A new channel routing algorithm based on Steiner Minimum Tree

被引：0
|
作者：
Luo, XH [1 ]
Sun, LL [1 ]
Yan, XL [1 ]
Zhu, HW [1 ]
机构：
[1] Zhejiang Univ, Inst VLSI Design, Hangzhou 310027, Peoples R China
来源：
2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS | 2001年
关键词：
D O I：
10.1109/ICASIC.2001.982514
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this article, we propose a new channel routing algorithm based on Steiner Minimum Tree for fixed amount of routing channels. By adding some doglegs and changing the order of routing, the algorithm can sufficiently use the channel resources. Quick and efficient channel routing can be implemented by using this algorithm. A routing sample is also provided.
引用
收藏
页码：126 / 129
页数：4
相关论文
共 50 条
  • [21] A Multicast Routing Tree Algorithm with Minimum Energy in MANET
    Yin Min
    Liang Miao-yuan
    Tang Yao
    2009 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2009), 2009, : 298 - +
  • [22] A data-aggregation algorithm based on minimum steiner tree in wireless sensor networks (WSN)
    Li, Zhiyu
    Shi, Haoshan
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2009, 27 (04): : 558 - 564
  • [23] A New Algorithm with Minimum Track for Four Layer Channel Routing in VLSI Design
    Khan, Ajoy Kumar
    Das, Bhaskar
    2013 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS, 2013,
  • [24] Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
    Liu, Suding
    OPTIMIZATION LETTERS, 2024, 18 (06) : 1421 - 1435
  • [25] Steiner tree construction based on congestion for the global routing problem
    Behjat, L
    Vannelli, A
    3RD IEEE INTERNATIONAL WORKSHOP ON SYSTEM-ON-CHIP FOR REAL-TIME APPLICATIONS, PROCEEDINGS, 2003, : 28 - 31
  • [26] An efficient hierarchical timing-driven Steiner tree algorithm for global routing
    Xu, JY
    Hong, XL
    Jing, T
    Cai, Y
    Gu, J
    INTEGRATION-THE VLSI JOURNAL, 2003, 35 (02) : 69 - 84
  • [27] An efficient hierarchical timing-driven steiner tree algorithm for global routing
    Xu, JY
    Hong, XL
    Jing, T
    Cai, Y
    Gu, J
    ASP-DAC/VLSI DESIGN 2002: 7TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE AND 15TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 2002, : 473 - 478
  • [28] Hexagonal Minimum Steiner Tree Construction for Y Architecture: A Case of Non-Manhattan Routing
    Ghosal, Prasun
    Biswas, Arunava
    2012 ASIA PACIFIC CONFERENCE ON POSTGRADUATE RESEARCH IN MICROELECTRONICS & ELECTRONICS (PRIMEASIA), 2012, : 160 - 166
  • [29] A new dynamic routing algorithm based on minimum interference in MPLS Networks
    Zhu, Mingying
    Ye, Wu
    Feng, Suili
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 4222 - 4225
  • [30] An Approximate Algorithm for the Steiner Tree Problem based on Ant Colony Algorithm
    Jia, Jingwei
    Long, Haiming
    2ND INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING, INFORMATION SCIENCE AND INTERNET TECHNOLOGY, CII 2017, 2017, : 262 - 267
12345