DocumentCode :
3397093
Title :
An efficient computer algorithm for the calculation of Walsh transform for completely and incompletely specified multiple-valued input binary functions
Author :
Schafer, Iwan ; Falkowski, Bogdan J. ; Perkowski, Marek A.
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
fYear :
1991
fDate :
14-17 May 1991
Firstpage :
1109
Abstract :
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
Keywords :
Boolean functions; Walsh functions; logic design; mathematics computing; spectral analysis; transforms; Walsh transform; computer algorithm; interactive algorithm; multiple-valued input binary functions; spectral coefficients; spectral representation; Application software; Boolean functions; Circuit synthesis; Circuit testing; Decoding; Electrical fault detection; Input variables; Logic design; Logic functions; Programmable logic arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-0620-1
Type :
conf
DOI :
10.1109/MWSCAS.1991.251939
Filename :
251939
Link To Document :
بازگشت