Article

Free access

Spectral transforms for large boolean functions with applications to technology mapping

Authors:

E. M. Clarke,

K. L. McMillan,

X Zhao,

M. Fujita,

J. YangAuthors Info & Claims

DAC '93: Proceedings of the 30th international Design Automation Conference

Pages 54 - 60

https://doi.org/10.1145/157485.164569

Published: 01 July 1993 Publication History

PDF eReader

References

[1]

R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.

Digital Library

Google Scholar

[2]

M. A. Harrison. Introduction to switching and automata theory. McGraw-Hill, 1965.

Google Scholar

[3]

S. L. Hurst, D. M. Miller, and J. C. Muzio. Spectral Techniques in Digital Logic. Academic Press, Inc., 1985.

Digital Library

Google Scholar

[4]

R. J. Lechner. A transform approach to logic design. IEEE Transactions on Computers, C-19(7), 1970.

Google Scholar

[5]

F. M ailhot and G. De Micheli. Technology mapping using boolean matching and don't care sets. In Proceedings of the 1990 European Design Automation Conference, 1990.

Digital Library

Google Scholar

[6]

G. De Micheli, David Ku, F. Mailhot, and T.K. Truong. The olympus synthesis system for digital design. IEEE design and test of computers, October 1990.

Digital Library

Google Scholar

[7]

J. Yang and G. De Micheli. Spectral techniques for technology mapping. Technical Report CSL-TR-91-498, Stanford University, December 1991.

Digital Library

Google Scholar

Cited By

View all

Li RYuan YYe FLiu MYang RYu YGuo TMa QZeng XXu CCai DZhai ESekar VYu MSeneviratne AVeitch D(2024)A General and Efficient Approach to Verifying Traffic Load Properties under Arbitrary k FailuresProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672246(228-243)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672246
Sistla MChaudhuri SReps T(2024)CFLOBDDs: Context-Free-Language Ordered Binary Decision DiagramsACM Transactions on Programming Languages and Systems10.1145/365115746:2(1-82)Online publication date: 2-May-2024
https://dl.acm.org/doi/10.1145/3651157
Mei JBonsangue MLaarman A(2024)Simulating Quantum Circuits by Model CountingComputer Aided Verification10.1007/978-3-031-65633-0_25(555-578)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65633-0_25
Show More Cited By

Index Terms

Spectral transforms for large boolean functions with applications to technology mapping

Recommendations

Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping

The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to ...
Mobius transforms, coincident Boolean functions and non-coincidence property of Boolean functions

Boolean functions and their Mobius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean functions and their Mobius transforms. This work is ...
Using symbolic Rademacher-Walsh spectral transforms to evaluate the correlation between Boolean functions
GLSVLSI '95: Proceedings of the Fifth Great Lakes Symposium on VLSI (GLSVLSI'95)

The use of symbolic techniques to store integer-valued functions has been shown to be extremely effective in handling both transform matrices and spectral representations of large Boolean functions. In this paper we propose a novel application of ...

Comments

Information & Contributors

Information

Published In

DAC '93: Proceedings of the 30th international Design Automation Conference

July 1993

768 pages

ISBN:0897915771

DOI:10.1145/157485

Chairman:
Alfred E. Dunlop
AT&T Bell Labs., Murray Hill, NJ

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 July 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC93

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC93: The 30th ACM/IEEE Design Automation Conference

June 14 - 18, 1993

Texas, Dallas, 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

199
Total Citations
View Citations
588
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)5

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li RYuan YYe FLiu MYang RYu YGuo TMa QZeng XXu CCai DZhai ESekar VYu MSeneviratne AVeitch D(2024)A General and Efficient Approach to Verifying Traffic Load Properties under Arbitrary k FailuresProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672246(228-243)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672246
Sistla MChaudhuri SReps T(2024)CFLOBDDs: Context-Free-Language Ordered Binary Decision DiagramsACM Transactions on Programming Languages and Systems10.1145/365115746:2(1-82)Online publication date: 2-May-2024
https://dl.acm.org/doi/10.1145/3651157
Mei JBonsangue MLaarman A(2024)Simulating Quantum Circuits by Model CountingComputer Aided Verification10.1007/978-3-031-65633-0_25(555-578)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65633-0_25
Zhang JZheng SNi LLi HLuo G(2023)Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions2023 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE56975.2023.10136889(1-6)Online publication date: Apr-2023
https://doi.org/10.23919/DATE56975.2023.10136889
Vinkhuijzen LCoopmans TElkouss DDunjko VLaarman A(2023)LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer StatesQuantum10.22331/q-2023-09-11-11087(1108)Online publication date: 11-Sep-2023
https://doi.org/10.22331/q-2023-09-11-1108
Kupferman OPetruschka A(2023)Lazy regular sensingTheoretical Computer Science10.1016/j.tcs.2023.114057971:COnline publication date: 6-Sep-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.114057
Nikolaidis PPoullikkas A(2021)Evolutionary Priority-Based Dynamic Programming for the Adaptive Integration of Intermittent Distributed Energy Resources in Low-Inertia Power SystemsEng10.3390/eng20400412:4(643-660)Online publication date: 19-Dec-2021
https://doi.org/10.3390/eng2040041
MATSUO RSHIOMI JISHIHARA TONODERA HSHINYA ANOTOMI M(2019)Methods for Reducing Power and Area of BDD-Based Optical Logic CircuitsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E102.A.1751E102.A:12(1751-1759)Online publication date: 1-Dec-2019
https://doi.org/10.1587/transfun.E102.A.1751
Sanger RLuckie MNelson R(2019)Identifying Equivalent SDN Forwarding BehaviourProceedings of the 2019 ACM Symposium on SDN Research10.1145/3314148.3314347(127-139)Online publication date: 3-Apr-2019
https://dl.acm.org/doi/10.1145/3314148.3314347
Zhou XWang LMishchenko A(2019)Fast Adjustable NPN Classification Using Generalized SymmetriesACM Transactions on Reconfigurable Technology and Systems10.1145/331391712:2(1-16)Online publication date: 12-Apr-2019
https://dl.acm.org/doi/10.1145/3313917
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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