DocumentCode :
3098326
Title :
Generating prime and irredundant covers for binary decision diagrams
Author :
Jacobi, Ricardo Pezzuol ; Trullemans, Anne-Marie
Author_Institution :
Lab. de Microelectron., Univ. Catholique de Louvain, Belgium
fYear :
1992
fDate :
16-19 Mar 1992
Firstpage :
104
Lastpage :
108
Abstract :
The paper presents algorithms for two-level logic minimization of Boolean functions represented by Modified Binary Decision Diagrams (MBDs). MBDs allow the representation of the don´t care set in the same graph. The main goal is to produce prime and irredundant covers for these MBDs. A new kind of mixed two-level representation is adopted, where each cube is itself a MBD. Results obtained are comparable to those from ESPRESSO
Keywords :
Boolean functions; combinatorial circuits; minimisation of switching nets; set theory; Boolean functions; Modified Binary Decision Diagrams; irredundant covers; prime covers; two-level logic minimization; Binary decision diagrams; Boolean functions; Circuit synthesis; DC generators; Data structures; Jacobian matrices; Logic circuits; Logic functions; Minimization methods; Programmable logic arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1992. Proceedings., [3rd] European Conference on
Conference_Location :
Brussels
Print_ISBN :
0-8186-2645-3
Type :
conf
DOI :
10.1109/EDAC.1992.205903
Filename :
205903
Link To Document :
بازگشت