Performance-driven Routing Tree Construction with Buffer Insertion and Wire Sizing

被引：0
|
作者：
祁昶
王高峰
机构：
[1] Institute of Microelectronics and Information Technology Wuhan University
[2] Wuhan 430072 China Wuhan 430072 China
[3] Institute of Microelectronics and Information Technology Wuhan University
来源：
Journal of Shanghai Jiaotong University | 2008年 / 01期
基金：
中国国家自然科学基金;
关键词：
performance-driven; multi-terminals net; rectilinear Steiner tree; buffer insertion; wiresizing optimization; RLC delay model;
D O I：
暂无
中图分类号：
TN405 [制造工艺];
学科分类号：
摘要：
A new approach was proposed to construct a performance-driven rectilinear Steiner tree with simultaneous buffer insertion and wiresizing optimization (PDRST/BW) under a higher order resistance-inductance-capacitance (RLC) delay model. This approach is based on the concept of sharing-buffer insertion and dynamic programming approach combined with a bottom-up rectilinear Steiner tree construction. The performances include the timing delay and the quality of signal waveform. The experimental results show that our proposed approach is scalable and obtains better performance than SP-tree and graph-RTBW approaches for the test signal nets.
引用
收藏
页码：46 / 51
页数：6
相关论文
共 50 条
  • [1] Performance-driven routing tree construction with buffer insertion and wire sizing
    Qi C.
    Wang G.-F.
    Journal of Shanghai Jiaotong University (Science), 2008, 13 (1) : 46 - 51
  • [2] Performance-driven routing tree construction with buffer insertion, wire sizing under RLC delay model
    Qi, Chang
    Wang, Gao-feng
    Chen, Yue-hua
    2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS, 2007, : 3418 - +
  • [3] A performance-driven global routing algorithm with wire-sizing and buffer-insertion
    Deguchi, T
    Koide, T
    Wakabayashi, S
    APCCAS '98 - IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: MICROELECTRONICS AND INTEGRATING SYSTEMS, 1998, : 121 - 124
  • [4] An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations
    Dechu, S
    Shen, C
    Chu, C
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2005, 24 (04) : 600 - 608
  • [5] An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations
    Dechu, S
    Shen, ZC
    Chu, CCN
    ASP-DAC 2004: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, 2004, : 361 - 366
  • [6] A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints
    Tang, XP
    Tian, RQ
    Xiang, H
    Wong, DF
    ICCAD 2001: IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2001, : 49 - 56
  • [7] Timing-driven Steiner tree construction with wire sizing, buffer insertion and obstacle avoidance
    Yan, Jin-Tai
    Huang, Shi-Qin
    Chen, Zhi-Wei
    2007 14TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-4, 2007, : 717 - +
  • [8] Top-down-based timing-driven Steiner tree construction with wire sizing and buffer insertion
    Yan, Jin-Tai
    Huang, Shi-Qin
    Chen, Zhi-Wei
    TENCON 2007 - 2007 IEEE REGION 10 CONFERENCE, VOLS 1-3, 2007, : 515 - 518
  • [9] Zero skew clock-tree optimization with buffer insertion/sizing and wire sizing
    Tsai, JL
    Chen, TH
    Chen, CCP
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2004, 23 (04) : 565 - 572
  • [10] Delay constrained optimization by simultaneous fanout tree construction, buffer insertion/sizing and gate sizing
    Liu, IM
    Aziz, A
    2000 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS, 2000, : 209 - 214
12345