Submitted To:
Chitra Biswas
Lecturer, ETE ,FSET
Submitted By
Name : Ananda Mohan Shil
Roll : 15010324
Subject : Communication II
Department : EEE
Source Coding…
Channel Coding…
Huffman Coding….
Source Coding
In signal processing data compression ,source coding ,or
bit-rate reduction involves encoding information using fewer
bits than the original representation. Compression can be
either lossy or lossless. Lossless compression reduces bits
by identifying and eliminating statistical redundancy .No
information is lost in losses compression . Lossy
compression reduce bits by removing unnecessary or less
important information. The process of reducing the size of a
data file is referred as data compression. In the context of
data transmission, it is called source coding (encoding
done at the source of data before it is stored or
transmitted)
Discrete
memory
less
source
Source Encoder
Binary
sequence
Channel Coding
• In telecommunication, information, theory and coding
theory , forward error correction (FEC) or channel coding
is a technique used for controlling errors in data
transmission over unreliable or noisy communication
channels.The central idea is the sender encodes the
message in a redundant way by using an error-
correcting cede(ECC).
Huffman Encoding
The Huffman encoding proceeds as follows…
1) The source symbol is listed in order of decresaing
probability in two source symbols of lowest probability
are assigned a 0 and a 1. This part of the step is
referred to as a splitting stage.
2) These two source symbols are regarded as being
combines into a new source symbol with probability
equal to the sum of the two original probabilities. Of the
new symbol is placed in the list in accordance with is
value.
3) The procedure is repeated unti we are left with a final
list of source statistics(symbol) of only two for which a 0
and a 1 are assigned.
Source channel-huffman coding

Source channel-huffman coding

  • 2.
    Submitted To: Chitra Biswas Lecturer,ETE ,FSET Submitted By Name : Ananda Mohan Shil Roll : 15010324 Subject : Communication II Department : EEE
  • 3.
  • 4.
    Source Coding In signalprocessing data compression ,source coding ,or bit-rate reduction involves encoding information using fewer bits than the original representation. Compression can be either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy .No information is lost in losses compression . Lossy compression reduce bits by removing unnecessary or less important information. The process of reducing the size of a data file is referred as data compression. In the context of data transmission, it is called source coding (encoding done at the source of data before it is stored or transmitted)
  • 5.
  • 6.
    Channel Coding • Intelecommunication, information, theory and coding theory , forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels.The central idea is the sender encodes the message in a redundant way by using an error- correcting cede(ECC).
  • 7.
    Huffman Encoding The Huffmanencoding proceeds as follows… 1) The source symbol is listed in order of decresaing probability in two source symbols of lowest probability are assigned a 0 and a 1. This part of the step is referred to as a splitting stage. 2) These two source symbols are regarded as being combines into a new source symbol with probability equal to the sum of the two original probabilities. Of the new symbol is placed in the list in accordance with is value. 3) The procedure is repeated unti we are left with a final list of source statistics(symbol) of only two for which a 0 and a 1 are assigned.