ACM Home Page
Please provide us with feedback. Feedback
Achievable bounds on signal transition activity
Full text Publisher SitePublisher Site PdfPdf (195 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 126 - 129  
Year of Publication: 1997
ISBN:0-8186-8200-0
Authors
Sumant Ramprasad  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Naresh R. Shanbhag  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Ibrahim N. Hajj  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 7,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
D. Marculescu, R. Marculescu, and M. Pedram, "Information theoretic measures for power analysis," IEEE Trans. CAD, pp. 599-610, June 1996.
 
3
M. Nemani and F. Najm, "Towards a High-Level Power Estimation Capability," IEEE Trans. CAD, pp. 588- 598, June 1996.
 
4
 
5
N. R. Shanbhag, "A mathematical basis for powerreduction in digital VLSI systems," IEEE Trans. CAS H (to appear).
 
6


Collaborative Colleagues:
Sumant Ramprasad: colleagues
Naresh R. Shanbhag: colleagues
Ibrahim N. Hajj: colleagues