Low Complexity Orthogonal Matching Pursuit Based Channel Estimation in mmWave Massive MIMO Systems

In mmWave channel estimation problem for massive MIMO systems, the compressed sensing (CS) techniques incurs prohibitive computational complexity, especially when the transmitter and receiver are both equipped with large number of antennas. In this paper, we convert the channel estimation problem into the equivalent multidimensional CS problem where the sparse channel is represented by a set of independent dictionaries with lower dimension instead of a large single one. Then we propose a multidimensional orthogonal matching pursuit relying on parameter refinement (MOMP-PR) algorithm to reconstruct the channel with lower complexity. Specifically, it performs the matching projection and updates the residual observation using the MOMP part to obtain the coarse estimation of channel parameters. Subsequently, these parameters can be refined to reduce the estimation error incurred by the basis mismatch between the continuous angles in reality and on-grid angles in the dictionary. Finally, simulation results demonstrate the effectiveness of our proposed algorithm.

Authors

Institutions

Publication Details

Published
2024-09-22
DOI
https://doi.org/10.1109/mlsp58920.2024.10734826
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low Complexity Orthogonal Matching Pursuit Based Channel Estimation in mmWave Massive MIMO Systems

Yingmeng Ge, Ziyi Gong, Zaichen Zhang, Chengyao Ruan et al.
Advanced MIMO Systems Optimization
article

Low Complexity Orthogonal Matching Pursuit Based Channel Estimation in mmWave Massive MIMO Systems

Yingmeng Ge, Ziyi Gong, Zaichen Zhang, Chengyao Ruan, Yuhao Qi
article en

Abstract

In mmWave channel estimation problem for massive MIMO systems, the compressed sensing (CS) techniques incurs prohibitive computational complexity, especially when the transmitter and receiver are both equipped with large number of antennas. In this paper, we convert the channel estimation problem into the equivalent multidimensional CS problem where the sparse channel is represented by a set of independent dictionaries with lower dimension instead of a large single one. Then we propose a multidimensional orthogonal matching pursuit relying on parameter refinement (MOMP-PR) algorithm to reconstruct the channel with lower complexity. Specifically, it performs the matching projection and updates the residual observation using the MOMP part to obtain the coarse estimation of channel parameters. Subsequently, these parameters can be refined to reduce the estimation error incurred by the basis mismatch between the continuous angles in reality and on-grid angles in the dictionary. Finally, simulation results demonstrate the effectiveness of our proposed algorithm.

Southeast University (CN)
Joint Project of Industry-University-Research of Jiangsu Province, Fundamental Research Funds for the Central Universities, National Mobile Communications Research Laboratory, Southeast University
Openalex Percentile: Top 83%
Advanced MIMO Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.