EFFICIENT MOVING-WINDOW DFT ALGORITHMS

This brief deals with the real-valued, moving-window discrete Fourier transform. After reviewing the basic recursive versions appearing in t he literature. additional recursive equations are presented. Then, the se equations are combined so that nonrecursive expressions involving o nly consecutive discrete Fourier transform (DFT) sine components are o btained for both the DFT cosine component and squared harmonic amplitu de. The computational complexity of this new-scheme is finally studied and compared to that of existing methods, showing that, in most pract ical situations, a reduction in the operation count is achieved.