Low-Complexity Linear Equalization for OTFS Systems with Rectangular Waveforms

November 19, 2019 Β· Declared Dead Β· πŸ› 2021 IEEE International Conference on Communications Workshops (ICC Workshops)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wenjun Xu, Tingting Zou, Hui Gao, Zhisong Bie, Zhiyong Feng, Zhiguo Ding arXiv ID 1911.08133 Category cs.IT: Information Theory Cross-listed eess.SP Citations 37 Venue 2021 IEEE International Conference on Communications Workshops (ICC Workshops) Last Checked 6 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted