# Saddlepoint Approximations for Short-Packet Wireless Communications

## TL;DR

This paper introduces saddlepoint approximations for bounds on the maximum coding rate in short-packet wireless communications, enabling efficient and accurate evaluation for practical SNRs and blocklengths.

## Contribution

The paper develops saddlepoint approximation methods for nonasymptotic bounds in wireless channels, improving computational efficiency and accuracy over existing numerical evaluations.

## Key findings

- Approximations are accurate for SNR as low as 0 dB.
- Effective for blocklengths of 168 channel uses or more.
- Significantly reduces computational complexity.

## Abstract

In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information theory literature. While these bounds are accurate for many scenarios of interest, they need to be evaluated numerically for most wireless channels of practical interest, and their evaluation is computationally demanding. This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB and blocklengths of 168 channel uses or more.