On one-bit quantized ZF precoding for the multiuser massive MIMO downlink
- 19 September 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Capacity Analysis of One-Bit Quantized MIMO Systems With Transmitter Channel State InformationIEEE Transactions on Signal Processing, 2015
- One-bit massive MIMO: Channel estimation and high-order modulations2015
- Channel estimation in millimeter wave MIMO systems with one-bit quantization2014
- Performance analysis for downlink massive MIMO system with ZF precodingTransactions on Emerging Telecommunications Technologies, 2013
- Massive MIMO in the UL/DL of Cellular Networks: How Many Antennas Do We Need?IEEE Journal on Selected Areas in Communications, 2013
- Comparison of linear precoding schemes for downlink massive MIMO2012
- Transmit processing with low resolution D/A-converters2009
- More about discrete random variables2006
- An efficient generalized sphere decoder for rank-deficient MIMO systemsIEEE Communications Letters, 2005
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985