Error control coding for wireless communication technologies

Slides:



Advertisements
Similar presentations
Finite Fields Rong-Jaye Chen. p2. Finite fields 1. Irreducible polynomial f(x)  K[x], f(x) has no proper divisors in K[x] Eg. f(x)=1+x+x 2 is irreducible.
Advertisements

BCH Codes Hsin-Lung Wu NTPU.
Cyclic Code.
Mathematics of Cryptography Part II: Algebraic Structures
Error Control Code.
296.3Page :Algorithms in the Real World Error Correcting Codes II – Cyclic Codes – Reed-Solomon Codes.
L. J. Wang 1 Introduction to Reed-Solomon Coding ( Part I )
Efficient Soft-Decision Decoding of Reed- Solomon Codes Clemson University Center for Wireless Communications SURE 2006 Presented By: Sierra Williams Claflin.
15-853:Algorithms in the Real World
Information and Coding Theory
2015/4/28System Arch 2008 (Fire Tom Wada) 1 Error Correction Code (1) Fire Tom Wada Professor, Information Engineering, Univ. of the Ryukyus.
CHANNEL CODING REED SOLOMON CODES.
Wireless Mobile Communication and Transmission Lab. Chapter 2 Block code ----BCH The Theory and Technology of Error Control Coding.
Announcements: Ch 3 quiz next week (tentatively Friday). Will include fields (today) Ch 3 quiz next week (tentatively Friday). Will include fields (today)Today:
DIGITAL COMMUNICATION Coding
Chapter 11 Algebraic Coding Theory. Single Error Detection M = (1, 1, …, 1) is the m  1 parity check matrix for single error detection. If c = (0, 1,
Chapter 4 – Finite Fields Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public.
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
Cyclic codes 1 CHAPTER 3: Cyclic and convolution codes Cyclic codes are of interest and importance because They posses rich algebraic structure that can.
1 S Advanced Digital Communication (4 cr) Cyclic Codes.
Part.7.1 Copyright 2007 Koren & Krishna, Morgan-Kaufman FAULT TOLERANT SYSTEMS Part 7 - Coding.
1 Channel Coding (II) Cyclic Codes and Convolutional Codes.
Monoids, Groups, Rings, Fields
1 SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Cyclic Codes.
Session 1 Stream ciphers 1.
15-853Page :Algorithms in the Real World Error Correcting Codes II – Cyclic Codes – Reed-Solomon Codes.
Chapter 4 – Finite Fields
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Chapter 8 Factors & The Greatest Common Factor
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
Reed Solomon Code Doug Young Suh Last updated : Aug 1, 2009.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Information and Coding Theory Cyclic codes Juris Viksna, 2015.
Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.
2016/2/14 1 Error Correction Code (1) Fire Tom Wada Professor, Information Engineering, Univ. of the Ryukyus.
15-499Page :Algorithms and Applications Cryptography II – Number theory (groups and fields)
Chapter 5.1 Notes Simplifying Polynomials Multiplying Polynomials Degree of a Polynomial Algebra 2.
Hardware Implementations of Finite Field Primitives
Multiplicative Group The multiplicative group of Z n includes every a, 0
Class Report 林格名 : Reed Solomon Encoder. Reed-Solomom Error Correction When a codeword is decoded, there are three possible outcomes –If 2s + r < 2t (s.
V. Non-Binary Codes: Introduction to Reed Solomon Codes
Fast vector arithmetic over GF(3) Kris Coolsaet Department of Applied Mathematics and Computer Science, Ghent University, Belgium Fq10 – 12/07/2011.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:
Information and Coding Theory
Mathematical Background: Extension Fields
Polynomials and Factoring
15-853:Algorithms in the Real World
FIRST REVIEW.
Representation Theory
Error control coding for wireless communication technologies
CHAPTER 3: Cyclic and convolution codes
Introduction to Reed-Solomon Coding ( Part II )
DIGITAL COMMUNICATION Coding
Cyclic Code.
Error control coding for wireless communication technologies
Finite Fields Rong-Jaye Chen.
I. Finite Field Algebra.
Error Trapping on LFBSR
Error Correction Code (1)
Erasure Correcting Codes for Highly Available Storage
Error control coding for wireless communication technologies
Cryptology Design Fundamentals
Transmission Errors Error Detection and Correction
Error Correction Code (1)
CHAPTER 3: Cyclic and convolution codes
296.3:Algorithms in the Real World
Chapter 10 Error Detection and Correction
Mathematical Background: Extension Finite Fields
Presentation transcript:

Error control coding for wireless communication technologies Background material for Reed- Solomon and cyclic codes EU-USA Atlantis Programme FIT & Budapest University of Technology and Economics

p is prime number and given an irreducible polynom p(y) of degree m Algebra over GF(pm) p is prime number and given an irreducible polynom p(y) of degree m Field representation Elements p-ary representations Polynom 1 .

p is prime number and given an irreducible polynom p(y) of degree m Algebra over GF(pm) p is prime number and given an irreducible polynom p(y) of degree m Field representation Elements p-ary representations Polynom 1 . op

„Big” Field and „Small” Field Algebra over „Big” Field is reduced to the algebra over the „Small” Field ! ops on coefficents according to mod p

Algebra over GF(4) Field representation Irreducible polynom Elements of GF(4) Binary representation Polynomial representation (00) 1 (01) 2 (10) 3 (11)

Addition over GF(4) E.g.: Elements of GF(4) Binary representation Polynomial representation (00) 1 (01) 2 (10) 3 (11) E.g.: + 1 2 3

Multiplication over GF(4) Elements of GF(4) Binary representation Polynomial representation (00) 1 (01) 2 (10) 3 (11) E.g.: * 1 2 3

The primitive element of GF(4) and the power table Elements of GF(4) Binary representation Polynomial representation (00) 1 (01) 2 (10) 3 (11) E.g.: Power of the primitive elment 1 2 3

Representation of GF(8) Elements of GF(8) Binary representation Polynomial representation (000) 1 (001) 2 (010) 3 (011) 4 (100) 5 (101) 6 (110) 7 (111)

The power table Elements of GF(8) Polynomial form Prim.el. 1 2 y 3 y+1 1 2 y 3 y+1 4 5 6 7 E.g.

Multiplication by using the power table Elements of GF(4) Polynomial form Prim.el. 1 2 y 3 y+1 4 5 6 7 E.g.

Multiplication by Shift Registers over GF(8) E.g. multiply two with a general element From the power table we know that this is y+1 In the next tick of the clock signal

Example: multiplying 2 with 6 over GF(8) In the next tick of the clock signal Indeed: 2*6=7 over GF(8)

Multiplication by Shift Registers over GF(8) E.g. multiply four with a general element From the power table we know that this is From the power table we know that this is y+1 In the next tick of the clock signal

Multiplication of 4 with 6 over GF(8) In the next tick of the clock signal Indeed 4*6=5 over GF(8)

Suggested readings D. Costello: Error control codes, Wiley, 2005, Chapter 2

Expected Quiz questions Given a generator polynom of cyclic RS code and a message vector, generate the correponding codeword by polynom multiplication ! Carry out a multiplication over G(8) by using shift register.

Thank you for your attention !