6.2.3. Boolean function representation
Below we discuss different ways of representing Boolean functions.
6.2.3.1. Truth table
The mapping of a Boolean function can be exhaustively enumerated with a truth table, where every truth assignment has a corresponding function value listed.
Example 6.7
Figure 6.2 shows the truth table of the majority function f(x1, x2, x3), which valuates to true if and only if at least two of the variables {x1, x2, x3} valuate to true.
FIGURE 6.2. Truth table of the 3-ary majority function.
Truth tables are canonical representations of Boolean functions. That is, two Boolean functions are equivalent if and only ...
Get Electronic Design Automation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
