PRFFT: A fast algorithm of sliding-window DFT with parallel structure

The Sliding Window discrete Fourier transform is a very important and widely used time-frequency representation of a signal. To speed up the calculation, fast algorithm of sliding-window discrete Fourier transform has been proposed and N complex multiplications per sample has been reported where rectangular window is adopted. However, in those algorithms, the results from a preceding step are required to effectively carry on with the next step, which leads to the difficulty of designing parallel computing algorithm. In this paper, we assumed that all the data are present at the outset, and then we proposed Parallel Really Fast Fourier Transform, a fast sliding-window discrete Fourier transform algorithm with parallel structure, which is easy to design a paralleling computing implementation.