US4400810A — Processing binary data

Claim 1

Independent Claim 127 words

A method of processing binary data comprising dividing the data into blocks of m words each of n bits, deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m words, deriving an n-bit check word by binary full-addition summing said m words and forming said check word as the n least significant bits of the resulting binary sum, subjecting to further processing said block of words including said parity word and said check word, checking the validity of each of the words, using said parity word and said check word to detect and correct at least some of the errors occurring in said m words during said further processing, and concealing any error which cannot be corrected.

Claim 2

Independent Claim 127 words

A method of processing binary data comprising dividing the data into blocks of m words each of n bits, deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m words, deriving an n-bit check word by binary full-addition summing said m words and forming said check word as the n least significant bits of the resulting binary sum, subjecting to further processing said block of words including said parity word and said check word, checking the validity of each of the words, using said parity word and said check word to detect and correct at least some of the errors occurring in said m words during said further processing, and concealing any error which cannot be corrected.

Claim 3

Dependent Claim 52 words

A method according to claim 1 wherein n is 8 and prior to said further processing, said words are all converted to respective 10-bit words using the sub-set of 10-bit words consisting of 5 "0" bits and 5 "1" bits, said 10-bit words being re-converted to 8-bit words after said further processing.

Claim 4

Dependent Claim 40 words

A method according to claim 1 wherein the natural sequence of said words including the parity words and check words is shuffled prior to said further processing, and the order is restored to said natural sequence after said further processing.

Claim 5

Dependent Claim 19 words

A method according to claim 1 wherein said data represents video information of a television signal in digital form.

Claim 6

Dependent Claim 15 words

A method according to claim 1 wherein said further processing comprises magnetic recording and reproduction.

Claim 7

Dependent Claim 142 words

Apparatus for processing binary data, the apparatus comprising means for dividing the data into blocks of m words each of n bits, means for deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m words, means for deriving an n-bit check word by binary full-addition summing said m words and forming said check word as the n least significant bits of the resulting binary sum, means to subject said block of words including said parity word and said check word to further processing, means for checking the validity of each of the words, means for using said parity word and said check word to detect and correct at least some of the errors occurring in said m words during said further processing, and means for concealing any error which cannot be corrected.

Claim 8

Dependent Claim 142 words

Apparatus for processing binary data, the apparatus comprising means for dividing the data into blocks of m words each of n bits, means for deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m words, means for deriving an n-bit check word by binary full-addition summing said m words and forming said check word as the n least significant bits of the resulting binary sum, means to subject said block of words including said parity word and said check word to further processing, means for checking the validity of each of the words, means for using said parity word and said check word to detect and correct at least some of the errors occurring in said m words during said further processing, and means for concealing any error which cannot be corrected.

Claim 9

Dependent Claim 62 words

Apparatus according to claim 6 wherein n is 8 and wherein said apparatus further comprises means operative prior to said further processing to convert all said words to respective 10-bit words using the sub-set of 10-bit words consisting of 5 "0" bits and 5 "1" bits, and means operative subsequent to said further processing to re-convert said 10-bit words to 8-bit words.

Claim 10

Dependent Claim 45 words

Apparatus according to claim 6 further comprising means to shuffle the natural sequence of said words including the parity words and check words prior to said further processing and means to restore the order of said words to said natural sequence after said further processing.

Claim 11

Dependent Claim 30 words

Apparatus according to claim 6 wherein said further processing comprises magnetic recording and reproduction, and said apparatus further comprises a video tape recorder for effecting said magnetic recording and reproduction.

Claim 12

Independent Claim 206 words

A method of processing binary data comprising dividing the data into blocks of m data words each of n bits; deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m data words; deriving an n-bit check word by binary summing said m data words and forming said check word as the n least significant bits of the resulting binary sum; shuffling the m data words, the parity word, and the check word of each block so that no two words of the same block are adjacent to one another; transmitting said blocks on a carrier; receiving the transmitted blocks; deshuffling said words to their natural sequence; checking the validity of each of the words; using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid; and concealing any erroneous words which cannot be corrected; wherein said checking the validity includes checking the validity of said data words, and blocking the concealing of erroneous words if all said data words are determined to be valid.

Claim 13

Independent Claim 206 words

A method of processing binary data comprising dividing the data into blocks of m data words each of n bits; deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m data words; deriving an n-bit check word by binary summing said m data words and forming said check word as the n least significant bits of the resulting binary sum; shuffling the m data words, the parity word, and the check word of each block so that no two words of the same block are adjacent to one another; transmitting said blocks on a carrier; receiving the transmitted blocks; deshuffling said words to their natural sequence; checking the validity of each of the words; using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid; and concealing any erroneous words which cannot be corrected; wherein said checking the validity includes checking the validity of said data words, and blocking the concealing of erroneous words if all said data words are determined to be valid.

Claim 14

Independent Claim 263 words

