李晓磊, 张梅娟, 于大鑫, 徐彦峰. 一种基于层次式FPGA的扩展布线算法[J]. 微电子学与计算机, 2012, 29(6): 37-41.
引用本文: 李晓磊, 张梅娟, 于大鑫, 徐彦峰. 一种基于层次式FPGA的扩展布线算法[J]. 微电子学与计算机, 2012, 29(6): 37-41.
LI Xiao-lei, ZHANG Mei-juan, YU Da-xin, XU Yan-feng. An Expanding Routing Algorithm Based on Hierarchical FPGA[J]. Microelectronics & Computer, 2012, 29(6): 37-41.
Citation: LI Xiao-lei, ZHANG Mei-juan, YU Da-xin, XU Yan-feng. An Expanding Routing Algorithm Based on Hierarchical FPGA[J]. Microelectronics & Computer, 2012, 29(6): 37-41.

一种基于层次式FPGA的扩展布线算法

An Expanding Routing Algorithm Based on Hierarchical FPGA

  • 摘要: 实现了一种基于Virtex架构的FPGA芯片,测试其单长线及直连开关连通情况的布线算法;巧妙地利用了FPGA结构层次化这一特点,采用轮回行布线整体扩展的方法进行布线,布线过程中,利用整体分组、多点布线、综合评优等多套策略,有效降低了后期资源冲突几率和回退率,极大地提高了布线质量和布线效率;拆除重布的过程又采用部分而非整体拆除的机制,大大减少了拆线数量,显著提高了运行速度;实验结果表明,本算法具有布线效率高、单长线资源覆盖率高、故障定位准确率高等优势.

     

    Abstract: This paper implements a routing algorithm,based on a FPGA chip of Virtex architecture,which testing the single long wire and the connected condition of directly connected switch.Taking use of the hierarchical features of FPGA Cleverly and using the method of overall expanding and cycle routing by line for routing.In the process of routing,taking use of several strategies,such as the whole group,multiple points routing,and comprehensive appraisal etc.,reducing the probability of the post resources conflict and the back rate effectively,enhancing the quality and efficiency of cabling greatly.In the process of demolishing and re-routing,taking partial,instead of integral demolition mechanism,greatly reduce the number of the lines that will be demolished,can greatly improve the speed.The experimental results show that this algorithm has advantages of high efficiency in the wiring,high rate in the coverage of single long wire resources,and high accuracy in fault location etc.

     

/

返回文章
返回