Saddlepoint Approximations for Short-Packet Wireless Communications
Journal article, 2020

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.

short packets

finite-blocklength information theory

saddlepoint approximations

Fading channels

ultra-reliable low-latency communications

Author

Alejandro Lancho Serrano

Chalmers, Electrical Engineering, Communication and Antenna Systems, Communication Systems

Johan Östman

Chalmers, Electrical Engineering, Communication and Antenna Systems, Communication Systems

Giuseppe Durisi

Chalmers, Electrical Engineering, Communication and Antenna Systems, Communication Systems

Tobias Koch

Universidad Carlos III de Madrid

Gonzalo Vazquez-Vilar

Universidad Carlos III de Madrid

IEEE Transactions on Wireless Communications

1536-1276 (ISSN)

Vol. 19 7 4831-4846 9072306

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Communication Systems

Signal Processing

DOI

10.1109/TWC.2020.2987573

More information

Latest update

9/18/2020