Best polarity searching for ternary FPRM logic circuit area based on whole annealing genetic algorithm

In this paper, according to the corresponding different circuit area of ternary Reed-Muller(RM) logic circuit in different polarities, an algorithm of the best polarity searching for the ternary FPRM circuit area is proposed based on the whole annealing genetic algorithm(WAGA). This algorithm makes the polarities be encoded into ternary digit strings, and annealing selection is carried on. Meanwhile, using the parent group to participate in competition for crossover and mutation operation is to realize the best polarity searching for circuit area and to converge to the global optimal solution in a short period of time. The results of testing on MCNC Benchmarks indicate that the algorithm can reduce the circuit area effectively.