Compute-and-forward protocol design based on improved sphere decoding

We consider the compute-and-forward protocol design problem with the objective being maximizing the computation rate at a single relay, and propose an efficient method that finds the optimal solution based on sphere decoding. The problem can be transformed into a shortest vector problem (SVP), which can be solved in two steps. First, by fully exploiting the specific structure of the associated Gram matrix using the hyperbolic transformation, the Cholesky factor can be computed with only n2/2 + O(n) flops. Then, taking into account of some useful properties of the optimal solution, we modify the Schnorr-Euchner search algorithm to solve the SVP. Numerical results show that our proposed branch-and-bound method is much more efficient than the existing one that gives the optimal solution. Besides, compared with the suboptimal methods, our method offers the best performance at a cost lower than that of the LLL based method and similar to that of the quadratic programming relaxation method.

[1]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[2]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[3]  Shafi Goldwasser,et al.  Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.

[4]  Soung Chang Liew,et al.  Physical-layer network coding: Tutorial, survey, and beyond , 2011, Phys. Commun..

[5]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[6]  Wai Ho Mow,et al.  A quadratic programming relaxation approach to compute-and-forward network coding design , 2014, 2014 IEEE International Symposium on Information Theory.

[7]  Gerald Matz,et al.  Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[8]  Qing Han,et al.  Solving Box-Constrained Integer Least Squares Problems , 2008, IEEE Transactions on Wireless Communications.

[9]  Wen Chen,et al.  Compute-and-Forward Network Coding Design over Multi-Source Multi-Relay Channels , 2012, IEEE Transactions on Wireless Communications.

[10]  Xiao-Wen Chang,et al.  Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding , 2012, IEEE Transactions on Information Theory.

[11]  Wai Ho Mow,et al.  Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications , 2013, IEEE Transactions on Communications.

[12]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[13]  Richard P. Brent,et al.  A Note on Downdating the Cholesky Factorization , 1987 .

[14]  Wai Ho Mow,et al.  Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection , 2009, IEEE Transactions on Signal Processing.

[15]  X. Chang,et al.  MLAMBDA: a modified LAMBDA method for integer least-squares estimation , 2005 .

[16]  Yi Hong,et al.  On the ergodic rate for compute-and-forward , 2012, 2012 International Symposium on Network Coding (NetCod).

[17]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[18]  Brigitte Vallée,et al.  An Upper Bound on the Average Number of Iterations of the LLL Algorithm , 1994, Theor. Comput. Sci..

[19]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[20]  R. Zamir.  Lattices are everywhere , 2009, 2009 Information Theory and Applications Workshop.

[21]  Eduard A. Jorswieck,et al.  An efficient branch-and-bound algorithm for compute-and-forward , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).