A fast algorithm for calculating the dual Gabor window with integer oversampling
Nagesh K. Subbanna, Yonina C. Eldar
Abstract
Nagesh K. Subbanna, Yonina C. Eldar
Abstract
In this paper, we consider Gabor expansion of signals that are oversampled in the time-frequency domain by an integer factor. We demonstrate that using a combination of non minimum norm dual windows and discrete Fourier transforms (DFT), we can obtain the Gabor expansion very efficiently. The conventional method used to solve this problem is compared with our method and the advantages of our method are explicitly shown. 1.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we consider Gabor expansion of signals that are oversampled in the time-frequency domain by an integer factor. We demonstrate that using a combination of non minimum norm dual windows and discrete Fourier transforms (DFT), we can obtain the Gabor expansion very efficiently. The conventional method used to solve this problem is compared with our method and the advantages of our method are explicitly shown. 1.
Key concepts: Oversampling, Integer (computer science), Window (computing), Computer science, Algorithm, Dual (grammatical number), Telecommunications, Bandwidth (computing)