A Novel Approach to Fast Discrete Fourier Transform

Author： Liu J.G. Li H.F. Chan F.H.Y. Lam F.K.

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.54, Iss.1, 1998-10, pp. : 48-58

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Discrete Fourier transform (DFT) is an important tool in digital signal processing. In the present paper, we propose a novel approach to performing DFT. We transform DFT into a form expressed in discrete moments via a modular mapping and truncating Taylor series expansion. From this, we extend the use of our systolic array for fast computation of moments without any multiplications to one that computes DFT with only a few multiplications and without any evaluations of exponential functions. The multiplication number used in our method is O(N log₂ N/ log₂ log₂ N) superior to O(N log₂ N) in FFT. The execution time of the systolic array is only O(N log₂ N/ log₂ log₂ N) for 1-D DFT and O(N^k) for k-D DFT (k2). The systolic implementation is a demonstration of the locality of dataflow in the algorithms and hence it implies an easy and potential hardware/VLSI realization. The approach is also applicable to DFT inverses. Copyright 1998 Academic Press.