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:
Dec. 30, 2003

Filed:

May. 01, 2000
Applicant:
Inventors:

Charles Edwin Cox, San Jose, CA (US);

Martin Aureliano Hassner, Mountain View, CA (US);

Barry Marshall Trager, Yorktown Heights, NY (US);

Shmuel Winograd, Scarsdale, NY (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H03M 1/300 ; G11B 5/09 ; G06F 7/00 ;
U.S. Cl.
CPC ...
H03M 1/300 ; G11B 5/09 ; G06F 7/00 ;
Abstract

An on-the-fly algebraic error correction system and corresponding method for reducing error location search are presented. The method transforms an error locator polynomial into two transformed polynomials whose roots are elements in a smaller subfield, in order to significantly simplify the complexity, and to reduce the latency of the error correcting system hardware implementation. More specifically, if the error locator polynomial is over a finite field of (2 ) elements, the transformed polynomial is over a finite subfield of (2 ) elements. Thus, the problem of locating the roots of the error locator polynomial is reduced to locating the roots of the transformed polynomials. Assuming the error locator polynomial is of degree m, the present method requires at most (m /2) evaluations of polynomials over the Galois field GF(2 ) and (2 ) evaluations over the subfield GF(2 ) or root finding of two polynomials of at most a degree m over the subfield GF(2 ).


Find Patent Forward Citations

Loading…