Large-scale SOP minimization using decomposition and functional properties

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 149-154

  Mishchenko, Alan ^a   Sasao, Tsutomu ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

BDDs; Disjoint support decomposition; Divide and conquer strategy; Orthodox functions; SOP minimization

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; HEURISTIC METHODS;

FUNCTIONAL PROPERTIES;

COMPUTER AIDED DESIGN;

EID: 0043092192     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775870.775872     Document Type: Conference Paper

References (24)

1. R. L. Ashenhurst, "The decomposition of switching functions". Computation Lab, Harvard University, 1959, Vol. 29, pp. 74-116.
2. V. Bertacco and M. Damiani, "Disjunctive decomposition of logic functions," Proc. ICCAD '97, pp. 78-82.
3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Dordrecht, 1984.
4. R. K. Brayton and C. McMullen, "The decomposition and factorization of Boolean expressions," Proc. ISCAS '82, pp. 29-54.
5. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comp., Vol. C-35, No. 8 (August, 1986), pp. 677-691.
6. M.J. Ciesielski, S. Yang, and M.A. Perkowski, "Multiple-valued minimization based on graph coloring," Proc. ICCD '89, pp.262-265.
7. O. Coudert and J. C. Madre, "Towards a symbolic logic minimization algorithm", Proc. VLSI Design, January 1993.
8. O. Coudert, "Two-level logic minimization: An overview", Integration, 17-2, pp. 97-140, Oct. 1994.
9. O. Coudert, "Exact coloring of real-life graphs is easy", Proc. DAC '97, pp. 121-126.
10. J. Jacob and A. Mishchenko, "Unate decomposition of Boolean functions", Proc. IWLS '01, pp. 66-71.
11. A. A. Malik, R. Brayton, A. R. Newton and A. Sangiovanni-Vincentelli, "Reduced offsets for two-level multi-valued logic minimization", Proc. DAC'90, pp. 290-296.
12. Y. Matsunaga, "An exact and efficient algorithm for disjunctive decomposition", Proc. SASIMI '98, pp. 44-50.
13. P. McGeer, J. Sanghavi, R. Brayton, and A. Sangiovanni-Vincentelli, "Espresso-Signature: A new exact minimizer for logic functions," Proc. DAC '93, pp. 618-624.
14. S. Minato, "Fast generation of irredundant sum-of-products forms from binary decision diagrams. Proc. SASIM'92, pp. 64-73.
15. A. Mishchenko, EXTRA Library of DD procedures. http://www.ee.pdx.edu/̃alanmi/research/extra.htm
16. R. L. Rudell and A. Sangiovanni-Vincentelli, "Multiple-valued minimization for PLA optimization", IEEE Trans. CAD, Vol. 6(5), pp. 727-750, Sep. 1987.
17. T. Sasao, "An algorithm to derive the complement of a binary function with multiple-valued inputs," IEEE Trans. Comp. Vol. C-34, No. 2, pp. 131-140, Feb. 1985.
18. T. Sasao and J. T. Butler, "On the minimization of SOPs for bi-decomposable functions", Proc. ASP-DAC '01, pp.219-224.
19. T. Sasao and J. T. Butler, "Worst and best irredundant sum-of-products expressions", IEEE Trans. Comp, Vol. 50, No. 9, Sept. 2001, pp. 935-948.
20. T. Sasao, S. J. Hong, and R. K. Brayton, "Minimization of PLA's by decomposition", Unpublished technical report, 1984.
21. T. Sasao and M. Matsuura, "DECOMPOS: An integrated system for functional decomposition," Proc. IWLS '98, pp. 471-477.
22. E. Sentovich, et al, "SIS: A system for sequential circuit synthesis", Tech. Rep. UCB/ERI, M.92/41, ERL, Dept. of EECS, Univ. of California, Berkeley, 1992.
23. F. Somenzi, BDD package "CUDD v. 2.3.0." http://vlsi.colorado.edu/̃fabio/CUDD/cuddIntro.html
24. http://www.lsi-cad.com/dac2003/appendix.pdf.