Degree limited polynomial in Reed-Solomon decoding

Details Degree limited polynomial in Reed-Solomon decoding Degree limited polynomial in Reed-Solomon decoding

2005-10-18

2009-11-03

Abraham, Esaw T (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S785000

Reexamination Certificate

active

07613988

ABSTRACT:
Processing Reed Solomon data is disclosed. A scratch polynomial having a degree is obtained using an inversionless Berlekamp-Massey process. The degree of the scratch polynomial is limited. A magnitude of an error associated with the Reed Solomon data is determined based at least in part on information associated with the degree limited scratch polynomial. In some embodiments, determining the magnitude of an error using the degree limited scratch polynomial enables a smaller device.

REFERENCES:
patent: 5099482 (1992-03-01), Cameron
patent: 6209115 (2001-03-01), Truong et al.
patent: 6374383 (2002-04-01), Weng
patent: 6643819 (2003-11-01), Weng
patent: 6684364 (2004-01-01), Cameron
patent: 6888897 (2005-05-01), Nazari et al.
patent: 6917313 (2005-07-01), Burd et al.
patent: 6931585 (2005-08-01), Burd et al.
patent: 6961197 (2005-11-01), Burd et al.
patent: 7028245 (2006-04-01), Zhang
patent: 7051267 (2006-05-01), Yu et al.
patent: 7080310 (2006-07-01), Cameron
E. R Berlekamp,Algebraic Coding Theory, New York: McGraw-Hill, 1968. pp. 218-223 & 178-189. (revised ed.—Laguna Hills, CA Aegean Park, 1984.).
R. E. Blahut,Algebraic Codes for Data Transmission, Cambridge: Cambridge University Press, 2003. pp. 192-201.
H. 0. Burton, “Inversionless Decoding of Binary BCH codes,”IEEE Trans. Inform. Theory, vol. 17, pp. 464-466, Jul. 1971.
I. S. Reed, M. T. Shih, and T. K. Truong, “VLSI Design of Inverse-free Berlekamp-Massey algorithm,”Proc. Inst. Elect. Eng., pt. E, vol. 138, pp. 295-298, Sep. 1991.
D. V. Sarwate and N. R. Shanbhag, “High-speed Architectures for Reed-Solomon Decoders,”IEEE Trans. VLSI Systems, vol. 9, pp. 641-655, Oct. 2001.
E. R. Berlekamp, G. Seroussi, and P. Tong, “A hypersystolic Reed-Solomon Decoder,”Reed-Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava, Eds. Piscataway, NJ: IEEE Press, 1994.
H.-C. Chang and C. B. Shung, “New Serial Architecture for the Berlekamp-Massey Algorithm,”IEEE Trans. Comm., vol. 47, pp. 481-483, Apr. 1999.
H. M. Shao, T. K. Truong, L. J. Deutsch, J. H. Yuen, and I. S. Reed, “A VLSI Design of a Pipeline Reed-Solomon Decoder,”IEEE International Conference on ICASSP '85, vol. 10, pp. 1404-1407, May 1985.
H. Lee, “High-Speed VLSI Architecture for Parallel Reed-Solomon Decoder,”IEEE Trans. VLSI Systems, vol. 11, pp. 288-294, Apr. 2003.

Affiliated with

Also associated with

Rating

Degree limited polynomial in Reed-Solomon decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Degree limited polynomial in Reed-Solomon decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Degree limited polynomial in Reed-Solomon decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4119573