DC@UNIT 3 ppt.ppt

MATRUSRI ENGINEERING COLLEGE
DEPARTMENT OF ELECTRONICS COMMUNICATION
AND ENGINEERING
SUBJECT NAME: DIGITAL COMMUNICATION(PC601EC)-VI SEM
FACULTY NAME: Mr.A.ABHISHEK Reddy,Asst.Prof.
MATRUSRI
ENGINEERING COLLEGE

DIGITAL COMMUNICATION
COURSE OBJECTIVES:
1. Familiarize the students with elements of digital communication system and
waveform coding techniques like PCM, DPCM, DM and ADM.
2. Introduce the concepts of information theory and source coding
3. Familiarize the students with channel coding techniques such as LBC, BCC and
convolution codes
4. Introduce the concepts of baseband digital data transmission and analyze the
error performance of different digital carrier modulation schemes like ASK, FSK,
PSK etc.
5. Familiarize the students with the concepts of spread spectrum communication
with emphasis on DSSS and FHSS.
COURSE OUTCOMES:
CO1: Classify the different types of digital modulation techniques PCM, DPCM, DM
and ADM and compare their performance by SNR.
CO2: Illustrate the classification of channels and Source coding methods.
CO3:Distinguish different types of Error control codes along with their
encoding/decoding algorithms.
CO4: Examine the Performance of different Digital Carrier Modulation schemes of
Coherent and Non-coherent type based on Probability of error.
CO5:Generation of PN sequence using Spread Spectrum and characterize the
Acquisition Schemes for Receivers to track the signals.
MATRUSRI
ENGINEERING COLLEGE

LESSON PLAN:
UNIT III- Channel Coding
MATRUSRI
ENGINEERING COLLEGE
S. No. Topic(S)
No.
of Hrs
Relevant
COs
Text Book/
Reference
Book
1. Types of transmission errors, need for error control
coding
01 CO3 T2,R1,R3
2. Linear Block Codes (LBC): description of LBC, generation 01 CO3 T2,R1,R3
3. Syndrome and error detection, Minimum distance of
Linear block code
02 CO3 T2,R1,R3
4. error correction and error detection capabilities,
Standard array and syndrome decoding, Hamming codes.
02 CO3 T2,R1,R3
5. Binary cyclic codes (BCC): Description of cyclic codes,
encoding
01 CO3 T2,R1,R3
6. decoding and error correction using shift registers 01 CO3 T2,R1,R3
7 Convolution codes: description, encoding 01 CO3 T2,R1,R3
8 code tree, state diagram 01 CO3 T2,R1,R3
TOTAL 10

TEXT BOOKS /REFERENCES
TEXT BOOKS:
1. Simon Haykin, “Communication systems” 4/e, Wiley India 2011
2. Sam Shanmugam K, “Digital and Analog Communication systems”,
Wiley 1979.
3. B.P.Lathi, “Modern digital and analog communication systems” 3/e,
OxfordUniversityPress. 1998.
4. Leon W.Couch II., Digital and Analog Communication Systems, 6th Edn,
Pearson Education inc., New Delhi, 2001.
5. R.E.Zimer&R.L.Peterson : Introduction to Digital Communication, PHI,
2001.
REFERENCES:
1. P. Ramakrishna Rao, “Digital Communication”, TMH, 2011.
2. Dr. Sanjay Sharma, “Digital and Analog Communication”, Mc Graw
Hill Publication, 2009.
3. Bernard Sklar “Digital Communications – Fundamentals and
Applications” / 2nd Edition, Prentice Hall.
4. John G. Proakis” Digital Communications” Fourth Edition (textbook)
McGraw Hill.
MATRUSRI
ENGINEERING COLLEGE

UNITIII-Channel Coding:
types of transmission errors, need for error control coding, linear
block codes (LBC): description of LBC, generation, syndrome and
error detection, minimum distance of linear block code, error
correction and error detection capabilities, standard array and
syndrome decoding, hamming codes. binary cyclic codes (bcc):
description of cyclic codes, encoding, decoding and error
correction using shift registers. convolution codes: description,
encoding – code tree, state diagram.
UNIT-III
OUTCOMES:
Distinguish different types of Error control codes along with their
encoding/decoding algorithms.
MATRUSRI
ENGINEERING COLLEGE

CONTENTS:
- Channel Coding: Introduction
- Types Of Transmission Errors
- Need For Error Control Coding
-Classification of codes
OUTCOMES:
Understanding the need for error control coding techniques with
block diagram and different types of codes.
MODULE-I
MATRUSRI
ENGINEERING COLLEGE

INTRODUCTION
In any digital communication system, the two important desirable features are the
higher transmission rate and good reliability (i.e., Low probability of error).
To achieve these features baseband coding techniques are used.
There are two types of baseband coding.
Source coding and
channel coding.
Source coding is used for an efficient representation of data generated by a
discrete source.
Channel coding is used for the reliable transmission of digital
information over the channel. Channel coding methods introduce controlled
redundancy in order to provide error detecting and correcting capability to the
data being transmitted. Hence channel coding is also called as error control
coding.
Channel Coding
MATRUSRI
ENGINEERING COLLEGE

Depending upon the nature of the noise, the codewords transmitted
through the channel is affected differently.
There are mainly two types of errors introduced during data transmission.
1) Random error
2) Burst error.
Both random error and burst errors occur in the contents of a message.
Hence they may also be referred to as “content errors”.
Alternatively, it is possible that a data block may be lost in the network as
it has been delivered to a wrong destination. It is referred as the “flow
integrity error”.
Types of Transmission errors
MATRUSRI
ENGINEERING COLLEGE

* The primary communication resources are the transmitted signal power
and channel bandwidth.
* These two parameters, together with the power spectral density of
receiver noise, determine the signal energy per bit-to-noise power density
ratio, Eb/No.
* This ratio Eb/No uniquely determines the probability of error (Pe) or bit
error rate (BER), for a particular modulation scheme.
* The channel induced noise can introduce errors in the transmitted
binary data. i.e., A bit 0 may change to bit 1 or a bit 1 may change to bit 0.
The reliability of data transmission gets severely affected because of these
errors.
Need for Error Control Coding
MATRUSRI
ENGINEERING COLLEGE

The channel encoder adds extra bits (redundancy) to the message bits in a
controlled manner. The encoded signal is modulated and then transmitted over
the noisy channel.
After demodulation, the channel decoder identifies the redundant bits
and uses them to detect and correct the errors in the message bits. Thus the
errors introduced due to channel noise are minimized by channel coding.
Drawbacks of channel coding
* The addition of redundant bits in the coded messages, increases the required
transmission bandwidth.
* The use of coding adds complexity to the communication system.
Therefore, the design trade-offs in the use of error control coding to
achieve acceptable error performance must include consideration of bandwidth
and system complexity.
Digital Communication System with Channel Coding
MATRUSRI
ENGINEERING COLLEGE

TYPES OF CODES
MATRUSRI
ENGINEERING COLLEGE

1. Why coding of information required?
2. Define “error”. Write the cause for its occurrences in digital
communication systems with different types.
3. Explain the block diagram of Digital communication system with
channel coding.
Questions & Answers
MATRUSRI
ENGINEERING COLLEGE

CONTENTS:
Error control coding methods
Important terms used in Error Control Coding
Linear Block Codes (LBC): description of LBC,
Generation, syndrome and error detection,
Minimum distance of linear block code,
OUTCOMES:
Understanding Error Control Coding methods and generation &
detection of linear block codes along with Hamming codes.
MODULE-II
MATRUSRI
ENGINEERING COLLEGE

