{"title":"On one-bit quantized ZF precoding for the multiuser massive MIMO downlink","authors":"A. K. Saxena, I. Fijalkow, A. L. Swindlehurst","doi":"10.1109/SAM.2016.7569670","DOIUrl":null,"url":null,"abstract":"We study low complexity precoding for a downlink massive MIMO multiuser system assuming a base station that employs one-bit digital-to-analog converters (DACs) in order to mitigate power usage. The use of one-bit DACs is equivalent to constraining the transmit signal to be drawn from a QPSK alphabet. While the precoding problem can be formulated using a standard maximum likelihood (ML) encoder, the implementation cost is prohibitive for massive numbers of antennas, even if a sphere encoding approach is used. Instead, we study the performance of a one-bit quantized zero-forcing precoder, and we show that it asymptotically provides the desired downlink vector with low complexity. Simulations show that the quantized ZF precoder can actually outperform the ML encoder for low to moderate signal-to-noise ratios.","PeriodicalId":159236,"journal":{"name":"2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAM.2016.7569670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44
Abstract
We study low complexity precoding for a downlink massive MIMO multiuser system assuming a base station that employs one-bit digital-to-analog converters (DACs) in order to mitigate power usage. The use of one-bit DACs is equivalent to constraining the transmit signal to be drawn from a QPSK alphabet. While the precoding problem can be formulated using a standard maximum likelihood (ML) encoder, the implementation cost is prohibitive for massive numbers of antennas, even if a sphere encoding approach is used. Instead, we study the performance of a one-bit quantized zero-forcing precoder, and we show that it asymptotically provides the desired downlink vector with low complexity. Simulations show that the quantized ZF precoder can actually outperform the ML encoder for low to moderate signal-to-noise ratios.