DocumentCode
3000928
Title
A fast algorithm for routability testing
Author
Sarrafzadeh, Hlajid ; Takahashi, Toshihiko
Author_Institution
Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA
Volume
6
fYear
1999
fDate
36342
Firstpage
178
Abstract
An L-shaped routing of a two-terminal net is its upper- or lower routing Given a set of nets: the planar testability problem (PTP) Is to decide if there exists a planar (i.e., pairwise non-crossing) L-shaped routing of all nets. PTP was solved via transformation to 2-satisfiability. Here, we propose an efficient greedy algorithm running in O(n(logn)2, where n is the number of nets. The density-1 testability problem (D1TP) is to decide if there exists an L-shaped routing of all nets with density 1 (i.e., overlap routing is not allowed, however routed nets may intersect each other). We extend-the PTP algorithm to solve the D1TP problem in O(nlogn) time
Keywords
graph theory; multiterminal networks; network routing; network topology; wiring; L-shaped routing; density-1 testability problem; greedy algorithm; pairwise non-crossing; planar testability problem; routability testing; two-terminal net; Greedy algorithms; Joining processes; Routing; Shape; Testing; Wire; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-5471-0
Type
conf
DOI
10.1109/ISCAS.1999.780124
Filename
780124
Link To Document