Matching-based algorithm for FPGA channel segmentation design
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
791 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
784 | en_US |
dc.citation.volume |
20 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Chang, YW | en_US |
dc.contributor.author |
Lin, JM | en_US |
dc.contributor.author |
Wong, MDF | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:43:48Z | |
dc.date.available |
2014-12-08T15:43:48Z | |
dc.date.issued |
2001-06-01 | en_US |
dc.description.abstract |
Process technology advances have made multimillion gate field programmable gate arrays (FPGAs) a reality. A key issue that needs to be solved in order for the large-scale FPGAs to realize their full potential lies in the design of their segmentation architectures. Channel segmentation designs have been studied to some degree in much of the Literature; the previous methods are based on experimental studies, stochastic models, or analytical analysis, In this paper, we address a new direction for studying segmentation architectures. Our method is based on graph-theoretic formulation. We first formulate a problem of finding the optimal segmentation architecture for two input routing instances and present a polynomial-time optimal algorithm to solve the problem. Based on the solution to the problem, we develop an effective and efficient multilevel matching-based algorithm for general channel segmentation designs. Experimental results show that our method significantly outperforms the previous work. For example, our method achieves average improvements of 18.2% and 8.9% in routability in comparison with other work. | en_US |
dc.identifier.doi |
10.1109/43.924831 | en_US |
dc.identifier.issn |
0278-0070 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/43.924831 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29611 | |
dc.identifier.wosnumber |
WOS:000168866600008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
detailed routing | en_US |
dc.subject |
interconnect | en_US |
dc.subject |
layout | en_US |
dc.subject |
physical design | en_US |
dc.subject |
routing | en_US |
dc.title |
Matching-based algorithm for FPGA channel segmentation design | en_US |
dc.type |
Article | en_US |
檔案
- 000168866600008.pdf (295.1 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chang, Y., Lin, J., & Wong, M. (2001). Matching-based algorithm for FPGA channel segmentation design. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 20(6), 784–791. https://doi.org/10.1109/43.924831
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29611