DocumentCode :
3244785
Title :
Grey relational grade applied to FPGA placement with minimal wire length
Author :
Jan-Ou Wu ; San-Fu Wang ; Chien Wei ; Yang-Hsin Fan
Author_Institution :
Dept. of Electron. Eng., De Lin Inst. of Technol., Tu-Cheng, Taiwan
fYear :
2011
fDate :
27-29 May 2011
Firstpage :
405
Lastpage :
409
Abstract :
This work aims at developing grey relational grade for minimal wire length FPGA placement to follow-up the FPGA routing work. The proposed GRAP (Grey Relational Grade Apply to Placement) algorithm was combined with grey relational clustering and CAPRI algorithm to construct a placement netlist to successfully solve minimal wire length in FPGA placement design problem. After the grey relational grade is calculated, GRAP can rank the sequence and analyze the minimal distance in CLB blocks from the grey relational sequence and combine connection-based approaches. Experimental results demonstrate that the proposed algorithm can obtain minimal total wire length.
Keywords :
field programmable gate arrays; grey systems; logic design; network routing; CAPRI algorithm; FPGA placement; FPGA routing; GRAP; grey relational clustering; grey relational grade apply to placement; minimal wire length; placement netlist; Arrays; Design automation; Field programmable gate arrays; CAPRI; CLB; FPGA placement; FPGA routing; GRAP; grey relational clustering; grey relational grade; minimal wire length;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-1-61284-485-5
Type :
conf
DOI :
10.1109/ICCSN.2011.6014923
Filename :
6014923
Link To Document :
بازگشت