Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform

Abstract EN

The long-periodic/infinite discrete Gabor transform (DGT) is more effective than the periodic/finite one in many applications.

In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT.

By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT).

The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms.

The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.