Minimisation of Reed-Muller polynomials with fixed polarity
- 1 January 1984
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques
- Vol. 131 (5) , 177-186
- https://doi.org/10.1049/ip-e.1984.0035
Abstract
An efficient algorithm for minimisation of Reed-Muller polynomials with fixed polarities is presented. The common terms of multiple-output polynomials are considered by applying a number of logical operations on their coefficients. The minimisation of the polynomials over extension Galois fields GF(2M) is considered. The average number of field multiplications for mapping a set of coefficients is reduced to less than Ṁ·2M−2.Keywords
This publication has 0 references indexed in Scilit: