DocumentCode
1340183
Title
Compute-and-Forward: Harnessing Interference Through Structured Codes
Author
Nazer, Bobak ; Gastpar, Michael
Author_Institution
Dept. of Electr. & Comput. Eng., Boston Univ., Boston, MA, USA
Volume
57
Issue
10
fYear
2011
Firstpage
6463
Lastpage
6486
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
decoding; linear codes; radio networks; radiofrequency interference; wireless channels; algebraic structure; compute-and-forward communication; encoder map messages; linear function decoding; radiofrequency interference; transmitter lack channel state information; wireless channel; AWGN; Encoding; Equations; Lattices; Mathematical model; Relays; Transmitters; Additive white Gaussian noise (AWGN) networks; cooperative communication; interference; nested lattice codes; relaying; reliable computation; structured codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2011.2165816
Filename
6034734
Link To Document