The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 23, 2010

Filed:

Jun. 21, 2006
Applicants:

Andrei Ovchinnikov, St. Petersburg, RU;

Evguenii Krouk, St. Petersburg, RU;

Andrey Efimov, St. Petersburg, RU;

Andrey Belogolovy, St. Petersburg, RU;

Inventors:

Andrei Ovchinnikov, St. Petersburg, RU;

Evguenii Krouk, St. Petersburg, RU;

Andrey Efimov, St. Petersburg, RU;

Andrey Belogolovy, St. Petersburg, RU;

Assignee:

Intel Corporation, Santa Clara, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H03M 13/00 (2006.01);
U.S. Cl.
CPC ...
Abstract

A technique to perform fast decoding of a Reed-Solomon code. A first multiplier unit multiplies a matrix Bwith a column vector v using common adders to produce a column vector v. The vector v represents one of an error locator polynomial, an error evaluator polynomial, and a derivative polynomial for a (n, k) Reed-Solomon code. The matrix Bis over GF() including first h columns of a matrix B. A second multiplier unit multiplies non-unity components of a column vector A with non-zero components of the column vector vcomponent-wise in GF(q) to produce a column vector v, q being equal to n+1. A third multiplier unit multiplies diagonal sub-matrices of a matrix C with corresponding components of the column vector vin GF() to produce a column vector v


Find Patent Forward Citations

Loading…