The Star-Routing Algorithm Based on Manhattan-Diagonal Model for Three Layers Channel Routing
學年 97
學期 1
出版（發表）日期 2009-01-01
作品名稱 The Star-Routing Algorithm Based on Manhattan-Diagonal Model for Three Layers Channel Routing
作品名稱（其他語言）
著者 Rau, Jiann-chyi; Wu, Po-han; Liu, Chia-jung; Lin, Yi-chen
單位 淡江大學電機工程學系
出版者 Zographou: World Scientific and Engineering Academy and Society (W S E A S)
著錄名稱、卷期、頁數 WSEAS Transactions on Circuits And Systems 8(1), pp.146-156
摘要 In this paper, we employ gridded model for channel routing and place the terminals which are horizontally aligned. We have developed a two-layer channel router that can eliminate the constraints due to overlap. The proposed approach is suitable for cell/IP-based channel-less circuit with a few channels. Our developed tool can route the nets in nearly linear time achieving to the advantage of time to market, and lead to the area overhead of 6.34% increase in average. The area overhead results from the space insertion, and we also have shown that the proposed algorithm can achieve 100% routing on most ISCAS'85 benchmarks. In addition, the number of channel tracks can be minimized by our algorithm. We proposed the star-routing algorithm for three layers channel routing using Manhattan-Diagonal Model to solve the channel routing problem. We drew up the smaller grid-model, and in order to avoid violating the DRC, so the algorithm has a restriction for the third metal-layer in routing step. We don't need to increasing extra spaces and moving any pins in order to finish the routing completely. The foregoing is good for hard blocks to finish the routing easily, and it does not replace the location of hard blocks because of routing incompletely. Therefore, the height of the entire routing channel can reduce a lot.
關鍵字 Manhattan-diagonal model; channel routing; electronic design automation (EDA)
語言 en
ISSN 1109-2734
期刊性質 國外
收錄於 EI
產學合作
通訊作者
審稿制度 是
國別 GRC
公開徵稿
出版型式 紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/50726 )

機構典藏連結
SDGS 產業創新與基礎設施