Title :
An algorithm for L-shaped channel routing in a diagonal model
Author_Institution :
Dipartimento di Inf., Pisa Univ., Corso, Italy
fDate :
2/1/1992 12:00:00 AM
Abstract :
The author investigates the two-terminal L-shaped channel routing problem (LRP) in the knock-knee diagonal model (KKD), where the grid consists of right and left tracks displayed at +45° and -45°. An optimal routing algorithm for the two-terminal simple LRP in KDD, which generates solutions matching the lower bound is presented
Keywords :
VLSI; circuit layout CAD; integrated circuit technology; CAD; L-shaped channel routing; circuit layout; knock-knee diagonal model; optimal routing algorithm; Design automation; Integrated circuit interconnections; Knee; NP-hard problem; Routing; Very large scale integration; Wires;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
