Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Reed-Muller Like Canonic Forms for Multivalued Functions
IEEE Transactions on Computers
A Theory of Galois Switching Functions
IEEE Transactions on Computers
Synthesis of Finite State Algorithms in a Galois Field GF[pn]
IEEE Transactions on Computers
Comment on "A Transform for Logic Networks"
IEEE Transactions on Computers
On the Fundamental Structure of Galois Switching Functions
IEEE Transactions on Computers
Galois Switching Functions and Their Applications
IEEE Transactions on Computers
| Hi-index | 15.00 |
The transform presented in this paper applies to functions which describe logic network behavior. Given a function G defined over a finite domain, it is shown that G(u) = Et F(t)ut for each element u in the domain, where finite-field arithmetic is assumed. Here, function F is the transform of G, and it is shown that F(t) = Eu G(u)(-u)-t for each integer t in a finite set. Both form and development of this transform pair resembles the Fourier transform in harmonic analysis.