ACM Home Page
Please provide us with feedback. Feedback
Skew spreading for peak current reduction
Full text PdfPdf (113 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 17th ACM Great Lakes symposium on VLSI table of contents
Stresa-Lago Maggiore, Italy
POSTER SESSION: Poster session 2 table of contents
Pages: 461 - 464  
Year of Publication: 2007
ISBN:978-1-59593-605-9
Authors
Zhentao Yu  North Carolina State University, Raleigh, NC
Marios C. Papaefthymiou  University of Michigan, Ann Arbor, MI
Xun Liu  North Carolina State University, Raleigh, NC
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

abstract   references   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/1228784.1228893
What is a DOI?

ABSTRACT

This paper presents a circuit optimization technique called skewspreading. Given an edge-triggered sequential circuit, skew spreadingderives the required clock arrival times for all registers so that theskews are distributed evenly in a preselected time window without changing the operating frequency of the circuit. Skew spreading is ideal for peak current reduction, since it distributes clock activities and the ensuing signal activities widely in time. We have developed a skew spreading algorithm and applied it to a suite of benchmark circuits. Simulation results demonstrate that the variance of the resulting skew from the uniform distribution can be reduced to 4% on the average. In comparison to other gate-level peak current reduction techniques, our scheme achieves an average improvement of 17% with a speedup of up to 13.9 times.


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
R. B. Deokar and S. S. Sapatnekar. A graph-theoretic approach to clock skew optimization. In Proc. Inter. Symp. on Circuits and Systems, pages 407--410, May 1994.
 
2
 
3
 
4
 
5
A. Mukherjee and R. Sankaranarayan. Retiming and clock scheduling to minimize simultaneous switching. In IEEE SOC Conference, Sept. 2004.
6
 
7

Collaborative Colleagues:
Zhentao Yu: colleagues
Marios C. Papaefthymiou: colleagues
Xun Liu: colleagues