By Topic

An improved 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
$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

2 Author(s)
Guoan Bi Mieee ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Yan Qiu Chen

This letter presents a decomposition approach for discrete Fourier transforms of composite sequence lengths. Special techniques are used to achieve in-place computation. Compared to other algorithms, substantial reduction of arithmetic operations can be achieved

Published in:

Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on  (Volume:3 )

Date of Conference:

9-12 Sep 1997