TY - GEN
T1 - FAST ALGORITHM DESIGN FOR THE CONSTANT-ENVELOPE PRECODING IN MASSIVE MIMO COMMUNICATIONS WITH INTERFERENCE EXPLOITATION
AU - Shi, Chunxuan
AU - Li, Yongzhe
AU - Tao, Ran
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - We study the problem of constant-envelope precoding in massive MIMO communications with interference exploitation, whose main challenge lies in the non-convexity introduced by its constant-modulus constraints. Different from conventional approaches that typically involve constant-modulus approximations, we devise a new method with direct phase manipulations for precoding. To this end, we first formulate the precoding design into an unconstrained phase optimization with a 'min-max' scheme, based on which we then apply the majorization-minimization (MM) technique to transform it into a convex minimization problem. For the sake of efficient solutions to this convex optimization, we focus on dealing with its dual problem, whose objective is further transformed into a simple quadratic form by means of elaborating the surrogate for MM. Finally, we arrive to a fast gradient-based solution for iteration. Simulation results show the superiority of our proposed algorithm over the existing methods in terms of different aspects, especially in the context of large-scale optimization.
AB - We study the problem of constant-envelope precoding in massive MIMO communications with interference exploitation, whose main challenge lies in the non-convexity introduced by its constant-modulus constraints. Different from conventional approaches that typically involve constant-modulus approximations, we devise a new method with direct phase manipulations for precoding. To this end, we first formulate the precoding design into an unconstrained phase optimization with a 'min-max' scheme, based on which we then apply the majorization-minimization (MM) technique to transform it into a convex minimization problem. For the sake of efficient solutions to this convex optimization, we focus on dealing with its dual problem, whose objective is further transformed into a simple quadratic form by means of elaborating the surrogate for MM. Finally, we arrive to a fast gradient-based solution for iteration. Simulation results show the superiority of our proposed algorithm over the existing methods in terms of different aspects, especially in the context of large-scale optimization.
KW - Massive MIMO
KW - constant-envelope precoding
KW - constructive interference
KW - majorization-minimization
UR - http://www.scopus.com/inward/record.url?scp=85195379627&partnerID=8YFLogxK
U2 - 10.1109/ICASSP48485.2024.10445990
DO - 10.1109/ICASSP48485.2024.10445990
M3 - Conference contribution
AN - SCOPUS:85195379627
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 8766
EP - 8770
BT - 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 49th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024
Y2 - 14 April 2024 through 19 April 2024
ER -