Efficient high-speed Reed-Solomon decoder

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07051267

ABSTRACT:
A Reed-Solomon decoder includes an inversionless Berlekamp-Massey algorithm (iBMA) circuit with a pipelined feedback loop. An error locator polynomial generator generates error locator polynomial values. A scratch polynomial generator generates scratch polynomial values. A discrepancy generator generates discrepancy values based on the error locator polynomial values and the scratch polynomial values. Multipliers used to generate the discrepancy values are also used to generate the error locator polynomial to reduce circuit area. A first delay circuit delays the discrepancy values. A feedback loop feeds back the delayed discrepancy values to the error locator polynomial generator and the scratch polynomial generator. An error location finder circuit communicates with the iBMA circuit and identifies error locations. An error value computation circuit communicates with at least one of the error location finder circuit and the iBMA circuit and generates error values.

REFERENCES:
patent: 6092233 (2000-07-01), Yang
patent: 6119262 (2000-09-01), Chang et al.
patent: 6122766 (2000-09-01), Fukuoka et al.
patent: 6209115 (2001-03-01), Truong et al.
patent: 6256763 (2001-07-01), Oh et al.
patent: 6286123 (2001-09-01), Kim
patent: 6317858 (2001-11-01), Cameron
patent: 6347389 (2002-02-01), Boyer
patent: 6374384 (2002-04-01), Ohta et al.
patent: 6378104 (2002-04-01), Okita
patent: WO99/09694 (1999-02-01), None
Reed et al., VLSI design of inverse-free Berlekamp Massey algorithm, Sep. 1991,, IEE Proceedings-E, vol. 138, No. 5, pp. 295-298.
Xu, youzhi, Implementation of Berlekamp Massey algorithm without inversion, Jun. 1991, IEE Proceedings-I vol. 138, No. 3, pp. 138-140.
Sarwate et al., High speed architecture for Reed Solomon decoders, Oct. 2001, IEEE Trans. on VLSI Sys., vol. 9, No. 5, pp. 641-655.
Chien, “Cycle Decoding Procedures for Bose-Chaudhuri-Hocquenghem Codes”, IEEE Transactions on Information Theory, Oct. 1964, pp. 357-363.
Elwyn R. Berlekamp, “Algebraic Coding Theory, Binary BHC Codes for Correcting Multiple Errors”, 1968, pp. 176-196.
Ralf Koetter, “On the determination of error values for codes from a class of maximal curves”, University of Illinois Coordinated Science Laboratory, Urbana, Illinois, pp. 44-53.
Truong/Jeng/Hung, “Inversionless Decoding of Both Errors and Erasures of Reed-Solomon Code”, IEEE Transactions on Communications, vol. 46, No. 8, Aug. 1998, pp. 973-976.
Bose-Chaudhuri-Hocquenghme Codes, 7.5 Fast Decoding of BCH Codes, pp. 186-187.
Feng, On Decoding Reed-Solomon Codes Up To And Beyond The Packing Radii, Chapter 2, University of Illinois at Urbana-Champaign, 1999, pp. 7-32.
Forney, Jr., “On Decoding BCH Codes”, IEEE Transactions on Information Theory, vol. 11, No. 4, Oct. 1965, pp. 549-557.
Horiguchi, “High-Speed Decoding of BCH Codes Using a New Error-Evaluation Algorithm”, Electronics and Communications in Japan, Part 3, vol. 72, No. 12, 1989, pp. 63-71.
Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Transactions on Information Theory, vol. 15, No. 1, Jan. 1969, pp. 122-127.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient high-speed Reed-Solomon decoder does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient high-speed Reed-Solomon decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient high-speed Reed-Solomon decoder will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3571371

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.