6.2. Data Structures for Boolean Representation and Reasoning
The basic mathematical objects to be dealt with in this chapter are Boolean functions. How to compactly represent Boolean functions (the subject of logic minimization) and how to efficiently solve Boolean constraints (the subject of Boolean reasoning) are closely related questions that play central roles in logic synthesis. There are several data structures for Boolean function representation and manipulation. For Boolean representation, we introduce some of the most commonly used ones, in particular, sum-of-products (SOP), product-of-sums (POS), binary decision diagrams (BDDs), and-inverter graphs (AIGs), and Boolean networks, among many others. For Boolean reasoning, we discuss ...
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.
