DocumentCode
3256782
Title
Domain compression of incompletely specified Boolean functions
Author
Griffin, Dwight D. ; Schmitt, Erich
Author_Institution
Dept. of Electr. & Comput. Eng., State Univ. of New York, Buffalo, NY, USA
fYear
1992
fDate
28-30 May 1992
Firstpage
10
Lastpage
13
Abstract
In the design automation of combinational switching circuits, the task of synthesis and optimization of Boolean functions with greater than 30 variables is computationally infeasible with conventional techniques. This paper presents a transform function that can compress the domain of any arbitrarily sized, incompletely-specified Boolean function into a new domain with significantly fewer variables. A statistical analysis illustrates the compression
Keywords
Boolean functions; combinatorial switching; logic design; minimisation of switching nets; transforms; combinational switching circuits; domain compression; incompletely specified Boolean functions; statistical analysis; transform function; Binary codes; Boolean functions; Circuit synthesis; Design automation; Design engineering; Design optimization; Laboratories; Polynomials; Statistical analysis; Switching circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location
Toronto, Ont.
Print_ISBN
0-8186-2812-X
Type
conf
DOI
10.1109/ICCI.1992.227717
Filename
227717
Link To Document