The Centered Discrete Fourier Transform and a parallel implementation of the FFT

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.