期刊文献+

一个基于模拟进化的VLSI多层区域布线算法

A General VLSI Multi-layer Area Routing Algorithm Based on Simulated Evolution
下载PDF
导出
摘要 提出了一个VLSI版图设计的多层区域详细布线算法。算法采用有网格顺序布线技术 ,先按线网权重从大到小的次序对线网逐个布线 ,若剩有不能布通的线网则采用拆线 -重布线 ,所有线网都布通后再利用拆线 -重布线策略对布线进行优化 ,拆线 -重布线的线网选择原则基于模拟进化技术 ,对单个线网使用改进型多层迷宫算法进行布线。算法可进行严格分层模式和非严格分层模式的布线 ,布线同时能进行通孔优化 ,能优先考虑关键线网的布线 ,并采取了减少串扰的措施。实验证明该算法能得到较好的布线结果。 This paper presents a VLSI multi-layer area detailed routing algorithm. The approach is based on a ripped-up and rerouted methodology using simulated evolution technique. The rip-up and reroute first finds a feasible initial solution, then optimizes the solution. For single net a modified Lee's maze algorithm is performed. In this area routing algorithm preferred wiring directions for each layer can be fixed or unfixed meanwhile stacked via is supported and via minimization is carried out as part of routing process, and critical nets are prior to be routed and crosstalk is taken into consideration. Experiments prove that the algorithm is effective.
作者 马琪
出处 《杭州电子工业学院学报》 2002年第3期6-10,共5页 Journal of Hangzhou Institute of Electronic Engineering
关键词 VLSI 算法 多层区域详细布线 模拟进化 多层迷宫布线算法 串扰 multilayer area detailed router simulated evolution modified Lee's maze algorithm
  • 相关文献

参考文献5

  • 1Hyunchul Shin, Alberto Sangiovanni - Vincentelli. A Detailed Router Based on Incremental Routing Modification: Mighty [J]. IEEE Trans. Computer- Aided Design, 1987, 6(11): 942 - 949.
  • 2J P Cohoon, P L Heck, Beaver. A Computational- C eometry Based Tool for S witchbox Routing [J] . WEE Trans. on Computer Aided Design, 1988, 7(6): 684- 697.
  • 3Youn Long Lin, Yu Chin Hsu, Fur Shing Tsai. SILK: A Simulated Evolution Router [J]. IEEE Trans. Computer- Aided Design, 1989, 8(10): 1108-1114.
  • 4Mohan Guruswamy, D F Wong. Echelon: A Multilayer Detailed Area Router [J]. IEEE Trans. Computer- Aided Design, 1996, 15(9): 1126-1136.
  • 5王沅 洪先龙 乔长阁 蔡懿慈.ARNTA:基于线网类型分析的多层区域布线算法[J].微电子学与计算机,1998,:57-60.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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