DocumentCode
2731025
Title
FPGA segmented channel routing using genetic algorithms
Author
Wang, Lipo ; Zhou, Lei ; Liu, Wen
Author_Institution
Coll. of Inf. Eng., Xiangtan Univ., Hunan, China
Volume
3
fYear
2005
fDate
2-5 Sept. 2005
Firstpage
2161
Abstract
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA´s) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.
Keywords
computational complexity; field programmable gate arrays; genetic algorithms; network routing; NP complete problem; field programmable gate arrays; genetic algorithms; gradual neural network; matrix row matching problem; segmented channel routing; Costs; Field programmable gate arrays; Genetic algorithms; Neural networks; Pins; Power capacitors; Programmable logic arrays; Routing; Switches; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN
0-7803-9363-5
Type
conf
DOI
10.1109/CEC.2005.1554962
Filename
1554962
Link To Document