ALGORITHMS FOR DECODING BCH CODES

In this research, a new simple algorithm called BMA (Back Multiplication Algorithm), was presented, It can be used to detect and correct errors in polynomial-generated codes. The process is based mainly upon a simple technique that enables avoiding the complexity of using Fourier transform or even using a large memory.Applications to BCH codes (15,5) and(15,7) were attempted and satisfactory results have been obtained. However, BMA has some limitations when the error span exceeds (n-k-l) where, n and k are the number of bits in the codword and the number of the original message bits respectively. Such cases can be stored in a small-size memory.The circuit executes the BMA process was implemented using EDA (Electronic Design Automation) by means of the Verilog HDL hardware description language which was supported by Xilinx foundation program manager and targeted to FPGA (Field programmable Gate Array) and good results have been shown as in chapter 4.In the future, I hope that we will be able to decode BCH codes with no memory and overcome the problem of decoding special cases.