An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
P. Mozhiarasi, V. Deepan, Mahle Behr · 2015
This paper describes the design of (31,11,5) BCH encoder and decoder using mathematical derivation where 31, 11 and 5 represents the block length(n), data length(k) and maximum number of correctable errors(t) respectively. By the use of Galois Field GF(2 5 ) the encoding and decoding are carried out with an irreducible polynomial of x 5 +x 2 +1.The codeword is formed in encoder side by appending redundant bits(R(X)) with the message bit and transmitted through the channel to the decoder side. In the meanwhile, the Flash memory is used to store codeword, later for correction part in decoder side. Decoder involves 3 important steps: 1) The Syndrome calculation(SC), 2) Berlekamp Massey Algorithm (BMA), 3)The Chein Search(CS). The result shows that maximum of 5 errors in any position of 31 bits can be corrected effectively.