Saddlepoint Approximations for Short-Packet Wireless Communications
arXiv:1904.10442 · doi:10.1109/TWC.2020.2987573
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.
32 pages, 7 figures. Submitted to the IEEE Transactions on Wireless Communications. Manuscript revised according to minor comments made by the reviewers
References in corpus (8)
- Finite Block-length Analysis of the Incremental Redundancy HARQ
- Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access
- Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels
- Coding in the Finite-Blocklength Regime: Bounds based on Laplace Integrals and their Asymptotic Approximations
- On the Evaluation of the Polyanskiy-Poor-Verdu Converse Bound for Finite Blocklength Coding in AWGN
- On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength
- Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis
- Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets
Cited by in corpus (8)
- Cell-Free Massive MIMO for URLLC: A Finite-Blocklength Analysis
- A Tutorial on Ultra-Reliable and Low-Latency Communications in 6G: Integrating Domain Knowledge into Deep Learning
- Spectral and Energy Efficiency Maximization of MISO STAR-RIS-assisted URLLC Systems
- The Sphere Packing Bound For Memoryless Channels
- Efficient evaluation of the error probability for pilot-assisted URLLC with Massive MIMO
- A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses
- Reliable and Secure Short-Packet Communications
- Polar-Coded Non-Coherent Communication