An Algebraic Approach to Physical-Layer Network Coding
arXiv:1005.2646 · doi:10.1109/TIT.2013.2274264
Abstract
The problem of designing new physical-layer network coding (PNC) schemes via lattice partitions is considered. Building on a recent work by Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, we take an algebraic approach to show its potential in non-asymptotic settings. We first relate Nazer-Gastpar's approach to the fundamental theorem of finitely generated modules over a principle ideal domain. Based on this connection, we generalize their code construction and simplify their encoding and decoding methods. This not only provides a transparent understanding of their approach, but more importantly, it opens up the opportunity to design efficient and practical PNC schemes. Finally, we apply our framework for PNC to a Gaussian relay network and demonstrate its advantage over conventional PNC schemes.
arXiv comment5 pages, 3 figures, accepted to IEEE Int. Symp. Information Theory, 2010
References in corpus (5)
- Wireless Network Information Flow: A Deterministic Approach
- Physical Layer Network Coding
- On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener
- Integer-Forcing Linear Receivers
- Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems
Cited by in corpus (50)
- A Modulo-Based Architecture for Analog-to-Digital Conversion
- Improving Sum-Rate of Cell-Free Massive MIMO with Expanded Compute-and-Forward
- Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations
- On the Subtleties of q-PAM Linear Physical-Layer Network Coding
- Construction of Capacity-Achieving Lattice Codes: Polar Lattices
- On Integer-Forcing Precoding for the Gaussian MIMO Broadcast Channel
- Compute-Compress-and-Forward: Exploiting Asymmetry of Wireless Relay Networks
- Communication over Finite-Chain-Ring Matrix Channels
- A Joint Typicality Approach to Algebraic Network Information Theory
- Integer-Forcing Linear Receiver Design with Slowest Descent Method
- Efficient Integer Coefficient Search for Compute-and-Forward
- Compute-and-Forward: Harnessing Interference through Structured Codes
- Low-complexity Voronoi shaping for the Gaussian channel
- Phase Precoding for the Compute-and-Forward Protocol
- Adaptive Compute-and-Forward with Lattice Codes Over Algebraic Integers
- Low-Rank Parity-Check Codes over Galois Rings
- Phase Precoded Compute-and-Forward with Partial Feedback
- Computation Alignment: Capacity Approximation without Noise Accumulation
- Pseudo-Lattice Treatment for Subspace Aligned Interference Signals
- Secure Modulo Sum via Multiple Access Channel
- Multilevel Coding Schemes for Compute-and-Forward
- On the Degrees-of-Freedom of the Large-Scale Interfering Two-Way Relay Network
- A Multilevel Framework for Lattice Network Coding
- A Novel Cooperative Strategy for Wireless Multihop Backhaul Networks
- Lattices from Codes for Harnessing Interference: An Overview and Generalizations
- Lattice Reduction over Imaginary Quadratic Fields
- Contention Resolution for Coded Radio Networks
- Low-Complexity Integer-Forcing Methods for Block Fading MIMO Multiple-Access Channels
- On Codes over Eisenstein Integers
- Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems
- Compute-and-Forward in Cell-Free Massive MIMO: Great Performance with Low Backhaul Load
- Complex Linear Physical-Layer Network Coding
- Simplified Compute-and-Forward and Its Performance Analysis
- Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying
- Opportunistic Cooperation Strategies for Multiple Access Relay Channels with Compute-and-Forward
- Compute--Forward Multiple Access (CFMA): Practical Code Design
- An algebraic framework for end-to-end physical-layer network coding
- Ring Compute-and-Forward over Block-Fading Channels
- A Physical Layer Network Coding Design for 5G Network MIMO
- Wireless Network Coding in Network MIMO: A New Design for 5G and Beyond
- Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices
- Generalized Compute-Compress-and-Forward
- An Efficient Optimal Algorithm for the Successive Minima Problem
- Nested Lattice Codes for Vector Perturbation Systems
- Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks
- Efficient Decoding Algorithms for the Compute-and-Forward Strategy
- Full Diversity Unitary Precoded Integer-Forcing
- Asynchronous Physical-Layer Network Coding with Quasi-Cyclic Codes
- On Multiplicative Matrix Channels over Finite Chain Rings
- Lattice Coding for Downlink Multiuser Transmission