Title :
Ordering the data for Lee´s algorithm
Author :
Moran, P.L. ; Price, I.R.
Author_Institution :
Loughborough University of Technology, Deparment of Electronic & Electrical Engineering, Loughborough, UK
Abstract :
It is shown that, when using Lee´s algorithm for interconnection programs, if the order in which the tracks are routed is determined by the distance between the start and end points of each tracks, on average more paths may be placed than if the order is chosen at random.
Keywords :
circuit layout CAD; Lee´s algorithm for interconnection programs; ordering routing based on routing length;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19760471
