First-passage time analysis for digital communication over erasure channels with delay-sensitive traffic


Conference Paper

This article explores the relation between queueing behavior and code-rate selection for digital communication over correlated erasure channels. The focus is on non-asymptotic system analysis, with finite block-lengths and non-vanishing probabilities of decoding failure. The transmit buffer is assumed to possess a given initial distribution and performance is evaluated in terms of the time required for the queue to become empty. Special attention is given to channel memory and its impact on the decoding process at the receiver. The system is ultimately defined in terms of a finite-state erasure channel. Using a Markov structure, the evolution of the transmit buffer is characterized and the distribution of the first-passage time to an empty queue is obtained. The proposed methodology is employed to optimally select code-rate. This provides new insights on the natural tradeoff between error protection and data content in the finite block-length regime. ©2010 IEEE.

Full Text

Duke Authors

Cited Authors

  • Chamberland, JF; Pfister, H; Shakkottai, S

Published Date

  • December 1, 2010

Published In

  • 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Start / End Page

  • 399 - 405

International Standard Book Number 13 (ISBN-13)

  • 9781424482146

Digital Object Identifier (DOI)

  • 10.1109/ALLERTON.2010.5706934

Citation Source

  • Scopus