Effect of the prefabricated routing track distribution on FPGA area-efficiency
- 1 September 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 6 (3) , 445-456
- https://doi.org/10.1109/92.711315
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Performance of a new annealing schedulePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Directional bias and non-uniformity in FPGA global routing architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Second generation ORCA architecture utilizing 0.5 μm process enhances the speed and usable gate capacity of FPGAsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New algorithms for the placement and routing of macro cellsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Logic block and routing considerations for a new SRAM-based FPGA architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Placement and routing tools for the Triptych FPGAIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1995
- FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Field-Programmable Gate ArraysPublished by Springer Nature ,1992
- Optimization by Simulated AnnealingScience, 1983
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961