By Topic

Pruning the decimation-in-time FFT algorithm with frequency shift

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

1 Author(s)
K. Nagai ; University of Tsukuba, Ibaraki, Japan

Fourier transformed components within desired narrow-band can be efficiently calculated by the pruned version of the decimation-in-time FFT algorithm. A new pruning method is proposed here which invloves frequency shift. The shifting simplifies the pruning algorithm because its flowgraph has a repetitive pattern of butterflies between adjacent stages.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 4 )