Abstract
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 . N 2 ). 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call