A fast least-squares solution-seeker algorithm for vector-perturbation

Finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real or complex numbers is a problem equivalent to finding the closest lattice-point to a given point and is well known that the search is hard. However, in communications applications the given vector is not arbitrary but rather is an unknown lattice-point that has been perturbed by an additive offset vector whose statistical properties are known, making it relatively easier to decode. In this paper we will discuss the vector- perturbation technique proposed for solving this problem and analyse a possible solution for overcome the complexity issues. © 2008 IEEE.

Complex number; Complexity issues; Lattice points; Least squares solutions; Matrix coefficients; Possible solutions; Seeker algorithms; Statistical properties; System of linear equations; Computational fluid dynamics; Perturbation techniques; Vectors

VIVO