Signal Processing
Discrete Gabor transforms with complexity O(NlogN)
Signal Processing
IEICE - Transactions on Information and Systems
IEEE Transactions on Signal Processing
Oversampled Gabor representation for transient signals
IEEE Transactions on Signal Processing
An efficient algorithm to compute the complete set of discrete Gabor coefficients
IEEE Transactions on Image Processing
Novel DCT-based real-valued discrete Gabor transform and its fast algorithms
IEEE Transactions on Signal Processing
Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform
IEEE Transactions on Image Processing
Hi-index | 0.08 |
The traditional discrete Gabor transform (DGT) is briefly reviewed in this paper. 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 then developed in both the critical sampling case and the over-sampling case. Unified parallel lattice structures for the implementation of the algorithms are studied. Computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster approach as compared to the existing DGT algorithms for the computation of DGTs.