ACM Home Page
Please provide us with feedback. Feedback
Theoretical bounds for switching activity analysis in finite-state machines
Full text PdfPdf (848 KB)
Source International Symposium on Low Power Electronics and Design archive
Proceedings of the 1998 international symposium on Low power electronics and design table of contents
Monterey, California, United States
Pages: 36 - 41  
Year of Publication: 1998
ISBN:1-58113-059-7
Authors
Diana Marculescu  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, Ca
Radu Marculescu
Massoud Pedram  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, Ca
Sponsors
IEEE-SSCS : Solid Stat Circuits Council
SIGDA: ACM Special Interest Group on Design Automation
IEEE-EDS : Electronic Devices Society
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/280756.280766
What is a DOI?

ABSTRACT

The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the behavior of the states of the FSM, we derive theoretical bounds for the average Hamming distance on the state lines which are valid irrespective of the state encoding used in the final implementation. Such lower and upper bounds, in addition to providing a target for any state assignment algorithm, can also be used as parameters in a high-level model of power, and thus provide an early indication about the performance limits of the target FSM. Experimental results obtained for the mcnc'91 benchmark suite show that our bounds are tighter than the bounds reported previously by other researchers and can be effectively used in a high-level power estimation framework.


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
 
3
 
4
L. Benini and G. De Micheli, 'State Assignment for Low Power Dissipation', in IEEE Journal of Solid State Circuits, vol.30, no.3, 1995.
 
5
6
 
7
 
8
 
9
 
10
 
11
G. Hachtel, E. Macii, A. Pardo, and E Somenzi, 'Markovian Analysis of Large Finite State Machines,' in IEEE Trans. on CAD of Integrated Circuits, vol. 15, no. 12, Dec. 1996.
 
12
 
13
D. Marculescu, R. Marculescu, and M. Pedram, 'Information Theoretic Measures for Power Analysis,' in IEEE Trans. on CAD of Integrated Circuits, vol. 15, no.6, June 1996.
14
 
15
 
16
 
17
G. De Micheli, R.K. Brayton, and A. Sangiovanni-Vincentelli, 'Optimal State Assignment for Finite State Machines,' in IEEE Trans. on CAD of Integrated Circuits, vol.4, no.7, July 1985.
 
18
T. Villa and A. Sangiovanni-Vincentelli, 'NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementation,' in IEEE Trans. on CAD of Integrated Circuits, vol.9, no.9, Sept. 1990.
 
19
A. Tyagi, Personal communication, Feb. 1998.


Collaborative Colleagues:
Diana Marculescu: colleagues
Radu Marculescu: colleagues
Massoud Pedram: colleagues