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 条
  • [31] Energy Saving Routing Algorithm for Wireless Sensor Networks Based on Minimum Spanning Hyper Tree
    Han, H.
    Shi, P. Z.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2023, 18 (06)
  • [32] An algorithm of Minimum energy costing single-path routing based on tree topology in WSN
    Li, Yaqian
    Liu, Haoran
    Hao, Xiaochen
    Yin, Rongrong
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL IX, 2010, : 439 - 443
  • [33] The Minimum Routing Cost Tree ProblemState of the art and a core-node based heuristic algorithm
    Adriano Masone
    Maria Elena Nenni
    Antonio Sforza
    Claudio Sterle
    Soft Computing, 2019, 23 : 2947 - 2957
  • [34] An algorithm of Minimum energy costing single-path routing based on tree topology in WSN
    Li, Yaqian
    Liu, Haoran
    Hao, Xiaochen
    Yin, Rongrong
    2011 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION AND INDUSTRIAL APPLICATION (ICIA2011), VOL IV, 2011, : 438 - 442
  • [35] Quantum Speedup for the Minimum Steiner Tree Problem
    Miyamoto, Masayuki
    Iwamura, Masakazu
    Kise, Koichi
    Le Gall, Francois
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 234 - 245
  • [36] On the Value of a Random Minimum Weight Steiner Tree
    Béla Bollobás*
    David Gamarnik
    Oliver Riordan
    Benny Sudakov†
    Combinatorica, 2004, 24 : 187 - 207
  • [37] On the value of a random minimum weight steiner tree
    Bollobás, B
    Gamarnik, D
    Riordan, O
    Sudakov, B
    COMBINATORICA, 2004, 24 (02) : 187 - 207
  • [38] Solving the Euclidean Steiner Minimum Tree Using Cellular Stochastic Diffusion Search Algorithm
    张瑾
    赵雅靓
    马良
    Journal of Shanghai Jiaotong University(Science), 2011, 16 (06) : 734 - 741
  • [39] Solving the euclidean steiner minimum tree using cellular stochastic diffusion search algorithm
    Zhang J.
    Zhao Y.-L.
    Ma L.
    Journal of Shanghai Jiaotong University (Science), 2011, 16 (06) : 734 - 741
  • [40] An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
    Shin, Donghoon
    Choi, Sunghee
    PLOS ONE, 2023, 18 (11):
12345