International Journal of Advanced Research in Engineering and Applied Sciences
  • Year: 2015
  • Volume: 4
  • Issue: 4

Analysis on (15,7) binary BCH encoder and decoder for 7-bit ASCII characters

  • Author:
  • P. Mozhiarasi, C. Gayathri
  • Total Page Count: 9
  • Page Number: 34 to 42

*ME Student, VLSI Design, Sri Eshwar College of Engineering, Coimbatore, Tamil Nadu, India

**Asst. Prof, Department of ECE, Sri Eshwar College of Engineering, Coimbatore, Tamil Nadu, India

Online published on 10 March, 2016.

Abstract

In digital communication, the data is transmitted through the channel to the receiver side. If noise is included in the channel, data that is received at the receiver side will not be the actual data. This may create a corruption of data which is intolerable. In such situations, an error control must be employed so that errors may be detected and afterwards corrected. In this paper, (15,7,2) BCH encoder and decoder are designed mathematically. The block length(n), data length(k) and maximum number of correctable errors(t) are 15, 7 and 2 respectively. The encoding and decoding operates over the Galois Field GF (24) with an irreducible polynomial x4+x+1. Decoder includes 3 major steps: 1) Syndrome calculation (SC) 2) Berlekamp Massey Algorithm (BMA) 3) Chein Search (CS). The error is then corrected effectively in decoder part with the help of NAND Flash memory.

Keywords

Bose Chaudhuri Hocquenghem (BCH), BCH Encoder, BCH Decoder, Berlekamp Massey Algorithm (BMA), Chein Search(CS), Galois Field (GF), Syndrome Calculation(SC)