Recognition: unknown
On Error Rate Analysis for URLLC over Multiple Fading Channels
classification
💻 cs.IT
math.IT
keywords
errormultiplerateurllcbinsboundfadingfind
read the original abstract
In this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used. From simulation results, we find that the bound is reasonably tight for wide ranges of signal-to-noise ratio (SNR) and the number of multiple bins. Thus, the derived bound can be used to determine key parameters to guarantee the performance of URLLC in terms of the packet error rate.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.