Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Data Formats


Huffman Code

Example

Characteristics

Variants

Dynamic Huffman Code

Adaptive Huffman Code

Initialization

Algorithm

Table Code Tree

Update Procedure

New Symbols

Formats

Decoding

Update Code Tree

Decoding

Example


Glossary

Index


Download


www.BinaryEssence.com

Integration of New Symbols


Symbols not yet contained in the current tree will be encoded in the general form Huffman Code NYA (Not Yet Available) plus new symbol. Afterwards the code tree has to be udpated.


Flow chart integration of new symbols:



The table representing the code tree changes as follows (the symbol "a" is added):


Initial table:

                Successor
No. Pred. Cont. "0"  "1"  Weight
 3. Root  NYA    -    -      0

Generate new node for this symbol with the weight 1:

                Successor
No. Pred. Cont. "0"  "1"  Weight
 2.       "a"    -    -      1
 3. Root  NYA    -    -      0

Generate new node for NYA:

                Successor
No. Pred. Cont. "0"  "1"  Weight
 1.       NYA    -    -      0
 2.       "a"    -    -      1
 3. Root  NYA    -    -      0

Subordinate new nodes to the old NYA and continue with this node:

                Successor
No. Pred. Cont. "0"  "1"  Weight
 1.   3   NYA    -    -      0
 2.   3   "a"    -    -      1
 3. Root         1    2      0

Increment the weight of this node:

                Successor
No. Pred. Cont. "0"  "1"  Weight
 1.   3   NYA    -    -      0
 2.   3   "a"    -    -      1
 3. Root         1    2      1

Development of the code tree:



 <   ^   > 

Algorithm Adaptive Huffman Code Update Procedure Formats for New Symbols