科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article we present an approach to the segment channel routing problem that occurs in FPGA design technology. The objective is to find an optimal solution for the k-segmented and unlimited segmented routing problems. A channel with programmable switches is converted to a channel with fixed switches under a chromosome. Both k-segmented and unlimited segmented routing are transformed into a 1-segment routing problem which can be solved in polynomial time. The fitness value of a chromosome is calculated during the process of solving the 1-segment routing. Experiments show that our algorithm can efficiently find a solution.
- 出版日期2013-12-1
- 单位清华大学
