FPGA architecture optimisation using geometric programming

Authors:
Alastair M. Smith;George A. Constantinides;Peter Y. K. Cheung
Affiliations:
Circuits and Systems Research Group, Department of Electrical and Electronic Engineering, Imperial College, London, UK;Circuits and Systems Research Group, Department of Electrical and Electronic Engineering, Imperial College, London, UK;Circuits and Systems Research Group, Department of Electrical and Electronic Engineering, Imperial College, London, UK
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2010

Citing 13
Cited 0

Architecture and CAD for Deep-Submicron FPGAs

Architecture and CAD for Deep-Submicron FPGAs
The stratixπ routing and logic architecture

FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
VPR: A new packing, placement and routing tool for FPGA research

FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
Digital Circuit Optimization via Geometric Programming

Operations Research
Connectivity of Random Logic

IEEE Transactions on Computers
On a Pin Versus Block Relationship For Partitions of Logic Graphs

IEEE Transactions on Computers
Modeling routing demand for early-stage FPGA architecture development

Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays
Area and delay trade-offs in the circuit and architecture design of FPGAs

Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays
VPR 5.0: FPGA cad and architecture exploration tools with single-driver routing, heterogeneity and process scaling

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Wirelength modeling for homogeneous and heterogeneous FPGA architectural development

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
The effect of LUT and cluster size on deep-submicron FPGA performance and density

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2002 international symposium on low-power electronics and design (ISLPED)
Wire sizing as a convex optimization problem: exploring the area-delay tradeoff

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Performance Benefits of Monolithically Stacked 3-D FPGA

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper is concerned with the application of geometric programming to the design of homogeneous field programmable gate array (FPGA) architectures. The paper builds on an increasing body of work concerned with modeling reconfigurable architectures, and presents a full area and delay model of an FPGA. We use a geometric programming framework to show how transistor sizing and high-level architecture parameter selection can now be solved as a concurrent optimization problem. We validate the model through the use of simulation program with integrated circuit emphasis (SPICE) models and the versatile place and route (VPR) FPGA architecture simulation tool. Not only does the optimization framework allow architectures to be optimized orders of magnitude faster than previous work, but the combined optimization can lead to different architectural conclusions compared to conventional methods by exploring the coupling between the two sets of optimization variables. Specifically, we show that as delay takes more significance in the objective of the optimization, there should be more lookup tables in a logic block, whereas conventional techniques suggest that there should be fewer lookup tables in an FPGA logic block.