Title :
BDD decomposition for efficient logic synthesis
Author :
Yang, Congguang ; Singhal, Vigyan ; Ciesielski, Maciej
Author_Institution :
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
Abstract :
A unified logic optimization method efficient at handling both AND/OR-intensive and XOR-intensive functions is proposed. The method is based on iterative BDD decomposition using various dominators. Detail analysis of decomposable BDD structures leading to AND/OR, XOR and MUX decompositions are presented. Experiment shows that our synthesis results for AND/OR-intensive functions are comparable to those of SIS, and results for XOR-intensive functions are comparable to those of techniques targetting specifically XOR decomposition
Keywords :
Boolean functions; binary decision diagrams; logic design; AND/OR; BDD decomposition; Boolean network; MUX decomposition; XOR-intensive functions; arithmetic functions; binary decision diagrams; efficient logic synthesis; iterative BDD decomposition; multi-level logic; unified logic optimization method; Arithmetic; Automatic logic units; Binary decision diagrams; Boolean functions; Data structures; Iterative methods; Logic functions; Minimization; Network synthesis; Optimization methods;
Conference_Titel :
Computer Design, 1999. (ICCD '99) International Conference on
Conference_Location :
Austin, TX
Print_ISBN :
0-7695-0406-X
DOI :
10.1109/ICCD.1999.808607