Channel Estimation for Orthogonal Time Frequency Space (OTFS) Massive MIMO

March 22, 2019 Β· Declared Dead Β· πŸ› ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wenqian Shen, Linglong Dai, Jianping An, Pingzhi Fan, Robert W. Heath, arXiv ID 1903.09441 Category cs.IT: Information Theory Citations 388 Venue ICC 2019 - 2019 IEEE International Conference on Communications (ICC) Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted