Fast factorization method for implicit cube set representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 4, 1996, Pages 377-384

  Minato, Shin Ichi ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; GRAPH THEORY; LOGIC CIRCUITS; RECURSIVE FUNCTIONS;

BINARY DECISION DIAGRAMS; FAST FACTORIZATION METHOD; IMPLICIT CUBE SET REPRESENTATION; LOGIC SYNTHESIS; ZERO SUPPRESSED BINARY DECISION DIAGRAMS;

COMPUTER AIDED LOGIC DESIGN;

EID: 0030125025     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.494701     Document Type: Article

References (13)

1. S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, "The transduction method-Design of logic networks based on permissible functions," IEEE Trans. Comput, vol. C-38, pp. 1404-1424, June 1987.
2. Y. Matsunagä and M. Fujita, "Multi-level logic optimization using binary decision diagrams," in Proc. IEEE/ACM Int. ConJ. ComputerAided Design, Nov. 1989, pp. 556-559.
3. N. Ishiura, "Synthesis of multi-level logic circuits from binary decision diagrams," in Proc. Synthesis Simulation Meeting Int. Interchange, Japan, Mar. 1992, pp. 74-83.
4. R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, "MIS: A multiple-level logic optimization system," IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 1062-1081, Nov. 1987.
5. O. Coudert, J. C. Madre, and H. Fraisse, "A new viewpoint of two-level logic optimization," in Proc. 30th ACM/IEEE Design Automation Conf., June 1993, pp. 625-630.
6. P. McGeer, J. Sanghavi, and R. K. Brayton, "Espresso-signature: A new exact minimize! for logic functions," in Proc. 30lh ACM/IEEE Design Automation Conf., June 1993, pp. 618-624.
7. S. Minato, "Zero-suppressed BDD's for set manipulation in combinatorial problems," in Proc. 30th ACM/IEEE Design Automation Conf., June 1993, pp. 272-277.
8. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Campul., vol. C-35, pp. 677-691, Aug. 1986.
9. S. Minato, N. Ishiura, and S. Yajima, "Shared binary decision diagram with attributed edges for efficient Boolean function manipulation," in Proc. 27th ACM/IEEE Design Automation Conf., June 1990, pp. 52-57.
10. M. Fujita, Y. Matsunaga, and T. Kakuda, "On variable ordering of binary decision diagrams for the application of multi-leve! logic synthesis," in Proc. IEEE Europ. Conf. Design Automation, Feb. 1991, pp. 50-54.
11. O. Coudert and J. C. Madre, "A new graph based prime computation technique," in New Trends in Logic Synthesis, T. Sasao, Ed. Boston, MA: Kluwer Academic, ch. 2, 1992, pp. 33-57.
12. S. Minato, "BEM-II: An arithmetic Boolean expression manipulator using BDD's," 1EICE Trans. Fundamentals, vol. E76-A, no. 10, pp. 1721-1729, Oct. 1993.
13. R. K. Brayton, G. D. Hachtel. C. T. McMullen, and A. SangiovanniVincentelli, Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 1984.