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 journalArticlepeer-review

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

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'A low-complexity step-by-step decoding algorithm for binary BCH codes'. Together they form a unique fingerprint.

Cite this