报告题目 (Title)：One-Bit Precoding in Massive MIMO: Algorithm Design and Asymptotic Performance Analysis（大规模MIMO中的1比特预编码：算法设计与渐进性能分析）
报告人 (Speaker)：刘亚锋 教授（北京邮电大学）
报告时间 (Time)：2025年11月17日 (周一) 19:00
报告地点 (Place)：腾讯会议: 383-853-200
邀请人(Inviter)：徐姿 教授
主办部门：理学院数学系
报告摘要：
One-bit precoding is a promising approach to enhancing hardware efficiency in massive MIMO systems and has attracted significant research interests in recent years. However, the inherent one-bit constraint on the transmit signals poses great challenges for both precoding design and performance analysis. This talk presents recent advancements in one-bit precoding. The first part focuses on precoding design for massive MIMO systems, introducing a new negative ℓ1 penalty approach. This method is based on an exact penalty model that penalizes the one-bit constraint into the objective using a negative ℓ1-norm term. Compared to existing approaches, our approach achieves a superior trade-off between computational complexity and symbol error rate (SER) performance. Additionally, we will explore one-bit precoding design in massive MIMO integrated sensing and communication (ISAC)—a key use case in next-generation 6G systems. The second part of the talk shifts to the asymptotic SER performance analysis of a broad class of linear-quantized precoding schemes. Unlike conventional Bussgang decomposition-based analyzes, our analytical framework is grounded in random matrix theory (RMT), which is more rigorous and can be extended to more general cases. Furthermore, we will present recent findings on the asymptotic SER analysis of a widely studied nonlinear precoding scheme.
