Patent EP0132086A2 successfully refreshed from Google Patents.
EP0132086A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Methods of and apparatus for correcting errors in binary data
Assignee: Sony Corp
•
Filing: 1984-07-05
•
Granted: —
•
Expires: 2004-07-05
Abstract
Abstract A method of correcting errors in binary data which may represent a digital television signal, comprises assembling the data into a plurality of first blocks, each first block comprising a first plurality of, say sixty, data words (Wo,etc) and a second plurality of, say six, check words (Ko,etc) and further assembling the first blocks into arrays of first blocks and deriving first and second check blocks for each array of the first blocks. Each check word is derived in dependence on all the data words in the first block and each other check word in the first block. One check word may be derived by modulo-2 addition and the remaining check words may be derived by respective primitive polynomial generators. The first check block is derived by modulo-2 addition and the second check block is derived by a primitive polynomial generator.
Inventors
- 👤 James Hedley Wilkinson
- 👤 John Goodwin Spencer Ive
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-05 21:40
CPC Classifications
H; H04; H04N; H04N5/00; H04N5/76; H04N5/91; H04N5/93; H04N5/94; H04N5/945; G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1806; G11B20/1809
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
113 words
A method of correcting errors in binary data, the method comprising assembling the data into a plurality of data blocks, each said data block comprising a first plurality of data words (W O , etc) and a second plurality of check words (K 0 , etc), each said check word (K 0 , etc) being derived in dependence on all said data words (W 0 , etc) in said data block and each other said check word (K 0 , etc) in said data block, and further assembling said data blocks into an array consisting of a plurality of said data blocks and deriving first and second check blocks for each said array.
Claim 2
Independent Claim
113 words
A method of correcting errors in binary data, the method comprising assembling the data into a plurality of data blocks, each said data block comprising a first plurality of data words (W O , etc) and a second plurality of check words (K 0 , etc), each said check word (K 0 , etc) being derived in dependence on all said data words (W 0 , etc) in said data block and each other said check word (K 0 , etc) in said data block, and further assembling said data blocks into an array consisting of a plurality of said data blocks and deriving first and second check blocks for each said array.
Claim 3
Dependent Claim
84 words
A method according to claim 1 wherein after transmission and reception or recording and reproduction of said binary data, said check words (K 0 , etc) are used in a first correction step to detect and to correct errors in said data words (W 0 , etc) and said check words (K 0 , etc), and in a second correction step said first and second check blocks are used to detect and to correct further errors in said data words (W 0 , etc).
Claim 4
Dependent Claim
91 words
A method according to claim 1 wherein after transmission and reception or recording and reproduction of said binary data, said check words (K O , etc) are used in a first correction step to detect and to correct errors in said data words and said check words (K 0 , etc), and in a second correction step said first and second check blocks are used to correct further errors in said data words (W 0 , etc) which have been detected by but not corrected by said check words (KO, etc).
Claim 5
Dependent Claim
40 words
A method according to claim 1 or claim 2 wherein in a third correction step said check words (K O , etc) are used to detect and to correct still further errors in said data words (W O , etc).
Claim 6
Dependent Claim
84 words
A method according to claim 2, claim 3 or claim 4 wherein one of said check words (K 0 , etc) in each said second plurality of check words (K 0 , etc) is derived by modulo-2 addition and each of the remaining said check words (K O , etc) in each said second plurality of check words (K 0 , etc) is derived by a respective primitive polynomial generator each using a respective function of the extension field of a common generator polynomial.
Claim 7
Dependent Claim
58 words
A method according to claim 5 wherein said binary data represents a digital television signal and said first check block is derived by modulo-2 addition of a plurality of said first blocks, said first blocks respectively belonging to active picture elements of a digital television signal, and said second check block is derived by a primitive polynomial generator.
Claim 8
Dependent Claim
19 words
A method according to claim 6 wherein said first and second check blocks are derived using a Reed-Solomon code.
Claim 9
Dependent Claim
14 words
A method according to claim 5 wherein said binary data represents an audio signal.
Claim 10
Dependent Claim
119 words
Apparatus for correcting errors in binary data, the apparatus comprising means (40, 41) for assembling the data into a plurality of data blocks, each said data block comprising a first plurality of data words (W 0 , etc) and a second plurality of check words (K 0 , etc), each said check word being derived in dependence on all said data words (W 0 , etc) in said data block and each other said check word (K 0 , etc) in said data block, and means (42) for further assembling said data blocks into an array consisting of a plurality of said data blocks and for deriving first and second check blocks for each said plurality of data blocks.
Claim 11
Dependent Claim
119 words
Apparatus for correcting errors in binary data, the apparatus comprising means (40, 41) for assembling the data into a plurality of data blocks, each said data block comprising a first plurality of data words (W 0 , etc) and a second plurality of check words (K 0 , etc), each said check word being derived in dependence on all said data words (W 0 , etc) in said data block and each other said check word (K 0 , etc) in said data block, and means (42) for further assembling said data blocks into an array consisting of a plurality of said data blocks and for deriving first and second check blocks for each said plurality of data blocks.
Claim 12
Dependent Claim
81 words
Apparatus according to claim 9 wherein one of said check words (K 0 , etc) in each said plurality of check words (K 0 , etc) is derived by modulo-2 addition and each of the remaining said check words (K 0 , etc) in each said second plurality of check words (K 0 , etc) is derived by a respective primitive polynomial generator (Figures 9A, 9B, 10) each using a respective function of the extension field of a common generator polynomial.
Claim 13
Dependent Claim
61 words
Apparatus according to claim 10 wherein said binary data represents a digital television signal and said first check block is derived by modulo-2 addition of a plurality of said first blocks, said first blocks respectively belonging to active picture elements of a digital television signal, and said second check block is derived by a primitive polynomial generator (Figures 9A, 9B, 10).
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.