Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
567156 | Signal Processing | 2008 | 8 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
Liang Tao, Hon Keung Kwan,