Coding in the Finite-Blocklength Regime: Bounds based on Laplace Integrals and their Asymptotic Approximations
arXiv:1511.04629 · doi:10.1109/TIT.2016.2616900
Abstract
In this paper we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi-Poor-Verdu, and are investigated under parallel AWGN channels, the AWGN channels, the BI-AWGN channel, and the BSC. The technique we use, which is a generalization of some recent results available from the literature, is to map the probabilities of interest into a Laplace integral, and then solve (or approximate) the integral by use of a steepest descent technique. The proposed results are particularly useful for short packet lengths, where the normal approximation may provide unreliable results.
29 pages, 10 figures. Submitted to IEEE Trans. on Information Theory. Matlab code available from http://dgt.dei.unipd.it section Download->Finite Blocklength Regime
References in corpus (2)
Cited by in corpus (20)
- List Decoding of Arikan's PAC Codes
- Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems
- Saddlepoint Approximations for Short-Packet Wireless Communications
- Spectral and Energy Efficiency Maximization of MISO STAR-RIS-assisted URLLC Systems
- Primitive Rateless Codes
- An Information-Theoretic View of Mixed-Delay Traffic in 5G and 6G
- Optimal Resource Allocation for Multi-user OFDMA-URLLC MEC Systems
- URLLC and eMBB Coexistence in MIMO Non-orthogonal Multiple Access Systems
- Frozen Set Design for Precoded Polar Codes
- Comprehensive Analysis on Exact Asymptotics of Random Coding Error Probability
- Deployment of Polar Codes for Mission-Critical Machine-Type Communication Over Wireless Networks
- Quantized Polar Code Decoders: Analysis and Design
- Comparison Between Asymmetric and Symmetric Channel-Based Authentication for MIMO Systems
- Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability
- Novel Joint Estimation and Decoding Metrics for Short-Block length Transmission Systems
- Nested Symmetric Polar Codes
- Latency and Reliability Trade-off with Computational Complexity Constraints: OS Decoders and Generalizations
- Faster-than-Nyquist Signaling in the Finite Time-Bandwidth Product Regime
- Beamforming Design for Multiuser uRLLC with Finite Blocklength Transmission
- Non-orthogonal HARQ for URLLC Design and Analysis