Sub-Trees Modification of Huffman Coding for Stuffing Bits Reduction and Efficient NRZI Data Transmission

In recent decades, image and video compression was widely used on network access. However, there are few researches focused on the behavior between data transmission and multimedia compression. Therefore, this paper considers this problem between the encoding of compression and transmission to develop a low bit rate transmission scheme based on Huffman encoding. The proposed method can balance “0” and “1” bits to save the issue by analyzing the probability of the miss match in the typical Huffman tree. Moreover, the proposed method also can modify the transitional tree under the same compression ratio. Experimental results show that the proposed method can reduce the stuffing bits to 51.13% of standard JPEG compression. Besides, the file size after the proposed encoding is the same with the original one. It is observed that the proposed method provides a way to reduce the transmitted bits under the same compression ratio.