In a massive multiuser multiple-input multiple-output (MU-MIMO) downlink communication system, it is observed that the primary power consumption is attributed to high-resolution digital-to-analog converters (DACs). Under the need to build the next generation of low-power mobile communications, we study the low-resolution DACs precoding problem in massive MU-MIMO communication systems. A novel symbol-level precoding technique is developed for the low-resolution $b$ -bit DACs system where $b \ge 2$ . Specifically, we first equivalently reconstruct the low-resolution DACs constraints, and then formulate the low-resolution DACs precoding problem as a directly solvable discrete binary optimization problem. By adding a penalty term to relax the discrete binary constraints, the alternating direction multiplier method can effectively solve the problem. In particular, we use an iterative subprocess that directly projects the low-resolution DACs constraints, avoiding the inversion of the quantized precoding signal in the alternating optimization. Furthermore, based on the matrix theory, the proposed algorithm avoids high-dimensional matrix inversion in each iteration, resulting in a reduction in algorithmic complexity. Simulations evaluate the performance of the proposed low-resolution DACs precoding design for different resolutions, where it is shown that using low-resolution DACs can lead to higher power efficiency. In particular, we focus on setup with low-resolution DACs and shows that compared with existing schemes, the proposed algorithm can achieve a performance gain of approximately $\text{0.5}\,\text{dB}$ in the 3-bit DACs case. We further analyze the convergence and computational complexity of the algorithm and verify it through simulation.
The practical implementation of massive multi-user multi-input–multi-output (MU-MIMO) downlink communication systems power amplifiers that are energy efficient; otherwise, the power consumption of the base station (BS) will be prohibitive. Constant envelope (CE) precoding is gaining increasing interest for its capability to utilize low-cost, high-efficiency nonlinear radio frequency amplifiers. Our work focuses on the topic of CE precoding in massive MU-MIMO systems and presents an efficient CE precoding algorithm. This algorithm uses an alternating minimization (AltMin) framework to optimize the CE precoded signal and precoding factor, aiming to minimize the difference between the received signal and the transmit symbol. For the optimization of the CE precoded signal, we provide a powerful approach that integrates the majorization-minimization (MM) method and the fast iterative shrinkage-thresholding (FISTA) method. This algorithm combines the characteristics of the massive MU-MIMO channel with the second-order Taylor expansion to construct the surrogate function in the MM method, in which minimizing this surrogate function is the worst-case of the system. Specifically, we expand the suggested CE precoding algorithm to involve the discrete constant envelope (DCE) precoding case. In addition, we thoroughly examine the exact property, convergence, and computational complexity of the proposed algorithm. Simulation results demonstrate that the proposed CE precoding algorithm can achievean uncoded biterror rate (BER) performance gain of roughly compared to the existing CE precoding algorithm and has an acceptable computational complexity. This performance advantage also exists when it comes to DCE precoding.