Top-Down-Based Symmetrical Buffered Clock Routing

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Seminar Papers > Item 987654321/32079

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/32079

Title:	Top-Down-Based Symmetrical Buffered Clock Routing
Authors:	顏金泰 YAN, JIN-TAI
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	時序繞線;緩衝器插入;時差 Clock routing;Buffer insertion;Skew
Date:	2012
Issue Date:	2014-06-27 01:43:44 (UTC+8)
Abstract:	對於同步設計,在時序樹上減少時差是很重要的,基於完整繞線中的長度相符的好處, 一個有效的四階段演算法進一步被提出產生具有較小時差的對稱式緩衝時序樹,對於對稱式緩衝時序樹,實驗結果與Shi的方法相比較,我們所提出的方法使用額外2.54%的總連線資源來減少85.78%的時差 It is important for a synchronous design to minimize the clock skew in a clock tree. In this paper, based on the length-matching benefit in exact routing, an efficient four-stage algorithm is further proposed to generate a symmetrical buffered clock tree
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0403.pdf		28Kb	Adobe PDF	57	View/Open