By Topic

An algorithm for single-row routing with prescribed street congestions

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)

The single-row routing approach for layout has attracted a great deal of interest and is in a position to become one of the fundamental routing methods for high density multilayer printed wiring boards (PWB's). A specific development has recently been accomplished on this approach [12], namely: Necessary and sufficient conditions for optimum routing have been obtained. Nonetheless, there still remains a fundamental problem to be overcome, that is, to develop an algorithm to find the optimum solution. The present paper derives an alternate set of necessary and sufficient conditions for the same problem. These are easy to check and are tailored for algorithm development. An efficient algorithm in the special cases of upper and lower street congestions up to two has been proposed. These special cases are particularly of interest in the design of practical PWB's.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:27 ,  Issue: 9 )