• PERFORMANCE EVALUATION OF BCH CODES ON AWGN CHANNELS

Abstract

The Bose-Chaudhuri-Hocquenghem (BCH) codes are a class of widely studied error-correcting codes. These are powerful error-correcting codes suitable for the mobile channel environment where they can correct both random and burst errors. The impressive algebraic structure of BCH codes facilitates their design and implementation. Out of the three main decoding algorithms of BCH codes, the Berlekamp-Massey algorithm, the Peterson’s algorithm and the Euclidean algorithm, the Berlekamp-Massey is the most efficient one and is widely used in simulations and software applications. In this paper, the BCH encoder and its decoder are implemented in a systematic manner. The Berlekamp-Massey algorithm is chosen as the decoding algorithms for (63, 30, 6) BCH codes. Further, simulation results for the bit error rate performance of (15, 5, 3), (31, 11, 5) and (63, 30, 6) BCH coded messages with BPSK modulation on AWGN channel have been obtained.