Exploiting communication complexity for multilevel logic synthesis
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 9 (10) , 1017-1027
- https://doi.org/10.1109/43.62729
Abstract
A multilevel logic synthesis technique based on minimizing communication complexity is presented. This approach is believed to be viable because, for many types of circuits, the area needed is dominated by interconnections. By minimizing communication complexity and interconnect, area is reduced. This approach performs especially well for functions that are hierarchically decomposable (e.g., adders, parity generators, comparators, etc.). Unlike many other multilevel logic synthesis techniques, a lower bound can be computed to determine how well the synthesis was performed. A new multilevel logic synthesis program based on the techniques described for reducing communication complexity is presentedKeywords
This publication has 13 references indexed in Scilit:
- Experiments in logic optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- ELM-a fast addition algorithm discovered by a programIEEE Transactions on Computers, 1992
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Mesh arrays and LOGICIAN: a tool for their efficient generationPublished by Association for Computing Machinery (ACM) ,1987
- SOCRATESPublished by Association for Computing Machinery (ACM) ,1986
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Logic Synthesis Through Local TransformationsIBM Journal of Research and Development, 1981
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Functional Decomposition and Switching Circuit DesignJournal of the Society for Industrial and Applied Mathematics, 1963
- A Generalized Tree CircuitJournal of the ACM, 1961