TY - GEN
T1 - Analysis of Cross-Domain Message Passing for OTFS Transmissions
AU - Chong, Ruoxi
AU - Li, Shuangyang
AU - Wei, Zhiqiang
AU - Matthaiou, Michail
AU - Ng, Derrick Wing Kwan
AU - Caire, Giuseppe
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85216558538
U2 - 10.1109/ITW61385.2024.10806925
DO - 10.1109/ITW61385.2024.10806925
M3 - 会议稿件
AN - SCOPUS:85216558538
T3 - 2024 IEEE Information Theory Workshop, ITW 2024
SP - 424
EP - 429
BT - 2024 IEEE Information Theory Workshop, ITW 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE Information Theory Workshop, ITW 2024
Y2 - 24 November 2024 through 28 November 2024
ER -