An Efficient Field Programmable Gate Arrays Placement by Particle Swarm Optimization

The Field Programmable Gate Arrays (FPGAs) are becoming increasingly important platforms for digital circuits. The optimum placement problem in FPGAs is crucial to achieve. This paper uses the particle swarm optimization (PSO) for solving the placement problem and adjusts its parameters for driving an optimal solution which is comparable with similar solutions. The proposed method results have been compared with Simulated annealing (SA) algorithm and previous PSO solution. The results of applying this algorithm on two digital circuits, a 4 bit ALU and a BCD counter, show the feasibility and efficiency of the proposed algorithm

Keywords:

Particle Swarm Optimization , FPGA , Placement , Simulated Annealing.