A Low Rank Channel Estimation Scheme in Massive Multiple-Input Multiple-Output

Aiming at the problem of computational complexity of channel estimation, this paper proposes a low-complexity block matching pursuit (BMP) algorithm based on antenna grouping and block sparsity for frequency division duplex (FDD) massive Multiple-input Multiple-output orthogonal frequency division m...

Full description

Bibliographic Details
Main Authors: Waleed Shahjehan, Syed Waqar Shah, Jaime Lloret, Antonio Leon
Format: Article
Language:English
Published: MDPI AG 2018-10-01
Series:Symmetry
Subjects:
Online Access:http://www.mdpi.com/2073-8994/10/10/507
Description
Summary:Aiming at the problem of computational complexity of channel estimation, this paper proposes a low-complexity block matching pursuit (BMP) algorithm based on antenna grouping and block sparsity for frequency division duplex (FDD) massive Multiple-input Multiple-output orthogonal frequency division multiplexing (OFDM) systems. The system coherence time may be exceeded as a result of time consumption when adopting an orthogonal pilot symbol in the time domain. To solve this problem, an antenna grouping transmission scheme is proposed to reduce the total channel estimation time by sacrificing the observed data length. The simulation results show that the proposed BMP algorithm has good anti-noise performance, and it can accurately determine the non-zero position of the sparse vector and adaptively determine the sparsity of the channel, which effectively translates to improved channel estimation performance and better overall system performance than the existing algorithms.
ISSN:2073-8994