An efficient algorithm for clustered integer least squares problems

DOI10.1002/nla.768zbMath1274.65113OpenAlexW1983050303MaRDI QIDQ4909726

Jae Hyun 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

NP-hardLLL algorithmlattice reductioninteger least squaressphere decoding algorithmordered successive interference cancellation

Mathematics Subject Classification ID

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

Cites Work

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

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