A method of processing binary data comprising dividing the data into blocks of m data words each of n bits, deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m data words, deriving an n-bit check word by binary summing said m data words and forming said check word as the n least significant bits of the resulting binary sum, transforming said n-bit data words, said n-bit parity word, and said n-bit check word into transformed words each of n' bits, wherein n'>n so that the transformed n'-bit words form a subset of all possible n'-bit words, shuffling the m data words, the parity word, and the check word of each block so that no two words of the same block are adjacent to one another; transmitting said blocks on a carrier; receiving the transmitted blocks; deshuffling said words to their natural sequence; checking the validity of each of the deshuffled n'-bit words; retransforming said n'-bit words into respective n-bit words; using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid; and concealing any erroneous words which cannot be corrected, wherein said checking the validity includes checking whether the N'-bit data words are all valid members of said subset thereof, and blocking said concealing of erroneous words if all said n'-bit data words are determined to be such valid members.

Claim 15

Independent Claim 263 words

A method of processing binary data comprising dividing the data into blocks of m data words each of n bits, deriving an n-bit parity word each digit of which is a parity digit for the corresponding digits of said m data words, deriving an n-bit check word by binary summing said m data words and forming said check word as the n least significant bits of the resulting binary sum, transforming said n-bit data words, said n-bit parity word, and said n-bit check word into transformed words each of n' bits, wherein n'>n so that the transformed n'-bit words form a subset of all possible n'-bit words, shuffling the m data words, the parity word, and the check word of each block so that no two words of the same block are adjacent to one another; transmitting said blocks on a carrier; receiving the transmitted blocks; deshuffling said words to their natural sequence; checking the validity of each of the deshuffled n'-bit words; retransforming said n'-bit words into respective n-bit words; using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid; and concealing any erroneous words which cannot be corrected, wherein said checking the validity includes checking whether the N'-bit data words are all valid members of said subset thereof, and blocking said concealing of erroneous words if all said n'-bit data words are determined to be such valid members.

Claim 16

Dependent Claim 23 words

A method according to claim 10, wherein n=8, n'=10, and said subset includes those words having 5 "0" bits and 5 "1" bits.

Claim 17

Dependent Claim 268 words

Apparatus for processing binary data, comprising means for dividing the data into blocks of m words each of n bits; means for deriving an n-bit parity word each digit of which is a parity digit for corresponding digits of said m words; means for deriving an n-bit check word by binary summing said m words and forming said check word as the n least significant bits of the resulting binary sum; means for converting said n-bit words into n'-bit converted words, wherein n'>n and the converted words form a predetermined subset of all possible n'-bit words; shuffling means for shuffling said words from their natural sequence so that no two words of the same block are adjacent to one another; means for transmitting the blocks on a carrier; means for receiving the transmitted blocks; deshuffling means for restoring said words to their natural sequence; means for checking whether the m n'-bit words of each block are valid members of said subset; reconverting means for transforming the n'-bit words into respective n-bit words; correcting means using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid and for concealing any erroneous words which cannot be corrected; wherein said means for checking includes means for determining whether said n'-bit data words are all valid members of said subset and means for blocking concealment of erroneous words if all said n'-bit data words are determined to be valid members.

Claim 18

Dependent Claim 268 words

Apparatus for processing binary data, comprising means for dividing the data into blocks of m words each of n bits; means for deriving an n-bit parity word each digit of which is a parity digit for corresponding digits of said m words; means for deriving an n-bit check word by binary summing said m words and forming said check word as the n least significant bits of the resulting binary sum; means for converting said n-bit words into n'-bit converted words, wherein n'>n and the converted words form a predetermined subset of all possible n'-bit words; shuffling means for shuffling said words from their natural sequence so that no two words of the same block are adjacent to one another; means for transmitting the blocks on a carrier; means for receiving the transmitted blocks; deshuffling means for restoring said words to their natural sequence; means for checking whether the m n'-bit words of each block are valid members of said subset; reconverting means for transforming the n'-bit words into respective n-bit words; correcting means using said parity word and said check word to correct at least one error if less than a predetermined number of erroneous words are present in one such block and if the associated parity word and check word are determined to be valid and for concealing any erroneous words which cannot be corrected; wherein said means for checking includes means for determining whether said n'-bit data words are all valid members of said subset and means for blocking concealment of erroneous words if all said n'-bit data words are determined to be valid members.

Claim 19

Dependent Claim 171 words

Apparatus for processing binary data according to claim 13, wherein said means for blocking concealment includes validity signal input means coupled to said means for checking to receive a data-valid signal when all the m n'-bit data words are determined to be valid members of said subset; means for computing the parity of said m n-bit data words and comparing the same with said parity word to provide a parity error signal; means for computing the sum of said m n-bit data words and comparing said sum with said check word to provide a check error signal; respective latch circuit means having inputs coupled to receive the associated parity and sum error signals, a clock input, a clear input, and an output; sequencer means providing a latch signal to each said clock input; said validity signal input means being coupled to each said clear input; and an OR circuit having inputs respectively coupled to the outputs of said latch means and an output providing a correction-inhibiting signal to said correcting means.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1986-08-22	1987-02-21	1987-08-23	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1990-08-22	1991-02-21	1991-08-23	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1994-08-22	1995-02-21	1995-08-23	$7700.00	Window Closed / Lapsed

Processing binary data

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag