DocumentCode
2546250
Title
Fast Buffered Delay Estimation Considering Process Variations
Author
Fang, Tien-Ting ; Wang, Ting-Chi
Author_Institution
Dept. of Comput. Sci., National Tsing Hua Univ., Hsinchu
fYear
2007
fDate
23-26 Jan. 2007
Firstpage
702
Lastpage
707
Abstract
Advanced process technologies impose more significant challenges especially when manufactured circuits exhibit substantial process variations. Consideration of process variations becomes critical to ensure high parametric timing yield. During the design stage, fast estimation of the achievable buffered delay can navigate more accurate and efficient wire planning and timing analysis in floorplanning or global routing. In this paper, we derive approximated first-order canonical forms for buffered delay estimation which considers the effect of process variations and the presence of buffer blockages. We empirically show that an existing deterministic delay estimation method is over-pessimistic and thus result in unnecessary design rollback. The experimental results also show that our method can estimate buffered delay with 4% average error but achieve up to 149 times speedup when compared to a state-of-the-art statistical buffer insertion method.
Keywords
delay estimation; integrated circuit design; statistical analysis; buffer blockages; buffered delay estimation; deterministic delay estimation method; first-order canonical forms; process variations; statistical buffer insertion method; Algorithm design and analysis; Approximation algorithms; Computer aided manufacturing; Computer science; Delay estimation; Distributed computing; Integrated circuit interconnections; Routing; State estimation; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2007. ASP-DAC '07. Asia and South Pacific
Conference_Location
Yokohama
Print_ISBN
1-4244-0629-3
Electronic_ISBN
1-4244-0630-7
Type
conf
DOI
10.1109/ASPDAC.2007.358069
Filename
4196115
Link To Document