A reed-solomon code decoding circuit

Abstract

The invention discloses a decoding circuit for Reed-Solomon codes. The decoding circuit comprises 3t+1 processing units and a control unit which are connected in sequence. The 3t+1 processing units perform iterative operation according to a signal a, a signal b, a zeroth signal, a first control signal and a second control signal to obtain coefficient of error value polynomial omega (x) and error position polynomial sigma (x). The decoding circuit has the advantages that hardware implementation complexity can be lowered, polynomial with lowered degree is combined with polynomial with increased degree according to the law of polynomial operation, circuit complexity and scale are reduced effectively, shifting in ME algorithm (modified Euclid's algorithm) is reallocated, iterations when the algorithm is ended are fixed, judging of algorithm end conditions in conventional algorithms is omitted, correspondingly, control logic and control passage in a hardware structure are simplified, maximum working frequency of the circuit is increased, and circuit area is reduced.

Description

technical field [0001] The invention relates to the technical field of data communication coding, in particular to a Reed-Solomon (Reed-Solomon) code decoding circuit. Background technique [0002] Reed-Solomon code (referred to as RS code, also known as Reed-Solomon code) is an important cyclic code, which is an error-correcting code with strong error-correcting ability in block codes, and is widely used in communication systems and computer storage systems. [0003] Euclidean algorithm is an algorithm for calculating the greatest common divisor of two numbers by rolling and dividing. Since the core part of the decoding of the Reed-Solomon code is to solve the key equation σ(x)S(x)=ω(x)modx 2t , which can be equivalent to finding S(x) and x 2t The maximum common polynomial, so the Euclidean (Euclidean) algorithm is also used to decode the Reed-Solomon code. The Euclidean algorithm here is a broad concept, including both the Euclidean algorithm in the narrow sense and the...

AI Technical Summary

Problems solved by technology

But the disadvantage is that the decoding using the above ME algorithm takes up relatively more resources. For example, the shift alignment operation is involved in the iteration process. In order to align the first terms of the two polynomials, a large number of delay registers need to be introduced. As a result, the decoder area is huge

According to the operation rules of the above-mentioned ME algorithm, those skilled in the art can draw that R i (x) and Q i The number of effective items in (x) will decrease as the iteration progresses. On the contrary, L i (x) and U i The number of effective items of (x) will increase with the iteration, and in the existing Reed-Solomon code decoder, in the above iteration process, due to R i (x), Q i (x) and L i (x), U i (x) The number of initial effective items, reserve a sufficient number of registers, and then the register storage resources will be idle during the calculation process, resulting in waste of resources

Images