On Walsh-domain versus RDFT filtering

Author

Ersoy, O.K.

Author_Institution

Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA

Volume

36

Issue

11

fYear

1988

fDate

11/1/1988 12:00:00 AM

Firstpage

1786

Lastpage

1787

Abstract

Spectral filtering and the computation of Fourier coefficients by the fast Walsh transform (FWT) and the fast algorithm for the real discrete Fourier transform (FRFT) are discussed on a comparative basis. In all cases discussed, the FRFT has fewer multiplications and additions. As the comparisons show, there is no good reason for using the Walsh-Fourier method in spectral filtering or for the generation of Fourier coefficients if the number of operations are the major criterion. However, the Walsh-Fourier method may still be useful if both the Walsh and the Fourier coefficients are to be utilized in a particular application

Keywords

Walsh functions; fast Fourier transforms; filtering and prediction theory; Fourier coefficients; Walsh-Fourier method; fast Walsh transform; real discrete Fourier transform; spectral filtering; Convolution; Discrete Fourier transforms; Discrete transforms; Equations; Fast Fourier transforms; Filtering algorithms; Finite impulse response filter; Fourier transforms; Signal processing algorithms; Transfer functions;

fLanguage

English

Journal_Title

Acoustics, Speech and Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

0096-3518

Type

jour

DOI

10.1109/29.9018

Filename

9018