# Is information lost due to Hanning window perturbations?

I apologize for the obscure phrasing of the title of the post...My question is quite simple...

Let us imagine an audio signal (any song will do). We want to apply the Short Time Fourier Transform algorithm, so we break our signal into frames and view each frame through a window. For the sake of the example let us assume the window is a Hanning window.

Many algorithms have a parameter to specify the sample at which to center the Hanning curve in a given frame. Now, let us assume that the dominant signal in that frame happens to fall near one of the the tails of the Hanning window for that frame. The window will then squash the importance of the sample and boost some samples which were not that prominent in the original signal. In essense, we have lost some possibly valuable information.

Would I then be correct in assuming that not only is the number of frames of importance in FT, but also the samples at which the window functions are centered?

For common implementations of the discrete STFT, we do not calculate the FFT of each possible shift of the window (i.e. every sample), but instead we have a bigger step size (of a few samples in time domain). This sampled STFT (because we evaluate the STFT(t,f) only at t=k*T, where T is the spacing between the windows) is actually a discrete Gabor Transform (of a 1D signal, most references online refer to Gabor Transform of images). In superficial terms, the Gabor transform is invertible as long as the sampling of the STFT is not too coarse. A necessary condition for invertablity (in continuous time) is that $TF\leq 1$, where $T$ is the sampling distance in time and $F$ is the sampling distance in frequency (since in continuous-time, we have infinite frequency resolution). The invertability becomes the easier, the smaller $TF$, i.e. the finer the sampling of the STFT is done.