Effect of the prefabricated routing track distribution on FPGA area-efficiency

In most commercial field programmable gate arrays (FPGA's) the number of wiring tracks in each channel is the same across the entire chip. A long-standing open question for both FPGA's and channeled gate arrays is whether or not some uneven distribution of routing tracks across the chip would lead to an area benefit. For example, many circuit designers intuitively believe that most congestion occurs near the center of a chip, and hence expect that having wider routing channels near the chip center would be beneficial. In this paper, we determine the relative area-efficiency of several different routing track distributions. We first investigate FPGA's in which horizontal and vertical channels contain different numbers of tracks in order to determine if such a directional bias provides a density advantage. Second, we examine routing track distributions in which the track capacities vary from channel to channel. We compare the area efficiency of these nonuniform routing architectures to that of an FPGA with uniform channel capacities across the entire chip. The main result is that the most area-efficient global routing architecture is one with uniform (or very nearly uniform) channel capacities across the entire chip in both the horizontal and vertical directions. This paper shows why this result, which is contrary to the intuition of many FPGA architects, is true. While a uniform routing architecture is the most area-efficient, several nonuniform and directionally biased architectures are fairly area-efficient provided that appropriate choices are made for the pin positions on the logic blocks and the logic block array aspect ratio.

[1]  Jean-Marc Delosme,et al.  Performance of a new annealing schedule , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[2]  Vaughn Betz,et al.  On Biased and Non-Uniform Global Routing Architectures and CAD Tools for FPGAs , 1996 .

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

[4]  Carl Ebeling,et al.  Placement and routing tools for the Triptych FPGA , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Vaughn Betz,et al.  Directional bias and non-uniformity in FPGA global routing architectures , 1996, Proceedings of International Conference on Computer Aided Design.

[6]  C. Sechen,et al.  New algorithms for the placement and routing of macro cells , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  C. Y. Lee An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[8]  Chih-Liang Eric Cheng,et al.  Risa: Accurate And Efficient Placement Routability Modeling , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[9]  D. Tavana,et al.  Logic block and routing considerations for a new SRAM-based FPGA architecture , 1995, Proceedings of the IEEE 1995 Custom Integrated Circuits Conference.

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Pierre Marchal,et al.  Field-programmable gate arrays , 1999, CACM.

[12]  Michael Feuer Connectivity of Random Logic , 1982, IEEE Transactions on Computers.

[13]  Jonathan Rose,et al.  The Effect of Fixed I/O Pin Positioning on The Routability and Speed of FPGAs , 1995 .

[14]  Chih-Liang Eric Cheng RISA: accurate and efficient placement routability modeling , 1994, ICCAD.

[15]  Satwant Singh,et al.  Second generation ORCA architecture utilizing 0.5 /spl mu/m process enhances the speed and usable gate capacity of FPGAs , 1994, Proceedings Seventh Annual IEEE International ASIC Conference and Exhibit.