Cyclic Code.

Slides:



Advertisements
Similar presentations
Cyclic Code.
Advertisements

Error Control Code.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
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 )
15-853:Algorithms in the Real World
Information and Coding Theory
Cellular Communications
DIGITAL COMMUNICATION Coding
Error detection/correction FOUR WEEK PROJECT 1 ITEMS TO BE DISCUSSED 1.0 OVERVIEW OF CODING STRENGTH (3MINS) Weight/distance of binary vectors Error detection.
Transmission Errors1 Error Detection and Correction.
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,
Error detection and correction
Chapter 2 : Direct Link Networks (Continued). So far... Modulation and Encoding Link layer protocols Error Detection -- Parity Check.
7/2/2015Errors1 Transmission errors are a way of life. In the digital world an error means that a bit value is flipped. An error can be isolated to a single.
DIGITAL COMMUNICATION Coding
Error Detection and Correction Rizwan Rehman Centre for Computer Studies Dibrugarh University.
DIGITAL COMMUNICATION Error - Correction A.J. Han Vinck.
Channel Coding and Error Control
Channel Coding Part 1: Block Coding
Part.7.1 Copyright 2007 Koren & Krishna, Morgan-Kaufman FAULT TOLERANT SYSTEMS Part 7 - Coding.
COM342 Networks and Data Communications
Error Coding Transmission process may introduce errors into a message.  Single bit errors versus burst errors Detection:  Requires a convention that.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
1 SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Cyclic Codes.
Cyclic Code. Linear Block Code Hamming Code is a Linear Block Code. Linear Block Code means that the codeword is generated by multiplying the message.
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.
ECE453 – Introduction to Computer Networks Lecture 4 – Data Link Layer (I)
§6 Linear Codes § 6.1 Classification of error control system § 6.2 Channel coding conception § 6.3 The generator and parity-check matrices § 6.5 Hamming.
EE 430 \ Dr. Muqaibel Cyclic Codes1 CYCLIC CODES.
Channel Coding Binit Mohanty Ketan Rajawat. Recap…  Information is transmitted through channels (eg. Wires, optical fibres and even air)  Channels are.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Review.
10.1 Chapter 10 Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and.
Error Detection. Data can be corrupted during transmission. Some applications require that errors be detected and corrected. An error-detecting code can.
Some Computation Problems in Coding Theory
Error Detection and Correction
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
FEC Linear Block Coding
INFORMATION THEORY Pui-chor Wong.
Error Control Coding. Purpose To detect and correct error(s) that is introduced during transmission of digital signal.
1 Product Codes An extension of the concept of parity to a large number of words of data 0110… … … … … … …101.
Network Layer4-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing.
Reed-Solomon Codes Rong-Jaye Chen.
Exercise in the previous class (1) Define (one of) (15, 11) Hamming code: construct a parity check matrix, and determine the corresponding generator matrix.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Error Correction/Detection.
ECE 442 COMMUNICATION SYSTEM DESIGN LECTURE 10. LINEAR BLOCK CODES Husheng Li Dept. of EECS The University of Tennessee.
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
Modulo-2 Digital coding uses modulo-2 arithmetic where addition becomes the following operations: 0+0= =0 0+1= =1 It performs the.
Information and Coding Theory
Error Detection and Correction
Subject Name: COMPUTER NETWORKS-1
Communication Networks: Technology & Protocols
DATA COMMUNICATION AND NETWORKINGS
Chapter 10 Error Detection And Correction
II. Linear Block Codes.
Chapter 3 Digital Transmission Fundamentals
EEC-484/584 Computer Networks
Block codes. encodes each message individually into a codeword n is fixed, Input/out belong to alphabet Q of cardinality q. The set of Q-ary n-tuples.
DIGITAL COMMUNICATION Coding
Lecture 3 Digital Transmission Fundamentals
Transmission Errors Error Detection and Correction
Error Detection Neil Tang 9/26/2008
Error Detection and Correction
Transmission Errors Error Detection and Correction
CHAPTER 3: Cyclic and convolution codes
Types of Errors Data transmission suffers unpredictable changes because of interference The interference can change the shape of the signal Single-bit.
Chapter 10 Error Detection and Correction
Presentation transcript:

