DocumentCode :
3434131
Title :
Floorplanning in Modern FPGAs
Author :
Banerjee, Pritha ; Sur-Kolay, Susmita ; Bishnu, Arijit
Author_Institution :
Adv. Comput. & Microelectron. Unit, Indian Stat. Inst., Kolkata
fYear :
2007
fDate :
6-10 Jan. 2007
Firstpage :
893
Lastpage :
898
Abstract :
State-of-the-art FPGA architectures have millions of gates in CLBs, Block RAMs, and Multiplier blocks which can host fairly large designs. While their physical design calls for floorplanning, the traditional algorithm for ASIC do not suffice. In this paper, we have proposed an algorithm for unified floorplan topology generation and sizing for recent heterogeneous FPGAs. Experimental results on a set of benchmark circuits show that our three step floorplan generation method can produce feasible solutions very fast with 45% improvement in total half perimeter wirelength compared to the very few previous approaches.
Keywords :
application specific integrated circuits; circuit layout; field programmable gate arrays; network topology; random-access storage; ASIC; CLB; FPGA architectures; benchmark circuits; block RAM; floorplanning; multiplier blocks; unified floorplan topology generation; Algorithm design and analysis; Application specific integrated circuits; Circuit topology; Clustering algorithms; Computer architecture; Computer science; Field programmable gate arrays; Microelectronics; Read-write memory; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI Design, 2007. Held jointly with 6th International Conference on Embedded Systems., 20th International Conference on
Conference_Location :
Bangalore
ISSN :
1063-9667
Print_ISBN :
0-7695-2762-0
Type :
conf
DOI :
10.1109/VLSID.2007.84
Filename :
4092154
Link To Document :
بازگشت