| US 7,590,924 B2 | ||
| Architecture and control of Reed-Solomon list decoding | ||
| Siu-Hung Fred Au, Fremont, Calif. (US); Gregory Burd, San Jose, Calif. (US); Zining Wu, Los Altos, Calif. (US); Jun Xu, Sunnyvale, Calif. (US); Ichiro Kikuchi, Yokohama (Japan); and Tony Yoon, San Jose, Calif. (US) | ||
| Assigned to Marvell International Ltd., Hamilton (Bermuda) | ||
| Filed on Oct. 23, 2008, as Appl. No. 12/256,652. | ||
| Application 12/256652 is a division of application No. 11/195183, filed on Aug. 01, 2005, granted, now 7,454,690. | ||
| Claims priority of provisional application 60/680969, filed on May 12, 2005. | ||
| Claims priority of provisional application 60/622429, filed on Oct. 27, 2004. | ||
| Prior Publication US 2009/0055717 A1, Feb. 26, 2009 | ||
| Int. Cl. H03M 13/00 (2006.01) | ||
| U.S. Cl. 714—785 [714/793] | 12 Claims |
| 1. A Reed-Solomon decoder capable of decoding an n-symbol decision-codeword to produce a k-symbol dataword where the number
of symbol errors in the decision-codeword is greater than t=(n−k)/2, the decoder comprising:
a syndrome computation circuit that performs a recursive computation to generate a plurality of values eαi·j, said syndrome computation circuit adding said plurality of values to existing syndromes to produce a plurality of modified
syndromes,
where j is a symbol position, e is an error value corresponding to the symbol position, and i is a non-negative integer.
|