Tunstall coding

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computer science and information theory, Tunstall coding is a form of entropy coding used for lossless data compression.

History[edit]

Tunstall coding was the subject of Brian Parker Tunstall's PhD thesis in 1967, while at Georgia Institute of Technology. The subject of that thesis was "Synthesis of noiseless compression codes" [1]

Its design is a precursor to Lempel-Ziv.

Properties[edit]

Unlike variable-length codes, which include Huffman and Lempel–Ziv coding, Tunstall coding is a code which maps source symbols to a fixed number of bits.[2]

Unlike typical set encoding, Tunstall coding parses a stochastic source with codewords of variable length.

It can be shown[3] that, for a large enough dictionary, the number of bits per source letter can be infinitely close to H(U), the entropy of the source.

Algorithm[edit]

The algorithm requires as input an input alphabet \mathcal{U}, along with a distribution of probabilities for each word input. It also requires an arbitrary constant C, which is an upper bound to the size of the dictionary that it will compute. The dictionary in question, D, is constructed as a tree of probabilities, in which each edge is associated to a letter from the input alphabet. The algorithm goes like this:

 D := tree of |\mathcal{U}| leaves, one for each letter in \mathcal{U}.
 While |D| < C:
   Convert most probable leaf to tree with |\mathcal{U}| leaves.

Example[edit]

Let's imagine that we wish to encode the string "hello, world". Let's further assume (somewhat unrealistically) that the input alphabet \mathcal{U} contains only characters from the string "hello, world" — that is, 'h', 'e', 'l', ',', ' ', 'w', 'o', 'r', 'd'. We can therefore compute the probability of each character based on its statistical appearance in the input string. For instance, the letter L appears thrice in a string of 12 characters: its probability is 3 \over 12.

We initialize the tree, starting with a tree of |\mathcal{U}|=9 leaves. Each word is therefore directly associated to a letter of the alphabet. The 9 words that we thus obtain can be encoded into a fixed-sized output of \lceil \log_2(9) \rceil = 4 bits.

Tunstall "hello, world" example — one iteration

We then take the leaf of highest probability (here, w_1), and convert it to yet another tree of |\mathcal{U}|=9 leaves, one for each character. We re-compute the probabilities of those leaves. For instance, the sequence of two letters L happens once. Given that there are three occurrences of letters followed by an L, the resulting probability is {1 \over 3} \cdot {3 \over 12} = {1 \over 12}.

We obtain 17 words, which can each be encoded into a fixed-sized output of \lceil \log_2(17) \rceil = 5 bits.

Tunstall "hello, world" example — two iterations

Note that we could iterate further, increasing the number of words by |\mathcal{U}|-1=8 every time.

Limitations[edit]

Tunstall coding requires the algorithm to know, prior to the parsing operation, what the distribution of probabilities for each letter of the alphabet is. This issue is shared with Huffman coding.

Its requiring a fixed-length block output makes it lesser than Lempel-Ziv, which has a similar dictionary-based design, but with a variable-sized block output.

References[edit]

  1. ^ Tunstall, Brian Parker (12,1967). Synthesis of noiseless compression codes. Georgia Institute of Technology. 
  2. ^ http://www.rle.mit.edu/rgallager/documents/notes1.pdf, Study of Tunstall's algorithm at MIT
  3. ^ [1], Study of Tunstall's algorithm from EPFL's Information Theory department