A Low-Complexity Euclidean Distance Based BP Detection Algorithm for OTFS System

It is complex to detect orthogonal time frequency space (OTFS) signals in scenarios with a large number of channel paths or fractional Doppler shifts. Thus, this paper proposes an efficient belief propagation (BP) detection algorithm for OTFS signals based on Euclidean distance. Instead of involving all the combinations of input symbols, the proposed detection only considers the most reliable combination according to Euclidean distance. Simulation results show that the proposed detection algorithm achieves better bit error rate (BER) performance while requiring less computation complexity compared with the message passing (MP) algorithm.