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

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

doi:10.1093/ietfec/e88-a.1.359

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

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

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.1 pp.359-365

Publication Date: 2005/01/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.1.359

Type of Manuscript: PAPER

Category: Coding Theory

Cite this

Copy

Ching-Lung CHR, Szu-Lin SU, Shao-Wei WU, "A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 1, pp. 359-365, January 2005, doi: 10.1093/ietfec/e88-a.1.359.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.1.359/_p

Copy

@ARTICLE{e88-a_1_359,
author={Ching-Lung CHR, Szu-Lin SU, Shao-Wei WU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes},
year={2005},
volume={E88-A},
number={1},
pages={359-365},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.1.359},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 359
EP - 365
AU - Ching-Lung CHR
AU - Szu-Lin SU
AU - Shao-Wei WU
PY - 2005
DO - 10.1093/ietfec/e88-a.1.359
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2005
AB - 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.
ER -