- The redundant bits added to the message are called check bits. Errors can be
detected and corrected with the help of these bits.
- The check bits reduce the data rate through the channel.
- It is not possible to detect and correct all the error in the received message.
Errors upto certain limit can only be detected and corrected.
There are two main methods used for error control coding. They are
1) Forward acting Error Correction (FEC)
2) Error detection with retransmission or Automatic Repeat Request (ARQ)
ERROR CONTROL CODING METHODS
MATRUSRI
ENGINEERING COLLEGE

STOP-AND-WAIT ARQ
Automatic Repeat Request (ARQ)
MATRUSRI
ENGINEERING COLLEGE

GO-BACK-N
MATRUSRI
ENGINEERING COLLEGE

SELECTIVE REPEAT
MATRUSRI
ENGINEERING COLLEGE

Codeword:
the encoded block of ‘n’ bits is called a codeword. It contains message bits (k) and
redundant check bits (q).
Block length: the number of bits ‘n’ after coding is called the block length of the
code.
Code rate: the code rate ‘r’ is defined as the ratio of message bits (k) and the
encoder output bits (n). Hence,
code rate, where 0 < r < 1 (3.1)
code vector: an ‘n’ bit code word can be visualized in an n-dimensional space as a
vector whose elements or co-ordinates are the bits in the code word.
TERMINOLOGIES
MATRUSRI
ENGINEERING COLLEGE

Code efficiency: the code efficiency is the ratio of the message bits to the
transmitted bits for that block by the encoder. Hence,
Weight of the code: the number of non-zero elements in the transmitted code
vector is called code vector weight.
Hamming distance: the hamming distance (d) between the two code vectors is
equal to the number of elements in which they differ. Eg. Let X = 101 and Y = 110.
Then hamming distance (d) between X and Y code vectors is 2.
Minimum hamming distance:
the smallest hamming distance between the valid code vectors is termed as the
minimum hamming distance (dmin).
MATRUSRI
ENGINEERING COLLEGE

MODULO-2 ARITHMETIC
1. ADDITION
Modulo-2 addition is an exclusive OR operation.
0 XOR 0 = 0
0 XOR 1 = 1
1 XOR 0 = 1
1 XOR 1 = 0
2. Multiplication
Multiplication of binary digits follows AND logic.
0 . 0 = 0
0 . 1 = 0
1 . 0 = 0
1 . 1 = 1
MATRUSRI
ENGINEERING COLLEGE

FUNCTIONAL DIAGRAM OF BLOCK CODER:
An (n, k) LBC is a said to be systematic if the k-message bits either appear at the
beginning of the codeword or at the end of the code word.
Linear Block Codes (LBC): Description of LBC
MATRUSRI
ENGINEERING COLLEGE

Message bits :
Parity bits:
Code Vector :
Generation of Linear Block Codes (LBC)
MATRUSRI
ENGINEERING COLLEGE
0 1 2 3 1 1
[ ] [m ,m ,m ,m ,......,m ]
k k
M  

0 1 2 3 1 1 ( )
[B] [b ,b ,b ,b ,......,b ]
n k n k
   

[ ]
C b m

0 1 2 3 1 0 1 2 3 1
[b ,b ,b ,b ,......,b ,m ,m ,m ,m ,......,m ]
n k k
  


Predetermined rule for finding parity bits :
P-matrix:
MATRUSRI
ENGINEERING COLLEGE
0 0 0,0 1 1,0 2 2,0 1 k 1,0
1 0 0,1 1 1,1 2 2,1 1 k 1,1
1 0 0,n k 1 1 1,n k 1 2 2,n k 1 1 k 1,n k 1
b m m m m
b m m m m
b m m m m
k
k
n k k
p p p p
p p p p
p p p p
 
 
           
    
    
    
0,0 0,1 0,n k 1
1,0 1,1 1,n k 1
( )
k 1,0 k 1,1 k 1,n k 1
[ ]k n k
p p p
p p p
P
p p p
 
 
 
    
 
 
 

 
 
 

Generator Matrix :
MATRUSRI
ENGINEERING COLLEGE
[ ] [ ] [ ]
k
C m P I m G
  
