Joint Channel Coding of Consecutive Messages with Heterogeneous Decoding Deadlines in the Finite Blocklength Regime
Abstract
A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption fails when messages rapidly arrive and reliability constraints require that the number of channel uses exceeds the time between arrivals. In this paper, we study channel coding in this setting by jointly encoding messages as they arrive while decoding the messages separately, allowing for heterogeneous decoding deadlines. For a scheme based on power sharing, we analyze the probability of error in the finite blocklength regime. We show that significant performance improvements can be obtained for short packets by using our scheme instead of standard approaches based on time sharing.
Domains
Information Theory [cs.IT]
Origin : Files produced by the author(s)