Title :
An iterative approach to hierarchical wire routing
Author_Institution :
Res. Inst., Daimler-Benz AG, Frankfurt, Germany
Abstract :
This paper gives an overview of Burstein´s Hierarchical Wire Routing (see IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, p. 223-34, 1980), points out limitations of the approach, and presents a new decomposition principle as well as an iterative algorithm. It can be applied to non-uniform structures and is independent of substrate orientation and net ordering. Results are presented for Burstein´s Switchbox
Keywords :
circuit layout CAD; integrated circuit layout; iterative methods; network routing; printed circuit layout; Burstein switchbox; PCB layout; decomposition principle; hierarchical wire routing; iterative algorithm; nonuniform structures; Dynamic programming; Iterative algorithms; Iterative methods; Linear programming; Routing; Tracking loops; Wire; Wiring;
Conference_Titel :
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3073-0
DOI :
10.1109/ISCAS.1996.542111
