Efficient computer method for ExOR logic design

Application of exclusive-OR logic design suffers from a lack of straightforward design methods. Recently a procedure using generalised Reed-Muller (GRM) coefficient maps has been proposed. Based on this approach, an efficient computer method is developed for the generation of all 2n sets of GRM coefficients of an n-variable Boolean function. Along with the coefficients a metric may be calculated from which the minimum cost set according to some criterion may be selected. The method requires a storage of 2n bits and an average of 2n-1 + n/2 ExOR single-bit operations per set of GRM coefficients.