Beamspace Channel Estimation for the Millimeter-Wave Massive MIMO Systems: Dual Loops-Based Iteration Reduction Algorithms

In the millimeter-wave (mmWave) massive multipleinput multiple-output (MIMO) channel estimation problem blue employing lens antenna arrays, conventional compressed sensing algorithms demand numerous matrix-vector multiplications per iteration, thereby incurring substantial computational complexity. To address this challenge, we propose dual-loop beamspace channel estimation strategies that leverage the sparsity of the mmWave beamspace channel, formulating the estimation problem as a sparse signal recovery task. First, we design an effective dual-loop algorithm based on the ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> minimization problem to tackle the channel estimation problem. In the outer loop, an ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>- based iterative reduction algorithm (ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>-IRA) reduces the largescale channel estimation problem to a series of small-scale subproblems by exploiting the sparsity of the beamspace channel. In the inner loop, the fast iterative shrinkage thresholding algorithm with backtracking (FISTAB) algorithm is used to solve these subproblems efficiently. Furthermore, conventional compressed sensing algorithms exhibit favorable performance in weakly correlated systems but suffer from significant performance degradation in strongly correlated scenarios. To mitigate this limitation, we design an ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1−2</sub> minimization problem-based IRA (ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1−2</sub>-IRA) for the beamspace channel estimation problem. Finally, simulation results show that the proposed dual loop methods significantly reduce pilot overhead and improve beamspace channel estimation accuracy compared to conventional channel estimation techniques.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-09-26
DOI
https://doi.org/10.1109/tvt.2025.3612767
Primary Topic
Millimeter-Wave Propagation and Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Beamspace Channel Estimation for the Millimeter-Wave Massive MIMO Systems: Dual Loops-Based Iteration Reduction Algorithms

Gaojie Chen, Zheng Li, Shuangyang Li, Zheng Chu et al.
IEEE Transactions on Vehicular Technology
Millimeter-Wave Propagation and Modeling
article

Beamspace Channel Estimation for the Millimeter-Wave Massive MIMO Systems: Dual Loops-Based Iteration Reduction Algorithms

Gaojie Chen, Zheng Li, Shuangyang Li, Zheng Chu, Zeliang An, Zhengyu Zhu, Lijun Zhu
article en

Abstract

In the millimeter-wave (mmWave) massive multipleinput multiple-output (MIMO) channel estimation problem blue employing lens antenna arrays, conventional compressed sensing algorithms demand numerous matrix-vector multiplications per iteration, thereby incurring substantial computational complexity. To address this challenge, we propose dual-loop beamspace channel estimation strategies that leverage the sparsity of the mmWave beamspace channel, formulating the estimation problem as a sparse signal recovery task. First, we design an effective dual-loop algorithm based on the ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> minimization problem to tackle the channel estimation problem. In the outer loop, an ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>- based iterative reduction algorithm (ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>-IRA) reduces the largescale channel estimation problem to a series of small-scale subproblems by exploiting the sparsity of the beamspace channel. In the inner loop, the fast iterative shrinkage thresholding algorithm with backtracking (FISTAB) algorithm is used to solve these subproblems efficiently. Furthermore, conventional compressed sensing algorithms exhibit favorable performance in weakly correlated systems but suffer from significant performance degradation in strongly correlated scenarios. To mitigate this limitation, we design an ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1−2</sub> minimization problem-based IRA (ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1−2</sub>-IRA) for the beamspace channel estimation problem. Finally, simulation results show that the proposed dual loop methods significantly reduce pilot overhead and improve beamspace channel estimation accuracy compared to conventional channel estimation techniques.

IEEE Transactions on Vehicular TechnologyVol. 75(3)
The University of Sydney (AU), University of Nottingham Ningbo China (CN), Beijing University of Posts and Telecommunications (CN), Xidian University (CN), Sun Yat-sen University (CN), Zhengzhou University (CN), Shenzhen Academy of Robotics (CN), Anhui Polytechnic University (CN)
National Natural Science Foundation of China, Sun Yat-sen University, Xidian University, Natural Science Foundation of Henan Province, State Key Laboratory of Integrated Services Networks, Natural Science Foundation of Ningbo, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 74%
Millimeter-Wave Propagation and Modeling
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.