Evolutionary computation in the design of logic circuits

This paper presents two evolutionary schemes and a swarm intelligence algorithm for the design of combinational logic circuits. A Genetic and a Memetic schemes as the evolutionary algorithms. The Particle Swarm Optimization as the swarm algorithm. The fitness function used in these three algorithms is sequential, that is, divided in two parts. The first part of the fitness function ƒ
1
evaluates the circuit functionality, while the second part ƒ2 deals with the circuit complexity. The experiments consist in applying the algorithms in the design of two arithmetic circuits: the one-bit full adder and the one-bit full subtractor. We also present a scalability analysis using the parity checker family of circuits.