Publication: Saddlepoint Approximations for Short-Packet Wireless Communications
Loading...
Identifiers
Publication date
2020-07-10
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Impact
Export
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.
Description
This article was presented in part at the 2019 IEEE International Symposium on Information Theory, Paris, France, July 2019, and in part at the 2019 53rd Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, November 2019.
Keywords
Fading channels, Finite-blocklength information theory, Saddlepoint approximations, Short packets, Ultra-reliable low-latency communications
Bibliographic citation
IEEE Transactions on Wireless Communications, 19(7), Pp. 4831-4846