Recursive realization of the robust STFT

An efficient procedure is proposed for the realization of robust short-time fourier transform (STFT) based on the recursive realization of the standard STFT. In the initial stage it uses the robust STFT calculated by iterative or sorting procedures and, after that, the recursive relation is applied. Basic difference from the standard STFT realization is in limiting samples in the next instants, since they can be corrupted by an impulse noise. It results in a numerically efficient form of the STFT, keeping robustness to the impulse noise influence.