Circuit activity based logic synthesis for low power reliable operations
Authors:
- 1 December 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 1 (4) , 503-513
Abstract
A system developed to synthesize both finite state machines and combinational logic for low-power applications, called SYCLOP, is described. SYCLOP tries to minimize the transition density at the internal nodes of a circuit to minimize power dissipation during normal operation. As input signal probabilities and transition densities are considered during the synthesis process, a particular circuit can be synthesized in different ways for different applications that require different types of inputs. For the present state inputs to the combinational circuit of a state machine, simulation was used to determine the signal probabilities and transition densities. The algorithm is not limited by the number of bits used for state assignment. The multilevel optimization process extracts kernels so that there is a balance between area and power optimization. Results have been obtained for a wide range of MCNC benchmark examples.Keywords
This publication has 12 references indexed in Scilit:
- Technologies for personal communications1991
- Transition density, a stochastic measure of activity in digital circuits1991
- Improved techniques for estimating signal probabilitiesIEEE Transactions on Computers, 1989
- MUSTANG: state assignment of finite state machines targeting multilevel logic implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Measurement and modeling of computer reliability as affected by system activityACM Transactions on Computer Systems, 1986
- Optimal State Assignment for Finite State MachinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- On Random Pattern Test LengthIEEE Transactions on Computers, 1984
- On the Complexity of VLSI Computations1981
- Probabilistic Treatment of General Combinational NetworksIEEE Transactions on Computers, 1975