FPGA Interconnect Topologies Exploration

This paper presents an improved interconnect network for Tree-based FPGA architecture that unifies two unidirectional programmable networks. New tools are developed to place and route the largest benchmark circuits, where different optimization techniques are used to get an optimized architecture. The effect of variation in LUT and cluster size on the area, performance, and power of the Tree-based architecture is analyzed. Experimental results show that an architecture with LUT size 4 and arity size 4 is the most efficient in terms of area and static power dissipation, whereas the architectures with higher LUT and cluster size are efficient in terms of performance. We also show that unifying a Mesh with this Tree topology leads to an architecture which has good layout scalability and better interconnect efficiency compared to VPR-style Mesh.

[1]  Sinan Kaptanoglu,et al.  Designing efficient input interconnect blocks for LUT clusters using counting and entropy , 2007, FPGA '07.

[2]  André DeHon,et al.  Compact, multilayer layout for butterfly fat-tree , 2000, SPAA '00.

[3]  Guy Lemieux,et al.  Design of interconnection networks for programmable logic , 2003 .

[4]  Carl Ebeling,et al.  PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[5]  Vaughn Betz,et al.  The stratixπ routing and logic architecture , 2003, FPGA '03.

[6]  Vaughn Betz,et al.  The Stratix II logic and routing architecture , 2005, FPGA '05.

[7]  Vaughn Betz,et al.  Architecture and CAD for Deep-Submicron FPGAS , 1999, The Springer International Series in Engineering and Computer Science.

[8]  Anthony J. Yu,et al.  Directional and single-driver wires in FPGA interconnect , 2004, Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921).

[9]  André DeHon,et al.  Balancing interconnect and computation in a reconfigurable computing array (or, why you don't really want 100% LUT utilization) , 1999, FPGA '99.

[10]  Dwight D. Hill,et al.  The benefits of flexibility in lookup table-based FPGAs , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Sinan Kaptanoglu,et al.  A new high density and very low cost reprogrammable FPGA architecture , 1999, FPGA '99.

[12]  André DeHon,et al.  Unifying mesh- and tree-based programmable interconnect , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Mike Hutton,et al.  Placement rent exponent calculation methods, temporal behaviour and FPGA architecture evaluation , 2003, SLIP '03.

[14]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[15]  Jonathan Rose,et al.  Architecture of field-programmable gate arrays: the effect of logic block functionality on area efficiency , 1990 .

[16]  Theerayod Wiangtong,et al.  International Conference on Field Programmable Technology , 2006 .

[17]  Alain Greiner.  ALLIANCE: A complete Set of CAD Tools for teaching VLSI Design , 1992 .

[18]  J. Rose,et al.  The effect of LUT and cluster size on deep-submicron FPGA performance and density , 2000, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.