A Mathematical Analysis on Error Propagation of EREC and Its Application to Optimal Channel-Matched Searching Pattern for Robust Transmission of Coded Video

Yong-Goo KIM  Yungho CHOI  Yoonsik CHOE  

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B   No.9   pp.2571-2587
Publication Date: 2007/09/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.9.2571
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Multimedia Systems for Communications
Keyword: 
error resilient entropy coding,  error propagation,  H.263,  video transmission,  

Full Text: PDF(551.7KB)>>
Buy this Article




Summary: 
The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.