Using a genetic algorithm for optimizing fixed polarity Reed-Muller expansions of boolean functions
- 1 April 1994
- journal article
- research article
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 76 (4) , 601-609
- https://doi.org/10.1080/00207219408925956
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.Keywords
This publication has 8 references indexed in Scilit:
- Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Highly efficient exhaustive search algorithm for optimizing canonical Reed-Muller expansions of boolean functionsInternational Journal of Electronics, 1994
- Optimization of Reed-Muller logic functionsInternational Journal of Electronics, 1993
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1992
- Tabular techniques for Reed—Muller logicInternational Journal of Electronics, 1991
- Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functionsInternational Journal of Electronics, 1990
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- On Minimal Modulo 2 Sums of Products for Switching FunctionsIEEE Transactions on Electronic Computers, 1967