Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1137/060660680 | SIAM J. Matrix Analysis Applications |
Keywords | Field | DocType |
squares problems,lll reduction,original eils problem,existing method,search algorithm,simulation result,ellipsoid-constrained integer,reduced eils problem,new method,general eils problem,qrz factorization | Least squares,Integer,Linear algebra,Ellipsoid,Mathematical optimization,Search algorithm,Factorization,Search problem,Numerical analysis,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 3 | 0895-4798 |
Citations | PageRank | References |
10 | 0.55 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao-Wen Chang | 1 | 208 | 24.85 |
| Gene H. Golub | 2 | 2558 | 856.07 |