Design and analysis of FPGA/FPIC switch modules

Switch modules are the most important component of the routing resources in FPGAs and FPICs. The quality of switch modules greatly affects FPGA/FPIC routing solutions. The switch-module design problem was studied by K. Zhu et al. (1993). In order to analyze the routability of designed switch modules, a heuristic algorithm based on network-flow techniques was proposed. In this paper, we mathematically show that the network-flow based algorithm has provably good performance with the bounds 5 and 5/4 away from the optima for two types of switch modules, respectively. Based on the analyses, we developed a new method for designing switch modules. Experimental results show that our designed switch modules significantly improve routability, compared with those by K. Zhu et al. Extensive experiments also show that the network-flow based algorithm is highly accurate and runs very efficiently.

[1]  R. Guo,et al.  A 1024 Pin Universal Interconnect Array With Routing Architecture , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[2]  William S. Carter,et al.  Third-generation architecture boosts speed and density of field-programmable gate arrays , 1990, IEEE Proceedings of the Custom Integrated Circuits Conference.

[3]  Stephen D. Brown,et al.  Flexibility of interconnection structures for field-programmable gate arrays , 1991 .

[4]  Sinan Kaptanoglu,et al.  Segmented channel routing , 1991, DAC '90.

[5]  Yao-Wen Chang,et al.  A new global routing algorithm for FPGAs , 1994, ICCAD '94.

[6]  A. El Gamal,et al.  An architecture for electrically configurable gate arrays , 1989 .

[7]  Martin D. F. Wong,et al.  Algorithms for FPGA Switch Module Routability Analysis , 1994 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Yao-Wen Chang,et al.  Switch module design with application to two-dimensional segmentation design , 1993, ICCAD.

[10]  Chak-Kuen Wong,et al.  Universal switch modules for FPGA design , 1996, TODE.

[11]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[12]  Chak-Kuen Wong,et al.  Routing for symmetric FPGAs and FPICs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Yao-Wen Chang,et al.  Algorithms for an FPGA switch module routing problem with application to global routing , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Dwight D. Hill,et al.  Routable technology mapping for LUT FPGAs , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[15]  Martin D. F. Wong,et al.  On channel segmentation design for row-based FPGAs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[16]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[17]  Steven Trimberger,et al.  Placement-based partitioning for lookup-table-based FPGAs , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.