Analysis of FPGA/FPIC switch modules

doi:10.1145/606603.606605

NHUIR > College of Science and Technology > Department of Information Management > Periodical Articles > Item 987654321/25074

Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/25074

Title:	Analysis of FPGA/FPIC switch modules
Authors:	吳光閔;Wu, Guang-Ming;Chang, Yao-Wen;Zhu, Kai;Wong, D. F.;Wong, C. K.
Contributors:	資訊管理學系
Keywords:	Algorithms;Analysis;Design;Experimentation;Measurement;Performance;Computer-Aided Design of VLSI;Layout;FPGA;FPIC
Date:	2003-01
Issue Date:	2017-07-18 15:47:22 (UTC+8)
Abstract:	Switch modules are the most important component of the routing resources in FPGAs/FPICs. Previous works have shown that switch modules with higher routability result in better area performance for practical applications. We consider in this paper an FPGA/FPIC switch-module analysis problem: the inputs consist of a switch-module description and the number of nets required to be routed through the switch module; the question is to determine if there exists a feasible routing for the routing requirements on the switch module. As a fundamental problem for the analysis of switch modules, this problem is applicable to the design and routability evaluation of FPGA/FPIC switch modules and FPGA/FPIC routing. We present a network-flow-based approximation algorithm for this problem. Based on mathematical analyses, we show that this algorithm has provably good performance with the bounds 5 and 5/4 away from the optima for two types of switch modules, respectively. Extensive experiments show that this algorithm is highly accurate and runs very efficiently.
Relation:	ACM Transactions on Design Automation of Electronic Systems (TODAES) vol. 8, no. 1 pp.11-37
Appears in Collections:	[Department of Information Management] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	445	View/Open

Loading...