Computer Science – Information Theory
Scientific paper
2010-06-11
Computer Science
Information Theory
5 pages, 4 figures, conference
Scientific paper
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters. This gives a framework that allows a rigorous analysis of the queue as a function of the code rate. Most prior work in this area either ignores block-length (e.g., fluid models) or assumes error-free communication using finite codes. This work enables one to determine when such assumptions provide good, or bad, approximations of true behavior. Moreover, it offers a new approach to optimize parameters and evaluate performance. This can be valuable for delay-sensitive systems that employ short block lengths.
Chamberland Jean-Francois
Narayanan Krishna R.
Parag Parimal
Pfister Henry D.
No associations
LandOfFree
On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-644704