7/12/2023 0 Comments Betterzip huffman codeLikewise, matching a symbol with codeword of length 4 both the level 1 and level 2 have to be searched. If there is any symbol with codeword of length 2, then it will be found in level 1 in the header tree. In the decoding phase, matching (two bits at a time) from encoded bit string with the header starts from level 1 in the header tree. Moreover, retrieving two bits at a time during decoding process also speeds up the process. The most frequent symbol is stored first in the header which confirms faster decoding. 2, it does not require to store the entire codeword in the header tree for a symbol. The structure of header tree for decoding is very simple for the proposed technique. For this reason, traversing time will be reduced for a petite tree. The height of a quaternary tree is always smaller than the height of a binary tree. Thus, the traversing time also depends on the height of the tree and frequency of different symbols. ( 1999) presented a fast decoding algorithm with \(O \left( \) = height constant To attain more decoding speed with compact memory size, Chen et al. He also proposed a fast decoding algorithm for this structure and claimed that the memory size can be reduced from \(3n - 2\) to \(2n - 3\), where n is the number of symbols. Chung ( 1997) introduced an array-based data structure for Huffman tree where the memory requirement is \(3n - 2\). He also conducted experiment on video data and found his method very efficient. In this new type of algorithm, he claimed that it required minimum storage whereas the speed for searching of symbol will be high. In another research, Hashemian ( 1995) introduced a new compression technique with the clustering algorithm. Katona and Nemetz ( 1978) investigated the connection between self-information of a source symbols and its codeword length. Schack ( 1994) described in his paper that codeword lengths of both Huffman and Shanon–Fano have similar interpretation. Since that time Huffman coding is not only popular in data compression but also image and video compression (Chung 1997). Huffman ( 1952) presented a coding system for data compression at I.R.E conference in 1952 and informed that no two messages will consist of same coding arrangement and the codes will be produced in such a way that no additional arrangement is required to specify where a code begins and ends once the starting point is known.
0 Comments
Leave a Reply. |