DocumentCode
3531614
Title
Clock Tree Skew Minimization with Structured Routing
Author
Chakrabarti, Pinaki
Author_Institution
Synopsys (India) Pvt. Ltd., Bangalore, India
fYear
2012
fDate
7-11 Jan. 2012
Firstpage
233
Lastpage
237
Abstract
One of the goals of clock tree synthesis in ASIC design flow is skew minimization. There are several approaches used in traditional clock tree synthesis tools to achieve this goal. However, many of the approaches create a large number of clock-buffer levels while others result in congested clock routing. Increase in buffer level and routing congestion essentially triggers the problem of increase in buffer area and total power. Also the performance of the circuit is degraded due to on-chip variation in such situations. For certain fan-out number restricted designs, a few proposals with H-tree routed clock nets have been proposed to reduce the skew, but those proposals can hardly be used across various designs used in industry. Here we propose a method where skew minimization is mainly achieved by structured routing of clock nets. Finally, we show that with this proposal, for a few real designs from industry, we could reduce the skew up to 6.5% with increase in total wire delay up to 1.89% compared to when simple H-tree routing was deployed.
Keywords
application specific integrated circuits; clocks; integrated circuit design; minimisation; trees (mathematics); ASIC design flow; H-tree routed clock nets; buffer level congestion; clock tree skew minimization; clock tree synthesis tools; congested clock routing; fan-out number restricted designs; on-chip variation; structured routing; Algorithm design and analysis; Clocks; Delay; Nickel; Routing; Shape; Wires; Clock tree; H-tree; Routing; Skew; Synthesis;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design (VLSID), 2012 25th International Conference on
Conference_Location
Hyderabad
ISSN
1063-9667
Print_ISBN
978-1-4673-0438-2
Type
conf
DOI
10.1109/VLSID.2012.76
Filename
6167757
Link To Document