A low-complexity rate allocation algorithm for joint source-channel video coding

Abstract

The problem of enabling robust video transmission over lossy networks has become increasingly important because of the growing interest in video delivery over unreliable channels such as wireless networks. The more the coding process relies on an intensive use of prediction to improve the coding gain, the more the reconstructed sequence proves to be sensitive to information losses. As a matter of fact, it is necessary to introduce some redundant data in order to increase the robustness of the coded bit stream. A possible solution can be found filling a matrix structure with RTP packets and applying a Forward Error Correction (FEC) code on its rows. However, the matrix size and the chosen FEC code affect the performance of the coding system. The paper proposes a novel adaptation technique that tunes the amount of redundant information included in the packet stream and differs from previously proposed solutions since it relies on the percentage of null quantized transform coefficients in place of the activity or the Mean Square Error (MSE). This strategy is then integrated in a joint source-channel coder rate allocation algorithm that shares the available bits between the H.264/AVC coder and the channel coder according to the significance of the frame in the decoding process. Experimental results show that the presented approach significantly improves the quality of the reconstructed sequences at the decoder with respect to activity-based strategies and requires a low computational complexity.