Cyclic Code

Linear Block Code Hamming Code is a Linear Block Code. Linear Block Code means that the codeword is generated by multiplying the message vector with the generator matrix. Minimum weight as large as possible. If minimum weight is 2t+1, capable of detecting 2t error bits and correcting t error bits.

Cyclic Codes Hamming code is useful but there exist codes that offers same (if not larger) error control capabilities while can be implemented much simpler. Cyclic code is a linear code that any cyclic shift of a codeword is still a codeword. Makes encoding/decoding much simpler, no need of matrix multiplication.

Cyclic code Polynomial representation of cyclic codes. C(x) = C_{n-1}x^{n-1} + C_{n-2}x^{n-2} + … + C_{1}x^{1} + C_{0}x^{0}, where, in this course, the coefficients belong to the binary field {0,1}. That is, if your code is (1010011) (c6 first, c0 last), you write it as x^6+x^4+x+1. Addition and subtraction of polynomials --- Done by doing binary addition or subtraction on each bit individually, no carry and no borrow. Division and multiplication of polynomials. Try divide x^3+x^2+x+1 by x+1.

Cyclic Code A (n,k) cyclic code can be generated by a polynomial g(x) which has degree n-k and is a factor of x^n-1. Call it the generator polynomial. Given message bits, (m_{k-1}, …, m_1, m_0), the code is generated simply as: In other words, C(x) can be considered as the product of m(x) and g(x).

Example A (7,4) cyclic code g(x) = x^3+x+1. If m(x) = x^3+1, C(x) = x^6+x^4+x+1.

Cyclic Code One way of thinking it is to write it out as the generator matrix So, clearly, it is a linear code. Each row of the generator matrix is just a shifted version of the first row. Unlike Hamming Code. Why is it a cyclic code?

Example The cyclic shift of C(x) = x^6+x^4+x+1 is C^1(x) = x^5+x^2+x+1. It is still a code polynomial, because it the code polynomial if m(x) = x^2+1.

Cyclic Code Given a code polynomial We have C^1(x) is the cyclic shift of C(x) and (1) has a degree of no more than n-1 and (2) divides g(x) (why?) hence is a code polynomial.

Cyclic Code So, to generate a cyclic code is to find a polynomial that (1) has degree n-k and (2) is a factor of x^n-1.

Generating Systematic Cyclic Code A systematic code means that the first k bits are the data bits and the rest n-k bits are parity checking bits. To generate it, you let where The claim is that C(x) must divide g(x) hence is a code polynomial. 33 mod 7 = 6. Hence 33-6=28 can be divided by 7.

Division Circuit Division of polynomials can be done efficiently by the division circuit. (just to know there exists such a thing, no need to understand it)

Remaining Questions for Those Really Interested Decoding. Divide the received polynomial by g(x). If there is no error you should get a 0 (why?). Make sure that the error polynomial you have in mind does not divide g(x). How to make sure to choose a good g(x) to make the minimum degree larger? Turns out to learn this you have to study more – it’s the BCH code.

Cyclic code used in IEEE 802 g(x) = x32 + x26 + x23 + x22 + x16 + x12 + x11 + x10 + x8 + x7 + x5 + x4 + x2 + x + 1 all single and double bit errors all errors with an odd number of bits all burst errors of length 32 or less

Other codes RS code. Block code. Used in CD, DVD, HDTV transmission. LDPC code. Also block code. Reinvented after first proposed 40 some years ago. Proposed to be used in 802.11n. Achieve close-to-Shannon bound Trellis code. Not block code. More closely coupled with modulation. Turbo code. Achieve close-to-Shannon bound.