Abstract

In this paper, genetic algorithm (GA) using parallel tabular technique is presented for the optimization of mixed polarity Reed Muller and mixed polarity dual Reed Muller functions. The algorithm is to find optimal solution among 3 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> different solutions for large functions. To overcome the disadvantage of the traditional tabular technique, the cost function of GA is based on parallel tabular technique, in which new terms are generated at one time instead of generating in sequence. Without generating all the polarities, the proposed algorithm is efficient in terms of CPU time and achieves 8% improvement in average.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call