Channel routing for strictly multiterminal nets
Integration, the VLSI Journal
Information Processing Letters
A 2d channel router for the diagonal model
Integration, the VLSI Journal
Chameleon: a new multi-layer channel router
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
A general graph theoretic framework for multi-layer channel routing
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Computing area and wire length efficient routes for channels
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry: Theory and Applications
X-Routing using Two Manhattan Route Instances
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Diagonal routing in high performance microprocessor design
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
The star-routing algorithm based on Manhattan-Diagonal model for three layers channel routing
WSEAS Transactions on Circuits and Systems
| Hi-index | 0.01 |
This paper presents a new technique of channel routing based on the Manhattan-Diagonal (MD) model. The layout grid is assumed to consist of two layers with tracks in horizontal, vertical and /spl plusmn/45/spl deg/ directions. First, we consider the non-overlap model and present a simple O(l,d) time algorithm that routes an arbitrary channel with no cyclic vertical constraints in w tracks, where l is the length of the channel, d is the channel density, and d/spl les/w/spl les/(d+1). Next, we describe an output-sensitive algorithm that can route general channels with cyclic vertical constraints using w tracks, in O(l,w) time allowing overlapping of wiring segments in two layers. The router outputs an 18-track solution for the Deutsch's difficult example, a 2-track solution for Burstein's difficult channel, and a 15-track solution for cycle.tough without inserting any extra row or column. Apart from quick termination, the proposed algorithms provide solutions with significantly low via count and reduced wire length. The study thus reveals the superiority of MD-routing strategy to classical techniques.