{"title":"Finite Gabor systems and uncertainty principle for block sliding discrete fourier transform","authors":"K. Poumai, N. Khanna, S. K. Kaushik","doi":"10.2298/fil2308361p","DOIUrl":null,"url":null,"abstract":"In this paper, we study the finite Gabor system for oversampling schemes. A characterization of dual finite Gabor tight frame using discrete time Zak transform is given. Also, a method to calculate the coefficients of the finite Gabor system expansion in the case of oversampling and a necessary and sufficient condition for the existence of biorthogonal pair of Riesz basis in l2(ZL) is given. Further, we introduce the notion of block sliding discrete Fourier transform (BSDFT) which reduces the computational complexity and give uncertainty principle for BSDFT. An uncertainty principle for two finite Parseval Gabor frames in terms of sparse representations is given. Finally, using the notion of numerical sparsity, an uncertainty principle for finite Gabor frames is given.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2298/fil2308361p","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we study the finite Gabor system for oversampling schemes. A characterization of dual finite Gabor tight frame using discrete time Zak transform is given. Also, a method to calculate the coefficients of the finite Gabor system expansion in the case of oversampling and a necessary and sufficient condition for the existence of biorthogonal pair of Riesz basis in l2(ZL) is given. Further, we introduce the notion of block sliding discrete Fourier transform (BSDFT) which reduces the computational complexity and give uncertainty principle for BSDFT. An uncertainty principle for two finite Parseval Gabor frames in terms of sparse representations is given. Finally, using the notion of numerical sparsity, an uncertainty principle for finite Gabor frames is given.