Outage Probability Analysis for OTFS with Finite Blocklength

2025-04-13

AI Summary

This work addresses the analytical challenge of characterizing the outage probability of Orthogonal Time Frequency Space (OTFS) modulation under finite blocklength constraints. We establish the first analytical framework by modeling OTFS transmission over multipath channels as an equivalent set of parallel additive white Gaussian noise (AWGN) channels and introducing an effective noise model tailored to time-frequency two-dimensional sparse channels. Tight lower bounds on the outage probability are derived for both equal power allocation and water-filling power allocation strategies. The analysis explicitly reveals how the number of resolvable propagation paths and the coding rate govern outage performance. Monte Carlo simulations confirm the accuracy and tightness of the derived bounds. This study fills a critical gap in the finite-blocklength theoretical analysis of OTFS outage behavior and provides computationally tractable, physically interpretable design guidelines for OTFS systems operating in short-packet communication scenarios.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Evaluation and Analysis
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Security and Privacy: Large-scale security measurements
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs

Abstract

Orthogonal time frequency space (OTFS) modulation is widely acknowledged as a prospective waveform for future wireless communication networks.To provide insights for the practical system design, this paper analyzes the outage probability of OTFS modulation with finite blocklength.To begin with, we present the system model and formulate the analysis of outage probability for OTFS with finite blocklength as an equivalent problem of calculating the outage probability with finite blocklength over parallel additive white Gaussian noise (AWGN) channels.Subsequently, we apply the equivalent noise approach to derive a lower bound on the outage probability of OTFS with finite blocklength under both average power allocation and water-filling power allocation strategies, respectively.Finally, the lower bounds of the outage probability are determined using the Monte-Carlo method for the two power allocation strategies.The impact of the number of resolvable paths and coding rates on the outage probability is analyzed, and the simulation results are compared with the theoretical lower bounds.

Problem

• Analyzes OTFS outage probability with finite blocklength
• Derives lower bounds for two power allocation strategies
• Examines impact of paths and coding rates on performance

Innovation

• Analyzes OTFS outage probability with finite blocklength
• Uses equivalent noise approach for lower bounds
• Compares simulation results with theoretical bounds