An efficient algorithm to compute the complete set of discrete Gabor coefficients

The discrete Gabor (1946) transform algorithm is introduced that provides an efficient method of calculating the complete set of discrete Gabor coefficients of a finite-duration discrete signal from finite summations and to reconstruct the original signal exactly from the computed expansion coefficients. The similarity of the formulas between the discrete Gabor transform and the discrete Fourier transform enables one to employ the FFT algorithms in the computation. The discrete 1-D Gabor transform algorithm can be extended to 2-D as well.<
>