Al Jassani, B.A., Urquhart, N. and Almaini, A.E.A. (2010) Minimization of incompletely specified mixed polarity reed muller functions using Genetic Algorithm. In: Proceedings of 2009 3rd International Conference on Signals, Circuits and Systems (SCS). 2009 3rd International Conference on Signals, Circuits and Systems (SCS), 06-08 Nov 2009, Djerba, Tunisia. . Institute of Electrical and Electronics Engineers (IEEE). ISBN: 978-1-4244-4397-0.
Abstract
A New and efficient genetic algorithm (GA) based approach is presented to minimise the number of terms of mixed polarity Reed Muller (MPRM) single and multi output incompletely specified Boolean functions. The algorithm determines the allocation of don't care terms for the given function resulting in optimal MPRM expansions. For an n-variable function with ß unspecified minterms there are (3n × 2ß) distinct MPRM expansions. A minimum MPRM is one with the fewest products. The algorithm is implemented in C++ and fully tested using standard benchmark examples. For the benchmark examples tested, the number of terms is reduced, on average, by 49% if ¿don't care¿ terms are included.
Metadata
| Item Type: | Proceedings Paper |
|---|---|
| Authors/Creators: |
|
| Keywords: | Mixed Polarity Reed Muller, Incompletely specified Boolean functions, Genetic Algorithm |
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mechanical Engineering (Leeds) |
| Date Deposited: | 20 Apr 2026 11:05 |
| Last Modified: | 20 Apr 2026 11:05 |
| Status: | Published |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Identification Number: | 10.1109/icscs.2009.5412318 |
| Related URLs: | |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:239818 |
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)