The Community for Technology Leaders
Green Image
Issue No. 05 - May (2012 vol. 61)
ISSN: 0018-9340
pp: 666-675
Kai-Chao Yang , National Chip Implementation Center, Hsinchu
Jia-Shung Wang , National Tsing Hua University, Hsinchu
This paper presents an Unequal Error Protection (UEP) method for streaming media. Previous researches have shown that UEP rateless codes can provide a low-complexity solution for downloading scalable information. However, the randomized generator of rateless codes leads to uncertainty of decoding probability and decoding priority of input data, and thus it is not suitable for streaming applications. In this paper, a novel UEP method is presented for streaming media. The proposed method, which consists of a hierarchical coding graph as well as low-complexity encoding and decoding operations, preserves the advantage of the UEP rateless codes and characterizes the decoding probability and decoding priority by formulas. The proposed hierarchical coding graph guarantees that high-priority input data are recovered before low-priority ones, so important information can be recovered with low latency, low computation, and high probability. In addition, data in different layers of the proposed UEP are dependently encoded, so that data in different layers can help decode each other. For heterogeneous clients, the proposed UEP codes can help a decoder with recovery of different amount of information according to the network condition and computation ability. Besides, we also extend the proposed UEP codes to a rateless version for downloading of media. Compared with the previous finite-length and rateless UEP codes, our method can recover more high-priority data even in serious packet loss rate (PLR), and the decoding order of data can be assigned by the server.
Data communications, error control codes, network communications, redundant design.
Kai-Chao Yang, Jia-Shung Wang, "Unequal Error Protection for Streaming Media Based on Rateless Codes", IEEE Transactions on Computers, vol. 61, no. , pp. 666-675, May 2012, doi:10.1109/TC.2011.95
96 ms
(Ver 3.1 (10032016))