https://scholars.lib.ntu.edu.tw/handle/123456789/632606
Title: | Low-Complexity Compressive Channel Estimation for IRS-Aided mmWave Systems With Hypernetwork-Assisted LAMP Network | Authors: | Tsai, Wen Chiao Chen, Chi Wei Teng, Chieh Fang AN-YEU(ANDY) WU |
Keywords: | channel estimation | compressive sensing | deep learning | hypernetwork | Intelligent reflecting surface (IRS) | Issue Date: | 1-Aug-2022 | Publisher: | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Journal Volume: | 26 | Journal Issue: | 8 | Start page/Pages: | 1883 | Source: | IEEE Communications Letters | Abstract: | Intelligent reflecting surface (IRS) can enhance the wireless communication environment by smartly reflecting the incident signal toward desired directions. However, the acquisition of channel state information (CSI) is challenging since IRS usually consists of a massive number of passive elements that have no capabilities of sensing and processing the pilot signals. Although by exploiting the sparsity of the angular domain channel, the huge pilot overhead can be reduced with conventional compressive sensing algorithms, such as approximate message passing (AMP), these algorithms cannot achieve satisfactory channel estimation performance. Based on the learned AMP (LAMP) network, we propose a hypernetwork-assisted LAMP (HN-LAMP) network with dynamic shrinkage parameters to improve the channel estimation accuracy. Furthermore, a recurrent architecture is adopted to reduce the large memory overhead arising from the LAMP network. Simulation results show that the proposed HN-LAMP network can improve the channel estimation accuracy or reduce the computational complexity under satisfactory estimation performance. Moreover, the proposed hypernetwork-assisted recurrent LAMP (HNR-LAMP) architecture can effectively reduce 50% memory overhead by sharing learnable weights. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/632606 | ISSN: | 10897798 | DOI: | 10.1109/LCOMM.2022.3178188 |
Appears in Collections: | 電機工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.