By Topic

On design rule correct maze routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Huijbregts, E.P. ; Dept. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands ; van Eijndhoven, J.T.J. ; Jess, J.A.G.

This paper addresses the problem of design rule correct routing, i.e. the avoidance of illegal wiring patterns during routing. These illegal wiring patterns are due to the set of design rules accompanying each specific technology. To avoid software tuning for different technologies, the routing space is modelled as a grid graph, and all design rules are described in terms of the grid graph, including rules that describe illegal wiring patterns. The problem of finding valid, (i.e. containing no illegal wiring patterns) minimum cost connections is shown to be NP-complete, even for single nets. Although this restriction occurs in most technologies, literature does not mention any routing algorithm capable of handling these situations correctly. Two heuristics are presented to solve the routing problem, both ensuring all paths found to be valid

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994