AN EFFICIENT COMPUTER ALGORITHM FOR THE CALCULATION OF THE WALSH TRANSFORM FOR INCOMPLETELY SPECIFIED MULTIPLE-VALUED BINARY FUNCTIONS

An efficient computer implementation of an originally developed spectr al representation of multiple-valued input binary functions is present ed. In such a representation, the spectrum for each multiple-valued in put binary function is composed of a vector of Walsh transforms, each of them defined for one pair of input variables of the function. By th at approach, the number of spectral coefficients describing a given mu ltiple-valued input binary function is a minimal one. The implementati on of the algorithm allows for the calculation of the spectra of binar y functions having an arbitrary number of literals; each of them can h ave up to 32 different logical values. The algorithm is interactive so users can manually determine the generation of a partial or whole spe ctrum.