Title :
Minimization of Boolean relations
Author :
Brayton, R.K. ; Somenzi, F.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Abstract :
The authors present a Quine-McCluskey-like method for the minimization of Boolean relations. They develop the notion of prime implications for Boolean relations and give a procedure for generating all primes. Using these primes, the minimization problem is formulated as a linear integer (0-1) program with a special structure. The authors show that this can be solved as a binate covering problem. The notions of essential and of row and column dominance are presented as bounding techniques for solving this covering problem using a branch-and-bound method
Keywords :
Boolean algebra; minimisation of switching nets; Boolean relations minimization; Quine-McCluskey-like method; all primes generation procedure; binate covering problem; bounding techniques; branch-and-bound method; column dominance; covering problem; essential dominance; linear integer program; prime implications; row dominance; special structure; Boolean functions; Casting; Contracts; Feeds; Linear programming; Logic functions; Minimization;
Conference_Titel :
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location :
Portland, OR
DOI :
10.1109/ISCAS.1989.100457
