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

Ulises Pineda Rico; Emad Alsusa; Christos Masouros

doi:10.1109/GLOCOM.2008.ECP.677

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

Ulises Pineda Rico, Emad Alsusa, Christos Masouros

Research output: Chapter in Book/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	GLOBECOM - IEEE Global Telecommunications Conference\|GLOBECOM IEEE Global Telecommun. Conf.
Pages	3523-3527
Number of pages	4
DOIs	https://doi.org/10.1109/GLOCOM.2008.ECP.677
Publication status	Published - 2008
Event	2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA Duration: 1 Jul 2008 → …

Conference

Conference	2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
City	New Orleans, LA
Period	1/07/08 → …

Access to Document

10.1109/GLOCOM.2008.ECP.677

Cite this

@inproceedings{234696100c084e47b800a50100ea55d2,

title = "A fast least-squares solution-seeker algorithm for vector-perturbation",

abstract = "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. {\textcopyright} 2008 IEEE.",

author = "Rico, {Ulises Pineda} and Emad Alsusa and Christos Masouros",

year = "2008",

doi = "10.1109/GLOCOM.2008.ECP.677",

language = "English",

isbn = "9781424423248",

pages = "3523--3527",

booktitle = "GLOBECOM - IEEE Global Telecommunications Conference|GLOBECOM IEEE Global Telecommun. Conf.",

note = "2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 ; Conference date: 01-07-2008",

}

TY - GEN

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

AU - Rico, Ulises Pineda

AU - Alsusa, Emad

AU - Masouros, Christos

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1109/GLOCOM.2008.ECP.677

DO - 10.1109/GLOCOM.2008.ECP.677

M3 - Conference contribution

SN - 9781424423248

SP - 3523

EP - 3527

BT - GLOBECOM - IEEE Global Telecommunications Conference|GLOBECOM IEEE Global Telecommun. Conf.

T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008

Y2 - 1 July 2008

ER -

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

Abstract

Conference

Access to Document

Fingerprint

Cite this