Low-Complexity Belief Propagation detector for OTFS System

The orthogonal time frequency space (OTFS) modulation has emerged as a potential candidate modulation scheme for high mobility wireless communications. However, the matrix-inversion based detectors have prohibitively high complexity in OTFS systems due to high-dimensional channel matrix. In this pap...

Full description

Saved in:
Bibliographic Details
Published in2021 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC) pp. 1 - 5
Main Authors Zhang, Yang, Zhang, Qunfei, He, Chengbing, Ma, Meiling, Wang, Yingjie
Format Conference Proceeding
LanguageEnglish
Published IEEE 17.08.2021
Subjects
Belief propagation
Bit error rate
Delay-Doppler channels
Detectors
Modulation
OTFS
Signal processing algorithms
Time-frequency analysis
Time-varying channels
Wireless communication
Online AccessGet full text
DOI10.1109/ICSPCC52875.2021.9564852

Cover

More Information
Summary:The orthogonal time frequency space (OTFS) modulation has emerged as a potential candidate modulation scheme for high mobility wireless communications. However, the matrix-inversion based detectors have prohibitively high complexity in OTFS systems due to high-dimensional channel matrix. In this paper, a low complexity belief propagation (BP) detection algorithm is therefore proposed for OTFS modulation over delay-Doppler channels. Specifically, the sparse feature of the equivalent channel matrix and the approximate probability update scheme are utilized to reduce computational complexity. In addition, we also add a damping factor to improve the convergence of the proposed algorithm, which brings substantial performance. Numerical simulation results that the proposed detection scheme effectively improves the bit error rate (BER) performance for OTFS systems.
DOI:10.1109/ICSPCC52875.2021.9564852