4.6 Article

Reduced-complexity Krylov subspace methods for large-scale MIMO channel estimation

Journal

DIGITAL SIGNAL PROCESSING
Volume 78, Issue -, Pages 332-337

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.dsp.2018.03.019

Keywords

Channel estimation; Krylov subspace; Large-scale MIMO; Preconditioning

Ask authors/readers for more resources

Large-scale multiple-input multiple-output (MIMO) system has been intensively studied for wireless communications. Channel estimation is one of the challenges in large-scale MIMO. Direct implementation of the minimum mean squared error (MMSE) channel estimator has a cubic computational complexity due to the operation of matrix inverse. Iterative Krylov subspace methods can be applied to reduce the complexity to quadratic, which is dominated by the matrix-vector products involved. In this paper, we apply conjugate gradient (CG) method and preconditioning to improve the convergence rate and reduce complexity. The computational complexities are analyzed, showing that the preconditioned CG (PCG) schemes have significantly lower complexities compared to several alternative Krylov subspace schemes. (C) 2018 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available