unit v

ET707 contiool coding

channel coding theorem

hannon s
This is alsso
callead

Second theorm

Statement:
quall4 i fi kely
kely
Sourcce of M
a inoimation
ainoTmation

GieneTat1ng
M>>1
messages ehannel capaciky
.

With
ate R channel
at
S t a t e mend i
Ss
mend
C th
t hi
iss SLate
c o n d i t i o n fo
The

R C
ess
than
ehanne Capacity

Rate is acroSS
transmit

We
f R2c When
of eTro7 messag
probab1lit4
the
channel . +ive channel
Statement 0f
This is theSta
is Small.

theoem
coding
Statement :

N egat 've
Whenn we
and
R7C

channel, PTObability
tTansmit
aCT OSS he
This ie the
is hish.
oeTO messaq Pe
4heorem,
neqative statement
of channel coding
 Linea block codes
Jinear bloch codes
4n
nurm bev of me sSo qe bi
LTanS rnit
b i t s is
With this ParitYche ck
along no 3 message
added In this,
biis are
eheck
bits and parity
and jound ou

ansnitied

ms biis
K -

bits added
n-k Par y c h e ck

at
o/P
channel =(n,k) block
Total bits Codes
Encoder

Systematic codes
Systematic c o d e s
bils a1e tTansmitk

of mesSage
number

while
while
l Coder Nex1
he Channe

messaqe bits
bi t s
and check bits
1 ansmiltin9
bY Sperate blocks.
tted
are ians mi
Syetematic codes
is Known
This t.a ehak 6.
(cnannel n-
bts cod

Linea codes
bits and
4n this, me s sag
paritylcheck bits linsarl y eombid

and tan sm it tzod Thss known as lh neas udo

 Since tne
they are inear we Call it
ineaY COdes 4n inear block odes
messa94 bits and check bits are
present
its a e esended in terms
Meseage
.mk
Vecto as m , , mz2
ve c t o s be 7ep7es ented
Che ck b i t in orm & can

as C C2 Ca
X aas
Tepresented in
block code is
inea
X mm, m2
c
n- k
be represented as
it can

fn Veco oTmat,

(Me
M h- biE
-

messaqe bit

c q -bits check vectooT

n matrix descTi ption

X= M G
, n bits
X c ode vector, 12 n
n- bits

k, k-b i t s
MAss aqe vect o
7 x
M
mairix, kx n
G= GeneraBor
fn tTms ma trix :

LM1,, T..
G IPang]xn
I I dentity matri kx k)
sub matiix
P kx 9
c Mp
m
PP Pia
CI,C2 Lm, m2

PTOblem PK Plk a Pra

n
nene7 ation ma t i x
to a 6,3) block
codes iG.given below. Find all the code
VectoTS
1
G

as kxn.
aenerator is T¢presented
matr ix

n 6 ,k3 9. n -k 3

Sub m a t r i
P

2 check bits

CMP
msg b i t s

M k bits 3 ids
c bits => q *n - k 6-3 3.

C =>3 bits
le, 2 J
Message bite

m m2
o
O mo m n ,Om4D

O
m m3 m , ma
m J

Ca

sn axo

compleBe code.
vee tor
check bits
MS bits m, 3
C2mm mm
Cm
m m2 m3 o I O

O oo olI

Iol1Ol

O
 codes
Hamming e ocde s

Hamnming
u,n,k) ine
block codes
ike inear

Hamminq copa
block codes
The conditions of
The
are listed beldw

check
bits (9)2 3
) No of
n2-
2) Bloc k length n-A

k n-9 :9-n
No o f ms9 bi ts
3) n-
dis !ance dmin :3
4) Minimum

Code Tate
n
n- -1/n

check matix H
parity qxn
ETTOY detection
amin 2 S +

COTrect i on bits
TTOT Co tTo Lorracted
dmin Z 2t+|

PTOble m;
check matriz of a Particular
1) The parit y
7,4 inea block code is 9iven y

o o
,
Find GeneTator' malzin

the code VectoYS

2) Lis al
is the minimum distance
3) what
27TO1S
coTTecled and
4) How many

detected ?

Parity ehe ck madrix LHJ:/p' .I

