Skip to main navigation Skip to search Skip to main content

A Study on Efficient Implementation of SW-Based BCH Encoding and Decoding

  • Jonghoon Lee
  • , Sooyoung Kim*
  • , Sangseob Song
  • *Corresponding author for this work
  • Jeonbuk National University

Research output: Contribution to journalJournal articlepeer-review

Abstract

In this paper, we design an efficient 2-bit error correction BCH code, which is specified in the WBAN standard, and we also propose a simple method to improve the error correction performance. The 2-bit error correction BCH code is a relatively simple error correction code, and thus the efficiency of the encoding and decoding processes is very important. The efficiency of the proposed method can be maximized when it is implemented in software. By applying the encoding method using the division-remainder table as well as the decoding method using the syndrome-error location table, the proposed method can be efficiently operated with very low computational complexity, even in a low performance device. In addition, the proposed method adopts an efficient performance enhancing method by using a bit inversion process for low-reliability bits, thereby taking advantages similar to soft decision decoding. From the simulation results presented in this paper, we show that the proposed scheme improves a bit error rate performance compared to the conventional scheme with very low complexity, and the advantages are maximized in the shortened codes.

Original languageEnglish
Pages (from-to)903-913
Number of pages11
JournalJournal of Korean Institute of Communications and Information Sciences
Volume45
Issue number5
DOIs
StatePublished - 2020.05

Keywords

  • BCH decoding
  • BCH encoding
  • error correction codes
  • shortened code
  • syndrome

Quacquarelli Symonds(QS) Subject Topics

  • Computer Science & Information Systems

Fingerprint

Dive into the research topics of 'A Study on Efficient Implementation of SW-Based BCH Encoding and Decoding'. Together they form a unique fingerprint.

Cite this