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

Ulises Pineda Rico, Emad Alsusa, Christos Masouros

    Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
    Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference|GLOBECOM IEEE Global Telecommun. Conf.
    Pages3523-3527
    Number of pages4
    DOIs
    Publication statusPublished - 2008
    Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA
    Duration: 1 Jul 2008 → …

    Conference

    Conference2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
    CityNew Orleans, LA
    Period1/07/08 → …

    Fingerprint

    Dive into the research topics of 'A fast least-squares solution-seeker algorithm for vector-perturbation'. Together they form a unique fingerprint.

    Cite this