Exploiting communication complexity for boolean matching

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

Volumn 15, Issue 10, 1996, Pages 1249-1256

  Wang, Kuo Hua ^a,b   Hwang, Tingting ^a   Chen, Cheng ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; EQUIVALENCE CLASSES; PROBLEM SOLVING;

BOOLEAN MATCHING; COFACTOR SIGNATURES; COMMUNICATION COMPLEXITY; EQUIVALENCE SIGNATURES; ORDERED BINARY DECISION DIAGRAMS; PERMUTATION; PHASE ASSIGNMENT;

COMPUTATIONAL COMPLEXITY;

EID: 0030262446     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.541444     Document Type: Article

References (18)

1. S. Muroga, Threshold Logic and ils Applications. New York: Wiley-Tnrersci., 1971.
2. K. A. Bartlett, R. K. Brayton et al., "Multilevel logic minimization using implicit don't cares," IEEE Trans. Computer-Aided Design, vol. 7, pp. 723-740, June 1988.
3. K. Keutzer. "DAGON: Technology binding and local optimization by DAG matching," in Proc. DAC24, June 1987, pp. 341-347,
4. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation,IEEE Trans. Comput., vol. C35, pp. 677-691, Aug. 1986.
5. C. L. Herman, "Circuit width, register allocation, and ordered binary decision diagrams,IEEE Trans. Compuler-Aided-Design, vol. 10, pp. 1059-1066, Aug. 1991.
6. F. Mailhot and G. De Micheli, "Technology mapping using boolean matching and don't care sets," in Proc. EDAC'90, 1990, pp. 212-216.
7. H. Savoj, M. J. Suva, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Boolean matching in logic synthesis." in Proc. Euro-DAC'92, 1992, pp. 168-174.
8. K.-C. Chen, "Boolean matching based on Boolean unification," in Proc. Euw-DAC'93, 1993, pp. 346-351.
9. U. Schlichtmann, F. Brgkexz, and P. Schneider, "Efficient Boolean matching based on unique variable ordering," in IWLS'93.
10. J. R. Bruch, and D. I,ong, "Efficient Boolean function matching," in Proc. ICCAD'92, 1992, pp. 408-411.
11. K. Zhu. and D. K Wong, "Fast Boolean matching tor Held programmable gate arrays," in Proc. Euro DAC'93, 1993, pp. 352-357,
12. U. Schlichtmann, F. Brglez, and M. Hermann, "Characterization of Boolean functions for rapid matching in EPGA technology mapping," in Proc DAC'92, 1992, pp. 374-379.
13. Y. T. Li, S. Sarma, and P. Massoud, "Boolean matching using hinary decision diagrams with applications to logic synthesis and vérification," in Proc. KCD'92, 1992, pp. 452-458.
14. Y. Matsunaga, "A new algorithm for Boolean matching utilizing structural information," in SASIMI'93, 1993, pp. 366-373.
15. D. I. Chen and M. Marek-Sadowska, "Verifing equivalence of functions with unknown input correspondence," in Proc. EDAC'93, 1993, pp. 81-85.
16. J. Mohnke, and S. Malik, "Permutation and phase independent Boolean comparison," in Proc. EDAC'93. 1993. pp. 86-92.
17. K. H. Wang, T.-T. Hwang, and C. Chen, "Restructuring binary decision diagrams based on functional equivalence," in Proc. F.DAC'93, Feb. 1993, pp. 261-265.
18. R. K. Brayton et ai., "MIS: A multiple-level logic optimization system," IEEE Trans. Computer-Aided Design, vol. CAD6, pp. 1062-1081, Nov. 1987.