| US 7,590,923 B1 | ||
| Architecture and control of Reed-Solomon error identification and evaluation | ||
| Ichiro Kikuchi, Yokohama (Japan); Siu-Hung Fred Au, Fremont, Calif. (US); Gregory Burd, San Jose, Calif. (US); Zining Wu, Los Altos, Calif. (US); Jun Xu, Sunnyvale, Calif. (US); and Tony Yoon, San Jose, Calif. (US) | ||
| Assigned to Marvell International Ltd., Hamilton (Bermuda) | ||
| Filed on Aug. 01, 2005, as Appl. No. 11/195,403. | ||
| Claims priority of provisional application 60/622429, filed on Oct. 27, 2004. | ||
| Claims priority of provisional application 60/680969, filed on May 12, 2005. | ||
| Int. Cl. G06F 11/00 (2006.01); H03M 13/00 (2006.01) | ||
| U.S. Cl. 714—780 [714/784] | 20 Claims |
| 1. A method for soft-decoding a Reed-Solomon decision-codeword using an iterative search to determine a decoded dataword,
the method comprising:
receiving a decision-codeword;
producing a plurality of error locator polynomials based on the decision-codeword; and
iteratively evaluating the plurality of error locator polynomials to determine the decoded dataword, wherein each iteration
comprises:
performing an accelerated Chien search on a first error locator polynomial selected from the plurality of error locator polynomials;
determining if the first error locator polynomial is valid based on the accelerated Chien search;
if the first error locator polynomial is determined to be valid, performing a non-accelerated Chien search and concurrent
error evaluation on the first error locator polynomial; and
if the first error locator polynomial is determined to be invalid, performing an accelerated Chien search on a second error
locator polynomial selected from the plurality of error locator polynomials.
|