Cascaded Channel Estimation for Large Intelligent Metasurface Assisted Massive MIMO

In this letter, we consider the problem of channel estimation for large intelligent metasurface (LIM) assisted massive multiple-input multiple-output (MIMO) systems. The main challenge of this problem is that the LIM integrated with a large number of low-cost metamaterial antennas can only passively...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE wireless communications letters Ročník 9; číslo 2; s. 210 - 214
Hlavní autoři: He, Zhen-Qing, Yuan, Xiaojun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.02.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation algorithms
Array signal processing
Bilinear factorization
Channel estimation
Computer simulation
large intelligent metasurface
massive MIMO
matrix completion
Metamaterials
Metasurfaces
MIMO (control systems)
Signal processing
Signal processing algorithms
Sparse matrices
ISSN:2162-2337, 2162-2345
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this letter, we consider the problem of channel estimation for large intelligent metasurface (LIM) assisted massive multiple-input multiple-output (MIMO) systems. The main challenge of this problem is that the LIM integrated with a large number of low-cost metamaterial antennas can only passively reflect the incident signals by certain phase shifts, and does not have any signal processing capability. To deal with this, we introduce a general framework for the estimation of the transmitter-LIM and LIM-receiver cascaded channel, and propose a two-stage algorithm that includes a sparse matrix factorization stage and a matrix completion stage. Simulation results illustrate that the proposed method can achieve accurate channel estimation for LIM-assisted massive MIMO systems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2019.2948632