The undersampled discrete Gabor transform

Conventional studies on discrete Gabor transforms have generally been confined to the cases of critical sampling and oversampling in which the Gabor families span the whole signal space. In this paper, we investigate undersampled discrete Gabor transforms. For an undersampled Gabor triple (g,a,b), i.e. a/spl middot/b>N, we show that the associated generalized dual Gabor window (GDGW) function is the same as the one associated with the oversampled (g,N/b,N/a), except for the constant factor (ab/N). Computations of undersampled Gabor transforms are made possible. By applying the methods (algorithms) developed in oversampled settings, the undersampled GDGW is determined. Then, we are able to obtain the best approximation of a signal x by linear combinations of vectors in the Gabor family.