Ring Compute-and-Forward Over Block-Fading Channels

DOI10.1109/TIT.2019.2927453MaRDI QIDQ5211485zbMATH OpenOpenAlexFDO

Authors Shanxiang Lyu, Antonio Campello, Cong Ling

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Channel models (including quantum) in information and communication theory (94A40)

Abstract: The Compute-and-Forward protocol in quasi-static channels normally employs lattice codes based on the rational integers $mathbbZ$, Gaussian integers $mathbbZleft[iight]$ or Eisenstein integers $mathbbZleft[omegaight]$, while its extension to more general channels often assumes channel state information at transmitters (CSIT). In this paper, we propose a novel scheme for Compute-and-Forward in block-fading channels without CSIT, which is referred to as Ring Compute-and-Forward because the fading coefficients are quantized to the canonical embedding of a ring of algebraic integers. Thanks to the multiplicative closure of the algebraic lattices employed, a relay is able to decode an algebraic-integer linear combination of lattice codewords. We analyze its achievable computation rates and show it outperforms conventional Compute-and-Forward based on $mathbbZ$-lattices. By investigating the effect of Diophantine approximation by algebraic conjugates, we prove that the degrees-of-freedom (DoF) of the optimized computation rate is $n/L$, where $n$ is the number of blocks and $L$ is the number of users.

Cited in

(2)

• An Approximation of Theta Functions with Applications to Communications
• Packet Transmission in a Noisy-Channel Ring Network

This page was built for publication: Ring Compute-and-Forward Over Block-Fading Channels

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