US4719628A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for decoding error correction code
Assignee: Sony Corp
•
Filing: 1984-12-19
•
Granted: 1988-01-12
•
Expires: 2004-12-19
Abstract
Abstract In a method for decoding an error correction code in which a first correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimensional arrangement of (k 1 ×k 2 ), a first pointer formed by decoding the first error correction code is stored in a memory having n 2 bits, a second pointer formed by decoding the second error correction code is stored in a memory having k 2 bits, reliability of the information symbols is evaluated on the basis of status of the first and second pointers when the information symbols is outputted. In the case when the second error correction code is decoded, an erasure correction may be made with respect to each of the code series of the second error correction code by employing the first pointer and a part of the calculation for obtaining an error value in this erasure correction may be carried out only once with respect to each of the code series of the second error correction code.
Inventors
- 👤 Shinya Ozaki
- 👤 Kentaro Odaka
- 👤 Tadashi Fukumi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 22:05
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15; H03M13/151; H03M13/158; H03M13/1525; H03M13/29; H03M13/2903; H03M13/2906; H03M13/2909; H03M13/2927; H03M13/293; H03M13/1515
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
154 words
A method for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimensional arrangement of (k 1 ×k 2 ), the method comprising the steps of: storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; storing a second pointer formed by decoding said second error correction code in a memory having k 2 bits; and manifesting an indication of the reliability of said information symbols in response to the status of said first and second pointers when outputting said information symbols.
Claim 2
Independent Claim
154 words
A method for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimensional arrangement of (k 1 ×k 2 ), the method comprising the steps of: storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; storing a second pointer formed by decoding said second error correction code in a memory having k 2 bits; and manifesting an indication of the reliability of said information symbols in response to the status of said first and second pointers when outputting said information symbols.
Claim 3
Independent Claim
159 words
An apparatus for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimensional arrangement of (k 1 ×k 2 ), the apparatus comprising: memory means for storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; memory means for storing a second pointer formed by decoding said second error correction code in a memory having k 2 bits; and means for manifesting an indication of the reliability of said information symbols on the basis of status of said first and second pointers when outputting said information symbols.
Claim 4
Independent Claim
159 words
An apparatus for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimensional arrangement of (k 1 ×k 2 ), the apparatus comprising: memory means for storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; memory means for storing a second pointer formed by decoding said second error correction code in a memory having k 2 bits; and means for manifesting an indication of the reliability of said information symbols on the basis of status of said first and second pointers when outputting said information symbols.
Claim 5
Independent Claim
162 words
A method for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) and encoded for every k 2 information symbols arranged in each row of a two dimentional arrangement of (k 1 ×k 2 ), the method comprising the steps of: storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; and decoding said second error correction code by implementing an erasure correction for each code series of said second error correction code by employing said first pointer and by implementing a calculation for obtaining an error value only once for each code series of said second error correction code in said erasure error correction.
Claim 6
Independent Claim
162 words
A method for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) and encoded for every k 2 information symbols arranged in each row of a two dimentional arrangement of (k 1 ×k 2 ), the method comprising the steps of: storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; and decoding said second error correction code by implementing an erasure correction for each code series of said second error correction code by employing said first pointer and by implementing a calculation for obtaining an error value only once for each code series of said second error correction code in said erasure error correction.
Claim 7
Independent Claim
163 words
An apparatus for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimentional arrangement of (k 1 ×k 2 ), the apparatus comprising: means for storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; and means for decoding said second error correction code by implementing an erasure correction for each code series of said second error correction code by employing said first pointer and by implementing a calculation for obtaining an error value only once for each code series of said second error correction code in said erasure error correction.
Claim 8
Independent Claim
163 words
An apparatus for decoding error correction code in which a first error correction code of (n 1 , k 1 ) (where n 1 denotes the code length) is encoded for every k 1 information symbols arranged in each column and a second error correction code of (n 2 , k 2 ) (where n 2 denotes the code length) are encoded for every k 2 information symbols arranged in each row of a two dimentional arrangement of (k 1 ×k 2 ), the apparatus comprising: means for storing a first pointer formed by decoding said first error correction code in a memory having n 2 bits; and means for decoding said second error correction code by implementing an erasure correction for each code series of said second error correction code by employing said first pointer and by implementing a calculation for obtaining an error value only once for each code series of said second error correction code in said erasure error correction.
Claim 9
Independent Claim
91 words
An apparatus for decoding a non-dualistic error correction code in which one of a plurality of syndromes is a result of an addition of a series of received symbols in (mod. 2) and by which errors of a plurality of symbols in said series of received symbols, can be corrected, the apparatus comprising: a syndrome register for storing said syndromes; wherein an error value with respect to a symbol is formed by substracting an error value from a value stored in said syndrome register in correcting a plurality of erroneous symbols.
Claim 10
Independent Claim
91 words
An apparatus for decoding a non-dualistic error correction code in which one of a plurality of syndromes is a result of an addition of a series of received symbols in (mod. 2) and by which errors of a plurality of symbols in said series of received symbols, can be corrected, the apparatus comprising: a syndrome register for storing said syndromes; wherein an error value with respect to a symbol is formed by substracting an error value from a value stored in said syndrome register in correcting a plurality of erroneous symbols.
Claim 11
Independent Claim
92 words
A method for decoding and correcting Reed=Solomon code comprising the steps of solving the expression ##EQU30## where, ν=0to d-2 n: Number of erasure X k : Location of kth element Sν: Syndrome Y k : Magnitude of error in the erasure of kth element d: Minimum distance of code to obtain the roots ##EQU31## where Λ nij : Coefficient of Z j of ##EQU32## 1: Any integer more than or equal to 0 which satisfies 1≦d-n-1 and making erasure correction of errors encoded in said Reed═Solomon code in accordance with said roots.
Claim 12
Independent Claim
92 words
A method for decoding and correcting Reed=Solomon code comprising the steps of solving the expression ##EQU30## where, ν=0to d-2 n: Number of erasure X k : Location of kth element Sν: Syndrome Y k : Magnitude of error in the erasure of kth element d: Minimum distance of code to obtain the roots ##EQU31## where Λ nij : Coefficient of Z j of ##EQU32## 1: Any integer more than or equal to 0 which satisfies 1≦d-n-1 and making erasure correction of errors encoded in said Reed═Solomon code in accordance with said roots.
References Cited (Backward Citations)
US3714629A
Cited
US4030067A
Cited
US4142174A
Cited
US4236247A
Cited
US4546474A
Cited
US4646301A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-01-11 | 1991-07-13 | 1992-01-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-01-11 | 1995-07-13 | 1996-01-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-01-11 | 1999-07-13 | 2000-01-12 | $7700.00 | Window Closed / Lapsed |