LUTs are a fundamental component used to perform all Boolean logic inside your FPGA. Instead, FPGAs use Look-Up Tables or LUTs. But have you ever considered how these are actually implemented inside of an FPGA? Are there really thousands of individual AND gates, just waiting to be wired up? That would not be very versatile. There are other types of simple Boolean logic components: OR, NOT, XOR, NAND, etc. Boolean logic simply means all variables can have the value 1 or 0 (or as sometimes called in FPGAs, high and low). It’s a very simple Boolean logic circuit. Unless both inputs are 1, the output will be 0. The output is equal to 1 only when both inputs are equal to 1. Have you ever wondered how an AND gate actually works inside your FPGA? An AND gate is a type of logic circuit that has two inputs and one output. Go Board – Introducing Look-Up Tables (LUTs) How Boolean Algebra is Actually Performed on an FPGA
