A Tile-Expansion Router
作者： A. Margarino , A. Romano , A. De Gloria , F. Curatelli , P. Antognetti
DOI: 10.1109/TCAD.1987.1270299
关键词: Image stitching 、 Router 、 Embedded system 、 Data structure 、 Engineering 、 Terminal (electronics) 、 Routing (electronic design automation) 、 Computer network 、 Electronic design automation 、 One-armed router 、 Tree (data structure)
摘要: A router based on a tile-expansion algorithm and corner stitching data structure is presented. This program finds connections with minimum number of jogs it ensures that possible solution will be found. Using working tree, allows an exhaustive recursive search along all available areas for routing. The are made going back through the tree until starting terminal reached. There two Manhattan layers user can choose each direction to implement connections; used wire hierarchical blocks using chip planning methodology. has been successfully tested examples concerning different classes problems.
sci-hub.se 参考文章(10)
P. Antognetti, G. Arato, A. De Gloria, O. Gaiotto, Arianna: A Floor-Planning Tool european solid-state circuits conference. pp. 193- 200 ,(1985) , 10.1109/ESSCIRC.1985.5468065
M. Burstein, R. Pelavin, Hierarchical Wire Routing IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 2, pp. 223- 234 ,(1983) , 10.1109/TCAD.1983.1270040
J.K. Ousterhout, Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 3, pp. 87- 100 ,(1984) , 10.1109/TCAD.1984.1270061
W. Heyns, W. Sansen, H. Beke, A line-expansion algorithm for the general routing problem with a guaranteed solution Proceedings of the seventeenth design automation conference on Design automation - DAC '80. pp. 243- 249 ,(1980) , 10.1145/800139.804534
J. Reed, A. Sangiovanni-Vincentelli, M. Santomauro, A New Symbolic Channel Router: YACR2 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 4, pp. 208- 219 ,(1985) , 10.1109/TCAD.1985.1270117
University of California, Berkeley. Computer Science Division, A Switchbox Router with Obstacle Avoidance design automation conference. pp. 173- 179 ,(1984) , 10.5555/800033.800793
D.N. Deutsch, Solutions to a Switchbox Routing Problem IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 4, pp. 163- 163 ,(1985) , 10.1109/TCAD.1985.1270110
C. Y. Lee, An Algorithm for Path Connections and Its Applications Ire Transactions on Electronic Computers. ,vol. 10, pp. 346- 365 ,(1961) , 10.1109/TEC.1961.5219222
David W. Hightower, A solution to line routing problems on the continuous plane design automation conference. pp. 1- 24 ,(1969) , 10.1145/800260.809014
J. Soukup, Circuit layout Proceedings of the IEEE. ,(1981)