Low-Complexity Compressed Sensing Downlink Channel Estimation for Multi-Antenna Terminals in FDD Massive MIMO Systems
| Autor: | Tongzhou Han, Danfeng Zhao |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
General Computer Science
Computer science MIMO General Engineering Process (computing) Channel estimation 020206 networking & telecommunications 020302 automobile design & engineering 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY Compressed sensing 0203 mechanical engineering Terminal (electronics) Telecommunications link Greedy algorithm 0202 electrical engineering electronic engineering information engineering General Materials Science FDD lcsh:Electrical engineering. Electronics. Nuclear engineering Algorithm lcsh:TK1-9971 Communication channel Computer Science::Information Theory large-scale MIMO |
| Zdroj: | IEEE Access, Vol 8, Pp 130183-130193 (2020) |
| ISSN: | 2169-3536 |
| Popis: | In frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems, the overhead of downlink channel estimation is complex in terms of the pilot overhead, the calculation cost and the estimation process. In this paper, we propose a low-complexity downlink channel estimation scheme based on compressed sensing for mobile multi-antenna terminals. In the scheme, the mobile terminal estimates the downlink massive MIMO channel and utilises the characteristics of the spatial sparsity of the massive MIMO channel to reduce the feedback overhead by feeding back the nonzero value of the sparse channel. Specifically, we propose a low-complexity estimation algorithm based on compressive sensing for multi-antenna terminals to reduce the computational overhead of the terminal. Since different antennas of a terminal share the same support set, the algorithm estimates multiple indices per iteration, collecting the estimated indices of different antennas at the end of each iteration, thereby reducing the total number of iterations of the algorithm. Then, we derive a halting condition for a greedy algorithm that stops the iteration process according to the residual energy. The simulation results illustrate the efficiency of the halting condition for the greedy algorithm and the low complexity of the proposed algorithm. In contrast to different greedy algorithms and the Bayesian algorithm, the proposed algorithm has a complexity that decreases as the number of terminal antennas. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|