A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes

Ching-Lung CHR  Szu-Lin SU  Shao-Wei WU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A   No.1   pp.359-365
Publication Date: 2005/01/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.1.359
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
BCH code,  step-by-step decoding,  matrix computation,  computational complexity,  

Full Text: PDF(943.7KB)>>
Buy this Article

A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decoder is less than the conventional step-by-step decoding algorithm, since it reduces at least half of the matrix computations and the most complex element in the conventional step-by-step decoder is the "matrix-computing" element.