doi: 10.4304/jsw.8.11.2770-2774
Optimisation of Mixed Polarity Reed-Muller Functions
- State Key Lab of ASIC and System, Fudan University, Shanghai, China
Abstract
This paper presents a genetic algorithm (GA)search method in order to obtain better circuitimplementation of the mixed polarity Reed-Muller functions.By combining global searching ability of genetic algorithmand local searching ability of simulated annealing, theproposed GA method could achieve fast convergence. Itdiffers to traditional genetic algorithm, in which theproposed GA forms an intermediate population by using 2/3population from previous generation and 2/3 populationfrom current generation at the annealing stage. Annealing isthen applied to the intermediate population to generate anew population. In the next generation selection, crossoverand mutation operations are used for the newly generatedpopulation. The calculation of cost function of proposedalgorithm is based on parallel tabular technique toovercome the disadvantage of the traditional tabulartechnique. The results of the tested benchmark indicatedthat this algorithm is highly effective for searching the bestpolarity and it could achieve 29% area reduction and 3.68Xspeedup.
Keywords
- Logic synthesis
- Reed-Muller
- mixed pola
How to Cite
Meng Yang and Jinmei Lai, "Optimisation of Mixed Polarity Reed-Muller Functions," Journal of Software, vol. 8, no. 11, pp. 2770-2774, 2013. https://doi.org/ 10.4304/jsw.8.11.2770-2774
Copyright & License
Copyright © 2013 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
