By Topic

Another discrete Fourier transform computation with small multiplications via the Walsh transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. Tadokoro ; Toyohashi University of Technology, Toyohashi, Japan ; T. Higuchi

This paper describes another computational algorithm for the discrete Fourier transform(DFT) via the discrete Walsh transform(DWT). The number of multiplications required by this algorithm is approximately NL/9 where N is the number of data points and L is the number of Fourier coefficients desired. This number shows a 33 % decrease against NL/6 in the previous algorithm published by us. The proposed algorithm can be derived by using conventional sampling points in the DFT. The DFT computation via the DWT is superior to the fast Fourier transform(FFT) approach in applications where L is relatively small compared with N and where the Walsh and Fourier coefficients are both desired.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '81.  (Volume:6 )

Date of Conference:

Apr 1981