Priority-Based Real-Time Stream Coding under Burst Erasures

Abstract

The real-time streams play an increasingly important role in both traditional and emerging networks. Whereas, transmitting such streams requires vast channel resources, posing a huge challenge to the networks. Motivated by this problem, this paper considers a real-time stream system, where realtime messages with different importance should be transmitted through a burst erasure channel, and be decoded by the receiver within a fixed delay. We introduce the concepts of Symmetric Real-time (SR) stream and Asymmetric Real-time (AR) stream according to the stream characteristics. Different from the classical Shannon capacity, the channel transmission capacities are derived for SR and AR streams respectively, which can be used to guide the design of efficient real-time stream coding approaches. The capacity for SR streams is shown asymptotically achievable with a Proportional Time-invariant Intra-session Code (PTIC). Moreover, a Maximum Time-invariant Intra-session Code (MTIC) is presented for AR streams, which can also asymptotically achieve the capacity. Finally, the performances of PTIC and MTIC are verified by simulation experiments.