
Compressed sensing channel estimation in massive MIMO
Author(s) -
Pramanik Ankita,
Maity Santi P.,
Farheen Zeba
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.0126
Subject(s) - matching pursuit , mimo , computer science , compressed sensing , channel (broadcasting) , algorithm , sparse approximation , telecommunications
Massive multiple‐input–multiple‐output (MIMO) emerges as a promising technology to meet the ever growing demand on a large volume of data transmission in an energy efficient manner in the upcoming fifth generation networks. This explores an integrated system model of improved wireless channel estimation (CE) and its consequent effect on image reconstruction, both done in compressed sensing (CS) framework. A massive MIMO channel exhibits sparse nature and has been modelled as a CS problem. Two CS‐MIMO‐CE algorithms, discrete cosine transform‐based stagewise orthogonal matching pursuit and improved stagewise orthogonal matching pursuit (iStOMP), are suggested here. Low density parity check codes are also integrated to serve three‐fold purposes, as a pilot signal, sensing matrix, and error control code, while Daubechies transform offers a sparse representation of the MIMO channel and transmitted image. The proposed iStOMP MIMO‐CE algorithm offers ∼ 6dB gain in CE over the existing works and gain in 2 dB on image visual quality at 75% CS measurements.