Solving Ellipsoid-Constrained Integer Least Squares Problems

A new method is proposed to solve an ellipsoid-constrained integer least squares (EILS) problem arising in communications. In this method, the LLL reduction, which is cast as a QRZ factorization of a matrix, is used to transform the original EILS problem to a reduced EILS problem, and then a search algorithm is proposed to solve the reduced EILS problem. Simulation results indicate the new method can be much more computationally efficient than the existing method. The method is extended to solve a more general EILS problem.

[1]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

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

[3]  Reinaldo A. Valenzuela,et al.  Simplified processing for high spectral efficiency wireless communication employing multi-element arrays , 1999, IEEE J. Sel. Areas Commun..

[4]  Stephen P. Boyd,et al.  Integer parameter estimation in linear models with applications to GPS , 1998, IEEE Trans. Signal Process..

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

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

[7]  Giuseppe Caire,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[8]  Ravi Kannan,et al.  Improved algorithms for integer programming and related lattice problems , 1983, STOC.

[9]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[10]  Peter Teunissen,et al.  GPS Carrier Phase Ambiguity Fixing Concepts , 1998 .

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

[12]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[13]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[14]  Xiao-Wen Chang,et al.  Euclidean distances and least squares problems for a given set of vectors , 2007 .

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

[16]  Loïc Brunel,et al.  Lattice decoding for joint detection in direct-sequence CDMA systems , 2003, IEEE Trans. Inf. Theory.

[17]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[18]  Loïc Brunel,et al.  Soft-input soft-output lattice sphere decoder for linear channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[19]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[20]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.