By Topic

A modified discrete fourier transform algorithm: A delta rotation algorithm

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)
Junho Choi ; Naval Coastal Systems Center, Panama City, FL ; J. Johnson

A new method for the evaluation of the Discrete Fourier Transform (DFT) is presented. This method evaluates the DFT of samples of a continuous time signal by multiplying the DFT of the difference signal at the output of a Linear Delta Modulator (LDM) by a rotation factor. The novelty of the proposed algorithm is to reduce the number of multiplication and to simplify the hardware implementation. Further modification of this algorithm does not require any multiplication at all during the DFT computation. An implementation of convolutions, chirp-z transform and the discrete Hilbert transform with the proposed technique will offer good opportunities for additional research with respect to the point of a simple hardware implementation, high-speed, and a computational simplicity. This proposed technique is, in fact, the combination of an encoding technique and a FFT algorithm. The results show a very promising and will be a viable alternative to the FFT and any other DFT algorithms.

Published in:

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

Date of Conference:

Mar 1984