16:00
Random Matrix Theory in Wireless Communications: Asymptotic Analysis of One-Bit Precoding
Abstract
Wireless communication systems with many antennas and users naturally give rise to large random channel matrices. In one-bit precoding, the transmitted signal is restricted to binary values and is designed using the channel matrix. It is then multiplied by the same channel matrix during transmission. This dependence, together with the entrywise sign nonlinearity, makes the performance difficult to characterize. Focusing on the standard i.i.d. Gaussian channel model, this talk studies the large-system behaviors of two classes of one-bit precoding schemes. For linear-quantized precoding, we use a recursive representation of Haar matrices, known as Householder Dice, to construct an asymptotic scalar signal-plus-independent-Gaussian-noise model. We next consider nonlinear symbol-level precoding, focusing on a scheme based on convex relaxation followed by one-bit quantization. Using approximate message passing and state evolution, we characterize the limiting empirical laws of the relaxed solution and of the received signal–symbol pairs. These results provide explicit performance predictions and guidance for precoder design.