Downlink precoding is considered for multi-path multi-input single-output channels where the base station uses orthogonal frequency-division multiplexing and low-resolution signaling. A quantized coordinate minimization (QCM) algorithm is proposed and its performance is compared to other precoding algorithms including squared infinity-norm relaxation (SQUID), multi-antenna greedy iterative quantization (MAGIQ), and maximum safety margin precoding. MAGIQ and QCM achieve the highest information rates and QCM has the lowest complexity measured in the number of multiplications. The information rates are computed for pilot-aided channel estimation and a blind detector that performs joint data and channel estimation. Bit error rates for a 5G low-density parity-check code confirm the information-theoretic calculations. Simulations with imperfect channel knowledge at the transmitter show that the performance of QCM and SQUID degrades in a similar fashion as zero-forcing precoding with high resolution quantizers.

A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM) for frequency selective channels. MAGIQ is compared to three existing algorithms in terms of information rates and complexity: quantized linear precoding (QLP), SQUID, and an ADMM-based algorithm. The information rate is measured by using a lower bound for finite modulation sets, and the complexity is measured by the number of multiplications and comparisons. MAGIQ and ADMM achieve similar information rates for Rayleigh flat-fading channels and one-bit quantization per real dimension, and they outperform QLP and SQUID for higher order modulation formats.

No abstract

In the original publication [...]

This paper represents an overview of the main sphere decoders used in MIMO (Multiple Input Multiple Output) spatial multiplexing communication systems. The family of sphere decoders addressed in this paper exhibits fixed throughput, regardless of the radio channel conditions. The algorithms are compared with respect to their complexity and performances when used with a soft Viterbi channel decoder. The paper concludes with the criteria for choosing the best algorithms in a given configuration and for specific modulation scheme.