[G] [ ] [ ] [ ]
k k n k n k
P I or G I P
 
 
0,0 0,1 0,n k 1
0
1,0 1,1 1,n k 1
1
k 1,0 k 1,1 k 1,n k 1
1
1 0 0
0 1 0
[G]
0 0 1
k
k k identity matrix
P matrix
p p p
g
p p p
g
p p p
g
 
 
    



 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

The H-matrix is useful at the decoder of the receiver.
Parity Check Matrix[H]
MATRUSRI
ENGINEERING COLLEGE
( )
[ ] [ ]or[ ]
T T
n k n n k n k
H I P P I
   

( )
[H]
n k
T
n n k
I
P

 
 
 
  
 
 
[ ] [ ]or[ ]
k n k k
G P I I P
 
. 0
T
C H
 

Encoding Circuit of LBC.
MATRUSRI
ENGINEERING COLLEGE

EXAMPLE 1
The generator matrix for a block code is given below. Find all code vectors of this
code.
G =
Questions & Answers
MATRUSRI
ENGINEERING COLLEGE

CONTENTS:
-Syndrome and error detection,
-Minimum distance of linear block code,
-Error correction and error detection capabilities,
-Standard array and syndrome decoding,
-Hamming codes.
OUTCOMES:
Estimate the error using syndrome and correct .
MODULE-III
MATRUSRI
ENGINEERING COLLEGE

When R is received, the decoder computes the following operation.
Syndrome,
SYNDROME DECODING
MATRUSRI
ENGINEERING COLLEGE
0 1 2 1
. [s ,s ,s ,......,s ]
T
n k
S R H  
 

The error detection and correction capabilities of a coding technique
depend on the minimum hamming distance dmin
Error control capabilities
Error detection and correction capability of block codes
MATRUSRI
ENGINEERING COLLEGE
S.No.
Name of errors detected /
corrected
Distance requirement
1.
Detect upto ‘s’ errors per code
word
dmin ≥ s + 1
2.
Correct upto ‘t’ errors per code
word
dmin ≥ 2t + 1
3.
Correct upto ‘t’ errors and
detect s > t errors per code
word
dmin ≥ t + s+ 1

1. Determine the syndrome of the received vector R
2. Identify the coset with this syndrome and let its coset leader be an error
pattern e
3. Decode the received vector R into the code vector C =R+ e.
STANDARD ARRAY DECODING
MATRUSRI
ENGINEERING COLLEGE
T
S RH

2.

Hamming codes are (n, k) linear block codes. They can be generated either
systematically or non-systematically.
Systematic form of hamming codes
the systematic form of hamming codes satisfy the following conditions.
1) Number of check bits, q ≥ 3
2) Code word length, n = 2q – 1
3) Number of message bits, k = n – q
4) Minimum hamming distance, dmin = 3
5) since dmin = 3,
The error detection capability is
dmin ≥ s + 1 → 3 ≥ s + 1 → s ≤ 3 – 1 → s ≤ 2
The error correction capability is
dmin ≥ 2t + 1 → 3 ≥ 2t + 1 → 2t ≤ 2 → t ≤ 1
Hence by using hamming code, we can correct single bit errors and detect errors
in two bits.
Hamming Codes
MATRUSRI
ENGINEERING COLLEGE

1. The parity check matrix of a (7, 4) linear block code is given by
H =
i. Find the generator matrix (G).
ii. List all the code vectors.
iii. How many errors can be detected?
iv. How many errors can be corrected?
v. Draw the encoder circuit.
TRY IT?
MATRUSRI
ENGINEERING COLLEGE

2. Consider a data (message) block of 1 1 0 1. The hamming code adds three parity
bits to the message bits in such a way that both message bits and check bits get
mixed. The check bit locations are as shown below.
Here p1, p2 and p3 represent the parity check bits to be added. D represents the
data (message) bits.
MATRUSRI
ENGINEERING COLLEGE
1 2 3 4 5 6 7 ---> Bit location
P1 P2 D P3 D D D

CONTENTS:
- Binary cyclic codes (BCC): description of cyclic codes
- Encoding, decoding and
- Error correction using shift registers.
OUTCOMES:
Understanding generation & detection of Binary cyclic codes (BCC)
MODULE-IV
MATRUSRI
ENGINEERING COLLEGE

A cyclic code exhibits the following two properties.
(I) linearity property: A code is said to be linear if modulo-2 addition of any two
code words will produce another valid codeword.
(Ii) cyclic property: A code is said to be cyclic if every cyclic shift of a code word
produces another valid code word.
For example, consider the n-bit code word, X = (xn-1, xn-2, ….. x1, x0).
Binary Cyclic Codes (BCC)
MATRUSRI
ENGINEERING COLLEGE

Cyclically shifting ‘C’ ‘i’ places to the right is equivalent to cyclically
shifting C, (n-i) places to left. This property of cyclic codes allows us to
treat the elements of each code-vector as the coefficients of a polynomial
of degree (n-1) or less.
Representation of code words by a polynomial
MATRUSRI
ENGINEERING COLLEGE
0 1 2 3 1
C = (C ,C ,C ,C ,......,C )
n
(i)
1 1 0 1 1
C = [C ,C ,.....,C ,C ,C ,......,C ]
n i n i n n i
     
2 1
0 1 2 1
( ) C +C X+C X +.......+C n
n
C X X 



Systematic Encoding :
because X cannot be a factor of and minimum factor is (1+X)
Non-systematic :
C(X)=M(X)G(X).
MATRUSRI
ENGINEERING COLLEGE
Re ( )
( ) b( )
a( )
( ) ( )
n k
Quotient
mainder PARITY
X m X X
X
g X g X

 
( ) ( ) ( )
n k
C X b X X m X

  
2
0 1 2
g( ) +g X+g X +.......+g n k
n k
X g X 


0 g 1
n k
g 
 
1
n
X 

Systematic Encoding Using (n-k) shift register
MATRUSRI
ENGINEERING COLLEGE

Syndrome and Error Correction Using (n-k) shift register
MATRUSRI
ENGINEERING COLLEGE

Advantages of cyclic codes
- Cyclic codes can correct burst errors that span many successive bits.
- They have an excellent mathematical structure. This makes the design of error
correcting codes with multiple-error correction capability relatively easier.
- The encoding and decoding circuits for cyclic codes can be easily implemented
using shift registers.
- The error correcting and decoding methods of cyclic codes are simpler and easy
to implement. These methods eliminate the storage (large memories) needed for
lookup table decoding. Therefore the codes become powerful and efficient.
Disadvantages of cyclic codes
- Even though the error detection is simpler, the error correction is slightly more
complicated. This is due to the complexity of the combinational logic circuit used for
error correction.
Advantages & Disadvantages of cyclic codes
MATRUSRI
ENGINEERING COLLEGE

EXAMPLE 1
The generator polynomial of a (7, 4) cyclic code is g(p) = p3 + p + 1. Find all the
code vectors for the code in non-systematic form.
(i) consider any message vector as
M = (m3 m2 m1 m0) = (1 0 0 1)
(ii) consider another message vector as
M = (m3 m2 m1 m0) = ( 0 1 1 0 )
Questions & Answers
MATRUSRI
ENGINEERING COLLEGE
Example 2
The generator polynomial of a (7, 4) cyclic code is g(p) = p3 + p + 1. Find all the
code vectors for the code in systematic form by considering any message
vector as
M = (m3 m2 m1 m0) = (1 1 1 0 )

CONTENTS:
- Convolution codes: description
- Encoding – code tree
- State diagram.
OUTCOMES:
Understanding generation of Convolution codes with graphical
representations like code tree, state diagram etc.
MODULE-V
MATRUSRI
ENGINEERING COLLEGE

