By Topic

Discrete Fourier transforms, linear filters, and spectrum weighting

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
$31 $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

1 Author(s)
Bruce, J. ; Massachusetts Institute of Technology, Cambridge, Mass.

Computational procedures which have been developed in the past few years have taken the familiar frequency-domain techniques from the realm of theory and placed them in the realm of practice. In order to realize fully the potential of th techniques, it is necessary to gain insight into the physical significance of the discrete Fourier transform. Here, the discrete Fourier transform is viewed as a set of discrete linear filters--one filter for each Fourier coefficient. Each filter is seen to have zero poles and (N-1) zeros. (N is the number of data points transformed.) The characteristics of these filters are discussed. Spectrum weighting, for the purpose of sidelobe reduction, is also shown to be equivalent to discrete linear filtering. The filters in this case are similar to those which represent the discrete Fourier transform.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:16 ,  Issue: 4 )