An Approximation of Theta Functions with Applications to Communications
Amaro Barreal, Mohamed Taoufiq Damir, Ragnar Freij-Hollanti, Camilla, Hollanti

TL;DR
This paper introduces a simple approximation method for theta series of lattices, analyzes its accuracy, and applies it to improve code design and decoding strategies in wireless communication systems.
Contribution
A new approximation of the theta series is derived and analyzed, providing explicit criteria for lattice code design in communication applications.
Findings
The approximation accurately estimates the theta series for various lattices.
The flatness factor influences decoding performance and can be characterized using the approximation.
Explicit code design criteria are established based on the theta series approximation.
Abstract
Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code design in various wireless communication setups. However, the theta series is in general not known in closed form, excluding a small set of very special lattices. In this article, motivated by the practical applications as well as the mathematical problem itself, a simple approximation of the theta series of a lattice is derived. A rigorous analysis of its accuracy is provided. In relation to this, maximum-likelihood decoding in the context of compute-and-forward relaying is studied. Following previous work, it is shown that the related metric can exhibit a flat behavior, which can be characterized by the flatness factor of the decoding function. Contrary to common belief, we note that the decoding metric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
