Journal of the Institute of Electronics Engineers of Korea SD (대한전자공학회논문지SD)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

A Minimum Crosstalk Wire Spacing Method by Linear Programming

선형프로그래밍에 의한 최소 혼신 배선간 간격조정방법

  • Published : 2003.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper deals with a crosstalk minimization method by wire spacing. The suggested method uses linear programming method and consider crosstalk of both horizontal segments and vertical segments. In this paper, we suggest a method which can predict the coupling length between vertical segments in the final routing result using longest path algorithm. By the suggested method, we can make LP problem without integer variable. Therefore, it is much faster to solve the problem. In the case of crosstalk optimization, the suggested method optimized peak crosstalk 11.2%, and 3% total crosstalk more than wire perturbation method. The execution time of the suggested method is as fast as it takes 11 seconds when Deutsch is optimized.

본 논문은 배선간의 간격 조정을 통하여 혼신을 최소화하는 방법을 다룬다. 제시된 방법은 선형 프로그래밍을 이용하며, 정확한 혼신 계산을 위해 수평 배선 조각과 수직 배선 조각에서의 혼신을 모두 고려한다. 본 논문에서는 최장 길이 경로 문제를 이용하여 수직 배선 조각간의 결합 길이를 예측하는 방법을 제안한다. 이를 이용하면 실수 변수만으로 선형 프로그래밍 문제를 생성할 수 있으므로 문제 해결 시간이 매우 빠르다. 제시된 방법은 기존의 연구 결과인 wire perturbation 방법에 비해 실행 시간과 혼신 최소화 율에서 보다 나은 성능을 보였다. 혼신 최소화 율의 경우, 제안된 방법은 wire perturbation 방법에 비해 최고 혼신의 경우 평균 11.2% 향상된 결과를 보였고, 전체 혼신의 경우 3% 향상된 결과를 얻었다. 또한 제시된 방법의 수행 시간은 회로 Deutsch의 경우 11초 이내에 해결하는 빠른 속도를 보였다.

Keywords

References

  1. Bakoglu, H.B., Circuits, Interconnections and Packaging for VLSI, Addison-Wesley, 1990
  2. Burstein, M., Pelavin, R., 'Hierarchical Wire Routing,' IEEE Trans. on CAD., Vol. CAD-2, No. 4, pp. 223-234, 1983 https://doi.org/10.1109/TCAD.1983.1270040
  3. Chen, Z. and Koren, I., 'Crosstalk Minimization in Three-Layer HVH Channel Routing,' IEEE Int. Symp. on Defect and Fault Tolerance in VLSI Systems, pp. 38-42, Oct. 1997 https://doi.org/10.1109/DFTVS.1997.628307
  4. Chen, H.H. and Wong, C.K., 'Wiring and Crosstalk Avoidance in Multi-chip Module Design,' Proc. Custom-Integrated Circuits Conf., pp. 28.6.1-28.6.4, May 1992
  5. Deutsch, D.N., 'A Dogleg Channel Router,' Proc. Design Automation Conf., pp. 425-433, Jun. 1976 https://doi.org/10.1145/800146.804843
  6. Gao, T. and Liu, C.L., 'Minimum Crosstalk Channel Routing,' IEEE Trans. Computer-Aided Design, Vol. 15, No. 5, May. 1996 https://doi.org/10.1109/43.506134
  7. Gao, T. and Liu, C.L., 'Minimum Crosstalk Switchbox Routing,' Proc. Int. Conf. Computer Aided Design, pp. 610-615, 1994
  8. Jhang, K.S., Ha, S. and Jhon, C.S., 'COP : A Crosstalk Optimizer for Gridded Channel Routing,' IEEE Trans. Computer-Aided Design, Vol. 15, No. 4, pp. 424-429, Apr. 1996 https://doi.org/10.1109/43.494705
  9. LP Solve, ftp://ftp.ics.ele.tue.nl
  10. MOSIS, http://www.mosis.org
  11. Ohtsuki, T., Layout Design and Verification, North-Holland, 1986
  12. Onozawa, A., Chaudhary, K. and Kuh, E.S., 'Performance Driven Spacing Algorithms Using Attractive and Repulsive Constraints for Submicron LSI's,' IEEE Trans. Computer- Aided Design, Vol. 14, No. 6, pp. 707-719, Jun. 1995 https://doi.org/10.1109/43.387731
  13. Parakh, P.N. and Brown, R.B., 'Crosstalk Constrained Global Route Embedding,' Proc. Int. Symp. Physical Design, pp. 201-206, Apr. 1999 https://doi.org/10.1145/299996.300077
  14. Sakurai, T. and Tamaru, K., 'Simple Formulas for Two-and Three-Dimensional Capacitances,' IEEE Trans. Electron Devices, Vol. ED-30, No. 2, pp. 183-185, Feb. 1983 https://doi.org/10.1109/T-ED.1983.21093
  15. Saxena, P. and Liu, C.L., 'A Postprocessing Algorithm for Crosstalk-Driven Wire Perturbation,' IEEE Trans. Computer-Aided Design, Vol. 19, No. 6, pp. 691-702, Jun. 2000 https://doi.org/10.1109/43.848090
  16. Thakur, S., Chao, K.Y. and Wong, D.F., 'An Optimal Algorithm for Minimizing Crosstalk for Three Layer VHV Channel Routing,' Proc. IEEE Intl. Symp. on Circuits and Systems, pp. 207-210, 1995
  17. Vittal, A. and Marek-Sadowska, M., 'Crosstalk Reduction for VLSI,' IEEE Trans. Computer Aided Design, Vol. 16, No. 3, pp. 290-298, Mar. 1997 https://doi.org/10.1109/43.594834
  18. Wang, D. and Kuh, E.S., 'A Performance driven MCM Router with Special Consideration of Crosstalk Reduction,' Proc. Design Automation and Test in Europe, pp. 466-470, 1998 https://doi.org/10.1109/DATE.1998.655899
  19. Xue, T. Huh, E.S. and Wang, D., 'Post Global Routing Corsstalk Synthesis,' IEEE Trans. Computer-Aided Design, Vol. 16, No. 12, pp. 1418-1430, Dec. 1997 https://doi.org/10.1109/43.664224
  20. Yoshimura, T. and Kuh, E.S., 'Efficient Algorithms for Channel Routing,' IEEE Trans. Computer-Aided Design, Vol. CAD-1, No. 1, pp. 25-35, Jan. 1982 https://doi.org/10.1109/TCAD.1982.1269993
  21. Zhou, H. and Wong, D.F., 'Crosstalk Constrained Maze Routing Based on Lagrangian Relaxation,' Proc. Int. Conf. Computer Design, pp. 628-633, 1997 https://doi.org/10.1109/ICCD.1997.628931
  22. Zhou, H. and Wong, D.F., 'Global Routing with Crosstalk Constraints,' IEEE Trans. Computer-Aided Design, Vol. 18, No. 11, pp. 1683-1688, Nov. 1999 https://doi.org/10.1109/43.806813