|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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/August, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/54.57914, author = {Jer Min Jou and Jau Yien Lee and Yachyang Sun and Jhing Fa Wang}, title = {An Efficient VLSI Switch-Box Router}, journal ={IEEE Design & Test of Computers}, volume = {7}, number = {4}, issn = {0740-7475}, year = {1990}, pages = {52-65}, doi = {http://doi.ieeecomputersociety.org/10.1109/54.57914}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Design & Test of Computers TI - An Efficient VLSI Switch-Box Router IS - 4 SN - 0740-7475 SP52 EP65 EPD - 52-65 A1 - Jer Min Jou, A1 - Jau Yien Lee, A1 - Yachyang Sun, A1 - Jhing Fa Wang, PY - 1990 VL - 7 JA - IEEE Design & Test of Computers ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/54.57914
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.

