Elements of information theory
Elements of information theory
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Stabilizing Batch-Processing Networks
Operations Research
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Capacity of time-slotted ALOHA packetized multiple-access systems over the AWGN channel
IEEE Transactions on Wireless Communications
Multi-Layer Broadcasting over a Block Fading MIMO Channel
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
A rate-splitting approach to the Gaussian multiple-access channel
IEEE Transactions on Information Theory
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
Spectral efficiency of CDMA with random spreading
IEEE Transactions on Information Theory
Linear multiuser receivers: effective interference, effective bandwidth and user capacity
IEEE Transactions on Information Theory
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
IEEE Transactions on Information Theory
The throughput of hybrid-ARQ protocols for the Gaussian collision channel
IEEE Transactions on Information Theory
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
A broadcast approach for a single-user slowly fading MIMO channel
IEEE Transactions on Information Theory
Exploiting decentralized channel state information for random access
IEEE Transactions on Information Theory
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case
IEEE Transactions on Information Theory
Optimizing MIMO antenna systems with channel covariance feedback
IEEE Journal on Selected Areas in Communications
Combining queueing theory with information theory for multiaccess
IEEE Journal on Selected Areas in Communications
Hi-index | 754.84 |
A single-server queue concatenated with a multilayer channel encoder is considered. The main focus of this work is on minimization of the expected delay of a packet from entering the queue until completion of successful service. Tight bounds are derived for the expected delay for different numbers of coded layers. Numerical optimization is applied to find the optimal resource allocation minimizing the average delay. Similar bounds are also derived for the case of continuous layering. It is demonstrated that code layering may give pronounced performance gains in terms of delay, which are more impressive than those associated with throughput. This makes layering more attractive when communicating under stringent delay constraints.