TY - GEN
T1 - On spectral efficiency of vector precoding for Gaussian MIMO broadcast channels
AU - Zaidel, Benjamin M.
AU - Müller, Ralf R.
AU - De Miguel, Rodrigo
AU - Moustakas, Aris L.
PY - 2008
Y1 - 2008
N2 - The spectral efficiency of practically oriented vector precoding schemes for the Gaussian multiple-input multiple-output (MIMO) broadcast channel is analyzed in the large system limit. Considering discrete complex input alphabets, the transmitter is assumed to comprise a linear front-end combined with nonlinear precoding, that minimizes the transmit energy penalty imposed by the linear front-end. The energy penalty is minimized by relaxing the input alphabet to a larger alphabet set prior to precoding. The so-called "replica method" of statistical physics is employed to derive the limiting empirical distribution of the precoder's output, as well as the limiting energy penalty. Particularizing to a "zero-forcing" (ZFJ linear front-end, and non- cooperative users, a decoupling result is derived according to which the channel observed by each of the individual receivers can be characterized by the Markov chain u-x-y, where u is the channel input, x is the equivalent precoder output, and y is the channel output. A comparative spectral efficiency analysis of two illustrative examples reveals significant performance gains compared to linear ZF precoding in the medium to high E b/No region. In particular, we demonstrate that convex extended alphabets, amenable to efficient energy minimization algorithms, provide an attractive alternative to alphabets based on the discrete Gaussian integer lattice, for which the energy minimization problem is NP-hard.
AB - The spectral efficiency of practically oriented vector precoding schemes for the Gaussian multiple-input multiple-output (MIMO) broadcast channel is analyzed in the large system limit. Considering discrete complex input alphabets, the transmitter is assumed to comprise a linear front-end combined with nonlinear precoding, that minimizes the transmit energy penalty imposed by the linear front-end. The energy penalty is minimized by relaxing the input alphabet to a larger alphabet set prior to precoding. The so-called "replica method" of statistical physics is employed to derive the limiting empirical distribution of the precoder's output, as well as the limiting energy penalty. Particularizing to a "zero-forcing" (ZFJ linear front-end, and non- cooperative users, a decoupling result is derived according to which the channel observed by each of the individual receivers can be characterized by the Markov chain u-x-y, where u is the channel input, x is the equivalent precoder output, and y is the channel output. A comparative spectral efficiency analysis of two illustrative examples reveals significant performance gains compared to linear ZF precoding in the medium to high E b/No region. In particular, we demonstrate that convex extended alphabets, amenable to efficient energy minimization algorithms, provide an attractive alternative to alphabets based on the discrete Gaussian integer lattice, for which the energy minimization problem is NP-hard.
UR - http://www.scopus.com/inward/record.url?scp=57849124146&partnerID=8YFLogxK
U2 - 10.1109/isssta.2008.48
DO - 10.1109/isssta.2008.48
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:57849124146
SN - 9781424422043
T3 - IEEE International Symposium on Spread Spectrum Techniques and Applications
SP - 232
EP - 236
BT - 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications - Proceedings, ISSSTA2008
T2 - 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008
Y2 - 25 August 2008 through 28 August 2008
ER -