11/17/2014

Information Theory and Coding

ECE533

Linear Code
?
Cyclic Codes ?
?

Nikesh Bajaj
nikesh.14730@lpu.co.in
Digital Signal Processing, ECE Dept.
Lovely Professional University 2 By Nikesh Bajaj

Cyclic Code Cyclic Code

Cyclic Code Before we move to Detail of cyclic code we
Linear and should go around Finite Field (Modular
cyclic shift arithmetic or Abstract Algebra)
Ring
Polynomial in GF(q)
Deg, monic, + , * mod
Exp GF(3)

3 By Nikesh Bajaj 4 By Nikesh Bajaj

Abstract Algebra
GF(q)
Properties, Closure, Identity & Inverse
Field and Ring

Abstract Algebra

5 By Nikesh Bajaj 6 By Nikesh Bajaj

1
 11/17/2014

Field Theory Group

Infinite field Group <G, *>
Finite field Closure
Associative
Identity Element
Inverse Element
Commutative
Finite/Infinite Group and Order of G
Abelian Group +
Subgroup H < G
Proper /Improper subgroup
7 By Nikesh Bajaj 8 By Nikesh Bajaj

Properties of Finite Field GF(2), GF(3), GF(4)

Closure under addition Addition/ Multiplication table
Associativity of addition
Additive identity Concluding of summery of
properties
Additive inverse
Closure
Commutativity of addition
Additive identity

Additive inverse
Closure under multiplication
Multiplicative identity
Associativity of multiplication
Multiplicative Inverse
Distributive laws
No zero divisors
Commutativity of multiplication
Multiplicative identity
No zero divisors
9 Multiplicative Inverse By Nikesh Bajaj 10 By Nikesh Bajaj

What you should know? Cyclic Code

What is Field and Why we need it Division Algorithm
How to Verify whether given GF is valid filed P(x) = q(x)d(x) +r(x), d(x) =\ 0 deg(r) < deg(d)
or not Ex p(x) =x3 +x + 1 and d(x) = x2 +x+1
check GF(2), GF(3), GF(4), GF(5), GF(6) GF(7) Remainder Theorem
Make + and X table, check all properties Congruent Modulo
How to do computations in particular field
3+4 in GF(5) or 3+4 in GF(7)
in GF(11)

11 By Nikesh Bajaj 12 By Nikesh Bajaj

2
 11/17/2014

Question Cyclic Code

Ring : F[x] /f(x) : Set of poly.
Closure under
+ and *
For a(x) in Ring deg(a) < deg(f)
Addition and Multiplication table
F[x]/(x2 +x+1 ) and Field
F[x] /(x2 +1 ) Ring
Reducible/Irreducible and
Prime poly

13 By Nikesh Bajaj 14 By Nikesh Bajaj

Theorems Theorems
f(x) has linear factor (x-a) iff f(a) =0 Cyclic Code
xn -1 = (x-1)(xn-1 + x + 1) (1) a(x) +b(x) C % Closure
Ring F[x]/f(x) is Field iff f(x) is prime poly. (2) a(x) C r(x) Rn a(x)r(x) C % Cyclicshift

Example
Find factors of x3 -1 if GF(2) and GF(3)
Is f(x) = x3 + x +1 prime poly? GF(2) GF(3)
Cyclic shift of any poly.

15 By Nikesh Bajaj 16 By Nikesh Bajaj

Generating Poly Cyclic Code Matrix Representation

Generator poly. g(x) s.t. in Ring Rn g(x) = g0 + g1x +g2x2 + grxr
c(x) Code (n,k) c(x) = i(x)g(x)
deg(g) = deg(i) = deg(c) =
g(x) is factor of xn -1

Example: binary code for length 3

3 2
G=
Factor : x -1 = (x+1) (x + x +1)

g(x) = 1

= (x+1)
= (x+1) (x2+ x +1)
17 = x3 -1 By Nikesh Bajaj 18 By Nikesh Bajaj

3
 11/17/2014

