mlsanityData to 14 Oct 2026

Low-Complexity Linear Equalization for OTFS Systems with Rectangular Waveforms

arXiv 1911.08133 ↗First posted 19 Nov 2019cs.IT eess.SP math.ITcited by 2

Not on the map. Why?

Abstract (arXiv)

Orthogonal time frequency space (OTFS) is a promising technology for high-mobility wireless communications. However, the equalization realization in practical OTFS systems is a great challenge when the non-ideal rectangular waveforms are adopted. In this paper, first of all, we theoretically prove that the effective channel matrix under rectangular waveforms holds the block-circulant property and the special Fourier transform structure with time-domain channel. Then, by exploiting the proved property and structure, we further propose the corresponding low-complexity algorithms for two mainstream linear equalization methods, i.e., zero-forcing (ZF) and minimum mean square error (MMSE). Compared with the existing direct-matrix-inversion-based equalization, the complexities can be reduced by a few thousand times for ZF and a few hundred times for MMSE without any performance loss, when the numbers of symbols and subcarriers are both 32 in OTFS systems.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1.

2 papers.