Generalized Walsh transforms of Boolean functions

Author

Falkowski, Bogdan J.

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore

Volume

1

fYear

1992

fDate

10-13 May 1992

Firstpage

137

Lastpage

140

Abstract

A theoretical formulation of the generalized Walsh transform targeting different gate implementations is presented. The formulation is based on a uniform representation of completely and incompletely specified Boolean functions by a set of orthogonal and generalized Walsh spectral coefficients. The computer implementation drastically reduces required computation time by making it possible to calculate only chosen coefficients in specified polarity. The entire spectrum, if required, can be computed incrementally for groups of coefficients

Keywords

Boolean functions; Walsh functions; transforms; Boolean functions; calculate only chosen coefficients; computation time reduction; computer implementation; gate implementations; generalized Walsh spectral coefficients; generalized Walsh transform; specified polarity; theoretical formulation; Arithmetic; Boolean functions; Circuit synthesis; Circuit testing; Field programmable gate arrays; Logic arrays; Logic design; Logic testing; Multiplexing; Programmable logic arrays;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on

Conference_Location

San Diego, CA

Print_ISBN

0-7803-0593-0

Type

conf

DOI

10.1109/ISCAS.1992.229995

Filename

229995