DocumentCode :
2610579
Title :
An algorithm for the calculation of generalized Walsh transform of Boolean functions
Author :
Falkowski, B.J.
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ.
fYear :
1993
fDate :
3-6 May 1993
Firstpage :
1694
Abstract :
An efficient computer method for the calculation of the generalized Walsh transform of Boolean functions is shown. The method uses reduced representation of Boolean functions in the form of disjoint cubes, and avoids exponentially long minterm expressions which allows the calculation of the spectra of large Boolean functions. The algorithm can be parallelized or implemented in hardware
Keywords :
Boolean functions; Walsh functions; logic design; minimisation of switching nets; parallel algorithms; Boolean functions; disjoint cubes; exponentially; generalized Walsh transform; long minterm expressions; parallel algorithm; reduced representation; Arithmetic; Boolean functions; Circuit synthesis; Circuit testing; Field programmable gate arrays; Hardware; Logic arrays; Logic design; Logic testing; Multiplexing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
Type :
conf
DOI :
10.1109/ISCAS.1993.394068
Filename :
394068
Link To Document :
بازگشت