By Topic

New topological method for laying out printed circuits

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 $31
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)
Basden, A. ; University of Southampton, Department of Electronics, Southampton, UK ; Nichols, K.G.

Topological methods of designing printed and integrated circuits have recently been the subject of much interest. A new algorithm is now presented for the construction of the graph of a circuit. Not only does this algorithm produce simpler graphs than it was possible to produce by the use of earlier methods, but it also retains much of the freedom normally associated with manual routing. Using this algorithm, conductors can be rerouted automatically if they lie in the path of another conductor, and certain options are left open as long as possible to minimise the probability of failure. There is no restriction on routing conductors among the terminals of a component. The experience gained with the algorithm so far is encouraging.

Published in:

Electrical Engineers, Proceedings of the Institution of  (Volume:120 ,  Issue: 3 )