Uplink Cascaded Channel Estimation for Intelligent Reflecting Surface Assisted Multiuser MISO Systems

被引:88
|
作者
Guo, Huayan [1 ,2 ]
Lau, Vincent K. N. [2 ]
机构
[1] Hong Kong Univ Sci & Technol, Shenzhen Res Inst, Shenzhen 518000, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong 999077, Peoples R China
基金
中国国家自然科学基金;
关键词
Channel estimation; Protocols; Training; Estimation; Antennas; Uplink; Reflection; Intelligent reflecting surface (IRS); reconfigurable intelligent surface (RIS); channel estimation; multiple-input multiple-output (MIMO); BEAMFORMING DESIGN; FRAMEWORK;
D O I
10.1109/TSP.2022.3193626
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the uplink cascaded channel estimation for intelligent-reflecting-surface (IRS)-assisted multi-user multiple-input-single-output systems. We focus on a sub-6 GHz scenario in which the channel propagation is not sparse and the number of IRS elements can be larger than the number of BS antennas. A novel channel estimation protocol without the need for on-off amplitude control to avoid the reflection power loss is proposed. The pilot overhead is substantially reduced by exploiting the common-link structure to decompose the cascaded channel coefficients by the multiplication of the common-link variables and the user-specific variables. However, these two types of variables are highly coupled, which makes them difficult to estimate. To address this issue, we formulate an optimization-based joint channel estimation problem, which only utilizes the covariance of the cascaded channel. Then, we design a low-complexity alternating optimization algorithm with efficient initialization for the non-convex optimization problem, which achieves a local optimum solution. To further enhance the estimation accuracy, we propose a new formulation to optimize the training phase shifting configuration for the proposed protocol, and then we solve it using the successive convex approximation algorithm. Comprehensive simulations verify that the proposed algorithm has supreme performance compared to various state-of-the-art baseline schemes.
引用
收藏
页码:3964 / 3977
页数:14
相关论文
empty
未找到相关数据