Rethinking WMMSE: Can Its Complexity Scale Linearly With The Number of BS Antennas?
报告人：史清江
报告人单位：同济大学
时间：22年6月20日（周一）晚上 8：30~9：30
线上腾讯会议号：453-843-192 密码：610064
摘要：Precoding design for maximizing weighted sumrate (WSR) is a fundamental problem for downlink of massive multi-user multiple-input multiple-output (MU-MIMO) systems. It is well-known that this problem is generally NP-hard due to the presence of multi-user interference. The weighted minimum mean-square error (WMMSE) algorithm is a popular approach for WSR maximization. However, its computational complexity is cubic in the number of base station (BS) antennas, which is unaffordable when the BS is equipped with an extremely large antenna array. In this talk, we will reshape the classical WMMSE with theoretical guarantee and linear complexity (i.e., scales linearly with the number of BS antennas).
报告人简介：史清江，同济大学软件学院教授/博导、曾受邀担任国际信号处理顶级期刊IEEE TSP编委。研究兴趣包括通信系统优化设计、网络/信号大数据、分布式机器学习。授权国家发明专利40余项，发表IEEE权威期刊论文80余篇，总引用5200余次（单篇最高引1300次），连续三年入选爱思唯尔中国高被引学者榜（2019-2021），荣获华为优秀技术成果奖、华为技术合作成果转化二等奖、中国通信学会科学技术一等奖（自然类）、日内瓦国际发明展发明金奖等。近年来主持国家重点研发计划项目（政府间合作）、国家自然科学基金面青项目、国防基础加强课题等国家级项目以及华为技术有限公司、中电科等企业院所委托的技术服务项目20余项。
邀请人：宋恩彬 教授
