Iterative Detection for Orthogonal Time Frequency Space Modulation with Unitary Approximate Message Passing

Abstract

The orthogonal time frequency space (OTFS) modulation has emerged as a promising modulation scheme for high mobility wireless communications. To harvest the time and frequency diversity promised by OTFS, some promising detectors, especially message passing based ones, have been developed by taking advantage of the sparsity of the channel in the delay-Doppler domain. However, when the number of channel paths is relatively large or fractional Doppler shift has to be considered, the complexity of existing detectors is a concern, and the message passing based detectors may suffer from performance loss due to the short loops involved in message passing. In this work, we investigate the design of OTFS detectors based on the approximate message passing (AMP) algorithm. In particular, AMP with unitary transformation (UTAMP) based detectors are developed, which enjoy the structure of the channel matrix and allow efficient implementation, e.g., by exploiting the property of block circulant matrix with circulant block (BCCB), the complexity of the UTAMP-based detector per symbol is in the order of the logarithm of OTFS block length. In addition, the estimation of noise variance is incorporated into the UTAMPbased detectors (while existing detectors assume perfect noise variance). Thanks to the robustness of UTAMP relative to AMP, the UTAMP-based detectors are able to deliver much better performance, and outperform state-of-the-art detectors significantly. The investigations are also extended to iterative joint detection and decoding in a coded OTFS system, where the OTFS detectors are integrated into a powerful turbo receiver, leading to a considerable performance gain.

Integrated Sensing and Communication-assisted Orthogonal Time Frequency Space Transmission for Vehicular Networks

“…Moreover, the alignment of the beams can affect the communication performance. From (34), the receive SNR at the i-th vehicle can be expressed as…”

“…On the other hand, after obtaining the channel estimates, an efficient detection algorithm is demanded for extracting the uplink information. Various detectors have been proposed in the literature, including the message passing algorithm [32], the variational Bayes [33], and the approximate message passing [34], which allow low-complexity implementations at the cost of moderate bit-error-rate (BER) performance degradation. However, all aforementioned detectors rely on the availability of perfect channel state information (CSI), which is overly optimistic.…”

Cross Domain Iterative Detection for Orthogonal Time Frequency Space Modulation

“…To solve this issue, the authors of [9] proposed a convergence guaranteed receiver based on the variational Bayes framework. An approximate message passing (AMP)-based approach was developed in [10], which can be efficiently implemented and can obtain the minimum mean square error (MMSE) detection performance with a reduced complexity. We notice that most of the existing works on the OTFS detection take advantage of the DD domain channel sparsity to reduce the detection complexity.…”