Citation: |
Ruan Aiwu, Li Wenchang, Xiang Chuanyin, Song Jiangmin, Kang Shi, Liao Yongbo. Graph theory for FPGA minimum configurations[J]. Journal of Semiconductors, 2011, 32(11): 115018. doi: 10.1088/1674-4926/32/11/115018
****
Ruan A W, Li W C, Xiang C Y, Song J M, Kang S, Liao Y B. Graph theory for FPGA minimum configurations[J]. J. Semicond., 2011, 32(11): 115018. doi: 10.1088/1674-4926/32/11/115018.
|
-
Abstract
A traditional bottom-up modeling method for minimum configuration numbers is adopted for the study of FPGA minimum configurations. This method is limited if a large number of LUTs and multiplexers are presented. Since graph theory has been extensively applied to circuit analysis and test, this paper focuses on the modeling FPGA configurations. In our study, an internal logic block and interconnections of an FPGA are considered as a vertex and an edge connecting two vertices in the graph, respectively. A top-down modeling method is proposed in the paper to achieve minimum configuration numbers for CLB and IOB. Based on the proposed modeling approach and exhaustive analysis, the minimum configuration numbers for CLB and IOB are five and three, respectively.-
Keywords:
- graph theory,
- minimum configuration number,
- FPGA,
- CLB,
- IOB
-
References
[1] [2] [3] [4] [5] [6] [7] [8] [9] -
Proportional views