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.
Patent No.:
Date of Patent:
Mar. 19, 2002
Filed:
Aug. 27, 1999
Jian Yang, Mansfield, MA (US);
Motorola, Inc., Schaumburg, IL (US);
Abstract
A method and apparatus for encoding/decoding data, wherein for one embodiment, during [During] encoding, a microprocessor ( ) calculates Y by standard Reed-Solomon encoding techniques. The microprocessor ( ) then utilizes Y as an index to a look-up table ( ), and is returned G Y , G Y , . . . , G Y , from the look-up table ( ). During syndrome calculation, a second set of parity symbols are generated from the information symbols using the method similar to the encoder, in particular, values for G Y , . . . , GK-,Y. are obtained from a first look-up table ( ) in a similar manner as encoder to determine the values for G Y , G Y , . . . , G Y . A second look-up table ( ) is set up to determine roots of the error locator polynomial. The second look-up table consists of several tables and each table contains (Q−1) elements, where Q is the size of the GF(Q) field. The mth look-up table stores Galois Field element &agr; at location i if the greatest common denominator between (Q−1) and m (GCD(Q−1,m))=1. If GCD(Q−1,m)≠1, then the mth look-up table actually consists of (GCD(Q−1,m) sub-tables storing GF element &agr; , where j=0, 1, . . ., GCD(Q−1,m)−1.