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...

Full description

Saved in:
Bibliographic Details
Published inIEEE/CIC International Conference on Communications in China - Workshops (Online) pp. 1 - 5
Main Authors Li, Xue, Huang, Qin, Yu, Furong, Wang, Zulin
Format Conference Proceeding
LanguageEnglish
Published IEEE 10.08.2023
Subjects
Bit error rate
Doppler shift
Euclidean distance
low complexity
Message passing
OTFS
Simulation
Symbols
Time-frequency analysis
Online AccessGet full text
ISSN2474-9141
DOI10.1109/ICCCWorkshops57813.2023.10233709

Cover

More Information
Summary: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.
ISSN:2474-9141
DOI:10.1109/ICCCWorkshops57813.2023.10233709