Global routing for lookup-table based FPGAs using genetic algorithms



In this paper we present experiments concerning the feasibility of
using genetic algorithms to efficiently build the global routing in lookup-table
based FPGAs. The algorithm is divided in two steps: first, a set of viable
routing alternatives is pre-computed for each net, and then the genetic algorithm
selects the best routing for each one of the nets that offers the best overall
global routing. Our results are comparable to other available global routers, so
we conclude that genetic algorithms can be used to build competitive global
routing tools.


FPGA Routing; Genetic Algorithms


Evolutionary Optimization


13th International Conference on Field Programmable Logic and Applications 2003, September 2003

PDF File

Cited by

No citations found