Patent · US Expired

Reed-Solomon decoder having a new polynomial arrangement architecture and decoding method therefor

US6256763A · kind A · utility

13Cited by
4References
20Claims
0Family size

Assignee

Inventors

Key dates

Filing dateOct 14, 1998
Grant dateJul 3, 2001
Priority date
Expiry dateOct 14, 2018

Classification

  • Technology area (CPC H)Electricity
  • CPC primaryH03M13/1585
  • WIPO fieldBasic communication processes
  • WIPO sectorElectrical engineering

Abstract

A Reed-Solomon (RS) decoder and a decoding method therefor are provided. The RS decoder includes a calculator for iteratively calculating four polynomials R(x), Q(x), .lambda.(x), and .mu.(x) for the modified Euclidean algorithm using input initial error locator polynomial and modified syndrome polynomial, an arranger for arranging the coefficients of the respective polynomials from the left, a generator for generating control signals for showing the effective sections of the respective polynomials using an iterative control signal for announcing the beginning of every iterative calculation, and an extractor for extracting the polynomial R(x) supplied from the calculator as an error estimator polynomial and the polynomial .lambda.(x) as an error locator polynomial on the basis of the control signals. The RS decoder is simplified since an additional degree comparing circuit and degree buffering is not necessary.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.