Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/827245.827334acmconferencesArticle/Chapter ViewAbstractPublication PagessbcciConference Proceedingsconference-collections
Article

Disjunctive Decomposition of Switching Functions Using Symmetry Information

Published: 18 September 2000 Publication History

Abstract

A new approach to a simple disjunctive decomposition of a Boolean function is presented. It is based on using symmetric relations among a function's variables to recognize intrinsic characteristics of the function. The conditions for the existence of a simple disjunctive decomposition are formulated and a hierarchical simple disjunctive decomposition is generated in a bottom-up manner without exhaustive search. Results on benchmark functions are very encouraging.

Cited By

View all
  • (2005)Detecting support-reducing bound sets using two-cofactor symmetriesProceedings of the 2005 Asia and South Pacific Design Automation Conference10.1145/1120725.1120846(266-271)Online publication date: 18-Jan-2005

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SBCCI '00: Proceedings of the 13th symposium on Integrated circuits and systems design
September 2000
ISBN:076950843X

Sponsors

Publisher

IEEE Computer Society

United States

Publication History

Published: 18 September 2000

Check for updates

Author Tags

  1. Boolean function
  2. Boolean functions
  3. VLSI
  4. VLSI layout optimisation
  5. benchmark functions
  6. circuit optimisation
  7. disjunctive decomposition
  8. hierarchical decomposition
  9. integrated circuit layout
  10. intrinsic characteristics
  11. logic partitioning
  12. multiple symmetries
  13. switching functions
  14. symmetric relations

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 133 of 347 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2005)Detecting support-reducing bound sets using two-cofactor symmetriesProceedings of the 2005 Asia and South Pacific Design Automation Conference10.1145/1120725.1120846(266-271)Online publication date: 18-Jan-2005

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media