DocumentCode
2266784
Title
An effective computer algorithm for the calculation of disjoint cube representation of Boolean functions
Author
Falkowski, Bogdan J. ; Schafer, Iwan ; Chang, Chip-Hong
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
fYear
1993
fDate
16-18 Aug 1993
Firstpage
1308
Abstract
An efficient computer algorithm is shown to calculate an optimal cube array specification of Boolean functions. Since the number of disjoint cubes is much smaller than the number of minterms, the memory requirements are significantly reduced. The results of a comparison of the execution of the program with ESPRESSO for the MCNC benchmark functions are given
Keywords
Boolean functions; logic CAD; logic arrays; Boolean functions; ESPRESSO; MCNC benchmark functions; design automation; disjoint cube representation; logic synthesis; memory requirements; minterms; optimal cube array specification; Algorithm design and analysis; Boolean functions; Calculus; Circuit analysis; Data preprocessing; Drives; Logic arrays; Logic design; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
Conference_Location
Detroit, MI
Print_ISBN
0-7803-1760-2
Type
conf
DOI
10.1109/MWSCAS.1993.343341
Filename
343341
Link To Document