Article

Free access

Detection of symmetry of Boolean functions represented by ROBDDs

Authors:

Dirk Möller,

Janett Mohnke,

Michael WeberAuthors Info & Claims

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

Pages 680 - 684

Published: 07 November 1993 Publication History

PDF eReader

References

[1]

K.S. Brace, R.L. Rudell, and R.E. Bryant. Efficient Implementation of a BDD Package. in Proc. 27th A CM/IEEE Design Automation Conference, pages 40-45, 1990.

Digital Library

Google Scholar

[2]

R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transact. on Computers, C-35(8):677-691, 1986.

Digital Library

Google Scholar

[3]

D. I. Cheng and M. Marek Sadowska. Verifying Equivalence of Functions with Unknown Input Correspondence. In Proceedings of EDA C, pages 81-85, February 1993.

Crossref

Google Scholar

[4]

S.L. tturst. Detection of Symmetries in Combinatorial Functions by Spectral Means. Electronic Circuits and Systems, 1(5):173-180, 1977.

Crossref

Google Scholar

[5]

B.-G. Kim and D.L. Dietmeyer. Multilevel Logic Synthesis of Symmetric Switching Functions. IEEE Transact. on CAD, CAD-10(4):436- 446, 1991.

Google Scholar

[6]

Y.-T. Lai, S. Sastry, and M. Pedram. Boolean Matching using Binary Decision Diagrams with Applications to Logic Synthesis and Verification. In Proceedings of the 1CCD'92, pages 452-458, October 1992.

Digital Library

Google Scholar

[7]

F. Mailhot and G. De Micheli. Technology Mapping Using Boolean Matching and Don't Care Sets. In European Design A utomation Conference, pages 212-216, 1990.

Crossref

Google Scholar

[8]

J. Mohnke and S. Malik. Permutation and Phase Independent Boolean Comparison. In Proceedings of EDA C, pages 86-92, February 1993.

Crossref

Google Scholar

Cited By

View all

Maurer PBrunvard EStevens KCavallaro JZhang T(2012)Extending symmetric variable-pair transitivities using state-space transformationsProceedings of the great lakes symposium on VLSI10.1145/2206781.2206859(315-320)Online publication date: 3-May-2012
https://dl.acm.org/doi/10.1145/2206781.2206859
Zhang JMishchenko ABrayton RChrzanowska-Jeske MSentovich E(2006)Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiabilityProceedings of the 43rd annual Design Automation Conference10.1145/1146909.1147044(510-515)Online publication date: 24-Jul-2006
https://dl.acm.org/doi/10.1145/1146909.1147044
Kettle NKing AHirose F(2006)An anytime symmetry detection algorithm for ROBDDsProceedings of the 2006 Asia and South Pacific Design Automation Conference10.1145/1118299.1118364(243-248)Online publication date: 24-Jan-2006
https://dl.acm.org/doi/10.1145/1118299.1118364
Show More Cited By

Recommendations

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 ...
On the Symmetric Negabent Boolean Functions
INDOCRYPT '09: Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology

We study the negabent Boolean functions which are symmetric. The Boolean function which has equal absolute spectral values under the nega-Hadamard transform is called a negabent function. For a bent function, the absolute spectral values are the same ...
Look into the Mirror: Evolving Self-dual Bent Boolean Functions
Genetic Programming
Abstract
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions, even ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

November 1993

781 pages

ISBN:0818644907

Chairmen:
Michael Lightner
Univ. of Colorado, Boulder
,
Jochen A. G. Jess
Eindhoven Univ. of Tech., Eindhoven, The Netherlands

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 07 November 1993

Check for updates

Qualifiers

Article

Conference

ICCAD '93

Sponsor:

SIGDA
IEEE-CS

ICCAD '93: International Conference on Computer Aided Design

November 7 - 11, 1993

California, Santa Clara, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
231
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)9

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maurer PBrunvard EStevens KCavallaro JZhang T(2012)Extending symmetric variable-pair transitivities using state-space transformationsProceedings of the great lakes symposium on VLSI10.1145/2206781.2206859(315-320)Online publication date: 3-May-2012
https://dl.acm.org/doi/10.1145/2206781.2206859
Zhang JMishchenko ABrayton RChrzanowska-Jeske MSentovich E(2006)Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiabilityProceedings of the 43rd annual Design Automation Conference10.1145/1146909.1147044(510-515)Online publication date: 24-Jul-2006
https://dl.acm.org/doi/10.1145/1146909.1147044
Kettle NKing AHirose F(2006)An anytime symmetry detection algorithm for ROBDDsProceedings of the 2006 Asia and South Pacific Design Automation Conference10.1145/1118299.1118364(243-248)Online publication date: 24-Jan-2006
https://dl.acm.org/doi/10.1145/1118299.1118364
Chang KMarkov IBertacco V(2005)Post-placement rewiring and rebuffering by exhaustive search for functional symmetriesProceedings of the 2005 IEEE/ACM International conference on Computer-aided design10.5555/1129601.1129612(56-63)Online publication date: 31-May-2005
https://dl.acm.org/doi/10.5555/1129601.1129612
Wang KChen JTang T(2005)K-disjointness paradigm with application to symmetry detection for incompletely specified functionsProceedings of the 2005 Asia and South Pacific Design Automation Conference10.1145/1120725.1120775(994-997)Online publication date: 18-Jan-2005
https://dl.acm.org/doi/10.1145/1120725.1120775
Mohnke JMolitor PMalik S(2002)Limits of Using Signatures for Permutation Independent Boolean ComparisonFormal Methods in System Design10.1023/A:101609141870221:2(167-191)Online publication date: 1-Sep-2002
https://dl.acm.org/doi/10.1023/A%3A1016091418702
Kravets VSakallah KSentovich E(2000)Generalized symmetries in boolean functionsProceedings of the 2000 IEEE/ACM international conference on Computer-aided design10.5555/602902.603020(526-532)Online publication date: 5-Nov-2000
https://dl.acm.org/doi/10.5555/602902.603020
Kravets VSakallah KBolsens I(2000)Constructive library-aware synthesis using symmetriesProceedings of the conference on Design, automation and test in Europe10.1145/343647.343734(208-215)Online publication date: 1-Jan-2000
https://dl.acm.org/doi/10.1145/343647.343734
Sawada HYamashita SNagoya ADewilde PRammig FMusgrave G(1998)Restructuring logic representations with easily detectable simple disjunctive decompositionsProceedings of the conference on Design, automation and test in Europe10.5555/368058.368399(755-761)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368399
Chung KLiu CChandrakasan AKiaei S(1998)Local transformation techniques for multi-level logic circuits utilizing circuit symmetries for power reductionProceedings of the 1998 international symposium on Low power electronics and design10.1145/280756.280904(215-220)Online publication date: 10-Aug-1998
https://dl.acm.org/doi/10.1145/280756.280904
Show More Cited By

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

Recommendations

Boolean functions with two distinct Walsh coefficients

On the Symmetric Negabent Boolean Functions

Look into the Mirror: Evolving Self-dual Bent Boolean Functions