2000 character limit reached
Gabor frames in $\ell^2(\mathbf Z)$ and linear dependence (1710.08280v1)
Published 23 Oct 2017 in math.FA
Abstract: We prove that an overcomplete Gabor frame in $ \ell2(\mathbf Z)$ by a finitely supported sequence is always linearly dependent. This is a particular case of a general result about linear dependence versus independence for Gabor systems in $\ell2(\mathbf Z)$ with modulation parameter $1/M$ and translation parameter $N$ for some $M,N\in \mathbf N,$ and generated by a finite sequence $g$ in $\ell2(\mathbf Z)$ with $K$ nonzero entries.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.