- In block coding, the encoder accepts a k-bit message block and
generates an n-bit code word. Thus code words are produced on a block-
by-block basis.
- Therefore, a buffer is required in the encoder to place the message
block.
- A subclass of tree codes is convolutional codes.
- The convolutional encoder accepts the message bits continuously and
generates the encoded codeword sequence continuously. Hence there is no
need for buffer.
-But in convolutional codes, memory is required to implement the encoder.
CONVOLUTIONAL CODES
MATRUSRI
ENGINEERING COLLEGE

Convolutional Encoder
MATRUSRI
ENGINEERING COLLEGE

Consider that the current message bit is shifted to position m0. Then m1 and m2 store
the previous two message bits. Now, by mod-2 adders 1 and 2 we get the new values of X1
and X2. We can write
X1 = m0 + m1 + m2 and X2 = m0 + m2
Convolutional Encoder redrawn alternatively
MATRUSRI
ENGINEERING COLLEGE

In this convolutional encoder, for every input message bit, two encoded
output bits X1 and X2 are transmitted. Hence number of message bits,
k = 1. The number of encoded output bits for one message bit, n = 2.
Code rate:
The code rate of this convolutional encoder is given by
Code rate, r =
where 0 < r < 1
MATRUSRI
ENGINEERING COLLEGE

Constraint length:
The constraint length (K) of a convolution code is defined as the number
of shifts over which a single message bit can influence the encoder
output. It is expressed in terms of message bits.
MATRUSRI
ENGINEERING COLLEGE
For the above convolutional encoder, constraint length is K = 3 bits.
Whenever a particular message bit enters the shift register, it remains in
the shift register for three shifts i.e.,
First shift → message bit is entered in position m0.
Second shift → message bit is shifted in position m1.
Third shift → message bit is shifted in position m2.
Constraint length ‘K’ is also equal to one plus the number of shift registers
required to implement the encoder.

Dimension of the code:
The code dimension of a convolutional code depends on the number of message
bits ‘k’, the number of encoder output bits, ‘n’ and its constraint length ‘K’. The
code dimension is therefore represented by (n, k, K).
For the encoder shown above, the code dimension is given by (2, 1, 3)
where n = 2, k = 1 and constraint length K = 3.
Graphical representation of convolutional codes
Convolutional code structure is generally presented in graphical form by the
following three equivalent ways.
1. By means of the state diagram
2. By drawing the code trellis
3. By drawing the code tree
These methods can be better explained by using an example.
MATRUSRI
ENGINEERING COLLEGE

Example problem
MATRUSRI
ENGINEERING COLLEGE
For the convolutional encoder given below in Figure,
determine the following.
a) Code rate b) Constraint length c) Dimension of the code
d) Represent the encoder in graphical form.

a) code rate:
the code rate, r = k/n
the number of message bits, k = 1.
The number of encoder output bits, n = 2.
Hence code rate, r = 1/2
b) constraint length:
constraint length, k = 1 + number of shift registers.
Hence k = 1 + 2 = 3
c) code dimension:
code dimension = (n, k, K) = (2, 1, 3)
hence the given encoder is of ½ rate convolutional encoder of dimension (2, 1, 3).
Solution
MATRUSRI
ENGINEERING COLLEGE

D) graphical form representation
The encoder output is X = (X1 X2 X1 X2 X1 X2….. And so on)
the mod-2 adder 1 output is x1 = m0 + m1 + m2
the mod-2 adder 2 output is x2 = m0 + m2.
We can represent the encoder output for possible input message bits in the form
of a logic table.
Solution
MATRUSRI
ENGINEERING COLLEGE
Input
Messag
e bit
Present State Next State
Encoder
Output
m0 m1 m2 m1 m2 X1 X2
A
0 0 0 0 0 0 0
1 0 0 1 0 1 1
B
0 1 0 0 1 1 0
1 1 0 1 1 0 1
C
0 0 1 0 0 1 1
1 0 1 1 0 0 0
D
0 1 1 0 1 0 1
1 1 1 1 1 1 0

