Efficient Boolean Representation
Many traditional tasks in computer-aided design such as equivalence or property checking, logic synthesis, static timing analysis, and automatic testpattern generation require an efficient representation of combinational circuits in terms of a network of Boolean primitives. Many practical problems derived from the above-mentioned applications have a high degree of structural redundancy.
KeywordsBoolean Function Table Lookup Equivalence Check Graph Size Structural Redundancy
Unable to display preview. Download preview PDF.