Compute-and-Forward: Harnessing Interference through Structured Codes
Preprint
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.Keywords
All Related Versions
This publication has 41 references indexed in Scilit:
- Physical-layer network coding: Tutorial, survey, and beyondPhysical Communication, 2013
- Multilevel coding schemes for compute-and-forward2011
- Local Interference Can Accelerate Gossip AlgorithmsIEEE Journal of Selected Topics in Signal Processing, 2011
- Capacity of a class of multi-source relay networks2009
- The case for structured random codes in network capacity theoremsEuropean Transactions on Telecommunications, 2008
- A cautionary perspective on cross-layer designIEEE Wireless Communications, 2005
- Network information flowIEEE Transactions on Information Theory, 2000
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- On lattice quantization noiseIEEE Transactions on Information Theory, 1996
- On coding without restrictions for the AWGN channelIEEE Transactions on Information Theory, 1994