Efficient systolic implementation of DFT using only the first-order moments

Abstract

The Discrete Fourier transform (DFT) is an important tool in digital signal processing. In this paper, a novel approach to DFT is proposed. The computation of DFT is transformed to the computation of the first-order moments by the simple mathematical deductions. It is well known that the first-order moments can be computed efficiently using only additions. An efficient systolic array is designed to implement DFT. The comparison with the existing methods shows the advantages of our method. The approach is also applicable to DFT inverses.