文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 A Robust Recovery of Block Sparse Channels in Massive MIMO-OFDM Systems
卷期 32:3
作者 Jing ZhangYing Su
頁次 014-029
關鍵字 massive MIMOOFDMchannel estimationcompressive sensingadaptive estimationEIMEDLINEScopus
出刊日期 202106
DOI 10.3966/199115992021063203002

中文摘要

英文摘要

The recovery algorithms of the finite impulse responses (FIRs) of multipath channels via a single-measurement-vector and a multiple-measurement-vector, respectively, are investigated in the massive multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) systems. Based on the characteristics of the spatial-temporal block sparse structure of the multipath channels, the phase-shift orthogonal comb pilots are designed and inserted into the symbols to ensure the column uncorrelatedness of the sensing matrix. These pilot tones are spread among all transmit antennas. For the purpose of resolving the difficulty of approximating the unknown sparsity without overestimation, the robust sparsity adaptive matching pursuit (RSAMP) algorithms to be used in both measurement scenarios are proposed. The residuals in these algorithms are smoothened within several iterations but achieving much more acceptable halting state. The proposed algorithms are proven to be immune to the size of the support set and a flexible number of measurement vectors. Simulations demonstrate that the normalized mean square error performance of these algorithms is comparable to those of the orthogonal matching pursuit algorithm and the subspace pursuit algorithm.

本卷期文章目次

相關文獻