By Topic

Real-factor FFT algorithms

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)
Cho, K. ; University of California, Los Angeles, CA ; Temes, G.C.

The FFT algorithms are described which, like those described by Rader and Brenner, use pure real (or imaginary) constant factors. Since these factors containcos(2pik/N)(orsin(2pik/N)), these processes are somewhat better conditioned than those of Rader/Brenner, and are comparably efficient.

Published in:

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

Date of Conference:

Apr 1978