By Topic

A split-radix partial input/output fast Fourier transform 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

1 Author(s)
C. Roche ; CCETT, Cesson-Sevigne, France

A fast discrete Fourier transform (DFT) computing algorithm used in situations where part of the data is zero and only the first transform elements are to be calculated is proposed. The method is based on the pruning of a split-radix decimation-time (DIT) fast Fourier transform (FFT) diagram. It has the advantage of providing gains as a result of pruning computation and the use of a split radix

Published in:

IEEE Transactions on Signal Processing  (Volume:40 ,  Issue: 5 )