Scribd
Upload
2 views6 pages

Source Coding

Uploaded by

manoharmarathe
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views6 pages

Source Coding

Uploaded by

manoharmarathe
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Source Coding & Data Compression

1- Basic Definitions
Source Coding is the representation of source symbols using
new alphabet to match the channel alphabet. Coding to binary
alphabet is most common source coding as in ASCII code to
match binary channel for example. Binary code alphabet {0,1}.
Also we may have Ternary code alphabet: {0,1, 2}, Quaternary
code alphabet: {0,1, 2,3 }, ….etc.
Source Coding Theorem: The source with entropy H(x)
can be represented efficiently with coded alphabet having
average length L as long as:
L ≥ H(x) (or Lmin=H(x) )
1
with H(x) and L have the same units.
2
3
2- Main Issues of Source Coding

Consider a source with five symbols as given in


the first two columns of the following table. Four
different source codes are suggested here. The
encoder assigns different codewords to each
symbol. Each codeword is represented by one or
more alphabet symbols “binary in the example”.
The entropy of the source is H(x) =1.875
Bits/Symbol.

4
5

You might also like