Factoring Boolean functions using graph partitioning

Discrete Applied Mathematics

Volumn 149, Issue 1-3, 2005, Pages 131-153

  Mintz, Aviad ^a   Golumbic, Martin Charles ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Factoring Boolean functions; Graph partitioning; Logic synthesis

Indexed keywords

ALGORITHMS; FUNCTIONS; GRAPH THEORY;

FACTORING BOOLEAN FUNCTIONS; GRAPH PARTITIONING; LOGIC SYNTHESIS;

BOOLEAN ALGEBRA;

EID: 22344435097     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.02.007     Document Type: Article

References (32)

1. Albert Ren Rui Wang, Algorithms for multilevel logic optimization, Ph.D. Thesis, University of California, Berkeley, 1989.
2. R. Brayton Factoring logic functions IBM J. Res. Develop. 31 2 1987 187 198
3. R. Brayton, and C. McMullen The decomposition and factorization of Boolean expressions Proc. Internat. Symp. on Circuits and Systems, Rome 1982 49 54
4. S.C. Chang, and D.I. Cheng Efficient Boolean division and substitution using redundancy addition and removing IEEE Trans. Comput. Aided Design 18 1999 1096 1106
5. J. Demmel, CS267: Lectures 20 and 21 - Graph Partitioning, Part 1, website: www.cs.berkeley.edu/d~emmel/cs267/lecture18/lecture18.html, March 1996.
6. J. Demmel, CS267: Notes for Lectures 23 - Graph Partitioning, Part 2, website: www.cs.berkeley.edu/d~emmel/cs267/lecture20/lecture20.html, April 1999.
7. S. Devadas, A. Ghosh, and K. Keutzer Logic Synthesis 1994 McGraw-Hill
8. U. Elsner, Graph partitioning - a survey, website: www.tu-chemnitz.de/ e~lsner, December 1997.
9. C.M. Fiduccia, and R.M. Mattheyses A linear time heuristic for improving network partitions Proc. 19th Design Automation Conference 1982 175 181
10. M.L. Fredman, and L. Khachiyan On the complexity of dualization of monotone disjunctive normal forms J. Algorithms 21 3 1996 618 628
11. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980. Annals of Discrete Mathematics, second ed., vol. 57, Elsevier, Amsterdam, 2004.
12. M.C. Golumbic, and A. Mintz Factoring logic functions using graph partitioning Proc. IEEE/ACM Int. Conf. Computer Aided Design November 1999 195 198
13. M.C. Golumbic, A. Mintz, and U. Rotics Factoring and recognition of read-once functions using cographs and normality Proc. of the 38th Design Automation Conf. June 2001 109 114
14. M.C. Golumbic, T.K. Philips, R.L. Harvell, K. Lynne, Optimal program linkage by graph partitioning, CSI J. Comput. Sci. and Inform. (1994).
15. V. Gurvich Criteria for repetition-freeness of functions in the algebra of logic Soviet Math. Dokl. 43 3 1991 721 726
16. V.A. Gurvich, On repetition-free Boolean functions, Uspekhi Mat. Nauk. 32 (1977) 183-184, (in Russian)
17. also, On read-once Boolean functions, Russian Math. Surveys 32 (1977) 183-184.
18. V.A. Gurvich Some properties and applications of complete edge-chromatic graphs and hypergraphs Soviet Math. Dokl. 30 3 1984 803 807
19. G.D. Hachtel, and F. Somenzi Logic Synthesis and Verification Algorithms 1996 Kluwer Academic Publishers
20. J.P. Hayes The fanout structure of switching functions J. ACM 22 1975 551 571
21. W.J. Hsu, and W.Z. Shen Coalgebraic division for multilevel logic synthesis 29th IEEE/ACM Design Automation Conference June 1992 438 442
22. G. Karypis, and V. Kumer A fast and high quality multilevel scheme for partitioning irregular graphs SIAM J. Sci. Comput. 20 1 1999 359 392
23. B.W. Keringhan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell System Technical J. 49 1970 291 307
24. T.A. McKee, and F.R. McMorris Topics in Intersection Graph Theory 1999 SIAM Philadelphia
25. A. Mintz, Multi-level synthesis: factoring logic functions using graph partitioning algorithms, Ph.D. Thesis, Bar-Ilan University, Ramat-Gan Israel, 2000.
26. J. Peer, Minimization of Boolean Computational Trees for Multilevel Logic Implementation of Combinational Networks, M.Sc. Thesis, Technion, Haifa, Israel, 1993.
27. J. Peer, and R. Pinter Minimal decomposition of Boolean functions using non-repeating literal trees Proc. Internat. Workshop on Logic and Architecture Synthesis, IFIP TC10 WD10.5, Grenoble December 1995 129 139
28. A. Pothen Graph partitioning algorithms with applications to scientific computing D.E. Keyes Parallel Numerical Algorithms 1997 Kluwer Academic Press 323 368
29. R. Rudell, Logic synthesis for VLSI design, Ph.D. Thesis, University of California, Berkeley, 1989.
30. SIS: A System for Sequential Circuit Synthesis, UCB - Electronic Research Library M92/41, University of California, Berkeley, CA, May 1992.
31. T. Stanion, and C. Sechen Boolean division and factorization using binary decision diagrams IEEE Trans. Comput. Aided Design 13 1994 1179 1184
32. S. Yang, Logic Synthesis and Optimization Benchmarks User Guide Version 3.0, Technical Report 1991-IWLS-UG-Saeyang, MCNC Research Triangle Park, NC, January 1991.