Single step current driven routing of multiterminal signal nets for analog applications

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2000, Pages 446-450

  Adler, Thorsten ^a   Barke, Erich ^b  

^a INFINEON TECHNOLOGIES AG   (Germany)

^b LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANALOG APPLICATIONS; CIRCUIT DESIGNERS; CONNECTION GRAPHS; CURRENT PROPERTIES; LAYOUT CONSTRUCTION; MULTI TERMINALS; POST PROCESSING; STEINER POINTS;

ALGORITHMS; EXHIBITIONS; WIRE;

DESIGN;

EID: 84893638973     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2000.840309     Document Type: Conference Paper

References (27)

1. S. B. Akers, A modification of Lee's path connection algorithm, IEEE Trans. Electron. Comput., vol. EC-16, pp. 97-98, 1967
2. S. Chowdhury, An Automated Design of Minimum-Area IC Power/Ground Nets, Proc. Design Automation Conference, pp. 223-229, 1987
3. E. W. Dijkstra, A Note on two problems in connexion with graphs, Numer. Math., vol. 1, pp. 269-271, 1959
4. K. L. Clarkson, S. Kapoor and P. M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time, Proc. Third Annual Conf. Computational Geometry, pp. 251-57, 1987
5. M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is NP-Complete, SIAM Journal Applied Math., pp. 826-834, 1977
6. F. O. Hadlock, The shortest: Path algorithm for grid graphs, Networks, vol. 7, pp. 323-34, 1977
7. M. Hanan, On Steiner's Problem With Rectilinear Distance, SIAM Journal of Applied Mathematics, vol. 30, no.1, pp. 324-342, April 1972
8. P. Hart, N. Nilson and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Syst., Sci., Cybern., vol. SCC-4, pp. 100-107, 1968
9. D. W. Hightower, A Solution to line routing problems on the continuous plane, DA Workshop, pp. 1-24, 1969
10. F. K. Hwang, On Steiner Minimal Trees with Rectilinear Distance, SIAM Journal on Applied Math., vol. 30(1), pp. 104-114, 1976
11. F. K. Hwang, D. S. Richards and P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics, No. 53, North-Holland, 1992
12. C. Y. Lee, An Algorithm for Patch Connections and Its Applications, IRE Trans. Electron. Comput., vol. EC-10, pp. 364-65, 1961
13. J. H. Lee, N. K. Bose and F. K. Hwang, Use of Steiner's problem in suboptimal routing in rectilinear metric, IEEE TCAS, vol. CAS-23, pp. 470-476, 1976
14. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, pp. 405-406, 1990 a routing area estimation which calculates the exact distances between the candidate Steiner point and the next two terminals and estimates the routing area of the remaining net. The Steiner tree algorithm incorporates some heuristics such as terminal swapping during routing to improve the routing result. CDR is to our knowledge the first routing algorithm capable of constructing Steiner tree based layouts of multiterminal signal nets with current driven wire widths in a single step, thus eliminating the need of a separate layout post-processing step. It is currently being integrated into two commercial design flows and will be used to enhance automatic layout generation for analog integrated circuits.
15. K. Mikami and K. Tabuchi, A computer program for optimal routing of printed circuit connectors, Proc. IFIPS, vol. H-47, pp. 1475-78, 1968
16. J. S. B. Mitchell, An optimal algorithm for shortest rectilinear paths among obstacles in the plane, Abstracts First Canadian Conf. Comput. Geometry, pp. 22, 1989
17. R. C. Prim, Shortest connection networks and some generalizations, Bell System Technology Journal, vol. 36, pp. 1389-1401, 1957
18. P. J. Rezend, D. T. Lee and Y.-F. Wu, Rectilinear shortest paths with rectangular barriers, Proc. Second Annual Conf. Computational Geometry, pp. 204-13, 1985
19. H.-J. Rothermel and D. A. Mlynski, Computation of Power Supply Nets in VLSI Layout, Proc. Design Automation Conference, pp. 37-47, 1981
20. H.-J. Rothermel and D. A. Mlynski, Automatic Variable-Width Routing for VLSI, IEEE TCAD, vol. CAD-2, no. 4, pp. 271-284, Oct. 1983
21. M. Sarrafzadeh and C. K. Wong, An Introduction To VLSI Physical Design, McGraw-Hill, pp. 96-107, 1996
22. M. Servit, Heuristic algorithms for rectilinear Steiner trees, Digital Processes, vol. 7, pp. 21-32, 1981
23. N. A. Sherwani, Algorithms for VLSI Physical Design Automation, Kluwer Academic Publ., pp. 228-36, 1993
24. J. Soukup, Fast maze router, Proc. Design Automation Conference, pp. 100-102, 1978
25. Z. A. Syed and A. Gamal, Single Layer Routing of Power and Ground Networks in Integrated Circuits, Journal of Digital Systems, vol. VI, no. 1, pp. 53-63, 1982
26. Y.-F. Wu, P. Widmayer, M. D. F. Schlag and C. K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles, IEEE Trans. Comput., vol. C-36, pp. 321-31, 1987
27. S. Q. Zheng, J. S. Lim and S. S. Iyengar, Finding Obstacle-Avoiding Shortest Paths Using Implicit Connection Graphs, IEEE TCAD, vol. CAD-15, no. 1, pp. 103-110, Jan. 1996