Decoding method and system of BCH codes

Abstract

The invention belongs to the field of error correction decoding, and provides a decoding method and system of BCH codes. The decoding method of the BCH codes comprises the steps that syndrome operation is carried out on the received BCH codes to obtain a syndrome polynomial, values of the syndrome polynomial are calculated successively through a parallel iterative decoding circuit on the basis of a BM algorithm without inverse operation so that error location polynomial coefficients and an error location polynomial can be obtained, the root of the error location polynomial is calculated through a Chien search method, and the error location is obtained through calculation. According to the step that the error location polynomial coefficients and the error location polynomial can be obtained through successive calculation of the parallel iterative decoding circuit, the iteration time of the parallel iterative decoding circuit and the calculation time of the Chien search method are matched, and multiplexing is carried out on the parallel iterative decoding circuit according to the iteration time. Therefore, according to the decoding method and system of the BCH codes, the number of adders, the number of multipliers and the number of registers for hardware implementation can be effectively reduced, complexity of combinational logic is reduced, and the size of a chip can be effectively reduced.

Description

technical field [0001] The present invention relates to the field of error correction decoding, and more specifically relates to a BCH code decoding method and system. Background technique [0002] BCH (Bose-Chaudhuri-Hocquenghem) code, as an important error correction coding method, has been widely used in the field of communication and consumer electronics. The BCH decoder includes three steps, the first is the adjoint calculation, the second step is to calculate the error position polynomial, and the third step is to search for the error position and correct it. The IBM (Inversionless Berlecamp-Massey, Berlecamp-Massey algorithm without inversion operation) algorithm is usually used in the hardware implementation of the error position polynomial, and the hardware overhead of the IBM algorithm will increase greatly with the increase of its error correction capability. And its combinational logic will become more and more difficult to meet the clock requirements, so how to...

AI Technical Summary

Problems solved by technology

The IBM (Inversionless Berlecamp-Massey, Berlecamp-Massey algorithm without inversion operation) algorithm is usually used in the hardware implementation of the error position polynomial, and the hardware overhead of the IBM algorithm will increase greatly with the increase of its error correction capability. And its combinational logic will become more and more difficult to meet the clock requirements, so how to optimize IBM's hardware structure becomes very important

Images