東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Multi-layer general area gridless de...

Fang, Jie,

Linked to FindBook

Google Book

Amazon

博客來

Multi-layer general area gridless detailed routing /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Multi-layer general area gridless detailed routing // Jie Fang.
Author:	Fang, Jie,
Description:	1 electronic resource (179 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 62-11, Section: B.
Contained By:	Dissertations Abstracts International62-11B.
Subject:	Computer science. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9998974
ISBN:	9780493074368

Multi-layer general area gridless detailed routing /
Fang, Jie,

Multi-layer general area gridless detailed routing /Jie Fang. - 1 electronic resource (179 pages)

Source: Dissertations Abstracts International, Volume: 62-11, Section: B.

Automatic routing is one of the oldest and most fundamental problems in computer-aided design of integrated circuits (IC). It has been studied extensively for over thirty years. However, recent advances in processing technology and design methodology have brought new challenges to the routing automation problem. As the VLSI technology reaches deep sub-micro devices and gigahertz clock frequencies, interconnect has become the dominating factor in determining the performance, power and reliability of the circuit. Various optimization algorithms are needed to handle the delay, power and noise problems. These algorithms impose variable width and variable spacing design rule requirements on the routing algorithm. Moreover, the complexity of IC design problem has increased significantly with the shrinking of the transistor feature size. This imposes a serious scaling problem for the full-chip level routing. These advancements in the IC technology brings several challenges to the detailed routing problem as well as the overall routing systems. First, an efficient multi-layer gridless routing engine is needed to route the interconnects with variable width and variable spacing constraints. Second, a highly scalable and flexible routing system is needed to integrate various optimization algorithms and the gridless detailed routing algorithms to handle the routing problem. In this dissertation, we present a multi-layer general-area detailed routing system. It features an efficient gridless point-to-point detailed routing algorithm as the routing engine. An implicit representation of a non-uniform grid graph is proposed as the underlying routing graph and a path-based maze searching engine is developed to search for the paths on the graph. Our gridless detailed routing system also features a unique wire planning algorithm. The planning algorithm not only guides our gridless detailed routing engine but also provides ripup and re-routing capabilities for the detailed routing system. Lastly, we propose a routing system featuring a multilevel framework. The proposed framework is highly scalable to large routing problems and flexible in integrating various optimization algorithms into the routing system. The proposed routing system can be used for high performance IC, multi-chip module (MCM), or printed circuit board (PCB) designs. It can also be used in full custom IC layout, as for the cell library design and the analog circuit design.

English

ISBN: 9780493074368Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Gridless

Multi-layer general area gridless detailed routing /
LDR:03781nmm a22004213i 4500 001 2396276
005 20250522083221.5
006 m o d
007 cr|nu||||||||
008 251215s2001 miu||||||m |||||||eng d
020 $a 9780493074368
035 $a (MiAaPQD)AAI9998974
035 $a AAI9998974
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Fang, Jie, $e author. $3 3765957
245 1 0 $a Multi-layer general area gridless detailed routing / $c Jie Fang.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2001
300 $a 1 electronic resource (179 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 62-11, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisors: Cong, Jason.
502 $b Ph.D. $c University of California, Los Angeles $d 2001.
520 $a Automatic routing is one of the oldest and most fundamental problems in computer-aided design of integrated circuits (IC). It has been studied extensively for over thirty years. However, recent advances in processing technology and design methodology have brought new challenges to the routing automation problem. As the VLSI technology reaches deep sub-micro devices and gigahertz clock frequencies, interconnect has become the dominating factor in determining the performance, power and reliability of the circuit. Various optimization algorithms are needed to handle the delay, power and noise problems. These algorithms impose variable width and variable spacing design rule requirements on the routing algorithm. Moreover, the complexity of IC design problem has increased significantly with the shrinking of the transistor feature size. This imposes a serious scaling problem for the full-chip level routing. These advancements in the IC technology brings several challenges to the detailed routing problem as well as the overall routing systems. First, an efficient multi-layer gridless routing engine is needed to route the interconnects with variable width and variable spacing constraints. Second, a highly scalable and flexible routing system is needed to integrate various optimization algorithms and the gridless detailed routing algorithms to handle the routing problem. In this dissertation, we present a multi-layer general-area detailed routing system. It features an efficient gridless point-to-point detailed routing algorithm as the routing engine. An implicit representation of a non-uniform grid graph is proposed as the underlying routing graph and a path-based maze searching engine is developed to search for the paths on the graph. Our gridless detailed routing system also features a unique wire planning algorithm. The planning algorithm not only guides our gridless detailed routing engine but also provides ripup and re-routing capabilities for the detailed routing system. Lastly, we propose a routing system featuring a multilevel framework. The proposed framework is highly scalable to large routing problems and flexible in integrating various optimization algorithms into the routing system. The proposed routing system can be used for high performance IC, multi-chip module (MCM), or printed circuit board (PCB) designs. It can also be used in full custom IC layout, as for the cell library design and the analog circuit design.
546 $a English
590 $a School code: 0031
650 4 $a Computer science. $3 523869
650 4 $a Electrical engineering. $3 649834
653 $a Gridless
653 $a Multichip
653 $a PCB
653 $a Routing
690 $a 0984
690 $a 0544
710 2 $a University of California, Los Angeles. $e degree granting institution. $3 3765958
720 1 $a Cong, Jason $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 62-11B.
790 $a 0031
791 $a Ph.D.
792 $a 2001
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9998974