Encoding Example
exp: 4.13/4.14
RB

19 By Nikesh Bajaj 20 By Nikesh Bajaj

Decoding Example
Parity check Poly h(x) s.t

c(x)h(x) =0
(c(x) +e(x))h(x) = e(x)h(x) =syndrome

21 By Nikesh Bajaj 22 By Nikesh Bajaj

Syndrome Decoding

23 By Nikesh Bajaj 24 By Nikesh Bajaj

4
 11/17/2014

CRC-Cyclic Redundancy Check CRC-Generation

Cyclic codes are special linear block codes with one extra property. In a
cyclic code, if a codeword is cyclically shifted (rotated), the result is
D k bit msg block
another codeword T n bit frame to be transmitted
F n-k bit FCS
P Predetermined divisor (n-k+1) bits

T = 2n-k D + F

25 By Nikesh Bajaj 26 By Nikesh Bajaj

Example
CRC- Encoding
D = 1010001101
P = 110101
T=? Or F=?

27 By Nikesh Bajaj 28 By Nikesh Bajaj

CRC-polynomial CRC-System

29 By Nikesh Bajaj 30 By Nikesh Bajaj

5
 11/17/2014

CRC-Standards CRC-Standards

31 By Nikesh Bajaj 32 By Nikesh Bajaj

Circuit Implementation
Circuit Implementation (FIR/IIR) Ref: TODD K MOON
Multiplying
Multiplying circuit
Ex: x8+ x6+ x5+ x3+ 1
Dividing circuit
Ex: x8+ x6+ x5+ x3+ 1
Dividing

33 By Nikesh Bajaj 34 By Nikesh Bajaj

Circuit Implementation
(Other approach) Ref: Ranjan Boss Circuit Implementation
Design circuit for Multiplication by
g(x)=x8+ x6+ x5+ x3+ 1

35 By Nikesh Bajaj 36 By Nikesh Bajaj

6
 11/17/2014

Circuit Implementation Circuit Implementation (Ref: Bose)

Design circuit for Dividing by Q: Design circuit to multiply any arbitary value ax2+bx+c
with (x2+x) in Field by Prime polynomial p(x)=x3+ x+1
g(x)=x8+ x6+ x5+ x3+ 1

37 By Nikesh Bajaj 38 By Nikesh Bajaj

Circuit Implementation Other class of Cyclic code

Q: Design circuit to multiply any arbitrary value ax2+bx+c Burst Error Correction code
with (x2+x) in Field by Prime polynomial p(x)=x3+ x2+1 Fire Code
Perfect Code
Golay Code

39 By Nikesh Bajaj 40 By Nikesh Bajaj

Ref: Ranjan Bose Ref: Ranjan Bose

Fire Code Golay Code

g(x) = (x2t-1 -1)p(x) over GF(q) Perfect Code

p(x) =prime polynomial over GF(q)

deg(p) = m >= t
p(x) does not divide (x2t-1 -1)
Block length = n such that g(x)| (xn -1) for smallest n
Correct all burst of length t or less
Exp: t = 3= m over GF(2) p(x) = x3 +x+1
g(x) = (x5 -1) p(x) =(x5 -1)(x3 +x+1) = x8 + x6 + x5 + x3 + x+1
deg (g) = n k = 8, Search n =35
Code(35,27)
41 By Nikesh Bajaj 42 By Nikesh Bajaj

7
 11/17/2014

Sphere and # vector Sphere

A sphere of radius t (0<=t<=n) contains vectors

Example: # of vector of distance 2 from a vector of length

4 in GF(2)
Hamming Bound or Sphere Packing Bound
MV <= qn

43 By Nikesh Bajaj 44 By Nikesh Bajaj

Ref: Ranjan Bose

Perfect Codes Golay Code

Perfect Code
Perfect Code is one which achieves the Hamming
Bound Binary code
MV = qn Ternary code

45 By Nikesh Bajaj 46 By Nikesh Bajaj

Coding Gain

47 By Nikesh Bajaj