By Topic

Procedures for computing the discrete Fourier transform on staggered blocks

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

3 Author(s)
G. Bongiovanni ; Università di Pisa, Pisa Italy. ; P. Corsini ; G. Frosini

In this work the problem of evaluating successively the discrete Fourier transform (DFT) on ordered sets of N elements staggered of M is considered. Three procedures for solving such a problem are given, of which two are recursive and one nonrecursive. The complexity of each procedure, in number of complex multiplications, is about (N/2) \log _{2} 4M .

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:24 ,  Issue: 2 )