Low Complexity Detection Algorithms for OTFS under Rapidly Time-Varying Channel
Authors:
- Lingjun LiLLLingjun Li
- Yu LiangYLYu Liang
- Pingzhi FanPFPingzhi Fan
- Yongliang GuanYGYongliang Guan
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
Orthogonal time frequency space (OTFS) modulation scheme is based on a novel 2-dimensional modulation technique designed to transform the time-varying multi-path channel into a time invariant Delay- Doppler channel. In general, the Message Passing (MP) algorithm works well for data detection in OTFS, but its complexity is quite large. In this paper, a low complexity MP algorithm for data detection in OTFS is presented based on a Doppler compensation precoder and a modified stopping criterion. Besides, an improved Approximate Message Passing (AMP) algorithm based on covariance processing, having almost the same complexity as that of conventional AMP algorithm, but exhibiting better bit error rate(BER) performance is presented, as demonstrated by simulation results.Keywords
This publication has 7 references indexed in Scilit:
- Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space ModulationIEEE Transactions on Wireless Communications, 2018
- Low Complexity Modem Structure for OFDM-Based Orthogonal Time Frequency Space ModulationIEEE Wireless Communications Letters, 2017
- Orthogonal Time Frequency Space Modulation2017
- An Acoustic OFDM System with Symbol-by-Symbol Doppler Compensation for Underwater CommunicationThe Scientific World Journal, 2016
- On the convergence of approximate message passing with arbitrary matrices2014
- Low-complexity multiuser detection for uplink large-scale MIMO2014
- A message-passing algorithm with dampingJournal of Statistical Mechanics: Theory and Experiment, 2005