In this paper, the discrete Gabor transform (DGT) is briefly reviewed, and then, block time-recursive algorithms for the efficient and fast computation of the DGT coefficients and for the fast reconstruction of the original signal from the coefficients are developed in both the critical sampling case and the oversampling case. Unified parallel lattice structures for the implementation of the algorithms are studied. Computational complexity analysis and comparison have shown that the proposed algorithms provide a more efficient and faster approach as compared to the existing DGT algorithms for the computation of discrete Gabor transforms.
展开▼
