.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Polar-Coded Iterative OTFS Receiver
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2024.3493962.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The orthogonal time-frequency space (OTFS) modulation has gained significant attention, due to its robust performance in high-speed mobile environment. In this correspondence, we develop a novel approach wherein delay-Doppler grid symbols into vectors are organized according to their Doppler index for OTFS. A novel detection algorithm is proposed in the Doppler transform domain, which offers lower complexity and better bit error rate (BER) performance compared to existing OTFS detection algorithms. In addition, considering the superior performance of short-block polar codes, we integrate them to further enhance the performance. Simulation results validate the performance advantages of the proposed algorithm over existing benchmarks in terms of BER for OTFS. Specifically, BER performance can be improved by at least 1 dB.
Keywords:
Vectors
Complexity theory
Channel estimation
Bit error rate
Time-frequency analysis
Detectors
Detection algorithms
Reliability
Indexes
OTFS
detection
low complexity
polar codes
polar codes
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
View more organizations