A simple step-by-step decoding of binary BCH codes

  • Ching Long Chyr
  • , Szu Lin Su
  • , Shao Wei Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes a simple step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes. By using logical analysis, we obtain a simple rule, which can directly determine whether any bit in received codeword is correct or not without finding the error-location polynomial. Compared to a previously proposed step-by-step decoding algorithm, the new method significantly reduces the matrix calculation. Since the most complex element in the conventional step-by-step decoder is the "matrix calculation", the computation complexity of this decoder can be much less than the conventional step-by-step decoding algorithm.

Original languageEnglish
Title of host publicationProceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications
EditorsA.O. Fapojuwo
Pages318-322
Number of pages5
Publication statusPublished - 2004
EventProceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications - Banff, Canada
Duration: 2004 Jul 82004 Jul 10

Publication series

NameProceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications

Other

OtherProceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications
Country/TerritoryCanada
CityBanff
Period04-07-0804-07-10

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

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

Cite this