US 7,322,004 B1 | ||
Efficient high-speed Reed-Solomon decoder | ||
Zhan Yu, Sunnyvale, Calif. (US); and Weishi Feng, San Jose, Calif. (US) | ||
Assigned to Marvell International, Ltd., Hamilton (Bermuda) | ||
Filed on Apr. 20, 2006, as Appl. No. 11/407,436. | ||
Application 11/407436 is a continuation of application No. 10/305091, filed on Nov. 26, 2002, granted, now 7,051,267. | ||
Claims priority of provisional application 60/370644, filed on Apr. 08, 2002. | ||
This patent is subject to a terminal disclaimer. | ||
Int. Cl. H03M 13/00 (2006.01) |
U.S. Cl. 714—784 | 41 Claims |
1. A Reed-Solomon decoder, comprising:
an inversionless Berlekamp-Massey algorithm (iBMA) circuit that includes:
a first polynomial generator that generates an error locator polynomial,
a discrepancy generator that generates discrepancy values that are output to said first polynomial generator, and
a plurality of arithmetic units, wherein said arithmetic units are used by said discrepancy generator during a first time
period to generate said discrepancy values and said arithmetic units are used during a second time period by said first polynomial
generator to generate said error locator polynomial.
|