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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.