For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
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
Publication Date: 2005/08/01
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)>>
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.