Timing-driven logic restructuring for nano-hybrid circuits

被引:5
|
作者
Chu, Zhufei [1 ]
Xia, Yinshui [1 ]
Hung, William N. N. [2 ]
Song, Xiaoyu [3 ]
Wang, Lunyao [1 ]
机构
[1] Ningbo Univ, Sch Informat Sci & Engn, Ningbo 315211, Zhejiang, Peoples R China
[2] Synopsys Inc, Mountain View, CA USA
[3] Portland State Univ, Dept Elect & Comp Engn, Portland, OR 97207 USA
基金
国家教育部博士点专项基金资助; 中国国家自然科学基金;
关键词
nano-hybrid circuit; logic restructuring; timing; optimisation;
D O I
10.1080/00207217.2012.720945
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As the feature size of the integrated circuits (ICs) scales down, the future of nano-hybrid circuit looks bright in extending Moore's Law. However, mapping a circuit to a nano-fabric structure is vexing due to connectivity constraints. A mainstream methodology is that a circuit is transformed into a nano-fabric preferred structure by buffer insertion to high fan-out gates. However, it may result in timing degradation. Logic replication is a traditional way to split high fan-out gates in logic synthesis but may not be suitable for high fan-out gates with high fan-ins. In this article, a timing-driven logic restructuring framework at the gate level is proposed. The proposed framework identifies the high fan-out gates from a given gate netlist according to the fan-out threshold, following by the restructuring of high fan-out gates through the application of logic replication and buffer insertion. To improve circuit timing from a global perspective, latent critical edges are identified to avoid entrapping critical paths during the restructuring. Experimental results on ISCAS benchmarks indicate that 8.51% timing improvement and 6.13% CPU time reduction can be obtained traded with 4.16% area increase on an average.
引用
收藏
页码:669 / 685
页数:17
相关论文
共 50 条
  • [41] Timing-driven global routing with efficient buffer insertion
    Xu, JY
    Hong, XL
    Jing, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (11) : 3188 - 3195
  • [42] A FAST AND EFFECTIVE TIMING-DRIVEN PLACEMENT TOOL FOR FPGAs
    Khalid, Mohammed A. S.
    Xu, Yonghong
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2008, 17 (04) : 663 - 673
  • [43] Optimality and stability study of timing-driven placement algorithms
    Cong, J
    Romesis, M
    Xie, M
    ICCAD-2003: IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2003, : 472 - 478
  • [44] Timing-driven floorplanning algorithm for Building Block Layout
    Kong, TM
    Hong, XL
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN AND COMPUTER GRAPHICS, 1996, 2644 : 477 - 482
  • [45] AIR: A Fast but Lazy Timing-Driven FPGA Router
    Murray, Kevin E.
    Zhong, Sheng
    Betz, Vaughn
    2020 25TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2020, 2020, : 338 - 344
  • [46] Timing-driven variation-aware synthesis of hybrid mesh/tree clock distribution networks
    Abdelhadi, Ameer
    Ginosar, Ran
    Kolodny, Avinoam
    Friedman, Eby G.
    INTEGRATION-THE VLSI JOURNAL, 2013, 46 (04) : 382 - 391
  • [47] Timing-driven global routing with efficient buffer insertion
    Xu, JY
    Hong, XL
    Jing, T
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 2449 - 2452
  • [48] Timing-driven Steiner tree construction among the obstacles
    Huang, Hsin-Hsiung
    Chang, Shu-Ping
    Lin, Yu-Cheng
    Hsieh, Rai-Mng
    2007 INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS, VOLS 1 AND 2, 2007, : 536 - +
  • [49] High-Performance Timing-Driven Rank Filter
    Szanto, Peter
    Szedo, Gabor
    Feher, Bela
    VLSI DESIGN, 2008,
  • [50] A timing-driven algorithm for leakage reduction in MTCMOS FPGAs
    Hassan, Hassan
    Anis, Mohab
    Elmasry, Mohamed
    PROCEEDINGS OF THE ASP-DAC 2007, 2007, : 678 - +