Channel Estimation for Orthogonal Time Frequency Space (OTFS) Massive MIMO
Shen, Wenqian ; Dai, Linglong ; An, Jianping ; Fan, Pingzhi ; Heath, Jr, Robert W.
arXiv, Tome 2019 (2019) no. 0, / Harvested from
Orthogonal time frequency space (OTFS) modulation outperforms orthogonal frequency division multiplexing (OFDM) in high-mobility scenarios. One challenge for OTFS massive MIMO is downlink channel estimation due to the large number of base station antennas. In this paper, we propose a 3D structured orthogonal matching pursuit algorithm based channel estimation technique to solve this problem. First, we show that the OTFS MIMO channel exhibits 3D structured sparsity: normal sparsity along the delay dimension, block sparsity along the Doppler dimension, and burst sparsity along the angle dimension. Based on the 3D structured channel sparsity, we then formulate the downlink channel estimation problem as a sparse signal recovery problem. Simulation results show that the proposed algorithm can achieve accurate channel state information with low pilot overhead.
Publié le : 2019-03-22
Classification:  Computer Science - Information Theory
@article{1903.09441,
     author = {Shen, Wenqian and Dai, Linglong and An, Jianping and Fan, Pingzhi and Heath, Jr, Robert W.},
     title = {Channel Estimation for Orthogonal Time Frequency Space (OTFS) Massive
  MIMO},
     journal = {arXiv},
     volume = {2019},
     number = {0},
     year = {2019},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1903.09441}
}
Shen, Wenqian; Dai, Linglong; An, Jianping; Fan, Pingzhi; Heath, Jr, Robert W. Channel Estimation for Orthogonal Time Frequency Space (OTFS) Massive
  MIMO. arXiv, Tome 2019 (2019) no. 0, . http://gdmltest.u-ga.fr/item/1903.09441/