P
O

4x3

)P sub mairix .
P4xa
,k.

2 Gieneralor matTin.

n 7 ;K = 4

n - k =7-4 =3.

Ax7 [PaxaJ
 o o o
41
oo o
o
o
O

iti) code ve cio1s

3 k 4

Ce ,
[M3,», 4x3
Ce, [ m , . m
o

m,r® o
m,m, oOm, m Do6m

m,m 0m m, m,Dm4
m ,ma

M
ssaq (Cncoder o
fHamming eodes)
C m,O m6m

C m,m n

code wovd 9
o/p.
 here hola
-. c o d e Vecio7s
wei g d

check bits
code veclou weigh'
Msq vecto mm,, mPm
mPmr mm
m,@mP
m, "44
mm,
m ma 4
m,
3

O
O

o loIol 4

IO0 o 3
o
O

D
3

3
4) Misim 6
oloo
O
3
O
O
4
IO1olo
O

dmin hwix)J
Mini mum
dis tan ce
3

EoT detecion dmin z Z s+

3 2S+
 S

2
T 101G deteced

0TTeciion
dmin z t

2 2t
3 22t

2z

&TO wi1 be coITected.

Cyeic codes: called
also
codes a
y e i i c

of inear eodes.

ss
Sub cl a We TepTesernt

co
o dde
ess

In
cyeli ce but
b ut in
th
t he
e ease

= p o l y n o m i a l s .

of
With
the
he hep
e p r e S e n t
it using
we
codes

of line a
m a t r i d e s c T i p t i o n . coTTecting
eTTO7
eTTO

useful
fo
fo7

3 t
is

PopeT ties usng Polynomia)

are
we
de coders
de eode7S
since

calcula
calcul a
ttors
ors ,

Syndrome,

encode7 S,
implemented
ase 2asi ly eTIO

for
burst type
This is used
non S y s t e matic
S y s t e m a t ic

HeTe
aTe used

foms5

Defini tion; thhe

cyclie shift of
If every
ome other code
PToduce s

Code VictoT
code is called as eyelie
VectoT. Linear
Tinear
T inea code
because foT each cyele
c od
code
eode VectTs .
and P7oduee
is shifted

C, C2 near code
m
 din
each
cyele
m ma CC2 3o1 shifted,

codes a T e
m2 C2
m,
C

Two PTperties

ine arit y
2) eyelic Property
0 c y i c codes
Alg e b r i c
structuTes
a T e T e p 3 e s e n t e d

codes
Cyclic X,, Xo
*n-z
X Xn-i bit OTmat
as X, in
rtten
This ie it o s
We ean wite

n polynomia
n-

+Xp-aP P
LSB

MSB

Gneneration

xp) MIp) & p )

cyelie Cod polynomial

xlp) polynomial
tode
MCp1 Messaq

Gn Cp) -
Generating polynomial
polynomjal is P7oduced
Cy e i c Lo de

code
by multiplying mess ag

Polunomial and Gener ating Polynomia

 oblem the
for
Determina the en coded mes saq
usinq the
code
folloinq 8- bit data
CRC qenes ating polynomia
follouing
P(1zta4+z

Son
I 8

G p) P+pp
9n-Kk
4 4 ;

A
n
-3

opFpop0
MP) p 0 Pop°>

npPP'p.f
x P b y Mp)

p Mtp)p" (p' *p°+F

P P +P*P
MLp)P" +Ppa op*+ ep
Pooporo
top' op°
 Remaind47 o PMLp
GLp
p' P+p *ops*of 1op.
Pop,op
opop+op
nep) Ppp
P
P p+opp p"+p°+op" op
PP +op+op +op3+op0o
PPI

P P ' opopp*p° op*op-Dp

P'pP0.o|P fopo
Poop+op+P
plo

P P
S a m ed i g i x a m

P
PPo'
RemaindeP p+ P0p0
+opo
+ Praphop
P' or
dn bit omat
+p +oP+p7
P+o
-p3P7op-
 Cncoded neesagg
biis check bit s)
-(Moq
: 1 O o ioo )
l2
bit s
bits :

ncocde d
c o n v o l u t i o n
coder

Convo lution Encode7

