Compute-and-Forward: Harnessing Interference Through Structured Codes

DOI10.1109/TIT.2011.2165816MaRDI QIDQ5272276zbMATH OpenOpenAlexFDO

Authors Bobak Nazer, Michael C. Gastpar

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Abstract: Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise. After decoding these linear equations, the relays simply send them towards the destinations, which given enough equations, can recover their desired messages. The underlying codes are based on nested lattices whose algebraic structure ensures that integer combinations of codewords can be decoded reliably. Encoders map messages from a finite field to a lattice and decoders recover equations of lattice points which are then mapped back to equations over the finite field. This scheme is applicable even if the transmitters lack channel state information.

Cited in

(12)

• Some ``good properties of LDA lattices
• Over-the-Air computation for distributed machine learning and consensus in large wireless networks
• Low-rank parity-check codes over Galois rings
• Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds
• Multilevel lattices for compute-and-forward and lattice network coding
• Nested linear/lattice codes revisited
• An Approximation of Theta Functions with Applications to Communications
• Trellis precoding: combined coding, precoding and shaping for intersymbol interference channels
• Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
• Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay
• Unsourced random access
• Low-rank parity-check codes over finite commutative rings

This page was built for publication: Compute-and-Forward: Harnessing Interference Through Structured Codes

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