Compute-and-Forward: A Novel Strategy for Cooperative Networks

In recent work, we have shown that in a Gaussian network, nodes can often recover linear combinations of transmitted codewords much more efficiently than the codewords themselves. These nodes, after decoding their linear equations, simply send them towards the destination, which given enough equations, can recover the desired messages. This compute-and-forward strategy relies on a lattice-based coding framework. In this note, we show that by employing appropriately nested lattice codes, nodes can reliably recover linear combinations of the messages symbols themselves. This considerably simplifies the description of our scheme. We also consider superposition and successive cancellation within the compute-and-forward framework.


Published in:
2008 42Nd Asilomar Conference On Signals, Systems And Computers, Vols 1-4, 69-73
Presented at:
42nd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, Oct 26-29, 2008
Year:
2008
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-2940-0
Laboratories:




 Record created 2011-10-17, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)