Digital Logic
Truth Table
A table listing all possible input combinations and their corresponding outputs for a combinational function.
Detailed Explanation
Truth tables exhaustively define Boolean functions. For n inputs, there are 2^n rows. Each row shows an input combination and the resulting output(s). Truth tables directly specify lookup table contents for FPGA implementation.
Truth tables help understand logic behavior and are the basis for Karnaugh map optimization. Complex functions have impractically large truth tables; they're expressed algebraically instead.