An Approximation of Theta Functions with Applications to Communications

DOI10.1137/19M1275334MaRDI QIDQ3388006zbMATH OpenOpenAlexFDO

Authors Amaro Barreal, Mohamed Taoufiq Damir, Ragnar Freij-Hollanti, Camilla Hollanti

Publication date 8 January 2021

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.05596

zbMATH Keywords

arbitrary latticescompute-and-forward protocolflatness factorgeometry of latticeslattice codestheta series approximationwireless communicationswiretap channels

Mathematics Subject Classification ID

Theta series; Weil representation; theta correspondences (11F27) Lattices and convex bodies (number-theoretic aspects) (11H06) Relations with coding theory (11H71) Lattice points in specified regions (11P21)

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 can be rewritten as a sum over a random lattice only when at most two sources are considered. Using a particular matrix decomposition, a link between the random lattice and the code lattice employed at the transmitter is established, which leads to an explicit criterion for code design, in contrast to implicit criteria derived previously. Finally, candidate lattices are examined with respect to the proposed criterion using the derived theta series approximation.

Recommendations

• Approximating tau-functions by theta-functions
• Analytic Expressions and Bounds for Special Functions and Applications in Communication Theory
• A theta function identity and applications
• A theta function identity and its applications
• scientific article; zbMATH DE number 3902818
• scientific article; zbMATH DE number 3219736
• scientific article; zbMATH DE number 1263745
• scientific article; zbMATH DE number 515895
• scientific article; zbMATH DE number 1424154

Cites work

• A mean value theorem in geometry of numbers
• A Metrical Theorem In Geometry of Numbers
• An Algebraic Approach to Physical-Layer Network Coding
• Bounds on generalized Frobenius numbers
• Compute-and-Forward: Harnessing Interference Through Structured Codes
• scientific article; zbMATH DE number 5149025 (Why is no real title available?)
• scientific article; zbMATH DE number 5149747 (Why is no real title available?)
• scientific article; zbMATH DE number 3335234 (Why is no real title available?)
• Lattice point problems and values of quadratic forms
• Lipschitz class, narrow class, and counting lattice points
• Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward
• Ring Compute-and-Forward Over Block-Fading Channels
• Semantically Secure Lattice Codes for Compound MIMO Channels
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(4)

• scientific article; zbMATH DE number 515895 (Why is no real title available?)
• On non-Gaussian potentials having triangular lattice as minimizer at any fixed density
• Dense generic well-rounded lattices
• Maximization of derivative of theta functions and hexagonal to square phase transitions

This page was built for publication: An Approximation of Theta Functions with Applications to Communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3388006)