报告题目 (Title)：One-Bit Precoding in Massive MIMO: Algorithm Design and Performance Analysis
（大规模MIMO中的一位预编码：算法设计与性能分析）
报告人 (Speaker)： 刘亚锋 副研究员（中国科学院数学与系统科学院研究院）
报告时间 (Time)：2023年9月25日 (周一) 9:30
报告地点 (Place)：校本部F309
邀请人(Inviter)：徐姿 教授
报告摘要：One-bit precoding is a promising way to achieve hardware-efficiency in massive MIMO systems and has gained growing research interests in recent years. However, the one-bit nature of the transmit signal poses great challenge to precoding design as well as performance analysis. In this talk, we will present some recent results on one-bit precoding. We will focus on both non-linear and linear-quantized precoding schemes. In particular, for non-linear precoding, we introduce a new negative ℓ1 penalty approach, which is based on an exact penalty model that penalizes the one-bit constraint into the objective with a negative ℓ1-norm term. The negative ℓ1 penalty approach achieves a better trade-off in complexity and symbol error rate (SER) performance than existing approaches. For linear-quantized precoding, we give an aysmptotic performance analysis for a wide class of precoders and derive the optimal precoder within the considered class. Different from existing Bussgang-decomposition-based analyzes, our analytical framework is based on random matrix theory (RMT), which is more rigorous and can be extended to more general cases.