Queue-Aware Finite-Blocklength Coding for Ultra-Reliable and Low-Latency Communications: A Cross-Layer Approach

To provide reliable transmissions with low-latency requirements, we focus on Finite-Blocklength Coding (FBC) in Ultra-Reliable and Low-Latency Communications (URLLC). However, ensuring the reliability and latency of FBC has remained an open issue in URLLC. In this paper, we develop a queue-aware FBC...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 21; no. 10; pp. 8786 - 8802
Main Authors: Zhao, Xiaoyu, Chen, Wei, Poor, H. Vincent
Format: Journal Article
Language:English
Published: New York IEEE 01.10.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To provide reliable transmissions with low-latency requirements, we focus on Finite-Blocklength Coding (FBC) in Ultra-Reliable and Low-Latency Communications (URLLC). However, ensuring the reliability and latency of FBC has remained an open issue in URLLC. In this paper, we develop a queue-aware FBC scheme under random arrivals. With the awareness of queue length, we employ variable-length coding to jointly encode packets, through which we obtain a benefit on reliability. Meanwhile, we optimize latency under a cross-layer approach, in which two classes of variable-length codes are investigated with resources allocated in the frequency and time domains, respectively. To obtain an optimal reliability-latency tradeoff under variable-length FBC, we first present the reliability and latency performance for single links based on a Constrained Markov Decision Process (CMDP). Providing reliability with a power allocation, we then obtain the optimal tradeoff by a Linear Programming (LP) problem, in which the probability of violation of the constraints on queue length and the number of transmitted packets is minimized under average constraints on resources. Moreover, we show an optimal threshold-based policy under Bernoulli arrivals. We finally consider some extensions of the optimal tradeoff for multi-user downlinks as well as single links with retransmission.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2022.3170088