Ant Colony Optimization approach for Solving FPGA routing with minimum Channel Width


In this paper ANT colony optimization algorithm has been proposed to solve FPGA routing in FPGA design architecture with minimum umbers of tracks per channel. In our method geometric FPGA routing task is transformed into a Boolean satisfiability (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a… (More)


2 Figures and Tables

Slides referencing similar topics