Hardware Support for Automatic Routing

A system for automatic routing based on an iterative application of Lee's algorithm is presented. An extended cell admissibility is defined for continuous design rules in coarse rectangular grids. Combined hardware and software design strategies are applied towards the definition of data structures and their kernel primitives for automatic routing. The hardware architecture and the implementation of specific structures are discussed. The resulting extended routing unit is used in a CAD system. Thus the throughput of the iterative router is improved by a factor of 5 compared to the equivalent software process. Finally the architecture of a high speed stand-alone routing processor is presented.

[1]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[2]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[3]  Melvin A. Breuer,et al.  Some theoretical aspects of algorithmic routing , 1977, DAC '77.

[4]  Jiri Soukup.  Global Router , 1979, 16th Design Automation Conference.

[5]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[6]  Frank Rubin.  An iterative technique for printed wire routing , 1974, DAC '74.

[7]  Jeffrey H. Hoel.  Some Variations of Lee's Algorithm , 1976, IEEE Transactions on Computers.

[8]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.