Statistical
Compressors
Concept
Algorithm
Example
Comparison (H vs. SF) |
The adjustment in code size from the Shannon-Fano to the
Huffman encoding scheme results in an increase of 7 bits to encode B, but a
saving of 14 bits when coding the A symbol, for a net savings of 7 bits. In
general, Shannon-Fano and Huffman coding will always be similar in size. However, Huffman
coding will always at least equal the efficiency of the Shannon-Fano method, and thus has
become the preferred coding method of its type (Nelson, 38).
|