國立虎尾科技大學 |

Multi-layer general area gridless detailed routing.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Multi-layer general area gridless detailed routing./
Author:	Fang, Jie.
Description:	1 online resource (179 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 62-11, Section: B.
Contained By:	Dissertations Abstracts International62-11B.
Subject:	Computer science. -
Online resource:	click for full text (PQDT)
ISBN:	9780493074368

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

Multi-layer general area gridless detailed routing. - 1 online resource (179 pages)

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

Thesis (Ph.D.)--University of California, Los Angeles, 2001.

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9780493074368Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

GridlessIndex Terms--Genre/Form:

554714
Electronic books.

Multi-layer general area gridless detailed routing.
LDR:03785ntm a22003857 4500 001 1144373
005 20240531083837.5
006 m o d
007 cr mn ---uuuuu
008 250605s2001 xx obm 000 0 eng d
020 $a 9780493074368
035 $a (MiAaPQ)AAI9998974
035 $a AAI9998974
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Fang, Jie. $3 1469371
245 1 0 $a Multi-layer general area gridless detailed routing.
264 0 $c 2001
300 $a 1 online 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 Advisor: Cong, Jason.
502 $a Thesis (Ph.D.)--University of California, Los Angeles, 2001.
504 $a Includes bibliographical references
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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Electrical engineering. $3 596380
653 $a Gridless
653 $a Multichip
653 $a PCB
653 $a Routing
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0544
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, Los Angeles. $3 642037
773 0 $t Dissertations Abstracts International $g 62-11B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9998974 $z click for full text (PQDT)