inear bl ock
and
eodes
Cyelie and data encoded

- block codes
codes

in bocks

the equence
inpu
To Send
convolutional c
cood
dees
s

bit by bit

Sequtnce

a used
ave used
PPTOaches
Tuwo
) Time domain

2) Mata approach

is used in
in
algorihm
Vi terbi
s used to easil
coda =This alqo thm encodey
Convoludi on

Denition
combined.
a72
Num ber of in
of inputs
number of
s combi ned by ed
t

34 s Ombned uGing sh 7eqsler

inputs :
bits av 6tond in xed lengt
dopu
shift gisle
 combinad datas aTe com binsd

with modulo - 2 a dd ers and P is

taken. hat IP is called convolutional co.

7Since modulo -2 adder is

used i
iS equivalent to binaiy c o n v o l u t i o n 'Soo
bina4
i is called convolution coding ,
sht egistes
m
m m»
bi |+ D D
Adder c D) =

K:I

era 9°(P) ,+D n: 2

S m4 m, - 4 D*.

PTesern and Past ipu ts are combined

modu lo adde7 I P is produced

and using
by Switchn
Out put S PTOduced
Code Rate
no f msq bits

no of bits at
o/p
Dimension fthe Sode
Cn,k dimension of the cod.

constsain ength tk)

k no 0f ms9 i t s
PAoblem
2Tate

of the
Daw the diagram
With q e n e r a t o r polynomials

convolution a ancoder
And ccomput
omput
+D + D . And
and 9 CD) =

input Seq uence

4he encode7 Outpuat T

Caven
K ', n 3
7 V2
:
/n
Adde7 -
LD)
D

CAdde
CAdder 2 °/p
(a

AAdde7
A Dn: Diagram

m m
m
A d d e r - 2

O o 1

a) polynomia equation lhener ating Polynomiai

D I+D

P +P
9 CD +D+D

3cp 1+P +P
 3 Polynomial 2quation (Messaqi

m p I+0xp p Ixp*oxpt .iap

mp). PP
4) Adder oulpu
Modui
Adder I Op

p qP mP

:PPPP"r°:p°P
ipp p-p° )*p*p»p
(p*p Powe tevms ae
same =7
bo Modulo r=0

=Itptp +op++p*

Modulo Addea °p.

p pmp)
litp+pR (i* p+* +p").
.

PPr*P*p***p*p'4p°aP
1 p +p+p°)
+tpp*)+ (p°>p*) +1p*+F
+P+P7
) P+op°top* op >
op+p+P
tIo oo o I )

uiooo ooo )
,I1,10,c10,00, 1o,o,I, o{

Viterbi decoder
the of
decbaing
is the type
Viberbi

Which use
t7e tlis diaga
decodirng for the
t7elli c diaqam
O DTa w

given code
Viterbi gorthithm

= )St is a method of decoding

convolution codes

n this algoaithm w used to solve

detectioon fo convolution codes.

data erTo
decode to decode
Rere we use 4ellis
Te ceived data.
is
ctive of Vitesb>i algorit hm
The obje
thTo u g h the relliss
the bes Path
o ind
Teceived data bit
to the
that iS closegt

S e q u e n ce

a1e to be
The foilowing sieps
Viter bi alqoithm.
to sOlve
fol lo we d
Make Trellis Encode
Trellis en coder make trellis diaqman
fromn
to trellis
Match wei ghtag with Tespece

diaqram
minimum
Wei ght aq path on t l
Find

Ezample O Viter bi Algorithm

Step: T7ellis Encode

M.M Ma ilp
 iate ofih}de

mo rn
-4mput W o clock

data t h ed a i a
'/p f4om
ar
sh. fied

stata m,m
ne1

eurrent state m m

X, M, M,OM
a M .OM

M m
ma
O O

C.u en Stat
mo m
m, state

olp ,*
tep 2 Trelis Diaqsa nput
Snpu

State b D

State c o

State d i

o OL
l a tt a

State b

State c

State d iI
o

Bequen ca
Reeeive d data bit

oo oo
iven y o lo
S qiven
Decocded data bit Sequenca

SO th:Te 21TO in one bi

de codinq in vilerb. algori4h

durin9