An efficient computer algorithm for the calculation of Walsh transform for completely and incompletely specified multiple-valued input binary functions
I. Schafer, B.J. Falkowski, Marek A. Perkowski · 2002
An efficient computer implementation of an originally developed spectral representation of multiple-valued input binary functions is presented. In such a representation, the spectrum for each multiple-valued input binary function is composed of a vector of Walsh transforms, each of which is defined for one pair of input variables of the function. By this approach, the number of spectral coefficients describing a given multiple-valued input binary function is the minimal one. The implementation of the algorithm allows for the calculation of the spectra of binary functions having an arbitrary number of literals, each of which can have up to 32 different logical values. The algorithm is interactive so users can, as needed, determine the generation of a partial or whole spectrum.>