Circuitry for detecting and correcting errors in data words occurring in Reed-Solomon coded blocks and determining when errors are uncorrectable by syndrome analysis, Euclid's algorithm and a Chien search
US5365529A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Dec 12, 1991 |
| Grant date | Nov 15, 1994 |
| Priority date | — |
| Expiry date | Dec 12, 2011 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/1545
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
Circuitry for detecting and correcting errors in data words occurring in Reed-Solomon coded blocks contains a plurality of stages. One stage constructs syndromes in the data flowing through the blocks. Another stage detects erasures in the syndromes. Another stage applies a Euclid's algorithm with EQU T.sub.s (x)={Q.sub.s-1 (x).multidot.T.sub.s-1 (x)}+T.sub.s-2 (x), EQU R.sub.s (x)={Q.sub.s-1 (x).multidot.R.sub.s-1 (x)}+R.sub.s-2 (x), and EQU I Q.sub.s-1 (x)=R.sub.s-2 (x)/R.sub.s-1 (x) wherein T.sub.s (x), R.sub.s (x), and Q.sub.s-1 (x) are polynomials representing the position of the error, its value, and a provisional value respectively, and R.sub.s (x) and T.sub.s (x) can be normalized with a minimal coefficient T.sub.s (0)=.delta. such that R(x)=R.sub.s (xi/.delta. and T(x)=T.sub.s (x)/.delta.. Another stage detects error positions X.sub.k and values Y.sub.k by conducting a Chien zero-root search in conjunction with ##EQU1## wherein T'(X.sub.k) is the first derivative of T at a place x.sub.k. Another stage uses the accordingly calculated error positions X.sub.k and values Y.sub.k to correct signal-duration matched data words in a currently occurring Reed-Solomon coded block. wh…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.