Architecture and control of reed-solomon error-correction...

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

C714S780000

Reexamination Certificate

active

07444582

ABSTRACT:
Systems and methods are provided for implementing various aspects of a Reed-Solomon (RS) error-correction system. A detector can provide a decision-codeword from a channel and can also provide soft-information for the decision-codeword. If the decision-codeword corresponds to an inner code and an RS code is the outer code, a soft-information map can process the soft-information for the decision-codeword to produce soft-information for a RS decision-codeword. A RS decoder can employ the Berlekamp-Massey algorithm (BMA), list decoding, and a Chien search, and can include a pipelined architecture. A threshold-based control circuit can be used to predict whether list decoding will be needed and can suspend the list decoding operation if it predicts that list decoding is not needed.

REFERENCES:
patent: 4541092 (1985-09-01), Sako et al.
patent: 5373511 (1994-12-01), Veksler
patent: 5450421 (1995-09-01), Joo et al.
patent: 5452310 (1995-09-01), Arts
patent: 5574979 (1996-11-01), West
patent: 5732093 (1998-03-01), Huang
patent: 5844918 (1998-12-01), Kato
patent: 6625775 (2003-09-01), Kim
patent: 7120850 (2006-10-01), Lehobey et al.
patent: 7131052 (2006-10-01), Hassner et al.
patent: 7185259 (2007-02-01), Fujita et al.
patent: 7328395 (2008-02-01), Burd
patent: 2003/0103582 (2003-06-01), Linsky et al.
patent: 2003/0123389 (2003-07-01), Russell et al.
patent: 2003/0128777 (2003-07-01), Linsky et al.
patent: 2004/0225940 (2004-11-01), Kerr et al.
U.S. Appl. No. 09/901,507, filed Jul. 9, 2001.
U.S. Appl. No. 10/135,422, filed Apr. 29, 2002.
U.S. Appl. No. 10/313,651, filed Dec. 6, 2002.
U.S. Appl. No. 11/006,381, filed Dec. 7, 2004.
R. Blahut,Theory and Practice of Error Control Codes, p. 267-272, 1983.
D. Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information,”IEEE Trans. Infor. Theory, vol. IT-18, No. 1, Jan. 1972, pp. 170-182.
G.D. Forney, Jr., “Generalized Minimum Distance Decoding,”IEEE Trans. Infor. Theory, vol. IT-12, No. 2, Apr. 1966, pp. 125-131.
V. Guruswami, M. Sudan, “Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes,”IEEE Trans. Infor. Theory, vol. 45, No. 6, Sep. 1999, pp. 1757-1767.
R. Koetter and A. Vardy, “Algebraic Soft-Decision Decoding of Reed-Solomon Codes”,IEEE Trans. Infor. Theory, vol. 49, No. 11, Nov. 2003, pp. 2809-2825.
M. Sudan, “Decoding of Reed Solomon codes beyond the error-correction bound,” J. complexity, vol. 12, pp. 180-193, 1997.
E. Berlekamp,Algebraic Coding Theory, pp. 218-240, 1984.
U.S. Appl. No. 11/195,403, Kikuchi et al., filed Aug. 1, 2005.
U.S. Appl. No. 11/195,183, Au et al., filed Aug. 1, 2005.

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

Architecture and control of reed-solomon error-correction... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Architecture and control of reed-solomon error-correction..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Architecture and control of reed-solomon error-correction... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4000851

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