A rs Decoder with Low Hardware Complexity

Abstract

The invention discloses an RS decoder low in hardware complexity. Received code words are stored; syndrome polynomial coefficient of the code words is calculated by utilizing Horner rules and used for time division to realize a chien searching function, and an error position is determined; polynomial coefficient of the error position is iteratively calculated according to the syndrome polynomial coefficient through a decomposed non-inversion Berlekamp-Massey algorithm, and polynomial calculation of an error estimated value is realized according to syndrome polynomial and error position polynomial time division; an error value on the error position is calculated; corresponding code words in a synchronous FIFO are corrected according to the error position and the error value. According to an iBM algorithm in the form of decomposition, inversion operation is eliminated during iterative solving of error position polynomial, and iteration is performed through decomposition, so that number of finite field multipliers is reduced, hardware complexity is lowered, hardware resources are saved to a great extent, and area and power consumption of a decoder chip is reduced.

Description

technical field [0001] The present invention relates to the technical field of communication channel coding and decoding, and more specifically, relates to an RS decoder with low hardware complexity. Background technique [0002] RS code is a kind of non-binary BCH (Bose Chaudhuri Hocquenghem) code with strong error correction ability, which was constructed by Reed (Reed) and Solomon (Solomon) in 1960 using MS (Mattson-Solomon) polynomial from. RS code can effectively correct random symbol errors and random burst errors, and is one of the most common channel coding schemes, and is widely used in various communication and data storage systems for error control. [0003] The RS code is based on the finite field GF(2 m ), that is, each symbol in the RS code is GF(2 m ) elements, the operations between the symbols are carried out according to the finite field algorithm. Generally, RS(n,n-2t) is used to represent an RS code, n represents the number of coded symbols, n-2t repr...

AI Technical Summary

Problems solved by technology

Due to the inverse operation of finite fields in the BM algorithm and the division operation of polynomials in the Euclid algorithm, these two operations will consume a lot of hardware resources and the operation speed is slow, which cannot meet the low-cost or high-speed requirements of modern wireless communication systems. , it is particularly important to improve and optimize the traditional RS decoder

Images