Robust Methods for EMC-Driven Routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 13, Issue 11, 1994, Pages 1366-1378

  Theune, D ^a   John, W ^a   Thiele, R ^b   Lengauer, T ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b The German National Computer Science Research Center ^*  (Germany)

^c FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; CROSSTALK; ELECTROMAGNETIC COMPATIBILITY; ELECTROMAGNETIC WAVE REFLECTION; MATHEMATICAL MODELS; PRINTED CIRCUIT BOARDS; PRINTED CIRCUIT DESIGN; ROBUSTNESS (CONTROL SYSTEMS);

COST CRITERIA; ELECTROMAGNETIC COMPATIBILITY DRIVEN ROUTING; PRINTED CIRCUIT BOARD ROUTING; ROBUST METHODS; SPECIFICATION;

ELECTRIC WIRING;

EID: 0028532585     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.329265     Document Type: Article

References (38)

1. H. B. Bakoglu, Circuits, Interconnections and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
2. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, pp. 223–234, 1983.
3. U. Choudhury and A. Sangiovanni-Vincentelli, “Constraint based channel routing for analog and mixed analog/digital circuits,” in Proc. ICCAD, 1990, pp. 198–201.
4. U. Choudhury and A. Sangiovanni-Vincentelli, “Constraint generation for routing analog circuits,” in Proc. 27th ACM/IEEE DAC, 1990, pp. 561–566.
5. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, “Provably good performance-driven global routing,” IEEE Trans. Computer-Aided Design, vol. CAD-11, no. 6, pp. 739–752, 1992.
6. W. A. Dees and P. G. Karger, “Automated ripup and reroute techniques,” in Proc. 19th ACM/IEEE DAC, 1982, pp. 432–439.
7. M. R. Garey and D. S. Johnson, Computers and intractibility. New York: W. H. Freeman, 1979.
8. D. J. Garrod, R. A. Rutenbar, and L. R. Carley, “Automatic layout of custom analog cells in ANAGRAM,” in Proc. ICCAD, 1988, pp. 544–547.
9. P. Groeneveld, “On global wire ordering for detailed routing,” in Proc. 26th ACM/IEEE Design Automation Conf., 1989, pp. 155–161.
10. P. Groeneveld, “Wire ordering for detailed routing,” IEEE Design & Test Comput., pp. 6–17, Dec. 1989.
11. R. S. Gyurcsik and J.C. Jeen, “A generalized approach to routing mixed analog and digital signal nets in a channel,” IEEE J. Solid State Circuits, pp. 436–442, 1989.
12. T.C. Hu and M. T. Shing, “A decomposition algorithm for circuit routing,” Mathematical Programming Study, vol. 24, pp. 87–103, 1985.
13. W. John, “Remarks to the solution of EMC-problems on printed circuit boards,” in 7th Int. Conf. EMC, Univ. of York, UK, 1990.
14. W. John, “Application of microelectronic devices on printed-circuit boards under EMC-aspects (in German),” GME-Fachbericht 9, EMV Störfestigkeit Ieittechnischer Einrichtungen. GME·Fachtagung, Bad Nauheim, pp. 207–232, 1991.
15. W. John, “Support of printed-circuit board design by an EMC-workbench,” workbench,” in Proc. 10th Int. Zürich Symp. & Tech. Exhibition on Electromagnetic Compatibility, Zürich, 1993.
16. W. John, J. Hoener, and O. Rethmeier, “FREACS-A fast reflection and crosstalk simulator,” Comp Euro 91, pp. 526–530, 1991.
17. W. John, D. Theune, and R. Thiele, “Layout design for printed-circuit circuit boards under EMC-constraints,” Electromagnetic Compatibility 1993, 10th International Zurich Symposium & Technical Exhibition on Electromagnetic Compatibility, Zurich, 1993, pp. 225–232.
18. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani, “Global wire routing in two-dimensional arrays,” in Proc. 24th Annual Symp. on Foundations of Computer Sci., 1983, pp. 453–459.
19. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani, “Global wire routing in two-dimensional arrays,” Algorithmica, vol. 2, pp. 113–129, 1987.
20. J. Kessenich and G. Jackoway, “Global Forced Hierarchical Router,” in Proc. 23rd ACM/IEEE DAC, 1986, pp. 798–802.
21. S. Kiefl, “A new hierarchical concept for the physical design of PCBs,” in Int. Workshop on Placement and Routing, Research Triangle Park, NC, 1988.
22. U. Lauther, “Top down hierarchical global routing for channelless gate arrays based on linear assignment,” Carlo H. Sequin, Ed., in Proceedings of VLS1'87. Amsterdam: Elsevier Science Publications B.V., pp. 141–151, 1987.
23. T. Lengauer, Combinatorial algorithms for integrated circuit layout, Teubner Wiley Series in Computer Science. New York: John Wiley and Sons, 1990.
24. T. Lengauer and R. Müller, “A robust framework for hierarchical floorplanning planning with integrated global wiring,” ICCAD, 1990, pp. 148–151.
25. T. Lengauer and D. Theune, “Efficient algorithms for path problems with general cost criteria,” in 18th Int. Symposium on Automata, Languages and Programming, Springer LNCS No. 510, pp. 314–326, 1991.
26. T. Lengauer and D. Theune, “Unstructured path problems and the making of semirings,” in 2nd Workshop on Algorithms and Data Structures, Ottawa, Canada, Springer LNCS No. 519, pp. 189–200, 1991.
27. W. K. Luk, P. Sipila, M. Tamminen, D. Tang, L. S. Woo, and C. K. Wong, “A hierarchical global wiring algorithm for custom chip design,” IEEE Trans. Computer-Aided Design, vol. CAD-6, no. 4, pp. 518–533, 1987.
28. E. Malavasi, M. Chilanti, and R. Guerrieri, “A general router for analog layout,” COMPEURO ‘89, Hamburg, 1989, pp. 549–551.
29. E. Malavasi, U. Choudhury, and A. Sangiovanni-Vincentelli, “A routing method for analog integrated circuits,” in Proc. 1CCAD, 1990, pp. 202–205.
30. S. Mitra, S. K. Nag, R. A. Rutenbar, and L. R. Carley, “System-level routing of mixed-signal {ASICS} in WREN,” in Proc. ICCAD, 1992, pp. 394–399.
31. A.P.C. Ng, P. Raghavan, and C. D. Thompson, “Experimental results for a linear program global router,” Computers and Artificial Intelligence, vol. 6, no. 3, pp. 229–242, 1987.
32. O. A. Olukotun and T. N. Mudge, “Hierarchical gate-array routing on a hypercube multiprocessor,” J. Parallel Distrib. Comput., vol. 8, pp. 313–324, 1990.
33. P. Raghavan and C. D. Thompson, “Randomized rounding: A technique for provably good algorithms and algorithmic proofs,” Combinatorica, vol. 7, no. 4, pp. 365–374, 1987.
34. R. W. ‘Thaik. N. Lek, and S.M. Kang, “A new global router using zero-one one integer linear programming techniques for sea-of-gates and custom logic arrays,” IEEE Trans. Computer-Aided Design, vol. CAD-11, pp. 1479–1494, 1992.
35. D. Theune, “Robust and efficient methods for solving path problems, ” Ph.D. thesis, University of Paderborn, Germany, 1994 (in German).
36. D. Theune, R. Thiele, T. Lengauer, and A. Feldmann, “HERO: Hierarchical EMC-constrained routing,” in Proc. ICCAD, 1992, pp. 468–472.
37. J.S. Turner, “Allmost all k-colorable graphs are easy to color,” J. Algorithms, vol. 9, pp. 63–82, 1988.
38. K. Wawryn, “Layout including parasitics for printed circuit boards,” Int. J. Circuit Theory Appl. (UK), vol. 6, no. 2, pp. 107–128, Apr. 1988.