2000 character limit reached
Optimal Gabor frame bounds for separable lattices and estimates for Jacobi theta functions (1601.02972v3)
Published 12 Jan 2016 in math.FA
Abstract: We study sharp frame bounds of Gabor frames with the standard Gaussian window and prove that the square lattice optimizes both the lower and the upper frame bound among all rectangular lattices. This proves a conjecture of Floch, Alard & Berrou (as reformulated by Strohmer & Beaver). The proof is based on refined log-convexity/concavity estimates for the Jacobi theta functions $\theta_3$ and $\theta_4$.
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.