**Adaptive Huffman coding** (also called **Dynamic Huffman coding**) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data.

The benefit of one-pass procedure is that the source can be encoded in real time, though it becomes more sensitive to transmission errors, since just a single loss ruins the whole code.

## Algorithms

There are a number of implementations of this method, the most notable are **FGK** (Faller-Gallager-Knuth) and **Vitter** algorithm.

### FGK Algorithm

It is an online coding technique based on Huffman coding. Having no initial knowledge of occurrence frequencies, it permits dynamically adjusting the Huffman's tree as data are being transmitted. In a FGK Huffman tree, a special external node, called *0-node*, is used to identify a newly coming character. That is, whenever new data is encountered, output the path to the 0-node followed by the data. For a past-coming character, just output the path of the data in the current Huffman's tree. Most importantly, we have to adjust the FGK Huffman tree if necessary, and finally update the frequency of related nodes. As the frequency of a datum is increased, the* sibling property* of the Huffman's tree may be broken. The adjustment is triggered for this reason. It is accomplished by consecutive swappings of nodes, subtrees, or both. The data node is swapped with the highest-ordered node of the same frequency in the Huffman's tree, (or the subtree rooted at the highest-ordered node). All ancestor nodes of the node should also be processed in the same manner.

Since the FGK Algorithm has some drawbacks about the node-or-subtree swapping, Vitter proposed another algorithm to improve it.

### Vitter algorithm

Some important terminologies & constraints :-

**Implicit Numbering**: It simply means that nodes are numbered in increasing order by level and from left to right. i.e. nodes at bottom level will have low implicit number as compared to upper level nodes and nodes on same level are numbered in increasing order from left to right.**Invariant**: For each weight w, all leaves of weight w precede all internal nodes having weight w.**Blocks**: Nodes of same weight and same type (i.e. either leaf node or internal node) form a Block.**Leader**: Highest numbered node in a block.

Blocks are interlinked by increasing order of their weights.

A leaf block always precedes internal block of same weight, thus maintaining the invariant.

**NYT (Not Yet Transferred)** is special node and used to represents symbols which are *'not yet transferred'*.

algorithmfor adding a symbolisleaf_to_increment := NULL p := pointer to the leaf node containing the next symbolif(p is NYT)thenExtend p by adding two children Left child becomes new NYT and right child is the new symbol leaf nodep:= parent of new symbol leaf node leaf_to_increment := Right Child of pelseSwap p with leader of its blockif(new p is sibling to NYT)thenleaf_to_increment := pp:= parent of pwhile(p ≠ NULL)doSlide_And_Increment(p)if(leaf_to_increment != NULL)thenSlide_And_Increment(leaf_to_increment)

functionSlide_And_Increment(p)isprevious_p := parent ofpif(p is an internal node)thenSlide p in the tree higher than the leaf nodes of weight wt + 1 increase weight ofpby 1p:= previous_pelseSlide p in the tree higher than the internal nodes of weight wt increase weight ofpby 1p:= new parent ofp.

Encoder and decoder start with only the root node, which has the maximum number. In the beginning it is our initial NYT node.

When we transmit an NYT symbol, we have to transmit code for the NYT node, then for its generic code.

For every symbol that is already in the tree, we only have to transmit code for its leaf node.

#### Example

Encoding "abb" gives 01100001 001100010 11.

Step 1:

Start with an empty tree.

For "a" transmit its binary code.

Step 2:

NYT spawns two child nodes: 254 and 255, both with weight 0. Increase weight for root and 255. Code for "a", associated with node 255, is 1.

For "b" transmit 0 (for NYT node) then its binary code.

Step 3:

NYT spawns two child nodes: 252 for NYT and 253 for leaf node, both with weight 0. Increase weights for 253, 254, and root. To maintain Vitter's invariant that all leaves of weight w precede (in the implicit numbering) all internal nodes of weight w, the branch starting with node 254 should be swapped (in terms of symbols and weights, but not number ordering) with node 255. Code for "b" is 11.

For the second "b" transmit 11.

For the convenience of explanation this step doesn't exactly follow Vitter's algorithm,^{[1]} but the effects are equivalent.

Step 4:

Go to leaf node 253. Notice we have two blocks with weight 1. Node 253 and 254 is one block (consisting of leaves), node 255 is another block (consisting of internal nodes). For node 253, the biggest number in its block is 254, so swap the weights and symbols of nodes 253 and 254. Now node 254 and the branch starting from node 255 satisfy the SlideAndIncrement condition^{[1]} and hence must be swapped. At last increase node 255 and 256's weight.

Future code for "b" is 1, and for "a" is now 01, which reflects their frequency.

## References

- ^
^{a}^{b}"Adaptive Huffman Coding". Cs.duke.edu. Retrieved 2012-02-26.

- Vitter's original paper: J. S. Vitter, "Design and Analysis of Dynamic Huffman Codes", Journal of the ACM, 34(4), October 1987, pp 825–845.
- J. S. Vitter, "ALGORITHM 673 Dynamic Huffman Coding", ACM Transactions on Mathematical Software, 15(2), June 1989, pp 158–167. Also appears in Collected Algorithms of ACM.
- Donald E. Knuth, "Dynamic Huffman Coding", Journal of Algorithm, 6(2), 1985, pp 163–180.

## External links

- This article incorporates public domain material from the NIST document: Black, Paul E. "adaptive Huffman coding".
*Dictionary of Algorithms and Data Structures*. - University of California Dan Hirschberg site
- Cardiff University Dr. David Marshall site
- C implementation of Vitter algorithm
- Excellent description from Duke University