Outage Probability Analysis for OTFS in Lossy Communications

TL;DR

This paper derives an exact and a lower bound expression for the outage probability of OTFS modulation in lossy, time-varying communication channels, providing theoretical insights and empirical validation through simulations.

Contribution

It introduces a novel analytical framework for outage probability in OTFS under lossy conditions, including a lower bound for practical computation.

Findings

Exact outage probability expression derived

Lower bound provides a computationally efficient performance limit

Monte-Carlo simulations validate theoretical results

Abstract

This paper analyzes the outage probability of orthogonal time frequency space (OTFS) modulation under a lossy communication scenario. First of all, we introduce the channel model and the vector form representation of OTFS this paper uses. Then, we derive an exact expression of the OTFS outage probability in lossy communication scenarios, using Shannon's lossy source-channel separation theorem. Because the channel is time-varying, calculating the exact outage probability is computationally expensive. Therefore, this paper aims to derive a lower bound of the outage probability, which can relatively easily be calculated. Thus, given the distortion requirement and number of the resolvable paths, we can obtain a performance limit under the optimal condition as a reference. Finally, the experimental results of outage probability are obtained by Monte-Carlo method, and compared with the theoretical results calculated by the closed-from expression of the lower bound.