A new principle for fast Fourier transformation

1976/06/01 by Charles M. Rader, Norman Brenner · 5 citations
Computer Science · #Digital Filter Design and Implementation #Numerical Methods and Algorithms #Image and Signal Denoising Methods

paper · doi:10.1109/tassp.1976.1162805

openalex publication_date 1976/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01

Abstract

An alternative form of the fast Fourier transform (FFT) is developed. The new algorithm has the peculiarity that none of the multiplying constants required are complex-most are pure imaginary. The advantages of the new form would, therefore, seem to be most pronounced in systems for which multiplication are most costly.

Cited by

• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• On the number of multiplications necessary to compute a length-2<sup>n</sup>DFT
• Einstein@Home search for periodic gravitational waves in LIGO S4 data
• Fast Fourier transform [wikipedia]