Logic block clustering of large designs for channel-width constrained FPGAs

In this paper we present a system level technique for mapping large, multiple-IP-block designs to channel-width constrained FPGAs. Most FPGA clustering tools (Betz, 1999, Bozorgzadeh, 2004 and Singh, 2002) aim to reduce the amount of intercluster connections, hence reducing channel width needs. However, if this exceeds the FPGA's channel width (a hard constraint), then the circuit still cannot be routed. Previous work by Singh (2002) and Tessier (2000) depopulates logic clusters (CLBs) to reduce channel width. By depopulating non-uniformly, i.e. depopulate more in hard-to-route regions, we show a graceful trade-off between channel width and CLB count. This makes it possible to target specific channel-width constraints during clustering with minimal CLB inflation. Results show channel width decreases of up to 20% with a 5% increase in area. Further decreases of nearly 50% are possible at 3.3 times the original area. Despite the area increase, this technique creates routable solutions from otherwise unroutable circuits.

[1]  Jason Cong,et al.  An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1992, ICCAD.

[2]  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.

[3]  Michael Chan,et al.  CycloneTM: A Low-Cost, High-Performance FPGA , 2005 .

[4]  Jan Van Campenhout,et al.  Synthetic Benchmark Circuits for Timing-driven Physical Design Applications. , 2002 .

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

[6]  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.

[7]  Michael Chan,et al.  Cyclone /spl trade/: a low-cost, high-performance FPGA , 2003, Proceedings of the IEEE 2003 Custom Integrated Circuits Conference, 2003..

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

[9]  Malgorzata Marek-Sadowska,et al.  Efficient circuit clustering for area and power reduction in FPGAs , 2002, FPGA '02.

[10]  Majid Sarrafzadeh,et al.  Routability-Driven Packing: Metrics And Algorithms For Cluster-Based FPGAs , 2004, J. Circuits Syst. Comput..

[11]  Jonathan Rose,et al.  Synthetic circuit generation using clustering and iteration , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Jonathan Rose,et al.  Automatic generation of synthetic sequential benchmark circuits , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Russell Tessier,et al.  Balancing Logic Utilization and Area Efficiency in FPGAs , 2000, FPL.

[14]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..