Binary Primitive BCH Codes. Decoding of the BCH Codes. Implementation of Galois Field Arithmetic. Implementation of Error Correction
|
|
- Scarlett Lambert
- 5 years ago
- Views:
Transcription
1 BCH Codes
2 Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes
3 Preface The Bose, Chaudhuri, and Hocquenghem (BCH) codes form a large class of powerful random error-correcting cyclic codes This class of codes is a remarkable generalization of the Hamming codes for multiple-error correction Binary BCH codes were discovered by Hocquenghem in 959 and independently by Bose and Chaudhuri in 960 Generalization of the binary BCH codes to codes in p m symbols (where p is a prime) was obtained by Gorenstein and Zierler Among the nonbinary BCH codes, the most important subclass is the class of Reed-Solomon (RS) codes Among all the decoding algorithms for BCH codes, Berlekamp s iterative algorithm, and Chien s search algorithm are the most efficient ones 3
4 Description of the BCH Codes 4
5 Binary Primitive BCH Codes m integer m 3, t, a binary BCH codes with m n Block length n k mt Number of parity-check digits d min t Minimum distance Clearly, this code is capable of correcting any combination of t or fewer errors in a block of n m digits We call this code a t- error-correcting BCH code The generator polynomial of this code m is specified in terms of its roots from the Galois field GF( ) m Let be a primitive element of GF( ) The generator poly g(x) of the t-error-correcting BCH code of length m is the lowestdegree poly over GF() which has 3 t as its roots 5
6 Binary Primitive BCH Codes t It follows from Theorem that g(x) has,,, and their i conjugates as all its roots Let i (x) be the minimal poly of Then g(x) must be the least common multiple (LCM) of x), ( x),, ( ), that is, ( t x If i is an even integer, it can be expressed as a product of the following form : l i i', ' l i i where i is an odd number and l Then ( ) is a conjugate ' ' i i i of and therefore and have the same minimal poly, that is, g( x) LCM ( x), ( x), ( x) t ( x) ( x) i i 6
7 Binary Primitive BCH Codes Hence, even power of has the same minimal poly as some preceding odd power of deg ( ) g( x) LCM ( x), ( x), ( x) i x m 3 t (Theorem 8 & 9) deg g( x) mt n k mt The BCH codes defined above are usually called primitive (or narrow-sense ) BCH codes 7
8 Binary Primitive BCH Codes The single-error-correcting BCH codes of length is generated by g( x) ( x) since t = m is a primitive element of GF( ) m x 0 ( ) is a primitive poly of degree m (,,, ) m the single-error-correcting BCH codes of length Hamming code m is a Ex 6 4 is a primitive element of GF( ) given by Table 8 4 such that 0 The minimal polynomials of α,α 3,α 5 are 8
9 Binary Primitive BCH Codes 9 9
10 Binary Primitive BCH Codes ( x) x x 3 5 ( x) x x x x ( x) x x The double-error-correcting BCH code of length n 4 5 is generated by g( x) LCM{ ( x), 3( x)} Since x) and ( ) are two distinct irreducible polynomials, ( 3 x g( x) ( x x x 4 x 4 6 )( x (5, 7) cyclic code with d 5 x 7 x x 8 min W ( g( x)) 5 d 5 min x 3 x 4 ) 0
11 Binary Primitive BCH Codes The triple-error-correcting BCH code of length 5 is generated by g( x) LCM ( x), ( x), ( x) It s a (5,5) cyclic code with ( x x )( x x x x )( x x ) x x x x x x d min 7Since W ( g( x)) 7, dmin 7 Let v( x) v v x v x n be a poly with v GF() 0 n t If v( x) has roots,,,, then v( x) is divisible by ( x), ( x),, ( x) (Theorem 4) t i v(x) is a code poly, g(x) v( x), g( x) LCM{ ( x), ( x),, ( x)} t
12 Binary Primitive BCH Codes We have a new definition for t-error-correcting BCH code: A binary n-tuple v ( v0, v, v,, vn ) is a code word if n and only if the poly v( x) v0 vx vn x t has,,, as roots, ie v( i ) v v v i i 0 v n ( n) i i ( v0, v, v,, v ) n 0 for i t ( n) i
13 3 Binary Primitive BCH Codes Let If v is a code word in the t-error-correcting BCH code, then The code is the null space of the matrix H and H is the parity-check matrix of the code ) ( ) ( ) ( ) ( H n t t n n 0 H v T
14 Binary Primitive BCH Codes j i j i is a conjugate of, then v( ) 0 iff v( ) 0 (Thm ) j-th row of H can be omitted As a result H can be reduced to the following form : H n ( ) ( ) ( ) ( ) n (t) t t n 只剩下奇數的 Row EX 6 double-error-correcting BCH code of length (5,7) code Let be a primitive element in 4 n 4 5, GF( ) 4
15 Binary Primitive BCH Codes The parity-check matrix is 4 H Using 5, and representing each entry of H by its 4- tuple, H (Note that the parity check matrix is not binary anymore)
16 Binary Primitive BCH Codes FACT: The t-error-correcting BCH code indeed has dmin t (pf): Suppose v 0 such that W(v) t Let v, v, v be the nonzero components of v (ie all ones) j j j T 0 vh ( v j v ) j v j 6 j j t j ( ) ( ) j j t j ( ) ( ) j j t j ( ) ( ) j j j t ( ) ( ) j j j t ( ) ( ) (,,) 0 j j j t ( ) ( )
17 Binary Primitive BCH Codes j j j ( ) ( ) j j j ( ) ( ) (,,) 0 j j j ( ) ( ) Taking out the common factor from each row of the determinant A A, a square matrix t 0 j j ( ) j ( ) j ( j j j ) 0 j ( ) j 7
18 Binary Primitive BCH Codes The determinant in the equality above is a Vandermonde determinant which is nonzero The product on the left-hand side of can not be zero This is a contradiction and hence our assumption that there exists a nonzero code vector v of W(v) t is invalid dmin t t+ is the designed distance of the t-error-correcting BCH code The true minimum distance of a BCH code may or may not be equal to its designed distance m Binary BCH code with length n can be constructed in the same manner as for the case n m (Theorem 9) m m Let be an element of order n in GF( ), n and g(x) be the t binary polynomial of minimum degree that has,,, as roots 8
19 Binary Primitive BCH Codes Let ( x), ( x),, t ( x) be the minimal poly of,, respectively then g(x) LCM{ ( x), ( x),, ( x)} t t n t n,,,, are roots of x n g( x) ( x ) We see that g(x) is a factor of The cyclic code generated by g(x) is a t-error-correcting BCH code of length n The number of parity-check dmin t digits mt X n If β is not a primitive element of GF( m ), the code is called a nonprimitive BCH code 9
20 General Definition of Binary BCH Codes General definition of binary BCH codes m GF( ), and consider 0 be any nonnegative integer l0 l0 l0 d0,,, For 0 i d0, let i (x), ni be the minimal poly and order of, respectively and the length of the code is Note that: 0 i g( x) LCM{ 0( x), ( x),, d ( x)} d n LCM n, n, n d d min 0 0 parity-check digits md ( ) 0 0 is capable of correcting ( d0 ) / or fewer errors (Proof is omitted and left as an exercise) 0 0
21 General Definition of Binary BCH Codes If we let l0 =, d0 = t+ and be a primitive element of ), the code becomes a t-error-correcting primitive BCH m code of length GF( m If we let l0 =, d0 = t+ and be not a primitive element of GF( m ), the code is a nonprimitive t-error-correcting BCH code of length n, which is the order of For a BCH code with designed distance d0, we require g(x) has d0 - consecutive powers of a field element as roots This guarantees that the code has dmin d0 This lower bound on the minimum distance is called the BCH bound In the rest of this chapter, we consider only the primitive BCH codes
22
23 3 Decoding of the BCH Codes Suppose that a code word v(x) = is transmitted and the transmission errors result : r(x) = Let e(x) be the error pattern Then For decoding, remember 0 n v n x x v x v v 0 n r n x x r r x r e(x) v(x) r(x) ) ( ) ( ) ( ) ( H n t t n n
24 The syndrome is t-tuple, S ( S, S, S T t H i i i n Let s r( ) r r r ( ) for i i ) 0 n r s can be evaluated by b ( x) R [ r( x)] i i ( x) ( x) is the minimal poly of i r( x) a ( x) ( x) b ( x) i i i i i s r( ) b ( ) i i i i t 4
25 EX64 Consider the double-error-correcting (5, 7) BCH code given in (from Ex6) If r ( ) r( x) x 8 ( x) ( x) ( x) x x 4 ( x) x x x x 3 ( x) 3 ( x) b ( x) R [ r( x)] x b ( x) R [ r( x)] x 3 4 s b ( ), s b ( ) s s 4 b ( ) 4 8 b( ) s (,,, ) (Note that syndrome is not binary anymore) 5
26 v i t s r e i i i ( ) 0 for ( ) ( ) Suppose i j j j e( x) x x x v 0 j j j n s s j j jv j j jv ( ) ( ) ( ) v s t ( ) ( ) j t jv t j j j where,, v are unknown Any method for solving these equations is a decoding algorithm for the BCH codes 6
27 Once j j j v the powers If the number of errors in e(x) is t or less, the solution that yields an error pattern with the smallest number of errors is the right solution For convenience, let location numbers,, have been found, j, j, j tell us the error locations in e( x) v s s s j, v v t t t t v v be the error Power-sum Symmetric function 7
28 Define ( x) ( x)( x)( x) = 0 x x x : error-location poly v v v The roots of ( x) are,, v, which are the inverses of the error location numbers 0 3 v v v v v 8
29 These coefficients are known as elementary symmetric functions i ' s are related to s ' s by Newton's identities s s 0 s 0 s s s j s s s v 0 v v v v s s s s 0 v v v v Note that, for binary case, 0, we have i for odd i i i 0 for even i 9
30 Consequently, if m,,, GF( ) v, then ( ) r v v v v j j j i i sj i i r r r r r r r v r r r Since 0 mod, r s 30
31 Consequently, the Newton s Identities can be simplified into t equations: s 0 s s s 3 3 s s s s s s s s s 0 t t t3 t t 3
32 The equations may have many solutions We want to find the solution that yields a σ(x) of minimal degree This σ(x) would produce an error pattern with minimum number of errors Decoding Procedure step Compute s ( s, s, s ) from r( x) t step Determine ( x) from step 3 Determine the error-location number,, by finding the roots of ( x) v and correct the errors in rx ( ) s 3
33 The first method for determing ( x) from Peterson s Algorithm s A s s s s 3 s4 s3 s s s 5 st4 st5 st6 st7 st s t3 t s t3 s s s s s s s t t3 t4 t5 t t t t s, s s s 3 3, 33
34 The second method: Berlekamps iterative algorithm Iterative Algorithm for finding ( x) i () i sx i e s Y i t ( t) ( x) ( x) N END Does the coeficients of () i satisfy the ( i ) th Newtons identity? Y ( i) ( i) correction term N ( i) ( i) ii a 34
35 How to add a correction term to () i? Let x x x ( ) ( ) ( ) ( ) be the minimum-degree poly determined at the step ( To determine ) ( x) => compute discrepancy ( ) ( ) ( ) d s s s s ( ) ( ) If d 0 ( x) ( x) If d 0, go back to the steps prior to the th step and determine ( ) ( x) st th discrepancy d 0, and has the largest value ( ) ( deg [ ( x)]) Then th is the minimum-degree poly whose coefficients satisfy the first Newton s identities th ( x) ( x) d d x ( x) ( ) ( ) ( ) ( ) 35
36 To carry out the iteration of finding σ(x), we begin with the following table: ( ) ( x) d 0-0 S 0 0 t 36
37 l μ is the degree of σ (μ) (X) If d μ =0, then σ μ (μ+) (X)= σ (μ) (X) and l μ+ = l μ If d μ 0, find another row ρ prior to the μth row such that d ρ 0 and the number ρ-l ρ in the last column of the table has the largest value Then σ (μ+) (X) is given by ( x) ( x) d d x ( x) ( ) ( ) ( ) ( ) and l μ+ = max(l μ, l ρ +μ-ρ) ( ) ( ) In either case, d s s s The polynomial σ (t) (X) in the last row should be the required σ(x) 37
38 Ex 65 Consider (55) triple-error-correcting BCH codes given in ex 6 (t=3) p( x) x x v 0 r x x x e ( x) ( x) ( x) x x ( x) ( x) x x x x ( x) x x
39 b ( x) R [ r( x)] ( x) 3 ( x) 5 ( x) b ( x) R [ r( x)] x x 3 b ( x) R [ r( x)] x s s s s s s s (,,,,, ) ( ) ( ) ( ) ( ) 3 ( x) ( x) d d x ( x) 39
40 S = μ=0; d 0 =S = 0 ρ=- ( ) ( ) ( ) d s s s s ( x) ( x) d d x ( x) ( ) ( ) ( ) ( ) σ () (X)= σ (0) (X)+d 0 d - - X (0+) σ (-) (X)=+ X =+X l =max(l 0,l - +μ-ρ))=max(0,0+0+)= μ-l μ =-l =-=0 d =S +σ () S =+ =0 l μ+ = max(l μ, l ρ +μ-ρ) σ () (X)= σ () (X)=+X l =l = μ-l μ =-l =-= d =S 3 +σ () S =α 0 + =(+α+α )+= α 5 40
41 d =α 5 0 ρ=0 σ (3) (X)=σ () (X)+d d 0 - X (-0) σ (0) (X)=+X+ α 5 X =+X+α 5 X l 3 =max(l,l 0 +μ-ρ))=max(,0+-0)= μ-l μ =3-l 3 =3-= d 3 =S 4 +σ (3) S 3 +σ (3) S +σ 3 (3) S =+ α 0 + α 5 +0 =+(+α+α )+(α+α )=0 4
42 ( ) ( x) d x x 5 3 x x x x x x x x ( x) ( x) x x (6) ( x)( x)( x) 3 0 x,, 4
43 error location numbers ,, 3 e( x) x x x 3 5 r( x) r( x) e( x) 0 If the number of errors in the received polynomial r(x) is less than the designed error-correcting capability t of the code, it is not necessary to carry out the t steps of iteration to find the errorlocation polynomial σ(x) It has been shown that if d μ and the discrepancies at the next t-l μ - steps are all zeros (ie successive t-l μ zeros), σ (μ) (X) is the errorlocation polynomial If v(v t) errors occur, only v+t steps of iteration are needed The iterative algorithm described above not only applies to binary BCH codes but also nonbinary BCH codes 43
44 Simplified Algorithm for finding ( x) For a binary BCH code, it is only required to fill out a table with t empty rows Such a table is presented below ( ) ( x) d -/ 0-0 S 0 0 t 44
45 ( ) ( ) If d 0, then ( x) ( x) If d 0, find another row proceding the th row, st is as large as possible and d 0 ( ) ( ) ( ) ( ) Then ( X) ( X) d d X ( X ) note that d s s s ( ) ( ) 3 + ( ) s 3 ( ) deg [ ( x)] 45
46 The polynomial σ (t) (X) in the last row should be the required σ(x) If it has degree greater than t, there were more than t errors, and generally it is not possible to locate them The computation required in this simplified algorithm is onehalf of the computation required in the general algorithm The simplified algorithm applies only to binary BCH codes If the number of errors in the received polynomial r(x) is less than the designed error-correcting capability t of the code, it is not necessary to carry out the t steps of iteration to find the error-location polynomial σ(x) for a t-error-correcting binary BCH code 46
47 Remarks: If errors occur, only ( tv)/ steps needed If, for some μ, d μ and the discrepancies at the next (t-l μ -)/ steps are zero, then ( X ) is the error-location poly EX66 v t The simplified table for finding (x) for the code in ex65 is given (3) 5 3 below Thus, ( x) ( x) x x ( ) ( x) d l l -/ 0-0 S= Sx=+x S3+S S== (take = -/ ) +x+ 5 x 0 (take = 0 ) 3 +x+ 5 x (take = ) 47
48 Finding the Error-Location Numbers and Error Correction Consider ex66 The error-location poly has been found to be 5 3 ( x) x x By substituting 4 3 0,,,, into it, we find that,, are the roots of (x) Therefore, the error location numbers are,, e( x) x x x Chien s procedure: The received vector r( x) r r x r x 0 is decoded on a bit-by-bit basis The high-order bits are n decoded first To decode r n-, the decoder test whether is an error-location number; this is equivalent to test whether its inverse is a root of (x) If is a root, then 48 r n x n v v 0
49 rn l To decode l l vl, the decoder forms,,, v and tests the sum l l vl v If the sum is zero, then α n-l is an error-location number and r n- l is an erroneous digit; otherwise, r n-l is a correct digit Cyclic error location search unit t output x x x t t i i A i input Buffer 49
50 The t-registers are initial stored with,,, t calculated in step of the decoding ( v v t 0 for v < t) Immediately before rn- is read out of the buffer, the t multiplier are v pulsed once The multiplications are performed and,,, v are stored in the -registers The output of the logic circuit A is if v and only if the sum v 0; otherwise, the output of A is 0 The digit rn- is read out of the buffer and corrected by the output of A Having decoded rn-,the t multipliers are pulsed 4 v again Now,,, v are stored in the -registers The sum 4 v v is tested for 0 The digit rn- is read out of the buffer and corrected in the same manner as rn- is corrected 50
Chapter 6. BCH Codes
Chapter 6 BCH Codes Description of the Codes Decoding of the BCH Codes Outline Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes Weight
More informationImplementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes
BCH Codes Wireless Information Transmission System Lab Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation
More informationImplementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes
BCH Codes Wireless Information Transmission System La. Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation
More information5.0 BCH and Reed-Solomon Codes 5.1 Introduction
5.0 BCH and Reed-Solomon Codes 5.1 Introduction A. Hocquenghem (1959), Codes correcteur d erreurs; Bose and Ray-Chaudhuri (1960), Error Correcting Binary Group Codes; First general family of algebraic
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationError Correction Review
Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols
More informationChapter 6 Reed-Solomon Codes. 6.1 Finite Field Algebra 6.2 Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding
Chapter 6 Reed-Solomon Codes 6. Finite Field Algebra 6. Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding 6. Finite Field Algebra Nonbinary codes: message and codeword symbols
More informationChapter 5. Cyclic Codes
Wireless Information Transmission System Lab. Chapter 5 Cyclic Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Description of Cyclic Codes Generator and Parity-Check
More informationx n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)
Cyclic codes: review EE 387, Notes 15, Handout #26 A cyclic code is a LBC such that every cyclic shift of a codeword is a codeword. A cyclic code has generator polynomial g(x) that is a divisor of every
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More informationAn Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission P.Mozhiarasi, C.Gayathri, V.Deepan Master of Engineering, VLSI design, Sri Eshwar College of Engineering, Coimbatore- 641 202,
More informationB. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.
B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
More informationA 2-error Correcting Code
A 2-error Correcting Code Basic Idea We will now try to generalize the idea used in Hamming decoding to obtain a linear code that is 2-error correcting. In the Hamming decoding scheme, the parity check
More informationBerlekamp-Massey decoding of RS code
IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationInformation redundancy
Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant
More informationSimplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey
2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 1 Vivek Tilavat, 2 Dr.Yagnesh Shukla 1 PG Student,
More informationVHDL Implementation of Reed Solomon Improved Encoding Algorithm
VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of
More informationELEC3227/4247 Mid term Quiz2 Solution with explanation
ELEC7/447 Mid term Quiz Solution with explanation Ang Man Shun Department of Electrical and Electronic Engineering, University of Hong Kong Document creation date : 015 1 05 This document explain the solution
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationContents Introduction Primitive BCH Codes Generator Polynomial Properties Decoding of BCH Codes Syndrome Computation Syndrome and Error Pattern
BCH CODE Contents. Introduction. Primitive BCH Codes. Generator Polynomial 4. Properties 5. Decoding of BCH Codes 6. yndrome Computation 7. yndrome and Error Pattern 8. Error-location Polynomial 9. Decoding
More informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
More informationEE512: Error Control Coding
EE51: Error Control Coding Solution for Assignment on BCH and RS Codes March, 007 1. To determine the dimension and generator polynomial of all narrow sense binary BCH codes of length n = 31, we have to
More informationPAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
359 PAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR a),szu-linsu, Members, and Shao-Wei WU, Nonmember SUMMARY A low-complexity step-by-step decoding algorithm
More informationChapter 3 Linear Block Codes
Wireless Information Transmission System Lab. Chapter 3 Linear Block Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Introduction to linear block codes Syndrome and
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 9B ERROR CONTROL CODING Spring 005 Solutions for Homework 1. (Weights of codewords in a cyclic code) Let g(x) be the generator polynomial of a binary cyclic code of length n. (a) Show that if g(x) has
More informationError Detection & Correction
Error Detection & Correction Error detection & correction noisy channels techniques in networking error detection error detection capability retransmition error correction reconstruction checksums redundancy
More informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
More informationCyclic Codes. Saravanan Vijayakumaran August 26, Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Cyclic Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay August 26, 2014 2 / 25 Cyclic Codes Definition A cyclic shift
More information1 Vandermonde matrices
ECE 771 Lecture 6 BCH and RS codes: Designer cyclic codes Objective: We will begin with a result from linear algebra regarding Vandermonde matrices This result is used to prove the BCH distance properties,
More informationOptical Storage Technology. Error Correction
Optical Storage Technology Error Correction Introduction With analog audio, there is no opportunity for error correction. With digital audio, the nature of binary data lends itself to recovery in the event
More informationCoding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014
Anna Dovzhik 1 Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014 Sharing data across channels, such as satellite, television, or compact disc, often
More informationChapter 9: BCH, Reed-Solomon, and Related Codes
Chapter 9: BCH, Reed-Solomon, and Related Codes Draft of February 23, 2001 9.1 Introduction. In Chapter 7 we gave one useful generalization of the (7, 4) Hamming code of the Introduction: the family of
More informationFault Tolerance & Reliability CDA Chapter 2 Cyclic Polynomial Codes
Fault Tolerance & Reliability CDA 5140 Chapter 2 Cyclic Polynomial Codes - cylic code: special type of parity check code such that every cyclic shift of codeword is a codeword - for example, if (c n-1,
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 x + + a n 1 x n 1 + a n x n, where the coefficients a 0, a 1, a 2,,
More informationDecoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring
Decoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring Antonio Aparecido de Andrade Department of Mathematics, IBILCE, UNESP, 15054-000, São José do Rio Preto, SP, Brazil E-mail:
More informationThe Pennsylvania State University. The Graduate School. Department of Computer Science and Engineering
The Pennsylvania State University The Graduate School Department of Computer Science and Engineering A SIMPLE AND FAST VECTOR SYMBOL REED-SOLOMON BURST ERROR DECODING METHOD A Thesis in Computer Science
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x f(x) = q(x)h(x) + r(x),
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 + + a n 1 x n 1 + a n x n, where the coefficients a 1, a 2,, a n are
More informationDecoding Algorithm and Architecture for BCH Codes under the Lee Metric
Decoding Algorithm and Architecture for BCH Codes under the Lee Metric Yingquan Wu and Christoforos N. Hadjicostis Coordinated Science Laboratory and Department of Electrical and Computer Engineering University
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationNew algebraic decoding method for the (41, 21,9) quadratic residue code
New algebraic decoding method for the (41, 21,9) quadratic residue code Mohammed M. Al-Ashker a, Ramez Al.Shorbassi b a Department of Mathematics Islamic University of Gaza, Palestine b Ministry of education,
More informationFault Tolerant Computing CS 530 Information redundancy: Coding theory. Yashwant K. Malaiya Colorado State University
CS 530 Information redundancy: Coding theory Yashwant K. Malaiya Colorado State University March 30, 2017 1 Information redundancy: Outline Using a parity bit Codes & code words Hamming distance Error
More information1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007
1 Reed Solomon Decoder 6.375 Final Project Group 3 Abhinav Agarwal S Branavan Grant Elliott 14 th May 2007 2 Outline Error Correcting Codes Mathematical Foundation of Reed Solomon Codes Decoder Architecture
More informationERROR CORRECTING CODES
ERROR CORRECTING CODES To send a message of 0 s and 1 s from my computer on Earth to Mr. Spock s computer on the planet Vulcan we use codes which include redundancy to correct errors. n q Definition. A
More informationChapter 6. BCH Codes
Wreless Informaton Transmsson System Lab Chapter 6 BCH Codes Insttute of Communcatons Engneerng Natonal Sun Yat-sen Unversty Outlne Bnary Prmtve BCH Codes Decodng of the BCH Codes Implementaton of Galos
More informationGenerator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.
Cyclic Codes II Generator Matrix We would now like to consider how the ideas we have previously discussed for linear codes are interpreted in this polynomial version of cyclic codes. Theorem 6: If the
More informationMinimized Logic Gates Number Of Components In The Chien Search Block For Reed-Solomon (RS)
Research Paper American Journal of Engineering Research (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-7, Issue-2, pp-110-116 www.ajer.org Open Access Minimized Logic Gates Number Of Components In
More informationError Detection, Correction and Erasure Codes for Implementation in a Cluster File-system
Error Detection, Correction and Erasure Codes for Implementation in a Cluster File-system Steve Baker December 6, 2011 Abstract. The evaluation of various error detection and correction algorithms and
More informationGF(2 m ) arithmetic: summary
GF(2 m ) arithmetic: summary EE 387, Notes 18, Handout #32 Addition/subtraction: bitwise XOR (m gates/ops) Multiplication: bit serial (shift and add) bit parallel (combinational) subfield representation
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationSPA decoding on the Tanner graph
SPA decoding on the Tanner graph x,(i) q j,l = P(v l = x check sums A l \ {h j } at the ith iteration} x,(i) σ j,l = Σ P(s = 0 v = x,{v : t B(h )\{l}}) q {vt : t B(h j )\{l}} j l t j t B(h j )\{l} j,t
More informationNew Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)
International Journal of Computational Intelligence Research (IJCIR). ISSN: 097-87 Volume, Number 8 (207), pp. 205 2027 Research India Publications http://www.ripublication.com/ijcir.htm New Algebraic
More informationLecture 12: November 6, 2017
Information and Coding Theory Autumn 017 Lecturer: Madhur Tulsiani Lecture 1: November 6, 017 Recall: We were looking at codes of the form C : F k p F n p, where p is prime, k is the message length, and
More informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationAlternant and BCH codes over certain rings
Computational and Applied Mathematics Vol. 22, N. 2, pp. 233 247, 2003 Copyright 2003 SBMAC Alternant and BCH codes over certain rings A.A. ANDRADE 1, J.C. INTERLANDO 1 and R. PALAZZO JR. 2 1 Department
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationVLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2, 4-4 (29) VLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code HUANG-CHI CHEN,2, YU-WEN CHANG 3 AND REY-CHUE HWANG Deaprtment of Electrical
More informationCyclic codes. Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon. February 2008
Cyclic codes Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon February 2008 1 Definitions Definition 1. A ring < R, +,. > is a set R with two binary operation + (addition) and. (multiplication)
More informationProof: Let the check matrix be
Review/Outline Recall: Looking for good codes High info rate vs. high min distance Want simple description, too Linear, even cyclic, plausible Gilbert-Varshamov bound for linear codes Check matrix criterion
More informationELEC 519A Selected Topics in Digital Communications: Information Theory. Hamming Codes and Bounds on Codes
ELEC 519A Selected Topics in Digital Communications: Information Theory Hamming Codes and Bounds on Codes Single Error Correcting Codes 2 Hamming Codes (7,4,3) Hamming code 1 0 0 0 0 1 1 0 1 0 0 1 0 1
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationA Brief Encounter with Linear Codes
Boise State University ScholarWorks Mathematics Undergraduate Theses Department of Mathematics 8-2014 A Brief Encounter with Linear Codes Brent El-Bakri Boise State University, brentelbakri@boisestate.edu
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationDesign and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by
Design and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by Hazem Abd Elall Ahmed Elsaid A Thesis Submitted to the Faculty of Engineering at Cairo University
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
More informationMaking Error Correcting Codes Work for Flash Memory
Making Error Correcting Codes Work for Flash Memory Part I: Primer on ECC, basics of BCH and LDPC codes Lara Dolecek Laboratory for Robust Information Systems (LORIS) Center on Development of Emerging
More informationCONSTRUCTION OF QUASI-CYCLIC CODES
CONSTRUCTION OF QUASI-CYCLIC CODES by Thomas Aaron Gulliver B.Sc., 1982 and M.Sc., 1984 University of New Brunswick A DISSERTATION SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
More informationMATH3302 Coding Theory Problem Set The following ISBN was received with a smudge. What is the missing digit? x9139 9
Problem Set 1 These questions are based on the material in Section 1: Introduction to coding theory. You do not need to submit your answers to any of these questions. 1. The following ISBN was received
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationEECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
More informationECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes
Kevin Buckley - 2010 109 ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes m GF(2 ) adder m GF(2 ) multiplier
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationFinite fields: some applications Michel Waldschmidt 1
Ho Chi Minh University of Science HCMUS Update: 16/09/2013 Finite fields: some applications Michel Waldschmidt 1 Exercises We fix an algebraic closure F p of the prime field F p of characteristic p. When
More informationObjective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them.
ECE 7670 Lecture 5 Cyclic codes Objective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them. Reading: Chapter 5. 1 Cyclic codes Definition
More informationOpen problems on cyclic codes
Open problems on cyclic codes Pascale Charpin Contents 1 Introduction 3 2 Different kinds of cyclic codes. 4 2.1 Notation.............................. 5 2.2 Definitions............................. 6
More information2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor
SYSTEM ARCHITECTURE ADVANCED SYSTEM ARCHITECTURE Error Correction Code 1 01/Fall-Winter Term Monday 1:50 Room# 1- or 5F Meeting Room Instructor: Fire Tom Wada, Professor 014/1/0 System Arch 1 Introduction
More informationInformation Redundancy: Coding
Info Redundancy April 2, 23 Information Redundancy: Coding Often applied to Info transfer: often serial communication thru a channel Info storage Hamming distance: error detection & correction capability
More informationComputer Algebra for Computer Engineers
p.1/23 Computer Algebra for Computer Engineers Galois Fields: GF(2 m ) Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/23 Galois Fields A Galois Field
More informationError-correcting codes and Cryptography
Error-correcting codes and Cryptography Henk van Tilborg Code-based Cryptography Workshop Eindhoven, May -2, 2 /45 CONTENTS I II III IV V Error-correcting codes; the basics Quasi-cyclic codes; codes generated
More informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More information8+4 0 mod (12), mod (12), mod (12), mod (12), mod (12).
Decimal Codes Massoud Malek To make error correcting codes easier to use and analyze, it is necessary to impose some algebraic structure on them. It is especially useful to have an alphabet in which it
More informationReverse Berlekamp-Massey Decoding
Reverse Berlekamp-Massey Decoding Jiun-Hung Yu and Hans-Andrea Loeliger Department of Information Technology and Electrical Engineering ETH Zurich, Switzerland Email: {yu, loeliger}@isi.ee.ethz.ch arxiv:1301.736v
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationCyclic codes. I give an example of a shift register with four storage elements and two binary adders.
Good afternoon, gentleman! Today I give you a lecture about cyclic codes. This lecture consists of three parts: I Origin and definition of cyclic codes ;? how to find cyclic codes: The Generator Polynomial
More informationSPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES
SPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES N. J. A. SLOANE Abstract. Bose-Chaudhuri-Hocquenghem and Justesen codes are used to pack equa spheres in M-dimensional Euclidean space with density
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More informationIN this paper, we will introduce a new class of codes,
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 44, NO 5, SEPTEMBER 1998 1861 Subspace Subcodes of Reed Solomon Codes Masayuki Hattori, Member, IEEE, Robert J McEliece, Fellow, IEEE, and Gustave Solomon,
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationDecoding of the Five-Error-Correcting Binary Quadratic Residue Codes
American Journal of Mathematical and Computer Modelling 2017; 2(1): 6-12 http://www.sciencepublishinggroup.com//amcm doi: 10.1168/.amcm.20170201.12 Decoding of the Five-Error-Correcting Binary Quadratic
More information