DocumentCode
2855386
Title
An exact minimizer for Boolean relations
Author
Brayton, R.K. ; Somenzi, F.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1989
fDate
5-9 Nov. 1989
Firstpage
316
Lastpage
319
Abstract
Boolean relations are a generalization of incompletely specified logic functions. The authors give a procedure, similar to the Quine-McCluskey procedure, for finding the global optimum sum-of-product representation for a Boolean relation. This is formulated as a binate covering problem, i.e. as a generalization of the ordinary (unate) covering problem. They give an algorithm for it and review the relation of binate covering to tautology checking. The procedure has been implemented and results are presented.<>
Keywords
Boolean functions; logic CAD; Boolean relations; Quine-McCluskey procedure; binate covering problem; exact minimizer; generalization; global optimum sum-of-product representation; incompletely specified logic functions; Adders; Boolean functions; Cost function; Digital systems; Logic functions; Microelectronics; Minimization; Utility programs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1989. ICCAD-89. Digest of Technical Papers., 1989 IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-1986-4
Type
conf
DOI
10.1109/ICCAD.1989.76961
Filename
76961
Link To Document