Fast Boolean minimizer for completely specified functions

Proceedings - 2008 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems, DDECS

Volumn , Issue , 2008, Pages 122-127

  Fiser, Petr ^a   Rucky, Premysl ^a   Vanova, Irena ^b  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC CIRCUITS; MEMORY CONSUMPTION; MINIMIZATION ALGORITHMS;

ALGORITHMS; ARTS COMPUTING; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; ELECTRON TUBES; NETWORKS (CIRCUITS); SET THEORY; TREES (MATHEMATICS);

BOOLEAN FUNCTIONS;

EID: 50649111212     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DDECS.2008.4538768     Document Type: Conference Paper

References (20)

1. S. Hassoun and T. Sasao, "Logic Synthesis and Verification", Boston, MA, Kluwer Academic Publishers, 2002, 454 pp.
2. Agarwal, Kime, Saluja: "A tutorial on BIST, part 1: Principles". IEEE Design & Test of Computers, vol. 10, No.1 March 1993, pp.73-83, part 2: Applications, No.2 June 1993, pp.69-77
3. E.J. McCluskey, "Minimization of Boolean functions", The Bell System Technical Journal, 35, No. 5, Nov. 1956, pp. 1417-1444
4. S.J. Hong, R.G. Cain and D.L. Ostapko, "MINI: A heuristic approach for logic minimization", IBM Journal of Res. & Dev., Sept. 1974, pp.443-458
5. R.K. Brayton et al., "Logic minimization algorithms for VLSI synthesis", Boston, MA, Kluwer Academic Publishers, 1984, 192 pp.
6. R.L. Rudell and A.L. Sangiovanni-Vincentelli, "Multiple-valued minimization for PLA optimization", IEEE Trans. on CAD, 6(5): 725-750, Sept.1987
7. P. McGeer et al., "ESPRESSO-SIGNATURE: A new exact minimizer for logic functions", Proc. DAC'93
8. J. Hlavička, P. Fišer, "BOOM - a Heuristic Boolean Minimizer", Proc. ICCAD 2001, San Jose, Cal. (USA), 4.-8.11.2001, 439-442
9. P. Fišer, J. Hlavička, "BOOM - A Heuristic Boolean Minimizer", Computers and Informatics, Vol. 22, 2003, No. 1, pp. 19-51
10. P. Fišer, H. Kubátová, "Boolean Minimizer FC-Min: Coverage Finding Process", Proc. 30th Euromicro Symposium on Digital Systems Design (DSD'04), Rennes (FR), 31.8. - 3.9.04, pp. 152-159
11. P. Fišer, H. Kubátová, "Two-Level Boolean Minimizer BOOM-II", Proc. 6th Int. Workshop on Boolean Problems (IWSBP'04), Freiberg, Germany, 23.-24.9.2004, pp. 221-228
12. P. Fišer, H. Kubátová, "Flexible Two-Level Boolean Minimizer BOOM II and Its Applications", Proc. 9th Euromicro Conference on Digital Systems Design (DSD'06), Cavtat, (Croatia), 30.8. - 1.9.2006, pp. 369-376
13. P. Fišer, J. Hlavička, "Implicant Expansion Method used in the BOOM Minimizer". Proc. IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop (DDECS'01), Gyor (Hungary), 18.-20.4.2001, pp. 291-298
14. F. Brglez and H. Fujiwara, "A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortan", Proc. of ISCAS 1985, pp. 663-698
15. F. Brglez, D. Bryan and K. Kozminski, "Combinational Profiles of Sequential Benchmark Circuits", Proc. of ISCAS, pp. 1929-1934, 1989
16. P. Rucký, "Multi-level Logical Circuit Collapsing Using Binary Decision Diagrams (BDDs)", MSc. Thesis, Czech Technical University in Prague, 2007, 57 pp.
17. S. B. Akers, "Binary decision diagrams", IEEE Trans.on Computers, Vol. C-27. No. 6, June 1978, pp. 509-516.
18. T. Sasao, "Ternary Decision Diagrams - A Survey", Proc. of IEEE International Symposium on Multiple-Valued Logic, pp. 241-250, Nova Scotia, May 1997
19. R. P. Jacobi, "A Study of the Aplication of Binary Decision Diagrams to Multi-level Logic Synthesis". Nivel de doutorado, Universitá Catholique de Louvain, Bélgica, 1993.
20. L. Jozwiak, A. Slusarczyk and M. Perkowski,."Term Trees in Application to an Effective and Efficient ATPG for AND-EXOR and AND-OR Circuits" ,VLSI Design, Volume 14, Number 1, 1 January 2002, pp. 107-122