An encoding procedure and a decoding procedure for a new modified Huffman code

The conventional Huffman table, which stores a set of code words with different lengths, is difficult to construct. An easily constructed table that includes a code-length array and an encoding mapping array can accompany an encoding procedure to replace the conventional Huffman table. The code-length array records the number of code words of the same length, and the index of this array represents the code length. The encoding mapping array records the indexes of the probability vector for the corresponding symbols, with the elements of the probability vector in decreasing order. The code word generated by the encoding procedure is a new modified Huffman code that can be decoded by a simple procedure. The hardware structure for the encoding and decoding procedures is presented. The required maximum number of clock cycles for encoding and decoding are (N+1) and (N+2), respectively, where N is the number of symbols in the source alphabet. The encoding procedure can accompany the generation of the code-length array, replacing many Huffman tables required in the coding system with a time-varying probability vector. The algorithm has a good performance with respect to speed and memory requirements.<
>