On the Complexity of Mod-2l Sum PLA's
IEEE Transactions on Computers
Boolean Matrix Transforms for the Minimization of Modulo-2 Canonical Expansions
IEEE Transactions on Computers
Field-programmable gate arrays
Field-programmable gate arrays
An arithmetic model of computation equivalent to threshold circuits
Theoretical Computer Science
Generalized Transforms for Multiple Valued Circuits and Their Fault Detection
IEEE Transactions on Computers
Spectral Techniques and Fault Detection
Spectral Techniques and Fault Detection
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
An efficient technique for synthesis and optimization of polynomials in GF(2m)
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
IEEE Transactions on Computers
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Oversampled multi-phase time-domain bit-error rate processing for transmitter testing
Analog Integrated Circuits and Signal Processing
| Hi-index | 14.99 |
This paper considers the Reed-Muller transform for incompletely specified multiple-valued logic functions, which is obtained as the finite field polynomial representation. A new algorithm for dealing with single-variable functions is presented. It is applicable to finite fields of small sizes (two to four), which is of interest because only these fields are readily implementable with today驴s MVL technology. It is shown how such or any similar single-variable algorithm can be used to obtain a fast n-variable Reed-Muller transform. Based on this transform, a heuristic scheme is derived for dealing with incompletely specified functions. It has better computational properties than other methods and achieves the best results when applied to functions with a large number of unspecified points.