DocumentCode
2835569
Title
A recursive router with 100% completion
Author
Tong, C.C. ; Wu, C.L.
Author_Institution
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
fYear
1990
fDate
12-14 Aug 1990
Firstpage
1202
Abstract
The necessary and sufficient condition for routability of a special class of routing problems is provided. The proof is based on mathematical induction. A recursive maze router has been developed based on the necessary and sufficient condition, and 100% completion is guaranteed, provided that the original routing problem is routable
Keywords
VLSI; circuit layout; network topology; completion; mathematical induction; maze router; recursive router; routability; routing problems; Feedback; Optimization methods; Printed circuits; Routing; Shape; Sufficient conditions; Topology; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location
Calgary, Alta.
Print_ISBN
0-7803-0081-5
Type
conf
DOI
10.1109/MWSCAS.1990.140943
Filename
140943
Link To Document