A Detailed Router for Field-Programmable Gate
msra(1992)
摘要
This paper describes a new kind of detailed routing algorithm that has been designed specifically for field-program- mable gate arrays (FPGA's). The algorithm is unique in that it approaches this problem in a general way, allowing it to be used over a wide range of different FPGA routing architee- tures. The detailed routing of FPGA's is a new problem and can be more difficult than classic detailed routing because the wiring segments that are available for routing are Preplaced and can only be ~onnected together in specified patterns. In some FPGA's, the routing architecture places exacting limita- tions on the routing choices for any connection, and in such cases there will routing channels in the FPGA where overlap- ping routing alternatives of two or more connections create
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络