Title :
A new approach for Boolean function minimization
Author :
Damarla, T. Raju ; Stroud, Charles E. ; Michael, Gerald T.
Author_Institution :
Army Res. Lab., Fort Monmouth, NJ, USA
Abstract :
In this paper we present a new approach for Boolean function minimization. We introduce a new representation for sum of two terms that can be used to perform traditional Boolean minimization (ex. AB+AB¯=A) as well as terms of the type ABC+A¯B¯C¯. We call these terms as CTERMs. We introduce rules to combine CTERMS that would lead to new minimization algorithm. Since the minimization includes sum of products, EXOR, EXNOR and other complex terms, fewer terms are needed to represent a given Boolean function resulting in a near optimal representation. The minimization algorithm is implemented in PERL programming language
Keywords :
Boolean functions; application specific integrated circuits; built-in self test; integrated circuit design; logic CAD; logic gates; minimisation of switching nets; programmable logic devices; Boolean function minimization; CTERMs; EXNOR; EXOR; PERL programming language; minimization algorithm; sum of products; Binary decision diagrams; Boolean functions; Computer languages; Data structures; Field programmable gate arrays; Laboratories; Logic functions; Minimization methods; Programmable logic arrays;
Conference_Titel :
ASIC Conference and Exhibit, 1996. Proceedings., Ninth Annual IEEE International
Conference_Location :
Rochester, NY
Print_ISBN :
0-7803-3302-0
DOI :
10.1109/ASIC.1996.551983
