Using a genetic algorithm for optimizing fixed polarity Reed-Muller expansions of boolean functions

Millert, Julian F.; Luchian, Henri; Bradbeeru, Peter V. G.; Barclay, Peter J.

Abstract

The use of a genetic algorithm is presented which determines good sub-optimum fixed polarity Reed-Muller expansions of completely specified boolean functions. The algorithm performs better than previous techniques which find a good fixed polarity by non-exhaustive search.

Citation

Millert, J. F., Luchian, H., Bradbeeru, P. V. G., & Barclay, P. J. (1994). Using a genetic algorithm for optimizing fixed polarity Reed-Muller expansions of boolean functions. International Journal of Electronics, 76(4), 601-609. https://doi.org/10.1080/00207219408925956

• Journal Article Type: Article
• Acceptance Date: Dec 6, 1993
• Publication Date: 1994-04
• Deposit Date: Apr 22, 2022
• Journal: International Journal of Electronics
• Print ISSN: 0020-7217
• Electronic ISSN: 1362-3060
• Publisher: Taylor & Francis
• Peer Reviewed: Peer Reviewed
• Volume: 76
• Issue: 4
• Pages: 601-609
• DOI: https://doi.org/10.1080/00207219408925956
• Public URL: http://researchrepository.napier.ac.uk/Output/2866038