Compressive Downlink Channel Estimation for FDD Massive MIMO Using Weighted $l_{p}$ Minimization

Abstract

We propose a weighted l p minimization method for downlink channel estimation in frequency division duplexing massive multiple-input multiple-output (MIMO) systems. The proposed algorithm involves two stages, in which it first diagnoses the downlink supports by utilizing the channel sparsity in angular domain and angular reciprocity for uplink and downlink channels. In stage two, a weighted l p minimization algorithm based on the diagnosed supports is used for downlink channel estimation. The diagnosed supports are used for generating the weighting matrix in the weighted l p minimization. The restricted isometry property (RIP)-based guarantees and upper bound of the recovery error are derived. Our analytical results have the universal forms for the l p (0 < p ≤ 1) minimization and the weighted l p (0 < p ≤ 1) minimization, and can reduce to the RIP-based analysis results for the l 1 minimization and the weighted l 1 minimization which have been discussed in the previous literature. The discussion on the weight selection is also presented which is based on the derived upper bound. Simulations show that the weighted l p minimization is preferred when the correct percentage of the estimated support is more than 0.5. For the channel estimation, the proposed method with support diagnosis and the weighted l p minimization can achieve higher estimation accuracy compared with the l p minimization, weighted subspace pursuit, weighted l 1 minimization, general l 1 minimization, joint orthogonal matching pursuit, and simultaneous orthogonal matching pursuit in the medium and high signal-to-noise-rate regions.INDEX TERMS Channel estimation, massive MIMO, weighted l p minimization.

On the Error Probability of Support Recovery for Orthogonal Matching Pursuit With a Random Measurement Matrix

“…To this end, our analysis is based on the statistical characteristics of a random measurement matrix in CS. The derivation can be used for some applications such as CS encryption [9]- [11] and wireless communications [25]- [27], which can directly exploit sparsity with an acceptable prediction of the support recovery.…”

Compressive Sensing based Low Complexity User Selection for Massive MIMO Systems

“…Specifically, the Massive MIMO channel has an approximately sparse representation under the Discrete Fourier Transform (DFT) basis if the BS is equipped with a large uniform linear array (ULA). As a consequence, Compressive Sensing (CS) algorithm, which exploits the hidden sparsity under the DFT basis, has been examined for downlink channel estimation and feedback [3].…”