Skip to content
naulon
Not checkedNot checked for notices yet.

Compressive Downlink Channel Estimation for FDD Massive MIMO Using Weighted <inline-formula> <tex-math notation="LaTeX">$l_{p}$ </tex-math></inline-formula> Minimization

Wei Lu, Yongliang Wang, Xiaoqiao Wen and 3 more

IEEE Access · 2019

doi:10.1109/access.2019.2926790 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

We propose a weighted Ip 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 Ip 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 Ip 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 Ip(0 &lt;; p 1) minimization and the weighted Ip(0 &lt;; p 1) minimization, and can reduce to the RIP-based analysis results for the I1 minimization and the weighted I1 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 Ip 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 Ip minimization can achieve higher estimation accuracy compared with the Ip minimization, weighted subspace pursuit, weighted I<sub>1</sub> minimization, general I1 minimization, joint orthogonal matching pursuit, and simultaneous orthogonal matching pursuit in the medium and high signal-to-noise-rate regions.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.