Novel Parallel Architectures for Short-Time Fourier Transform

where w(n) is an analysis window. At each time instant, the STFT is a discrete-time Fourier transform or discrete Fourier transform (DFT). Many DFT computing algorithms and architectures have been proposed. However, the direct use of the DFI' without considering the special sliding window effect of STFT is not an efficient approach. There are two major approaches for STFT. One is based on the filter bank approach and another is the FFT-based approach [l]. The filter bank approach can be described by the following two convolution sum equations,