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. © 2005 IEEE.
Cite
CITATION STYLE
Wang, L., Zhou, L., & Liu, W. (2005). FPGA segmented channel routing using genetic algorithms. In 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings (Vol. 3, pp. 2161–2165). https://doi.org/10.1109/cec.2005.1554962
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
