By Topic

On river routing with minimum number of jogs

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
$33 $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

2 Author(s)
T. C. Tuan ; Sch. of Electr. Eng. & Comput. Sci., Oklahoma Univ., Norman, OK ; K. H. Teo

The one-layer wiring problem of providing a one-to-one connection between two sets of terminals that lie on two horizontal lines by means of wires, which are in the forms of disjoint rectilinear curves on a unit-grid (where one unit is the minimum spacing between two wires), is called the river routing problem. The minimization of horizontal wire segments for a one-layer rectilinear river routing model is discussed. For given separation s, the list of simple jog sequences is merged into a list of compound jog sequences that leads to the concept of feasible cuts. An algorithm that finds a feasible cut whose corresponding layout has the minimum possible total number of horizontal wires segments is given. An algorithm that gives a complete description of the layout is also given. Both algorithms run in time O(n*s)

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:10 ,  Issue: 2 )