Skip to main content
SpringerLink
Log in

Hexagonal routing of multiterminal nets

  • Session 9: Algorithms
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

  • 99 Accesses

Abstract

Channel routing is a vital task in the layout design of VLSI circuits. In this paper, we investigate the multiterminal channel routing problem in a hexagonal model, whose grid is composed of horizontal tracks, right tracks (with slope +60°), and left tracks (with slope −60°). We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. Furthermore, we can wire the layout produced by the router using four layers and there are no overlaps among different layers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.S. Baker, S.N. Bhatt, and F.T. Leighton, An approximation algorithm for Manhattan routing, Proc. 15th Ann. ACM Symp. on Theory of Computing, pp. 477–486, 1983.

    Google Scholar 

  2. B. Berger, M. Brady, D.J. Brown and F.T. Leighton, Nearly optimal algorithms and bounds for multilayer channel routing, Journal of ACM, Vol. 42, No.2, pp. 500–542, 1995.

    Google Scholar 

  3. M. Brady and D.J. Brown, VLSI routing: four layers suffice, Advances in Computing Research (F.P.Preparata, ed.), Vol.2, JAI Press, Greenwich, CT, pp. 245–257, 1984.

    Google Scholar 

  4. M. Brady, D.J. Brown and K.D. Powers, Channel routing on a 60° grid. Proc. Conf. Information Science and Systems, pp. 926–931, 1990.

    Google Scholar 

  5. K. Chaudhary, and Peter Robinson, Channel routing by Sorting, IEEE Trans. on CAD, vol. 10. No. 6. pp. 754–760, 1991.

    Google Scholar 

  6. P. Chaudhuri, An ecological approach to wire routing. Proc. of IEEE International Symposium on Circuits and Systems, pp. 854–857, 1979.

    Google Scholar 

  7. J. Cong and C.L. Liu, A new approach to three-or four-layer channel routing, IEEE Trans. on CAD, Vol. 7, pp. 1094–1104, 1988.

    Google Scholar 

  8. S. Gao and S. Hambrusch, Two-layer channel routing with vertical unit-length overlap, Algorithmica, Vol. 1, pp. 223–232, 1986.

    Google Scholar 

  9. S. Gao and M. Kaufmann, Channel routing of multiterminal nets, Journal of ACM, Vol. 41, No. 4, pp. 791–818, 1994.

    Google Scholar 

  10. A.Hashimoto and J. Stevens, Wire routing by optimization channel assignment within large apertures, in Proc. 8th. Design Automation Workshop, pp. 155–163, 1971.

    Google Scholar 

  11. W. Lipski, On the structure of three-layer wirable layouts, Advances in Computing Research (F.P.Preparata, ed.), Vo1. 2, JAI Press, Greenwich, CT, pp. 231–244, 1984.

    Google Scholar 

  12. W. Lipski and F.P.Preparata, A uniform approach to layout wirability. Math. System Theory, Vol. 19, pp. 189–203, 1987.

    Google Scholar 

  13. E. Lodi, F. Luccio and L. Pagli, A preliminary study of a diagonal channel routing model, Algorithmica, Vol. 4, pp. 585–597, 1989.

    Google Scholar 

  14. E. Lodi, F. Luccio, and L. Pagli, Channel routing for strictly multiterminal nets, Integration, the VLSI Journal Vo1. 8, No.2, pp. 143–153, 1989.

    Google Scholar 

  15. E. Lodi, F. Luccio and L. Pagli, Routing in times square mode, Information Processing Letters Vol. 35, pp. 41–48, 1990.

    Google Scholar 

  16. E. Lodi, F. Luccio, X. Song, A 2d channel router for the diagonal model, Integration, the VLSI Journal, Vol. 11(2), pp. 111–125, 1991.

    Google Scholar 

  17. K. Mehlhorn, F.P. Preparata, and M. Sarrafzadeh, Channel routing in knock-knee mode: Simplified Algorithms and Proofs, Algorithmica, Vol. 1, pp. 213–221, 1986.

    Google Scholar 

  18. B. Rhee, Y. Sugai and H. Hirata, A new HVHD model four layer channel router using a channel-graph (in Japanese), Transactions of IEICE of Japan, Vol. J77-A, pp. 671–679, 1994.

    Google Scholar 

  19. X. Song and X. Tan, An optimal channel routing algorithm in the times square model, IEEE Trans. on CAD Vol. 13, pp. 891–898, 1994.

    Google Scholar 

  20. X. Tan and X. Song, Improvement on the diagonal routing model, IEE Proc. Circuits Devices Syst. Vol. 141, pp. 535–536, 1994.

    Google Scholar 

  21. I.G. Tollis, Algorithms for VLSI layout, Tech. Rep. ACT-85, Coordinated Science Laboratory, University of Illinois at Urbana, 1987.

    Google Scholar 

  22. I.G. Tollis, Techniques for wiring in non-square grids, ISCAS'89, pp. 66–69, 1989.

    Google Scholar 

  23. D.C. Wang, Novel Routing Schemes for IC layout Part 1: Two-Layer Channel Routing, Proc. 28th ACM/IEEE Design Automation Conference, pp. 49–53, 1991.

    Google Scholar 

  24. D.F. Wong and C.L. Liu, Compacted channel routing with via placement restrictions, Integration, the VLSI Journal Vol.4, pp. 287–307, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of High-Technology for Human Welfare, Tokai University, 410-03, Numazu, Japan

    Xuehou Tan

  2. Dept. I.R.O., Universite de Montreal C.P. 6128, Succ. Centre-ville, Montreal, Canada

    Xiaoyo Song

Authors
  1. Xuehou Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyo Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, X., Song, X. (1997). Hexagonal routing of multiterminal nets. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045098

Download citation

  • DOI: https://doi.org/10.1007/BFb0045098

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation