4.7 Article

Dictionary Learning-Based Channel Estimation for RIS-Aided MISO Communications

期刊

IEEE WIRELESS COMMUNICATIONS LETTERS
卷 11, 期 10, 页码 2125-2129

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LWC.2022.3194585

关键词

Channel estimation; Dictionaries; Sparse matrices; Training; Estimation; Matching pursuit algorithms; Transmission line matrix methods; Reconfigurable intelligent surface (RIS); dictionary learning; compressive sensing (CS)

资金

  1. National Key Research and Development Program of China [2018YFB1801105]
  2. National Natural Science Foundation of China [U1801261, 61631005]
  3. Key Areas of Research and Development Program of Guangdong Province, China [2018B010114001]
  4. Macau Science and Technology Development Fund (FDCT), Macau [0009/2020/A1]
  5. Fundamental Research Funds for the Central Universities [ZYGX2019Z022]
  6. Programme of Introducing Talents of Discipline to Universities [B20064]

向作者/读者索取更多资源

This letter addresses the channel estimation problem for RIS-aided MISO systems by optimizing dictionary parameters and sparse signal recovery to enhance the representation and estimation performance of sparse channels.
In this letter, we study the channel estimation problem for the reconfigurable intelligent surface (RIS)-aided multi-input single-output (MISO) system. By exploiting the channel sparsity, compressive sensing (CS) based sparse channel estimators can be applied to the system to reduce the training overhead. However, these existing sparse channel estimators adopt predefined dictionaries when formulating the sparse matrix recovery problem, which will cause grid mismatch issues and estimation performance degradation. Hence, in this letter, we formulate the channel estimation problem as a joint dictionary parameter learning and sparse signal recovery problem, in which the dictionary parameter can be optimized to adapt to the channel measurements, thereby improving the robustness of sparse channel representation and estimation performance. Then, we propose an iterative re-weighted algorithm to solve this non-convex problem efficiently. Simulation results show that the proposed algorithm outperforms other benchmark schemes significantly.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据