Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing
This work addresses hardware efficiency in wireless communications for massive MIMO systems, but it is incremental as it builds on existing convex-relaxation methods with a new analytical framework.
The paper tackles the challenge of designing one-bit precoding for massive MIMO systems by analyzing a convex-relaxation-then-quantization approach, deriving a closed-form expression for symbol error probability (SEP) in the large-system limit and showing that an ℓ∞² regularizer achieves optimal SEP performance.
Massive multiple-input multiple-output (MIMO) systems employing one-bit digital-to-analog converters offer a hardware-efficient solution for wireless communications. However, the one-bit constraint poses significant challenges for precoding design, as it transforms the problem into a discrete and nonconvex optimization task. In this paper, we investigate a widely adopted ``convex-relaxation-then-quantization" approach for nonlinear symbol-level one-bit precoding. Specifically, we first solve a convex relaxation of the discrete minimum mean square error precoding problem, and then quantize the solution to satisfy the one-bit constraint. Focusing on a real-valued system with an independently and identically distributed (i.i.d.) Gaussian channel, we develop a novel analytical framework based on approximate message passing (AMP) to characterize the high-dimensional asymptotic performance of the considered scheme. The key technical ingredient is an auxiliary AMP iteration that dedicatedly incorporates the nonlinear quantization function into the state evolution analysis. With the proposed framework, we derive a closed-form expression for the symbol error probability (SEP) at the receiver side in the large-system limit, which provides a quantitative characterization of how model and system parameters affect the SEP performance. Our empirical results suggest that the $\ell_\infty^2$ regularizer, when paired with an optimally chosen regularization parameter, achieves optimal SEP performance within a broad class of convex regularization functions. As a first step towards a theoretical justification, we prove the optimality of the $\ell_\infty^2$ regularizer within the mixed $\ell_\infty^2$-$\ell_2^2$ regularization functions.