TY - GEN
T1 - Non-Asymptotic Performance for Finite Blocklength Coding over Nakagami-m Channels
AU - Zhang, Xi
AU - Zhu, Qixuan
AU - Poor, H. Vincent
N1 - Funding Information:
This work of Xi Zhang and Qixuan Zhu was supported in part by the U.S. National Science Foundation under Grants ECCS-1408601 and CNS-1205726, and the U.S. Air Force under Grant FA9453-15-C-0423. This work of H. Vincent Poor was supported in part by the U.S. National Science Foundation under Grants CCF-093970 and CCF-1513915.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - The fifth generation (5G) wireless networks are expected to provide a wide range of time-sensitive multimedia services and applications to satisfy users' stringent requirements on delay-bounded quality of service (QoS). Finite blocklength coding theory can efficiently address the issue of delay-bounded QoS constraint guarantees, where mobile users send messages using packets with small numbers of bits to achieve low latency transmissions. In this paper, we employ the Nakagami-m fading model to analyze channel coding performance in the finite blocklength regime, in terms of average block error rate, capacity outage probability, and symbol error probability. We first derive closed-form expressions for upper and lower bounds on the average block error rate. Then, we compare these bounds with the capacity outage probability and show that the average block error rate is larger than the capacity outage probability. We also obtain a lower-bound in closed-form for the symbol error probability under M-ary phase shift keying (MPSK). Finally, we validate and evaluate our derived average block error rate bound, capacity outage probability, and symbol error probability in the finite blocklength regime through numerical analyses.
AB - The fifth generation (5G) wireless networks are expected to provide a wide range of time-sensitive multimedia services and applications to satisfy users' stringent requirements on delay-bounded quality of service (QoS). Finite blocklength coding theory can efficiently address the issue of delay-bounded QoS constraint guarantees, where mobile users send messages using packets with small numbers of bits to achieve low latency transmissions. In this paper, we employ the Nakagami-m fading model to analyze channel coding performance in the finite blocklength regime, in terms of average block error rate, capacity outage probability, and symbol error probability. We first derive closed-form expressions for upper and lower bounds on the average block error rate. Then, we compare these bounds with the capacity outage probability and show that the average block error rate is larger than the capacity outage probability. We also obtain a lower-bound in closed-form for the symbol error probability under M-ary phase shift keying (MPSK). Finally, we validate and evaluate our derived average block error rate bound, capacity outage probability, and symbol error probability in the finite blocklength regime through numerical analyses.
KW - Finite blocklength coding
KW - Gamma function
KW - Nakagami-m Channel
KW - average block error rate
KW - bounds
KW - symbol error rate
UR - http://www.scopus.com/inward/record.url?scp=85070209253&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85070209253&partnerID=8YFLogxK
U2 - 10.1109/ICC.2019.8762019
DO - 10.1109/ICC.2019.8762019
M3 - Conference contribution
AN - SCOPUS:85070209253
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -