Abstract
A feasible algorithm for implementing the Gabor expansion, the coefficients of which are computed by the discrete Gabor transform (DGT), is presented. For a given synthesis window and sampling pattern, computing the auxiliary biorthogonal function of the DGT is nothing more than solving a linear system. The DGT presented applies for both finite as well as infinite sequences. By exploiting the nonuniqueness of the auxiliary biorthogonal function at oversampling an orthogonal like DGT is obtained. As the discrete Fourier transform (DFT) is a discrete realization of the continuous-time Fourier transform, similarly, the DGT introduced provides a feasible vehicle to implement the useful Gabor expansion.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callDisclaimer: 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.
