An efficient and hardware-implementation-friendly algorithm for adaptive Huffman coding

Adaptive Huffman coding is preferred in communication systems due to its capability in real-time processing.An efficient algorithm for adaptive Huffman coding is presented.The new algorithm utilizes the similarity between the construction processes of the Huffman tree before and after symbol′s arrival,and updates much less nodes than Algorithm V to accomplish the code processing.Consequently,the complexity is significantly reduced,the space and time consuming is saved,and hence hardware implementation is greatly simplified.