Joint Framing and Finite-Blocklength Coding for URLLC in Multi-user Downlinks

Due to the stringent requirement of low-latency, Finite-Blocklength Coding (FBC) has been developed to guarantee reliability in Ultra-Reliable and Low-Latency Communications (URLLC). However, ensuring the reliability and latency of FBC for downlink transmissions has remained as an open issue for URL...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications (2003) s. 1 - 6
Hlavní autoři: Zhao, Xiaoyu, Chen, Wei, Poor, H. Vincent
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2020
Témata:
Delays
Downlink
Encoding
Markov processes
Power demand
Reliability
Resource management
ISSN:1938-1883
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Due to the stringent requirement of low-latency, Finite-Blocklength Coding (FBC) has been developed to guarantee reliability in Ultra-Reliable and Low-Latency Communications (URLLC). However, ensuring the reliability and latency of FBC for downlink transmissions has remained as an open issue for URLLC with random arrivals. In this paper, we focus on a multi-user downlink system with URLLC required. In the downlink transmission, we obtain a benefit on the reliability from a longer blocklength, generated by grouping and jointly encoding the multi-users' packets. By this means, a Joint Framing and Finite-Blocklength Coding (JF^{2} BC) scheme is proposed to provide the requirements of reliability and latency. In particular, considering the queueing effects for latency under random arrivals, we employ a cross-layer approach to characterize the JF^{2} BC policy. Under the queue-aware policy, we show an optimal tradeoff between the queueing delay and reliability by a Linear Programming (LP) problem, in which a matrix-based algorithm is developed to automatically generate the LP problem for the multi-user scenario. To optimize the tail distribution of queueing delay, we further extend the optimal tradeoff by using the violation probability of maximal queue length as the delay measure.
ISSN:1938-1883
DOI:10.1109/ICC40277.2020.9148847