欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了避免由于布线线序处理不当而导致无法布通的问题,提出一种基于整数规划的层次式FPGA布线算法.该算法使用一种全局优化处理的方式对布线问题进行求解,通过分析层次式FPGA的结构特点和整数规划的算法特点,导出了FPGA布线算法问题与整数规划之间的关系;然后具体描述了如何将FPGA布线问题转化成二进制整数规划问题及其相应的求解过程,其中利用层次式FPGA的结构特点对得到的整数规划问题进行简化.与可满足性布线算法进行实验比较的结果表明,文中算法具有求解速度更快、求解规模更大以及求解质量更高等方面的优势.
英文摘要：
In order to avoid the unroutability caused by the bad net-routing sequence,this paper presents a routing algorithm for hierarchical FPGAs（HFPGAs） based on integer programming.It employs global optimization method to solve the routing problem.By analyzing the architecture of HFPGAs and the features of the integer programming,we get the corresponding relationship between the problem of the routing and the integer programming model.Then the process of conversions from the FPGA routing constraints to the modeling of the binary integer programming is discussed in detail.At this stage,it takes advantage of the architectural characteristics of HFPGAs to simplify the resulted model.At last the integer programming based FPGA routing algorithm is implemented,compared with the SAT algorithm by experiments.The experimental results show that the proposed routing algorithm has advantages of high speed,large scale and good quality.
同期刊论文项目
同项目期刊论文
期刊信息
位置：