An efficient algorithm for clustered integer least squares problems.

DOI10.1002/NLA.768MaRDI QIDQ4909726zbMATH OpenOpenAlexFDO

Authors Jaehyun Park, Joohwan Chun

Publication date 21 March 2013

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.768

zbMATH Keywords

integer least squareslattice reductionLLL algorithmNP-hardordered successive interference cancellationsphere decoding algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Integer programming (90C10) Quadratic programming (90C20)

Recommendations

• Solving ellipsoid-constrained integer least squares problems
• A comparative study of the LLL algorithm
• An improved LLL algorithm
• scientific article; zbMATH DE number 2065311
• scientific article; zbMATH DE number 3908520

Cites work

• An improved LLL algorithm
• Factoring polynomials with rational coefficients
• Fundamentals of Wireless Communication
• ML Symbol Detection Based on the Shortest Path Algorithm for MIMO Systems
• On the sphere-decoding algorithm I. Expected complexity
• Towards a Generalized Singular Value Decomposition

Cited in

(4)

• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
• A comparative study of the LLL algorithm
• Solving ellipsoid-constrained integer least squares problems
• scientific article; zbMATH DE number 2065311 (Why is no real title available?)

This page was built for publication: An efficient algorithm for clustered integer least squares problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909726)