Article

Free access

Boolean matching for incompletely specified functions

Authors:

Kuo-Hua Wang,

Ting-Ting HwangAuthors Info & Claims

DAC '95: Proceedings of the 32nd annual ACM/IEEE Design Automation Conference

Pages 48 - 53

https://doi.org/10.1145/217474.217505

Published: 01 January 1995 Publication History

PDF eReader

References

[1]

F. Mailhot, and G. De Micheli, "Technology Mapping Using Boolean Matching and Don't Care Sets," in Proc. of EDAC'90, pp.212-216, 1990.

Digital Library

Google Scholar

[2]

H. Savoj, M.J. Silva, R.K. Brayton, and A. Sangiovanni-Vincentelli, "Boolean Matching in Logic Synthesis," in Proc. of Euro-DAC'92, pp.168- 174, 1992.

Digital Library

Google Scholar

[3]

K-C Chen, "Boolean Matching Based on Boolean Unification," in Proc. of Euro-DAC'93, pp.346-351, 1993.

Google Scholar

[4]

U. Schlichtmann, F. Brglez, and P. Schneider, "Efficient Boolean Matching Based on Unique Variable Ordering," in IWLS'93.

Google Scholar

[5]

J.R. Bruch, and D. Long, "Efficient Boolean Function Matching," in Proc. of ICCAD'92, pp.408-411, 1992.

Digital Library

Google Scholar

[6]

K. Zhu, and D.F. Wong, "Fast Boolean Matching for Field Programmable Gate Arrays," in Proc. of Euro-DAC'93, pp.352-357, 1993.

Google Scholar

[7]

U. Schlichtmann, F. Brglez, and M. Hermann, "Characterization of Boolean Functions for Rapid Matching in EPGA Technology Mapping," in Proc of DA C'92, pp.374-379, 1992.

Digital Library

Google Scholar

[8]

Y.T. Li, S. Sarma, and P. Massoud, "Boolean Matching using Binary Decision Diagrams with Applications to Logic Synthesis and Verification," in Proc. of ICCD'92, pp.452-458, 1992.

Digital Library

Google Scholar

[9]

D.I. Chen and M. Marek-Sadowska, "Verifing Equivalence of Functions with Unknown Input Correspondence," in Proc. of EDAC'93, pp.81-85, 1993.

Google Scholar

[10]

J. Mohnke, and S. Malik, "Permutation and Phase Independent Boolean Comparison," in Proc. of EDAC'93, pp.86-92, 1993.

Google Scholar

[11]

C.C. Tsai, and M. Marek-Sadowska, "Boolean Matching Using Generalized Reed-Muller Forms," in Proc. of DAC'94, pp.339-344, 1994.

Digital Library

Google Scholar

Cited By

View all

Abdollahi AFix L(2008)Signature based Boolean matching in the presence of don't caresProceedings of the 45th annual Design Automation Conference10.1145/1391469.1391635(642-647)Online publication date: 8-Jun-2008
https://dl.acm.org/doi/10.1145/1391469.1391635
Wei ZChai DNewton AKuehlmann A(2006)Fast Boolean Matching with Don't CaresProceedings of the 7th International Symposium on Quality Electronic Design10.1109/ISQED.2006.65(346-351)Online publication date: 27-Mar-2006
https://dl.acm.org/doi/10.1109/ISQED.2006.65
De Micheli G(2000)Cell-based Logic OptimizationArchitecture Design and Validation Methods10.1007/978-3-642-57199-2_2(49-87)Online publication date: 2000
https://doi.org/10.1007/978-3-642-57199-2_2
Show More Cited By

Index Terms

Boolean matching for incompletely specified functions
1. Hardware
  1. Integrated circuits
    1. Logic circuits
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching
      2. Sorting and searching

Recommendations

Boolean matching for incompletely specified functions

Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. In this paper, we address Boolean matching problems for incompletely specified functions. We formulate the searching of input ...
Identification of incompletely specified multiple-valued Kleenean functions

This paper focuses on incompletely specified multiple-valued Kleenean functions (1991). It is easy to verify that they do not have functional completeness in the class of all functions on the unit interval. Therefore, not all incompletely specified ...
Boolean functions with two distinct Walsh coefficients

Are there other Boolean functions having two distinct Walsh coefficients except affine Boolean functions and maximal nonlinear (i.e. bent) Boolean functions__ __ This paper proves that all Boolean functions with exactly two distinct Walsh coefficients ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DAC '95: Proceedings of the 32nd annual ACM/IEEE Design Automation Conference

January 1995

760 pages

ISBN:0897917251

DOI:10.1145/217474

Chairman:
Bryan T. Preas
Xerox Parc, Palo Alto, CA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC95

Sponsor:

EDAC
SIGDA

DAC95: The 32nd Design Automation Conference

June 12 - 16, 1995

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
226
Total Downloads

Downloads (Last 12 months)100
Downloads (Last 6 weeks)14

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abdollahi AFix L(2008)Signature based Boolean matching in the presence of don't caresProceedings of the 45th annual Design Automation Conference10.1145/1391469.1391635(642-647)Online publication date: 8-Jun-2008
https://dl.acm.org/doi/10.1145/1391469.1391635
Wei ZChai DNewton AKuehlmann A(2006)Fast Boolean Matching with Don't CaresProceedings of the 7th International Symposium on Quality Electronic Design10.1109/ISQED.2006.65(346-351)Online publication date: 27-Mar-2006
https://dl.acm.org/doi/10.1109/ISQED.2006.65
De Micheli G(2000)Cell-based Logic OptimizationArchitecture Design and Validation Methods10.1007/978-3-642-57199-2_2(49-87)Online publication date: 2000
https://doi.org/10.1007/978-3-642-57199-2_2
Trullemans AZhang Q(1996)Rapid Gate Matching with Don't CaresProceedings of the 1996 European conference on Design and Test10.5555/787259.787570Online publication date: 11-Mar-1996
https://dl.acm.org/doi/10.5555/787259.787570
Trullemans AZhang Q(1996)Rapid gate matching with don't caresProceedings ED&TC European Design and Test Conference10.1109/EDTC.1996.494333(407-411)Online publication date: 1996
https://doi.org/10.1109/EDTC.1996.494333

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Boolean matching for incompletely specified functions

Identification of incompletely specified multiple-valued Kleenean functions

Boolean functions with two distinct Walsh coefficients