On algebraic soft-decision decoding algorithms for BCH codes

Three algebraic soft-decision decoding algorithms are presented for binary Bose-Chaudhuri-Hocquengham (BCH) codes. Two of these algorithms are based on the bounded distance (BD)+1 generalized minimum-distance (GMD) decoding presented by Berlekamp (1984), and the other is based on Chase (1972) decoding. A simple algebraic algorithm is first introduced, and it forms a common basis for the decoding algorithms presented. Next, efficient BD+1 GMD and BD+2 GMD decoding algorithms are presented. It is shown that, for binary BCH codes with odd designed-minimum-distance d and length n, both the BD+1 GMD and the BD+2 GMD decoding algorithms can be performed with complexity O(nd). The error performance of these decoding algorithms is shown to be significantly superior to that of conventional GMD decoding by computer simulation. Finally, an efficient algorithm is presented for Chase decoding of binary BCH codes. Like a one-pass GMD decoding algorithm, this algorithm produces all necessary error-locator polynomials for Chase decoding in one run.

[1]  Masao Kasahara,et al.  Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes , 1992, IEEE Trans. Inf. Theory.

[2]  Dana J. Taipale,et al.  An efficient soft-decision Reed-Solomon decoding algorithm , 1994, IEEE Trans. Inf. Theory.

[3]  Ulrich K. Sorger.  A new Reed-Solomon code decoding algorithm based on Newton's interpolation , 1993, IEEE Trans. Inf. Theory.

[4]  Robert H. Deng,et al.  An Improvement to Generalized-Minimum-Distance Decoding , 1991 .

[5]  Jean Louis Dornstetter.  On the equivalence between Berlekamp's and Euclid's algorithms , 1987, IEEE Trans. Inf. Theory.

[6]  Masao Kasahara,et al.  Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes' , 1976 .

[7]  Norifumi Kamiya.  On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes , 1997, IEEE Trans. Inf. Theory.

[8]  N. Kamiya.  On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes , 1995 .

[9]  Shigeichi Hirasawa,et al.  An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder , 1994, IEEE Trans. Inf. Theory.

[10]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[11]  Alexander Vardy,et al.  Generalized minimum-distance decoding of Euclidean-space codes and lattices , 1996, IEEE Trans. Inf. Theory.

[12]  Elwyn R. Berlekamp,et al.  Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.

[13]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[14]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[15]  Shigeichi Hirasawa,et al.  An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding , 1997, IEEE Trans. Inf. Theory.

[16]  Masakatu Morii,et al.  The Efficient GMD Decoders for BCH Codes (Special Issue on Multiple-Valued Logic) , 1993 .

[17]  R. Kotter.  Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes , 1996 .

[18]  Masao Kasahara,et al.  An erasures-and-errors decoding algorithm for Goppa codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[19]  Chun Wang,et al.  A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient , 1996, IEEE Trans. Inf. Theory.

[20]  Shin-Lin Shieh,et al.  Soft-decision Reed-Solomon decoding strategies for code group identification and frame synchronization in UMTS WCDMA , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).