Efficient Multi-User Channel Estimation for RIS-Aided mmWave Systems Using Shared Channel Subspace

This paper presents an efficient channel estimation algorithm for multi-user reconfigurable intelligent surface (RIS)-aided millimeter-wave (mmWave) systems. In this paper, the concept of low rank matrix completion (LRMC) is exploited to reduce beam training overhead for channel estimation. The prop...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2024-08, Vol.23 (8), p.8512-8527
Main Authors: Chung, Hyeonjin, Hong, Songnam, Kim, Sunwoo
Format: Article
Language:English
Subjects:
Channel estimation
Computational efficiency
Estimation
fast alternating least squares
low-rank matrix completion
Millimeter wave communication
multi-user channel estimation
Reconfigurable intelligent surface
Sensors
shared channel subspace
Training
Uplink
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an efficient channel estimation algorithm for multi-user reconfigurable intelligent surface (RIS)-aided millimeter-wave (mmWave) systems. In this paper, the concept of low rank matrix completion (LRMC) is exploited to reduce beam training overhead for channel estimation. The proposed beam training samples part of each channel matrix in a special pattern that is suitable for LRMC with less beam training overhead. Then, the beam training is followed by multi-user channel estimation. For computationally efficient channel estimation, the proposed algorithm exploits the property that all the channel matrices share the same low-rank subspace in multi-user RIS-aided systems. The shared subspace is derived by combining candidate subspaces, which are estimated by fast alternating least squares (FALS) from partially observed channels. With the shared subspace, all the missing entries of channels are recovered via computationally efficient linear estimation. The simulations and complexity analysis demonstrate that the proposed algorithm shows a superior accuracy-complexity trade-off compared to existing works.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2024.3351701