Multilevel logic minimization using functional don´t cares

Author

Wang, L. ; Almaini, A.E.A.

fYear

2001

fDate

2001

Firstpage

417

Lastpage

424

Abstract

The concept of two-level cube on a Karnaugh map is first generalized to a multilevel cube that can cover both “0” and “1” entries. Then an efficient procedure is presented to produce a multilevel form of any incompletely specified function on a Karnaugh map utilizing don´t cares (DCs) generated as the function is decomposed. Further an important property of Boolean functions, “containment” of cofactors is introduced so that new DCs can be generated to simplify large functions. An algorithm based on the concept of multilevel cube and the property of “containment” is developed and implemented in C language. Experimental results are presented

Keywords

Boolean functions; C language; logic CAD; minimisation of switching nets; multivalued logic circuits; Boolean functions; C language; Karnaugh map; cofactors; functional don´t cares; incompletely specified function; multilevel cube; multilevel logic minimization; two-level cube; Boolean algebra; Boolean functions; Computational complexity; Distributed control; Equations; Field programmable gate arrays; Logic; Minimization methods; Optimization methods; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

VLSI Design, 2001. Fourteenth International Conference on

Conference_Location

Bangalore

ISSN

1063-9667

Print_ISBN

0-7695-0831-6

Type

conf

DOI

10.1109/ICVD.2001.902694

Filename

902694