Timing-driven routing for symmetrical array-based FPGAs
檔案
- 000167918100009.pdf (148.9 KB, Adobe PDF)
日期
2000-07-01
類型
系所
期刊名稱
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS
卷期與頁次
第 5 卷第 3 期,頁 433–450
ISSN
1084-4309
語言
英文
摘要
In this paper we present a timing-driven router for symmetrical array-based FPGAs. The routing resources in the FPGAs consist of segments of various lengths. Researchers have shown that the number of segments, instead of wirelength, used by a net is the most critical factor in controlling routing delay in an FPGA. Thus, the traditional measure of routing delay on the basis of geometric distance of a signal is not accurate. To consider wirelength and delay simultaneously, we study a model of timing-driven routing trees, arising from the special properties of FPGA routing architectures. Based on the solutions to the routing-tree problem, we present a routing algorithm that is able to utilize various routing segments with global considerations to meet timing constraints. Experimental results show that our approach is very effective in reducing timing violations.
所屬典藏
期刊論文引用此條目
Chang, Y., Zhu, K., & Wong, D. (2000). Timing-driven routing for symmetrical array-based FPGAs. ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 5(3), 433–450. https://ir.lib.nycu.edu.tw/handle/11536/30399
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30399