Compute-and-Forward: Finding the best equation
Authors:
- 1 September 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 290, 227-233
Abstract
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.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- A quadratic programming relaxation approach to compute-and-forward network coding design2014
- Simplified compute‐and‐forward and its performance analysisIET Communications, 2013
- An efficient branch-and-bound algorithm for compute-and-forward2012
- Finding short vectors in a lattice of Voronoi's first kind2012
- Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid FittingSIAM Journal on Matrix Analysis and Applications, 2012
- Joint Physical Layer Coding and Network Coding for Bidirectional RelayingIEEE Transactions on Information Theory, 2010
- Linear-Time Nearest Point Algorithms for Coxeter LatticesIEEE Transactions on Information Theory, 2010
- MIMO compute-and-forward2009
- A linear-time nearest point algorithm for the lattice An*2008
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional latticesProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992