Processing binary data
AssigneeSony Corporation
InventorJohn G. S. Ive
Life of this patent
Estimating the term…
Abstract
A method of processing binary data, which is preferably a digital television signal, comprises dividing the data into blocks of ten 8-bit words, deriving an 8-bit parity word each digit of which is a parity digit for the corresponding digits of the ten words, deriving an 8-bit check word by binary summing the ten words and forming the check word as the eight least significant bits of the resulting binary sum, subjecting to further processing, for example by magnetic recording and reproduction, the block of words including the parity word and the check word, and thereafter checking the parity word and the check word to reveal errors occuring in the ten words during the further processing.
Claims14
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.
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.
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.
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.
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.
Dependencies are inferred from the claim text.