DocumentCode
2111419
Title
FPGA placement methodology based on grey relational clustering
Author
Wu, Jan-Ou ; Fan, Yang-Hsin ; Wang, San-Fu
Author_Institution
Dept. of Electron. Eng., De Lin Inst. of Technol., Taipei, Taiwan
fYear
2012
fDate
21-23 April 2012
Firstpage
1829
Lastpage
1831
Abstract
This paper aims at developing grey relational clustering for FPGA placement. The proposed GRAP (Grey Relational Clustering Apply to Placement) algorithm was combined with grey relational clustering and CAPRI algorithm to successfully solve FPGA placement design problem. Experimental results demonstrate that the GRAP compares the Hilbert, Z and Snake with BB cost function in space filling curve. The GRAP improved BB cost by 0.753%, 0.324% and 0.096% for the Hilbert, Z and Snake, respectively.
Keywords
field programmable gate arrays; BB cost function; CAPRI algorithm; FPGA placement methodology; GRAP algorithm; grey relational clustering; space filling curve; Algorithm design and analysis; Arrays; Benchmark testing; Clustering algorithms; Field programmable gate arrays; Routing; Wires; BB cost; CAPRI; FPGA placemen; GRAP; grey relational clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on
Conference_Location
Yichang
Print_ISBN
978-1-4577-1414-6
Type
conf
DOI
10.1109/CECNet.2012.6201431
Filename
6201431
Link To Document