We present an exact method for minimizing logic functions using BDD's. In this method the function is mapped to an extended space which gives it special properties that can be exploited to compute the function Primes and Minterms. The next step consists of conceptually creating a covering table whose rows represent the minterms and whose columns represent the primes. We formulate conditions for row and column dominance and remove dominated rows and columns iteratively until no more reduction is possible. The final step consists of finding minimum column cover for the remaining cyclic core of the problem. All functions are implemented using implicit BDD operations.
Title
AN EXACT LOGIC MINIMIZER USING IMPLICIT BINARY DECISION DIAGRAM BASED METHODS
Published
1993-12-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
ERL-93-94
Type
Text
Extent
66 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
