Efficient Boolean Representation

Part of the Series on Integrated Circuits and Systems book series (ICIR)

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.


Boolean Function Table Lookup Equivalence Check Graph Size Structural Redundancy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2007

Personalised recommendations