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 条
  • [41] HEURISTICS FOR THE MINIMUM RECTILINEAR STEINER TREE PROBLEM - NEW ALGORITHMS AND A COMPUTATIONAL STUDY
    DESOUZA, CC
    RIBEIRO, CC
    DISCRETE APPLIED MATHEMATICS, 1993, 45 (03) : 205 - 220
  • [42] Improved approximation algorithm for Steiner tree based on topology analysis
    Gao, Lei
    Zhang, Deyun
    Wang, Xiaodong
    An, Zhiping
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2003, 37 (10): : 1012 - 1015
  • [43] A New Heuristic for the Minimum Routing Cost Spanning Tree Problem
    Singh, Alok
    ICIT 2008: PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, 2008, : 9 - 13
  • [44] Effective Algorithm CFL Based on Steiner Tree and UFL Problem
    Zheng, Hong-Zhen
    Chu, Dian-Hui
    Zhan, De-Chen
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (9A): : 24 - 27
  • [45] A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction
    Liu, Genggeng
    Guo, Wenzhong
    Niu, Yuzhen
    Chen, Guolong
    Huang, Xing
    SOFT COMPUTING, 2015, 19 (05) : 1153 - 1169
  • [46] A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction
    Genggeng Liu
    Wenzhong Guo
    Yuzhen Niu
    Guolong Chen
    Xing Huang
    Soft Computing, 2015, 19 : 1153 - 1169
  • [47] A NEW AD HOC ROUTING ALGORITHM BASED ON MINIMIZING THE CHANNEL HANDOFF
    Xie JinZhu Qi* Li Zongshou(Jiangsu Key Laboratory of Wireless Communications
    Journal of Electronics(China), 2010, 27 (06) : 749 - 755
  • [48] Clustering Based Minimum Spanning Tree Algorithm
    Saxena, Sakshi
    Verma, Priyanka
    Rajpoot, Dharmveer Singh
    2017 TENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2017, : 360 - 362
  • [49] A faster algorithm for the Steiner tree problem
    Mölle, D
    Richter, S
    Rossmanith, P
    STACS 2006, PROCEEDINGS, 2006, 3884 : 561 - 570
  • [50] The Minimum Routing Cost Tree Problem: State of the art and a core-node based heuristic algorithm
    Masone, Adriano
    Nenni, Maria Elena
    Sforza, Antonio
    Sterle, Claudio
    SOFT COMPUTING, 2019, 23 (09) : 2947 - 2957
12345