Abstract
We study sharp frame bounds of Gabor frames for integer redundancy 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 θ3 and θ4.
Sign-in/Register to access full text options 
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.
