Scribd
Upload
25 views

Generation OF Convolutional Code: by Group-5

This document describes the generation of convolutional codes by a group of students. Convolutional codes are error correcting codes characterized by three parameters: the number of output bits, number of input bits, and number of memory registers. The document provides an example of a (3,1,2) convolutional code and describes encoder designs including state diagrams, code trees, and trellis diagrams. It also outlines an algorithm to encode data using a convolutional code by updating the memory registers and calculating the output bits based on the input bit and memory contents.

Uploaded by

Sindhunil Paul
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Generation OF Convolutional Code: by Group-5

This document describes the generation of convolutional codes by a group of students. Convolutional codes are error correcting codes characterized by three parameters: the number of output bits, number of input bits, and number of memory registers. The document provides an example of a (3,1,2) convolutional code and describes encoder designs including state diagrams, code trees, and trellis diagrams. It also outlines an algorithm to encode data using a convolutional code by updating the memory registers and calculating the output bits based on the input bit and memory contents.

Uploaded by

Sindhunil Paul
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

GENERATION

OF
CONVOLUTIONAL
CODE
BY GROUP-5

GAURAV KUMAR(44)
SUBHRAJIT MAJUMDAR(46)
AYAN PAL(50)
SINDHUNIL PAL(51)
SUSHMA PATHAK(53)
ASIS PRASAD(54)
KUMAR AMIT PRATAP(55)
ROUNAK ROY(56)
CONTENTS

1 2 3 4

5 6 7 8
Coding

Source Coding Channel Coding

Huffman Cyclic Code


Coding

Convolutional Code
Shannon
Fano Coding
BCH Code

Linear Block Code


INTRODUCTION

Convolutional codes are characterized by three parameters : (n,k,m)


• n = number of output bits
• k = number of input bits
• m = number of memory registers
 Code Rate = k/n = number of input bits/number of output bits
 Constraint Length L = k(m-1) = number of bits in the encoder memory that affects
the generation of n output bits
EXAMPLE : (3,1,2) Convolutional Codes

INPUT
S1 S2 S3
S3 S2
0 0 -> a
0 1 -> b
1 0 -> c
m1 m2
1 1 -> d
ENCODED ELEMENTS
00 10

11 01

11 01

00 10
ENCODER DESIGNS

1. State diagram

2. Code tree

3. Trellis code
STATE DIAGRAM
CODE TREE
a = 00

b = 10

c = 01

Means 0
d = 11 Means 1

TRELLIS DIAGRAM
ALGORITHM
1) Start
2) Initialize the Memory Registers with zeros on reset. S1=0 S2=0 S3=0.
3) Store the incoming bit in memory register S_in. S_in = data_in.
4) After the input bit has arrived and datain is valid the operation starts and the output is
calculated as m1 = S_in + S1 + S2+ S3 and m2 = S_in+S1+S3;
5) Perform shifting operation S3=S2; S2=S1; S1=S_in;
6) Steps 2, 3 and 4 are repeated for the length of input data bits.
7) Stop

You might also like