Generalised k-variable-mixed-polarity Reed-Muller expansions forsystem of Boolean functions and their minimisation

摘要

A lookup table based method to minimise generalisednpartially-mixed-polarity Reed-Muller (GPMPRM) expansions with k mixednpolarity variables is presented. The developed algorithm can producensolutions based on the desired cost criteria for the systems ofncompletely specified functions. A heuristic approach based on thenexclusion rule is adopted to extract the best dual polarity variablesnfrom any fixed polarity Reed-Muller (FPRM) expansion. The obtainednexperimental results compared favourably with the recently publishednresults and outperform those generated by the exact minimal FPRMnexpansion minimisers