This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient VLSI Switch-Box Router
July/August 1990 (vol. 7 no. 4)
pp. 52-65

A tool for switch-box routing that can route regions with cyclic constraints and with terminals on three or four sides is presented. A divide-and-conquer algorithm is used to explore the greedy channel routing idea, using techniques such as routing area partitioning, dynamic routing strategies, and sweeping concurrent bidirectional columns. The routing area is decomposed into three parts by two special lines cut parallel, making routing easier. The algorithm completely routes Burstein's switch-box problem and with an extension also routes the Deutsch channel example in 19 tracks.

Citation:
Jer Min Jou, Jau Yien Lee, Yachyang Sun, Jhing Fa Wang, "An Efficient VLSI Switch-Box Router," IEEE Design & Test of Computers, vol. 7, no. 4, pp. 52-65, July-Aug. 1990, doi:10.1109/54.57914
Usage of this product signifies your acceptance of the Terms of Use.