Evolving digital circuits using hybrid particle swarm optimization and differential evolution.
This paper presents the evolution of combinational logic circuits by a new hybrid algorithm known as the Differential Evolution Particle Swarm Optimization (DEPSO), formulated from the concepts of a modified particle swarm and differential evolution. The particle swarm in the hybrid algorithm is represented by a discrete 3-integer approach. A hybrid multi-objective fitness function is coined to achieve two goals for the evolution of circuits. The first goal is to evolve combinational logic circuits with 100% functionality, called the feasible circuits. The second goal is to minimize the number of logic gates needed to realize the feasible circuits. In addition, the paper presents modifications to enhance performance and robustness of particle swarm and evolutionary techniques for discrete optimization problems. Comparison of the performance of the hybrid algorithm to the conventional Karnaugh map and evolvable hardware techniques such as genetic algorithm, modified particle swarm, and differential evolution are presented on a number of case studies. Results show that feasible circuits are always achieved by the DEPSO algorithm unlike with other algorithms and the percentage of best solutions (minimal logic gates) is higher.
Moore
Phillip W
PW
Real-Time Power and Intelligent Systems Laboratory, Department of Electrical and Computer Engineering, University of Missouri-Rolla, 1870 Miner Circle, Rolla, Missouri 65409, USA. pwmpn2@umr.edu
Venayagamoorthy
Ganesh K
GK
D000465:Algorithms; D000818:Animals; D006801:Humans; D008433:Mathematics; D008954:Models, Biological; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated