A Fully Implicit Quine-McCluskey Procedure Using BDD’s
43 Pages Posted: 18 Nov 2020
Date Written: November 10, 1992
We present an exact method for minimizing logic functions using BDD's to represent our functions. This approach differs from the classical approach in that it exploits the properties of the BDD data structure and the properties of a new extended space that we define, in order to implicitly compute the Primes, Minterms and Covering table for the Quine-McCluskey procedure. In this method the function is mapped to an extended space which endows it with special properties that may 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 a minimum column cover for the remaining cyclic core of the problem. All functions are implemented using implicit BDD operations.
Keywords: incremental algorithms, iterative design, computer aided design, logic network mapping
Suggested Citation: Suggested Citation