Floorplan design for multi-million gate FPGAs
Authors:
- M.D.F. WongMWM.D.F. Wong
- 22 February 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 22 (10923152) , 292-299
Abstract
Modern FPGAs have multi-millions of gates and future generations of FPGA will be even more complex. This means floorplanning tools will soon be extremely important for the physical design of FPGAs. Due to the heterogeneous logic and routing resources on an FPGA, FPGA floorplanning is very different from the traditional floorplanning for ASICs. This work presents the first FPGA floorplanning algorithm targeted for FPGAs with heterogeneous resources (e.g., Xilinx's Spartan3 chips consisting of columns of CLBs, RAM blocks, and multiplier blocks). Our algorithm can generate floor-plans for Xilinx's XC3S5000 architecture (largest of the Spartan3 family) in a few minutes.Keywords
This publication has 7 references indexed in Scilit:
- Multilevel Hypergraph Partitioning: Application In Vlsi Domain2005
- Rectangle-packing-based module placement2002
- A methodology for fast FPGA floorplanning1999
- Flexibility of interconnection structures for field-programmable gate arraysIEEE Journal of Solid-State Circuits, 1991
- Chortle-crf: Fast technology mapping for lookup table-based FPGAs1991
- SOCRATES1986
- Optimal orientations of cells in slicing floorplan designsInformation and Control, 1983