On Switchbox Routing Algorithm
Abstract
We present new switchbox routing algorithm that consider the characteristic of net crossings. The routing strategy is based on parallel bubble sorting technique. Non-Manhattan wires as well as overlapping wires are introduced. Preliminary results show that a class of switchbox routing problems can be routed by using smaller overall interconnection length than the Manhattan models provide.
References
N.A.Sherwani, Algorithms for VLSI Physical Design Automation. Kluwer Academic, 1993.
T. Ohtsuki, Layout design and verification, 1986
M. Sarrafzadeh. Channel-routing problem in the knock-knee mode is np-complete. IEEE Trans. on CAD, CAD-6(4), pages 503-506, 1987.
K.Chaudry and P.Robbinson, “Channel routing by sorting”, IEEE Trans. on CAD, vol.10, no.6, pp.754-760, June 1991.
Michael Burstein , Richard Pelavin, Hierarchical channel router, Proceedings of the 20th conference on Design automation, p.591-597, June 27-29, 1983, Miami Beach, Florida, United States
K. Chaudhary and P. Robinson. Private communication. 1990.
H.H. Chela and E.S. Kuh. Glitter: a gridless variable-width channel router. IEEE Transactions on Computer-Aided Design, vol. CAD- 5, pages 459-465, 1986.
D. Braunetal. Techniques for multilayer channel routing. lEEE Trans. on CAD of lntegrated Circuits and Systems, V. CAD-7, pages 698-712, 1988.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
