pith. machine review for the scientific record. sign in

arxiv: 1903.05804 · v1 · submitted 2019-03-14 · 💻 cs.IT · math.IT

Recognition: unknown

Queue-Aware Variable-Length Coding for Ultra Reliable Low Latency Communications with Random Arrival

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords codinglatencyvariable-lengtharrivalpresentedrandomurllcchannel
0
0 comments X
read the original abstract

With the phenomenal growth of the Internet of Things (IoT), Ultra Reliable Low Latency Communications (URLLC) has potentially been the enabler to guarantee the stringent requirements on latency and reliability. However, how to achieve low latency and ultra-reliability with the random arrival remains open. In this paper, a queue-aware variable-length channel coding is presented over the single URLLC user link, in which the finite blocklength of channel coding is determined based on the random arrival. More particularly, a cross-layer approach is proposed for the URLLC user to establish the optimal tradeoff between the latency and power consumption. With a probabilistic coding framework presented, the cross-layer variable-length coding can be characterized based on a Markov chain. In this way, the optimal delay-power tradeoff is given by formulating an equivalent Linear Programming (LP). By solving this LP, the delay-optimal variable-length coding can be presented based on a threshold-structure on the queue length.

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.