Data Compression (RCS087)

Dictionary-based Coding
Techniques- Static Coding

Prepared By:
Dr. Swati Singh
Assistant Professor, CSE Deptt
IMS Engineering College, Ghaziabad
DR. A. P. J. ABDUL KALAM TECHNICAL UNIVERSITY, Uttar
Pradesh
 Agenda
 Dictionary
 Need of Dictionary
 Features of Dictionary Coding
 Static vs. Adaptive Dictionary
 Static Dictionary
 Digram Coding Example
 Dictionary-based Coding
Techniques
 In previous techniques, we observed those coding
techniques that assume a source that generates
a sequence of independent symbols.
 Most data sources are correlated, thus, the coding
step is generally preceded by a de-correlation step
(i.e. model prediction).
 Alternatively, we can build a list of commonly
occurring patterns and encode these patterns by
transmitting their index in the list known as-
 dictionary techniques.

3/31
 Features of Dictionary Coding
 Given an input source, we want to
 Identify frequent symbol patterns
 Encode those frequent symbol patterns more efficiently
 Use a default (less efficient) encoding for the rest of
symbol patterns
 the average bits per symbol gets smaller by Encoding
frequent symbol patterns
 In general, dictionary-based techniques works well
for highly correlated data (e.g. text), but less efficient
for data with low correlation.

4/31
 Static vs. Adaptive Dictionary
 The dictionary holds a list of strings of symbols and it
may be static or dynamic (adaptive)
 Static dictionary – permanent, sometimes allowing
the addition of strings but no deletions
 Dynamic dictionary – Temporary, holding strings that
are previously found in the input stream, this allows
additions and deletions of strings as and when new
input symbols are being read.

5/31
Static Dictionary
 A static dictionary is less complex, but the
probability of efficiency of a hit will highly
depends on the applications in which it is
used.
 For example-
 Applications like having student records in a university
is probably ok and can be solved using Static
Dictionary.
 The key for success of this technique is that- the
most common patterns are a small subset of all
possible messages
 Out of over 100,000 English words, probably only less
than 2,000 words are used in most writings i.e frequently6/31
used.
Simple Digram Coding- Example
 The source alphabet A = {a, b, c, d, r}
 Dictionary:

 Try to code the sequence abracadabra, the output is

101100110111101100000.

7/31


For Any Query/Doubt You can mail at

Swati.singh@imsec.ac.in
Thank You