FPGA Implementation of Parallel Particle Swarm Optimization Algorithm and Compared with Genetic Algorithm

  • AMEUR B
  • Anis S
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

—In this paper, a digital implementation of Particle Swarm Optimization algorithm (PSO) is developed for implementation on Field Programmable Gate Array (FPGA). PSO is a recent intelligent heuristic search method in which the mechanism of algorithm is inspired by the swarming of biological populations. PSO is similar to the Genetic Algorithm (GA). In fact, both of them use a combination of deterministic and probabilistic rules. The experimental results of this algorithm are effective to evaluate the performance of the PSO compared to GA and other PSO algorithm. New digital solutions are available to generate a hardware implementation of PSO Algorithms. Thus, we developed a hardware architecture based on Finite state machine (FSM) and implemented into FPGA to solve some dispatch computing problems over other circuits based on swarm intelligence. Moreover, the inherent parallelism of these new hardware solutions with a large computational capacity makes the running time negligible regardless the complexity of the processing.

Cite

CITATION STYLE

APA

AMEUR, B., & Anis, S. (2016). FPGA Implementation of Parallel Particle Swarm Optimization Algorithm and Compared with Genetic Algorithm. International Journal of Advanced Computer Science and Applications, 7(8). https://doi.org/10.14569/ijacsa.2016.070809

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free