FDD Massive MIMO Channel Estimation With Arbitrary 2D-Array Geometry

• Published in: IEEE transactions on signal processing Vol. 66; no. 10; pp. 2584 - 2599
• Main Authors: Dai, Jisheng, Liu, An, Lau, Vincent K. N.
• Format: Journal Article
• Language: English
• Published: IEEE 15.05.2018
• Subjects: Channel estimation; Discrete Fourier transforms; Downlink; Geometry; majorization-minimization (MM); massive multiple-input multiple-output (MIMO); MIMO communication; off-grid refinement; Scattering; sparse Bayesian learning (SBL); Training
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2018.2807390

This paper addresses the problem of downlink channel estimation in frequency-division duplexing massive multiple-input multiple-output systems. The existing methods usually exploit hidden sparsity under a discrete Fourier transform (DFT) basis to estimate the downlink channel. However, there are at least two shortcomings of these DFT-based methods: first, they are applicable to uniform linear arrays (ULAs) only, since the DFT basis requires a special structure of ULAs; and second, they always suffer from a performance loss due to the leakage of energy over some DFT bins. To deal with the above-mentioned shortcomings, we introduce an off-grid model for downlink channel sparse representation with arbitrary two-dimensional-array antenna geometry, and propose an efficient sparse Bayesian learning approach for the sparse channel recovery and off-grid refinement. The main idea of the proposed off-grid method is to consider the sampled grid points as adjustable parameters. Utilizing an in-exact block majorization-minimization algorithm, the grid points are refined iteratively to minimize the off-grid gap. Finally, we further extend the solution to uplink-aided channel estimation by exploiting the angular reciprocity between downlink and uplink channels, which brings enhanced recovery performance.