Dale H. Mugler
Abstract
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the Centered DFT to provide an FFT that requires no complex multiplications and which allows a highly parallel implementation.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the Centered DFT to provide an FFT that requires no complex multiplications and which allows a highly parallel implementation.
Key concepts: Fast Fourier transform, Discrete Fourier transform (general), Split-radix FFT algorithm, Prime-factor FFT algorithm, Computer science, Computation, Discrete Hartley transform, Cyclotomic fast Fourier transform