Abstract
This paper presents a fundamental result on buffer sizing. Given an interconnection wire with n buffers evenly spaced along the wire, we would like to size all buffers such that the Elmore delay is minimized. It is well known that the problem can be solved by an iterative algorithm which sizes one buffer at a time. However, no closed form solution has ever been reported. In this paper, we derive a closed form buffer sizing function f(x) where f(x) gives the optimal buffer size for the buffer at position x. We show that f(x) can be expressed in terms of the Weierstrass elliptic function p(x) and its derivative p'(x).
Original language | English |
---|---|
Title of host publication | Proceedings of The 11th Asia and South Pacific Conference on Design Automation, ASP-DAC 2006 |
Publisher | IEEE |
Number of pages | 5 |
ISBN (Print) | 9780780394513, 0780394518 |
DOIs | |
Publication status | Published - 25 Jan 2006 |
Event | 11th Asia and South Pacific Design Automation Conference, ASP-DAC 2006 - Pacifico Yokohama, Yokohama, Japan Duration: 24 Jan 2006 → 27 Jan 2006 https://www.aspdac.com/aspdac2006/ (Conference website) https://www.aspdac.com/aspdac2006/tpc/pdf/finalprogprint_nosign.pdf (Conference programme ) https://ieeexplore.ieee.org/xpl/conhome/10626/proceeding (Conference proceedings) |
Publication series
Name | Proceedings of The Asia and South Pacific Conference on Design Automation, ASP-DAC |
---|---|
Volume | 2006 |
Conference
Conference | 11th Asia and South Pacific Design Automation Conference, ASP-DAC 2006 |
---|---|
Country/Territory | Japan |
City | Yokohama |
Period | 24/01/06 → 27/01/06 |
Internet address |
|