Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Gradient Pursuit-Based Channel Estimation for MmWave Massive MIMO Systems with One-Bit ADCs (1908.00508v1)

Published 1 Aug 2019 in eess.SP, cs.IT, and math.IT

Abstract: In this paper, channel estimation for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems with one-bit analog-to-digital converters (ADCs) is considered. In the mmWave band, the number of propagation paths is small, which results in sparse virtual channels. To estimate sparse virtual channels based on the maximum a posteriori (MAP) criterion, sparsity-constrained optimization comes into play. In general, optimizing objective functions with sparsity constraints is NP-hard because of their combinatorial complexity. Furthermore, the coarse quantization of one-bit ADCs makes channel estimation a challenging task. In the field of compressed sensing (CS), the gradient support pursuit (GraSP) and gradient hard thresholding pursuit (GraHTP) algorithms were proposed to approximately solve sparsity-constrained optimization problems iteratively by pursuing the gradient of the objective function via hard thresholding. The accuracy guarantee of these algorithms, however, breaks down when the objective function is ill-conditioned, which frequently occurs in the mmWave band. To prevent the breakdown of gradient pursuit-based algorithms, the band maximum selecting (BMS) technique, which is a hard thresholder selecting only the "band maxima," is applied to GraSP and GraHTP to propose the BMSGraSP and BMSGraHTP algorithms in this paper.

Citations (2)

Summary

We haven't generated a summary for this paper yet.