Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low-Complexity Equalization for Orthogonal Time and Frequency Signaling (OTFS) (1710.09916v1)

Published 26 Oct 2017 in cs.IT and math.IT

Abstract: Recently, a new precoding technique called orthogonal time-frequency signaling (OTFS) has been proposed for time- and frequency-selective communication channels. OTFS precodes a data frame with a complete set of spreading sequences and transmits the results via orthogonal frequency division multiplexing (OFDM). OTFS uses two dimensional (2D) linear spreading sequences in time and frequency which are the basis functions of a symplectic Fourier transform. OTFS allows the utilization of time- and frequency-diversity but requires maximum likelihood decoding to achieve full diversity. In this paper we show performance results of a low-complexity equalizer using soft-symbol feedback for interference cancellation after an initial minimum-mean square error equalization step. Performance results for an implementation in the delay-Doppler domain and in the time-frequency domain are compared. With our equalizer, OTFS achieves a gain of 5dB compared to OFDM for a bit error rate of $10{-4}$ and a velocity of $200\,\text{km/h}$.

Citations (30)

Summary

We haven't generated a summary for this paper yet.