Pith. sign in

REVIEW

Low-Complexity Linear Equalization for OTFS Systems with Rectangular Waveforms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.08133 v1 pith:Q5BR42EH submitted 2019-11-19 cs.IT eess.SPmath.IT

Low-Complexity Linear Equalization for OTFS Systems with Rectangular Waveforms

classification cs.IT eess.SPmath.IT
keywords equalizationotfsrectangularsystemswaveformschannellinearlow-complexity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.