Patent US4852099A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4852099A Expired / Lapsed US ⏱️ 0.0 years remaining

Error correction method using Reed-Solomon code

Assignee: Sony Corp
•
Filing: 1988-02-02
•
Granted: 1989-07-25
•
Expires: 2008-02-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In an error correction method using Reed-Solomon code when the error correction is performed by using the result of the multiplication of a syndrome and an error location, another syndrome is added to thereby form a new syndrome. By repetitively executing this procedure, the error vector is obtained by a small number of arithmetic operations relative to a known procedure, thereby performing error correction by the so-called erasure correction technique. Then, by calculating another error vector using the first calculated error vector, the number of arithmetic operation times can be even further reduced.

Inventors

  • 👤 Shinya Ozaki

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 21:51
CPC Classifications
H; H03; H03M; H03M7/00; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 115 words
An error-correction method for use in decoding Reed-Solomon code that corrects errors in data by use of known error locations, whereby respective error symbols are corrected by use of n error vectors obtained by a series of steps comprising: (A) performing product sum arithmetic operations of syndromes Sν(ν=0 to n-1) and error locations X j (j=1 to n) on the basis of: Sν.sub.,i =Sν.sub.,i-1 X.sub.i +Sν.sub.+1,i-1 ( 1≦i≦n-1: n is the number of error symbols) where, (Sν.sub.,0 =Sν) for sequentially obtaining an i th answer Sν.sub.,i, and for finally obtaining S 0 ,n-1 ; and (B) obtaining error vectors Y n by performing the following arithmetic operation by use of said S O ,n-1, ##EQU23##
Claim 2
Dependent Claim 115 words
An error-correction method for use in decoding Reed-Solomon code that corrects errors in data by use of known error locations, whereby respective error symbols are corrected by use of n error vectors obtained by a series of steps comprising: (A) performing product sum arithmetic operations of syndromes Sν(ν=0 to n-1) and error locations X j (j=1 to n) on the basis of: Sν.sub.,i =Sν.sub.,i-1 X.sub.i +Sν.sub.+1,i-1 ( 1≦i≦n-1: n is the number of error symbols) where, (Sν.sub.,0 =Sν) for sequentially obtaining an i th answer Sν.sub.,i, and for finally obtaining S 0 ,n-1 ; and (B) obtaining error vectors Y n by performing the following arithmetic operation by use of said S O ,n-1, ##EQU23##
Claim 3
Dependent Claim 166 words
An error correction method for use in decoding Reed-Solomon code that corrects errors by use of known error locations, whereby respective error symbols are corrected by use of n error vectors obtained by repetitively executing a series of steps comprising: (A) performing product sum arithmetic operations of syndromes Sν(ν=0 to n-1) and error locations X j (j=1 to n) on the basis: Sν.sub.,i =Sν.sub.,i-1 X.sub.i +Sν.sub.+1,i-l ( 1≦i≦n-1: and n is the number of error symbols) where, (Sν.sub.,0 =S); for sequentially obtaining an i th answer Sν.sub.,i, and for finally obtaining S 0 ,n-1 ; (B) obtaining error vectors Y n by performing the following arithmetic operation by use of said S 0 ,n-1 derived in the preceding step, ##EQU24## thereby correcting one-symbol errors; (C) correcting said syndromes Sν(ν=0 to n-2) by use of said error vectors Y n , thereby producing syndromes in the case of (n-1)-multiple errors; and (D) thereafter, applying said equation for Sν.sub.,i to obtain the next error vector Y n-1 .
Claim 4
Dependent Claim 166 words
An error correction method for use in decoding Reed-Solomon code that corrects errors by use of known error locations, whereby respective error symbols are corrected by use of n error vectors obtained by repetitively executing a series of steps comprising: (A) performing product sum arithmetic operations of syndromes Sν(ν=0 to n-1) and error locations X j (j=1 to n) on the basis: Sν.sub.,i =Sν.sub.,i-1 X.sub.i +Sν.sub.+1,i-l ( 1≦i≦n-1: and n is the number of error symbols) where, (Sν.sub.,0 =S); for sequentially obtaining an i th answer Sν.sub.,i, and for finally obtaining S 0 ,n-1 ; (B) obtaining error vectors Y n by performing the following arithmetic operation by use of said S 0 ,n-1 derived in the preceding step, ##EQU24## thereby correcting one-symbol errors; (C) correcting said syndromes Sν(ν=0 to n-2) by use of said error vectors Y n , thereby producing syndromes in the case of (n-1)-multiple errors; and (D) thereafter, applying said equation for Sν.sub.,i to obtain the next error vector Y n-1 .

References Cited (Backward Citations)

US4497058A Cited
US4546474A Cited
US4476562A Cited
US4675869A Cited
US4796110A Cited
US4763332A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-07-24 1993-01-23 1993-07-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-07-24 1997-01-23 1997-07-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-07-24 2001-01-23 2001-07-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag