B. M. Zaidel, R. Muller, R. de Miguel, A. L. Moustakas
{"title":"On Spectral Efficiency of Vector Precoding for Gaussian MIMO Broadcast Channels","authors":"B. M. Zaidel, R. Muller, R. de Miguel, A. L. Moustakas","doi":"10.1109/ISSSTA.2008.48","DOIUrl":null,"url":null,"abstract":"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\" (ZF) 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 Et/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.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2008.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
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" (ZF) 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 Et/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.