Problem
Research questions and friction points this paper is trying to address.
reliable communication systems
conflict between message arrival rates and communication quality
broadcast scenario with overlapping messages
Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability
🤖 AI Summary
To address performance bottlenecks of conventional time-division multiplexing (TDM) in ultra-reliable, low-latency broadcast scenarios—characterized by bursty message arrivals, overlapping transmission windows, and heterogeneous delay constraints (e.g., distinct decoding deadlines across receivers)—this paper pioneers the extension of Marton’s joint coding to the Gaussian broadcast channel under short-packet and heterogeneous latency requirements. Leveraging information-spectrum methods and second-order asymptotic analysis, we derive the first rigorous second-order achievable rate region, overcoming the limited applicability of classical capacity theorems under finite blocklengths. Theoretically, our scheme strictly outperforms TDM in the broadcast setting; it recovers the normal approximation in both point-to-point and parallel-channel degenerate cases; and the resulting rate bounds are directly deployable in practical systems.
📝 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 arrive rapidly and reliability constraints require that the number of channel uses exceed the time between arrivals. In this paper, we consider a broadcast setting in which a transmitter wishes to send two different messages to two receivers over Gaussian channels. Messages have different arrival times and decoding deadlines such that their transmission windows overlap. For this setting, we propose a coding scheme that exploits Marton's coding strategy. We derive rigorous bounds on the achievable rate regions. Those bounds can be easily employed in point-to-point settings with one or multiple parallel channels. In the point-to-point setting with one or multiple parallel channels, the proposed achievability scheme is consistent with the normal approximation. In the broadcast setting, our scheme agrees with Marton's strategy for sufficiently large numbers of channel uses and shows significant performance improvements over standard approaches based on time sharing for transmission of short packets.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Marton coding
time-overlapping communication
short-message transmission advantage
🔎 Similar Papers
No similar papers found.
