Achievable bounds on signal transition activity
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10923152,p. 126-131
- https://doi.org/10.1109/iccad.1997.643387
Abstract
Transitions on high capacitance busses in VLSI systems result in considerable system power dissipation. Therefore, various coding schemes have been proposed in the literature to encode the input signal in order to reduce the number of transitions. In this paper we derive achievable lower and upper bounds on the expected signal transition activity. These bounds are derived via an information-theoretic approach in which symbols generated by a source (possibly correlated) with entropy rate H are coded with an average of R bits/symbol. These results are applied to, (1) determine the activity reducing efficiency of different coding algorithms such as Entropy coding, Transition coding, and Bus-Invert coding, (2) bound the error in entropy-based power estimation schemes, and (3) determine the lower-bound on the power-delay product. Two examples are provided where transition activity within 4% and 8% of the lower bound is achieved when blocks of 8 and 13 symbols respectively are coded at a time.Keywords
This publication has 6 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- A mathematical basis for power-reduction in digital VLSI systemsIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1997
- Achievable bounds on signal transition activityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Towards a high-level power estimation capability [digital ICs]IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Information theoretic measures for power analysis [logic design]IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Bus-invert coding for low-power I/OIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1995