The Optimization And Application Of Decoding Algorithm Of Binary BCH Code

We evaluate a digital communication whether its performance is excellent or inferior from its dependability and its validity in the process of its transmission.The coding of message sources can improve validity of signals,and the coding of channel can improve dependability of transmission . Since signals must be transmitted in noise channel,it will produce many inaccurate code consequentially. Adoption of error-correcting technique can assure accuracy and reliability of data.Binary BCH codes are a very important kind of linear cyclic error-correcting code which can correct many random errors and have a series of strongpoint such as their powerful correction abilities, simple structure. They are widely used in digital communication, therefore, study of decoding algorithm of binary BCH codes have important meanings no matter in practice or theory.Binary BCH codes are a kind of good code. The study of decoding algorithm is one of very important tasks of coding theory. With fast development of modern communication and computer technology, the traditional BM algorithm can not satisfy the need of high speed communications any more. This text improves the traditional decoding algorithm in two aspects. First, we add a logic judge module of modul 2 to judge the parity of i.To binary BCH codes, we get that d i= 0 when i is an odd number. We don't calculate d i and do the next iterative directly when i is an odd number.In this way, we reduce the iterative times by half and reduce the times of count of encoder consumedly. Second, we construct matrix according to the syndromes of received codes, and then judge actual error bits in the received codes according to reversibility of the matrix. When there areλ(λ≤t) mistaken bits actually, we can get the error locator polynomial by iterating 2λtimes only. So the iterative times are reduced greatly. By optimized iterative algorithm, the speed of decoding BCH codes gets increased obviously.