US 2008/0168336 A1 · Simplified RS (reed-solomon) code decoder that obviates error value polynomial calculation

Abstract

Simplified RS (Reed-Solomon) code decoder that obviates error value polynomial calculation. A novel means is presented herein by which error magnitudes (or error values) can be calculated directly without requiring the generation of an error value polynomial (EVP). Modification of the Koetter decoding approach and the Forney formula are employed herein to perform the direct calculation of the error values. This approach is operable to save computation clock cycles that would normally be used to compute the EVP, and these clock cycles may be used to reduce the otherwise required parallelism and complexity in the ECC design that may be needed to perform the error correction in the allotted time and may also result in power savings. Some advantages related to this may approach include lower risk, less design time, and more scalability in an overall design.

Claims20

Dependent claims

A decoder that is operable to decode a Reed-Solomon (RS) coded signal, the decoder comprising:

an error locator polynomial generation module that is operable to generate an error location polynomial based on a plurality of syndromes that corresponds to a received codeword of the RS coded signal;
and
a combined error location search and error magnitude calculation module that is operable to:
locate an error within the RS coded signal using the error location polynomial;
and
directly calculate an error magnitude of the located error within the RS coded signal using a first plurality of error location polynomial coefficients and a second plurality of error location polynomial coefficients;
and wherein:
the decoder is operable to employ the calculated error magnitude to make a best estimate of an information bit encoded within the RS coded signal.

5 more elements

A decoder that is operable to decode a Reed-Solomon (RS) coded signal, comprising:

a first plurality of registers and a second plurality of registers for use in storing error location polynomial coefficients;
an error locator polynomial generation module that is operable to generate an error location polynomial based on a plurality of syndromes that corresponds to a received codeword of the RS coded signal;
and
a combined error location search and error magnitude calculation module that is operable to:
retrieve from the first plurality of registers a first plurality of error location polynomial coefficients of the error location polynomial corresponding to a previous iteration;
retrieve from the second plurality of registers a second plurality of error location polynomial coefficients of the error location polynomial corresponding to a current iteration;
perform Chien searching to process the error location polynomial including the first plurality of error location polynomial coefficients of the error location polynomial and the second plurality of error location polynomial coefficients of the error location polynomial to locate an error within the RS coded signal;
and
directly calculate an error magnitude of the located error within the RS coded signal using a third plurality of error location polynomial coefficients corresponding to a final iteration and a fourth plurality of error location polynomial coefficients corresponding to an iteration just before the final iteration that are calculated during the Chien searching;
and wherein:
the decoder is operable to employ the calculated error magnitude to make a best estimate of an information bit encoded within the RS coded signal.

8 more elements

A method that is operable to employ perform decoding of a Reed-Solomon (RS) coded signal, the method comprising:

generating an error location polynomial based on a plurality of syndromes that corresponds to a received codeword of the RS coded signal;
performing Chien searching to process the error location polynomial to locate an error within the RS coded signal;
directly calculating an error magnitude of the located error within the RS coded signal using a first plurality of error location polynomial coefficients of the error location polynomial corresponding to a final iteration of Berlekamp-Massey processing and a second plurality of error location polynomial coefficients of the error location polynomial corresponding to an iteration just before the final iteration of Berlekamp-Massey processing that are calculated during the Chien searching;
and
employing the calculated error magnitude to make a best estimate of an information bit encoded within the RS coded signal.

2 more elements

Dependencies are inferred from the claim text.

Simplified RS (reed-solomon) code decoder that obviates error value polynomial calculation

Life of this patent

Simplified RS (reed-solomon) code decoder that obviates error value polynomial calculation

Life of this patent

Abstract

Claims20