Multilevel logic synthesis of symmetric switching functions
- 1 April 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 10 (4) , 436-446
- https://doi.org/10.1109/43.75627
Abstract
Designs of totally symmetric functions provided by logic synthesis systems have on average more than twice as many literals as best designs, while the designs of nonsymmetric functions have on average 20% more literals. A simple, but effective, heuristic method for synthesizing symmetric functions that detects and takes advantage of symmetry and is based on classic disjoint decomposition theory is fully developed from basic definitions. Functions are realized as Boolean networks with cost measured as the literal count of factored expressions. Programs based on the method almost always produce the best designs known to the authors. Two strategies for accepting decompositions are explored. They do produce different results in a few cases: examples are presented to show that neither always produces best designs. These programs are proposed as preprocessors for a comprehensive synthesis systemKeywords
This publication has 7 references indexed in Scilit:
- PLA decomposition with generalized decodersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Boolean decomposition in multilevel logic optimizationIEEE Journal of Solid-State Circuits, 1989
- Logic synthesis and optimization benchmarks for the 1986 Design Automation ConferencePublished by Association for Computing Machinery (ACM) ,1986
- Random logic design utilizing single-ended cascode voltage switch circuits in NMOSIEEE Journal of Solid-State Circuits, 1985
- Cascode voltage switch logic: A differential CMOS logic familyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Logic Synthesis Through Local TransformationsIBM Journal of Research and Development, 1981
- Identification of Symmetry, Redundancy and Equivalence of Boolean FunctionsIEEE Transactions on Electronic Computers, 1967