A Simple Step-by-Step Decoding of 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.8   pp.2236-2239
Publication Date: 2005/08/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.8.2236
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
BCH code,  step-by-step decoding,  matrix computation,  computational complexity,  

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

In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes based on logical analysis. Compared to the conventional step-by-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication.