Analysis of vector precoding at high SNR: Rate bounds and ergodic results

Maitane Barrenechea, Michael Joham, Mikel Mendicute, Wolfgang Utschick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


Besides the optimal but impractically complex dirty paper coding (DPC), linear precoding and vector precoding (VP) have been proposed for the vector broadcast channel (BC). Linear precoding is simple, as only a linear transform is applied to the data signals, whereas VP necessitates a closest-point search in a lattice to find the perturbation signal which reduces the necessary transmit power. In this paper, we analyze the high signal-to-noiseratio (SNR) performance of VP assuming optimal decoding. As the perturbation process hinders the analytical assessment of the VP performance, lower and upper bounds on the expected data rate of VP systems are reviewed and proposed. Based on these bounds, VP is compared to linear precoding w.r.t. the weighted sum rate, the power resulting from a quality of service (QoS) formulation, and the performance when balancing the rates.

Original languageEnglish
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781424456383
StatePublished - 2010
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: 6 Dec 201010 Dec 2010

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Conference53rd IEEE Global Communications Conference, GLOBECOM 2010
Country/TerritoryUnited States
CityMiami, FL


Dive into the research topics of 'Analysis of vector precoding at high SNR: Rate bounds and ergodic results'. Together they form a unique fingerprint.

Cite this