ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Trace driven logic synthesis—application to power minimization
Full text Publisher SitePublisher Site PdfPdf (167 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: 581 - 588  
Year of Publication: 1997
ISBN:0-8186-8200-0
Authors
Luca P. Carloni  University of California at Berkeley, Berkeley, CA
Patrick C. McGeer  Cadence Berkeley Laboratories, Berkeley, CA
Alexander Saldanha  Cadence Berkeley Laboratories, Berkeley, CA
Alberto L. Sangiovanni-Vincentelli  University of California at Berkeley, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

A trace driven methodology for logic synthesis and optimization is proposed. Given a logic description of a digital circuit C and an expected trace of input vectors T an implementation of C that optimizes a cost function under application of T is derived. This approach is effective in capturing and utilizing the correlations that exist between input signals on an application specific design. The idea is novel since it propose synthesis and optimization at the logic level where the goal is to optimize the average case rather than the worst case for a chosen cost metric. This paper focuses on the development of algorithms for trace driven optimization to minimize the switching power in multi-level networks. The average net power reduction (internal plus I/O power) obtained on a set of benchmark FSMs is 14%, while the average reduction in internal power is 25%. We also demonstrate that the I/O transition activity provides an upper bound on the power reduction that can be achieved by combinational logic synthesis.


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
5
 
6
7
 
8
 
9
10
 
11
J. Rajski and J. Vasudevamurthy. The Testability-Preserving Concurrent Decomposition and Factorization of Boolean Espression. IEEE Transactions on Computer-Aided Design, 11:778-793,1992.
 
12
K. Roy and S.C. Prasad. Circuit Activity Based Logic Synthesis for Low Power Reliable Operations. IEEE Transactions on VLSI Systems, 1:503-513,1993.
 
13
14
 
15
16
 
17

Collaborative Colleagues:
Luca P. Carloni: colleagues
Patrick C. McGeer: colleagues
Alexander Saldanha: colleagues
Alberto L. Sangiovanni-Vincentelli: colleagues