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 条
  • [1] Dynamic channel routing algorithm based on minimum spanning tree
    Wei, Jian-Jun
    Kang, Ji-Chang
    Lei, Yan-Jing
    Chen, Fu-Long
    Zhongbei Daxue Xuebao (Ziran Kexue Ban)/Journal of North University of China (Natural Science Edition), 2008, 29 (02): : 120 - 124
  • [2] DPSO Based Octagonal Steiner Tree Algorithm for VLSI Routing
    Liu, Genggeng
    Chen, Guolong
    Guo, Wenzhong
    2012 IEEE FIFTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2012, : 383 - 387
  • [3] X-architecture Steiner Minimum Tree Algorithm Considering Routing Resource Relaxation
    Tang H.
    Liu G.
    Guo W.
    Chen G.
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2020, 33 (05): : 401 - 412
  • [4] Wirelength and Memory OptimizedRectilinear Steiner Minimum Tree Routing
    Latha, N. R.
    Prasad, G. R.
    2017 2ND IEEE INTERNATIONAL CONFERENCE ON RECENT TRENDS IN ELECTRONICS, INFORMATION & COMMUNICATION TECHNOLOGY (RTEICT), 2017, : 1493 - 1497
  • [5] A practical algorithm for the minimum rectilinear steiner tree
    Jun Ma
    Bo Yang
    Shaohan Ma
    Journal of Computer Science and Technology, 2000, 15 : 96 - 99
  • [6] A practical algorithm for the minimum rectilinear Steiner tree
    Ma, J
    Yang, B
    Ma, SH
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (01) : 96 - 99
  • [7] Steiner tree based routing algorithm in consideration of optical proximity correction
    Zhang, Wei
    Cai, Yici
    Zhou, Qiang
    Hong, Xianlong
    2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 2424 - 2428
  • [8] RSR: A new Rectilinear Steiner Minimum Tree approximation for FPGA placement and global routing
    de Vicente, J
    Lanchares, J
    Hermida, R
    24TH EUROMICRO CONFERENCE - PROCEEDING, VOLS 1 AND 2, 1998, : 192 - 195
  • [9] MISTER: An Approximate Minimum Steiner Tree Based Routing Scheme in Wireless Sensor Networks
    Li, Guorui
    Wang, Ying
    Wang, Cong
    Luo, Biao
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2016, PT II, 2016, 9713 : 317 - 323
  • [10] Augmented Line Segment Based Algorithm for Constructing Rectilinear Steiner Minimum Tree
    Vani, V.
    Prasad, G. R.
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATION AND ELECTRONICS SYSTEMS (ICCES), 2016, : 749 - 753
12345