期刊文献+

新型电路版图布局布线算法设计

A novel circuit layout and routing algorithm
下载PDF
导出
摘要 调研了电路自动布局布线技术的国内外研究现状,在此基础上设计了一种面向中等规模电路布局布线算法,主要用于大型版图设计软件的模块测试环节,为用户提供各模块初步的布线布局结果,方便用户高效查找并修正错误点,填补了我国在相关领域的空白。建立了超图模型并转换为图模型,改进了Stoer-Wagner算法并利用该算法和Fiduccia-Mattheyses算法对图进行了基于最小割理论的划分,从而构建出一棵划分树。在这棵树的基础上设计了一种二元相对移动算法来确定各个电路元件的位置,大大降低了布局拥挤度,提高了美观度,对于数百元件的电路均能在0.5 s内得出布局结果。基于A*算法在多个方面做了改进,提高了布线速度,对于线路数1000以下的元件能在0.1 s~60 s内得出结果,实现了100%布通率以及均匀的布局布线效果。 This paper investigates the research status of automatic circuit layout and routing technology at home and abroad,and designs a layout and routing algorithm for medium-sized circuits.It is mainly used in the module test of large-scale layout design software,and provides users with preliminary wiring and layout results of each module,which is convenient for users to find and correct error points efficiently,and fills the gap in related fields in China.In this paper,a hypergraph model is established and transformed into a graph model.The Stoer-Wagner algorithm is improved,and the algorithm and the Fiduccia-Mattheyses algorithm are used to divide the graph based on the minimum cut theory,and construct a partition tree.Based on this tree,this paper designs a binary relative moving algorithm to determine the location of each circuit component,which greatly reduces the layout congestion and improves the aesthetics.For a circuit with hundreds of components,its layout can be obtained within 0.5 seconds.Based on the A*algorithm,the routing is improved in many aspects,and the routing speed is improved.For a circuit with<1000 wires,the routing results can be obtained within 0.1 s to 60 s,achieving 100%routing rate and uniform layout and routing effect.
作者 袁也 王刚 刘晓光 李雨森 YUAN Ye;WANG Gang;LIU Xiao-guang;LI Yu-sen(College of Computer Science,Nankai University,Tianjin 300350;Tianjin Key Laboratory of Network and Data Security Technology(Nankai University),Tianjin 300350,China)
出处 《计算机工程与科学》 CSCD 北大核心 2021年第7期1185-1191,共7页 Computer Engineering & Science
基金 国家自然科学基金(U1833114,61872201,61702521) 天津市人工智能重大专项(18ZXZNGX00140,18ZXZNGX00200)。
关键词 电路设计自动化(EDA) Stoer-Wagner算法 超图 模拟退火算法 A*算法 electroic design automation(EDA) Stoer-Wagner algorithm hypergraph simulated-annealing algorithm A*algorithm
  • 相关文献

参考文献1

二级参考文献12

  • 1吴强,边计年,薛宏熙.基于抽象体系结构模板的多路软硬件划分算法[J].计算机辅助设计与图形学学报,2004,16(11):1562-1567. 被引量:7
  • 2邹谊,庄镇泉,杨俊安.基于遗传算法的嵌入式系统软硬件划分算法[J].中国科学技术大学学报,2004,34(6):724-731. 被引量:14
  • 3盛蓝平,林涛.采用启发式分支定界的软硬件划分[J].计算机辅助设计与图形学学报,2005,17(3):414-417. 被引量:6
  • 4熊志辉,李思昆,陈吉华.遗传算法与蚂蚁算法动态融合的软硬件划分[J].软件学报,2005,16(4):503-512. 被引量:87
  • 5高海兵,周驰,高亮.广义粒子群优化模型[J].计算机学报,2005,28(12):1980-1987. 被引量:102
  • 6Lopez-Vallejo M,Lopez J C.On the hardware-software partitioning problem:system modeling and partitioning techniques[J].ACM Transactions on Design Automation for Electronic Systems,2003,8(3):269-297.
  • 7Arató P,Mann Z,Orbán A.Algorithmic aspects of hardwaresoftware partitioning[J].ACM Transactions on Design Automation of Electronic Systems,2005,10(1):136-156.
  • 8Wu J G,Srikanthan T,Jiao T.Algorithmic aspects for functional partitioning and scheduling in hardware/software co-design[J].Design Automation for Embedded Systems,2008,12(4):345-375.
  • 9Abdelhalim M B,Salama A E,Habib S E D.Constrained and unconstrained hardware/software partitioning using particle swarm optimization technique[C] //Proceedings of International Federation for Information Processing.Boston:Springer,2007:207-220.
  • 10Kennedy J,Eberhart R.Particle swarm optimization[C] //Proceedings of IEEE International Conference on Neural Networks.Piscataway,NJ:IEEE Press,1995:1942-1948.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部