FPGA segmented channel routing using genetic algorithms

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.

• Type: Conference
• Year: 2005
• Where: CEC
• Authors: Lipo Wang, Lei Zhou, Wen Liu
• Keywords: Artificial Intelligence, CEC 2005, Channel Routing, Channel Routing Problem, Segmented Channel