TY - JOUR
T1 - Finite Blocklength Regime Performance of Downlink Large Scale Networks
AU - Hesham, Nourhan
AU - Chaaban, Anas
AU - Elsawy, Hesham
AU - Hossain, Jahangir
N1 - KAUST Repository Item: Exported on 2023-06-07
Acknowledged KAUST grant number(s): OSR-2018-CRG7-3734
Acknowledgements: This publication is based upon work supported by King Abdullah University of Science and Technology (KAUST) under Award No. OSR-2018-CRG7-3734.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2023/5/26
Y1 - 2023/5/26
N2 - Some emerging 5G and beyond use-cases impose stringent latency constraints, which necessitates a paradigm shift towards finite blocklength performance analysis. In contrast to Shannon capacity-achieving codes, the codeword length in the finite blocklength regime (FBR) is a critical design parameter that imposes an intricate tradeoff between delay, reliability, and information coding rate. In this context, this paper presents a novel mathematical analysis to characterize the performance of large-scale downlink networks using short codewords. Theoretical achievable rates, outage probability, and reliability expressions are derived using the finite blocklength coding theory in conjunction with stochastic geometry, and compared to the performance in the asymptotic regime (AR). Achievable rates under practical modulation schemes as well as multilevel polar coded modulation (MLPCM) are investigated. Numerical results provide theoretical performance benchmarks, highlight the potential of MLPCM in achieving close to optimal performance with short codewords, and confirm the discrepancy between the performance in the FBR and that predicted by analysis in the AR. Finally, the meta distribution of the coding rate is derived, providing the percentiles of users that achieve a predefined target rate in a network.
AB - Some emerging 5G and beyond use-cases impose stringent latency constraints, which necessitates a paradigm shift towards finite blocklength performance analysis. In contrast to Shannon capacity-achieving codes, the codeword length in the finite blocklength regime (FBR) is a critical design parameter that imposes an intricate tradeoff between delay, reliability, and information coding rate. In this context, this paper presents a novel mathematical analysis to characterize the performance of large-scale downlink networks using short codewords. Theoretical achievable rates, outage probability, and reliability expressions are derived using the finite blocklength coding theory in conjunction with stochastic geometry, and compared to the performance in the asymptotic regime (AR). Achievable rates under practical modulation schemes as well as multilevel polar coded modulation (MLPCM) are investigated. Numerical results provide theoretical performance benchmarks, highlight the potential of MLPCM in achieving close to optimal performance with short codewords, and confirm the discrepancy between the performance in the FBR and that predicted by analysis in the AR. Finally, the meta distribution of the coding rate is derived, providing the percentiles of users that achieve a predefined target rate in a network.
UR - http://hdl.handle.net/10754/692050
UR - https://ieeexplore.ieee.org/document/10137396/
U2 - 10.1109/twc.2023.3278573
DO - 10.1109/twc.2023.3278573
M3 - Article
SN - 1536-1276
SP - 1
EP - 1
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
ER -