202137
20181114202521.0
978-1-4799-8009-3
doi
10.1109/ALLERTON.2014.7028460
CONF
Compute-and-Forward: Finding the Best Equation
2014
2014
Conference Papers
Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed to find the optimal solution.
Compute-and-Forward
Shortest Lattice Vector Problem
Wireless Communication
248001
Sahraei, Saeid
199698
241387
Gastpar, Michael
122796
52nd Annual Allerton Conference on Communication, Control, and Computing
Champaign, Illinois, USA
October 1-3, 2014
n/a
164210
n/a
http://infoscience.epfl.ch/record/202137/files/root.pdf
saeid.sahraei@epfl.ch
LINX
252408
U12434
oai:infoscience.tind.io:202137
IC
conf
GLOBAL_SET
199698
EPFL-CONF-202137
EPFL
REVIEWED
CONF