- The encoder output depends on the current input message bit and the
contents in the shift register i.E., The previous two bits.
- The present condition of the previous two bits in the shift register may
be in four combinations. Let these combinations 00, 10, 01 and 11 be
corresponds to the states A, B, C and D respectively.
- For each input message bit, the present state of the m1 and m2 bits will
decide the encoded output.
- The logic table presents the encoded output X1 and X2 for the possible ‘0’
or ‘1’ bit input if the present state is A or B or C or D.
Solution
MATRUSRI
ENGINEERING COLLEGE

The state of a convolutional encoder is defined by the contents of the shift
register. The number of states is given by 2 k-1 = 23-1 = 22 = 4. Here K represents the
constraint length.
Let the four states be A = 00, B = 10, C = 01 and D = 11 as per the logic table. A
state diagram as shown in the figure 3.9 illustrates the functioning of the encoder.
1. State Diagram Representation
MATRUSRI
ENGINEERING COLLEGE

Suppose in the state A = 00.
i. At this state, if the incoming message bit is 0, the encoder output is X = (X1 X2) =
00. Then if the m0, m1 and m2 bits are shifted, the contents of the shift register will
also be in state A = 00. This is represented by a solid line path starting from A and
ending at A itself.
Ii. At the ‘A’ state, if the incoming message bit is 1, then the encoder output is X =
11. Now if the m0, m1 and m2 bits are shifted, the contents of the shift register will
become the state B = 10. This is represented by a dashed line path starting from A
and ending at B.
Similarly we can draw line paths for all other states, as shown in the above figure.
2. Code tree representation
•The code tree diagram is a simple way of describing the encoding procedure.
By traversing the diagram from left to right, each tree branch depicts the
encoder output codeword.
•Figure below shows the code representation for this encoder.
Continued with state diagram representation
MATRUSRI
ENGINEERING COLLEGE

2. Code Tree Representation
MATRUSRI
ENGINEERING COLLEGE

Advantages of convolutional codes:
- The convolutional codes operate on smaller blocks of data. Hence decoding
delay is small.
- The storage hardware required is less.
Disadvantages of convolutional codes:
- Due to complexity, the convolutional codes are difficult to analyze.
- These codes are not developed much as compared to block codes.
Advantages & Disadvantages of Convolutional Codes
MATRUSRI
ENGINEERING COLLEGE

Comparison between
Linear Block codes and Convolutional codes
MATRUSRI
ENGINEERING COLLEGE
Sl. No. Linear Block Codes Convolutional Codes
1. Block codes are generated by
X = MG (or)
X(p) = M(p) .G(p)
Convolutional codes are generated by
convolution between message sequencing and
generating sequence.
2. For a block of message bits, encoded
block (code vector) is generated
Each message bit is encoded separately. For
every message bit, two or more encoded bits
are generated.
3. Coding is block by block. Coding is bit by bit.
4. Syndrome decoding is used for most
liklihood decoding.
Viterbi decoding is used for most liklihood
decoding.
5. Generator matrices, parity check
matrices and syndrome vectors are
used for analysis.
Code tree, code trellis and state diagrams are
used for analysis.
6. Generating polynomial and generator
matrix are used to get code vectors.
Generating sequences are used to get code
vectors.
7. Error correction and detection
capability depends upon minimum
distance dmin.
Error correction and detection capability
depends upon free distance dmin.

Example 1
For the convolutional encoder given below in figure, determine the
following.
A) code rate b) constraint length c) dimension of the code d)
represent the encoder in graphical form.
Questions & Answers
MATRUSRI
ENGINEERING COLLEGE

Example 2
Explain tree diagram, trellis diagram and state transition diagram of
convolution codes.
Questions & Answers
MATRUSRI
ENGINEERING COLLEGE

DC@UNIT 3 ppt.ppt

More Related Content

Similar to DC@UNIT 3 ppt.ppt (20)

More from Matrusri Engineering College (7)

Recently uploaded (20)

DC@UNIT 3 ppt.ppt