Title :
Discrete and continuous particle swarm optimization for FPGA placement
Author :
El-Abd, Mohammed ; Hassan, Hassan ; Kamel, Mohamed S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON
Abstract :
This paper proposes the use of a particle swarm optimization algorithm to the Field Programmable Gate Arrays (FPGA) placement problem. Two different versions of the particle swarm optimization algorithm are proposed. The first is a discrete version that solves the FPGA placement problem entirely in the discrete domain, while the second version is continuous in nature. Both versions are applied to several well- known FPGA benchmarks and the results are compared to those obtained by an academic placement tool that is based on adaptive simulated annealing. Results show that the proposed methods are competitive for small and medium-sized problems. For large-sized problems, the proposed methods provide very close results.
Keywords :
circuit optimisation; field programmable gate arrays; particle swarm optimisation; simulated annealing; FPGA placement problem; continuous particle swarm optimization; discrete optimization; field programmable gate arrays; Algorithm design and analysis; Application specific integrated circuits; Field programmable gate arrays; Integrated circuit interconnections; Logic design; Logic programming; Particle swarm optimization; Programmable logic arrays; Programmable logic devices; Wire;
Conference_Titel :
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location :
Trondheim
Print_ISBN :
978-1-4244-2958-5
Electronic_ISBN :
978-1-4244-2959-2
DOI :
10.1109/CEC.2009.4983014
