A low-complexity step-by-step decoding algorithm for binary BCH codes

Ching Lung Chr, Szu Lin Su, Shao Wei Wu

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)359-365
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number1
DOIs
Publication statusPublished - 2005 Jan

Fingerprint

Low Complexity
Decoding
Binary
Matrix Computation
Computational complexity
Computational Complexity
Computing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{b040495841884779a1df7897112080be,
title = "A low-complexity step-by-step decoding algorithm for binary BCH codes",
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.",
author = "Chr, {Ching Lung} and Su, {Szu Lin} and Wu, {Shao Wei}",
year = "2005",
month = "1",
doi = "10.1093/ietfec/E88-A.1.359",
language = "English",
volume = "E88-A",
pages = "359--365",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

A low-complexity step-by-step decoding algorithm for binary BCH codes. / Chr, Ching Lung; Su, Szu Lin; Wu, Shao Wei.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E88-A, No. 1, 01.2005, p. 359-365.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A low-complexity step-by-step decoding algorithm for binary BCH codes

AU - Chr, Ching Lung

AU - Su, Szu Lin

AU - Wu, Shao Wei

PY - 2005/1

Y1 - 2005/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=26044457831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26044457831&partnerID=8YFLogxK

U2 - 10.1093/ietfec/E88-A.1.359

DO - 10.1093/ietfec/E88-A.1.359

M3 - Article

AN - SCOPUS:26044457831

VL - E88-A

SP - 359

EP - 365

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -