Table of Contents
Fetching ...

Analysis of Cross-Domain Message Passing for OTFS Transmissions

Ruoxi Chong, Shuangyang Li, Zhiqiang Wei, Michail Matthaiou, Derrick Wing Kwan Ng, Giuseppe Caire

TL;DR

It is demonstrated that in convergence, the ultimate error performance of the CDID passing the a posteriori information can be characterized by two potential convergence points, which, interestingly, aligns with the matched filter bound.

Abstract

In this paper, we investigate the performance of the cross-domain iterative detection (CDID) framework with orthogonal time frequency space (OTFS) modulation, where two distinct CDID algorithms are presented. The proposed schemes estimate/detect the information symbols iteratively across the frequency domain and the delay-Doppler (DD) domain via passing either the a posteriori or extrinsic information. Building upon this framework, we investigate the error performance by considering the bias evolution and state evolution. Furthermore, we discuss their error performance in convergence and the DD domain error state lower bounds in each iteration. Specifically, we demonstrate that in convergence, the ultimate error performance of the CDID passing the a posteriori information can be characterized by two potential convergence points. In contrast, the ultimate error performance of the CDID passing the extrinsic information has only one convergence point, which, interestingly, aligns with the matched filter bound. Our numerical results confirm our analytical findings and unveil the promising error performance achieved by the proposed designs.

Analysis of Cross-Domain Message Passing for OTFS Transmissions

TL;DR

It is demonstrated that in convergence, the ultimate error performance of the CDID passing the a posteriori information can be characterized by two potential convergence points, which, interestingly, aligns with the matched filter bound.

Abstract

In this paper, we investigate the performance of the cross-domain iterative detection (CDID) framework with orthogonal time frequency space (OTFS) modulation, where two distinct CDID algorithms are presented. The proposed schemes estimate/detect the information symbols iteratively across the frequency domain and the delay-Doppler (DD) domain via passing either the a posteriori or extrinsic information. Building upon this framework, we investigate the error performance by considering the bias evolution and state evolution. Furthermore, we discuss their error performance in convergence and the DD domain error state lower bounds in each iteration. Specifically, we demonstrate that in convergence, the ultimate error performance of the CDID passing the a posteriori information can be characterized by two potential convergence points. In contrast, the ultimate error performance of the CDID passing the extrinsic information has only one convergence point, which, interestingly, aligns with the matched filter bound. Our numerical results confirm our analytical findings and unveil the promising error performance achieved by the proposed designs.
Paper Structure (11 sections, 29 equations, 6 figures)

This paper contains 11 sections, 29 equations, 6 figures.

Figures (6)

  • Figure 1: The block diagram for the Type-I CDID scheme.
  • Figure 2: The block diagram for the Type-II CDID scheme.
  • Figure 3: Evaluation of estimation bias before DD domain detection.
  • Figure 4: Heuristic state evolution and convergence trajectory with high Doppler shift at transmit ${\rm SNR}=15$ dB.
  • Figure 5: Performance comparison between Type I and Type II CDID schemes with different iterations in negligible Doppler shift scenarios.
  • ...and 1 more figures