Digital signal transmission

Abstract

Abstract Digital words are transmitted together with associated parity or checking digits. The parity bits are each related to a group of bits of the same significance from several different words. At a receiving station, a parity bit is generated for the same group from the incoming words and compared with the corresponding received parity bit. When the generated and received parity bits differ, a value is estimated for each word containing a bit from the respective group, and the estimated and received values for the word are compared to detect any word containing an erroneous bit, which bit is then corrected. This invention relates to the transmission of digital signals. In digital television systems the video signal is commonly represented by a series of eight-digit binary numbers. If any of the bits are altered by errors, then the effect appears as a brightness error in the picture, the magnitude of which depends on the significance of the affected bit. Extra bits, known as parity bits, can be added to the signal to reduce the effect of errors. Each parity bit may typically describe the modulo-two sum of a group of bits in the signal; the rules of modulo-two addition, for which the symbol + is used, being as follows: 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 An exlcusive-OR gate is a well known circuit which effects modulo-two addition. An odd number of errors in a group is shown by disagreement between the parity digit and the modulo-two sum of the digits, but an even number of errors in a group cannot be detected since the modulo-two sum of the digits is the same as for no errors. For a particular error rate, the probability of more than one error occurring in a group increases with the size of the group, so it is an advantage to keep the number of signal bits protected by one parity bit small. Conventionally, one parity bit is assigned to protect each eight-bit word of the television signal. Then, if an error is indicated, the protected word is discarded in its entirety and replaced by a value which will "conceal" the error. Suitable values for substitution are the average of the two adjacent samples in monochrome signals or the average of samples one or more colour subcarrier period away in colour signals. The accuracy of the values calculated in this way is such that errors in the fifth and less significant bits are generally less noticeable than the errors caused by this "concealment". Therefore it is usual to protect only the four most significant bits of each word with a parity bit. Table 1 shows an array of eight consecutive words, labelled a to h, each made up of eight bits. Digit a 1 is the most significant bit of word a representing 128 levels in the signal, a 2 the next in significance representing 64 levels, and so on down to a 8 which is the least significant digit of word a and represents one level in the signal. TABLE 1 ______________________________________ Significance Words ______________________________________ 128 a 1 b 1 c 1 d 1 e 1 f 1 g 1 h 1 64 a 2 b 2 c 2 d 2 e 2 f 2 g 2 h 2 32 a 3 b 3 c 3 d 3 e 3 f 3 g 3 h 3 16 a 4 b 4 c 4 d 4 e 4 f 4 g 4 h 4 8 a 5 b 5 c 5 d 5 e 5 f 5 g 5 h 5 4 a 6 b 6 c 6 d 6 e 6 f 6 g 6 h 6 2 a 7 b 7 c 7 d 7 e 7 f 7 g 7 h 7 1 a 8 b 8 c 8 d 8 e 8 f 8 g 8 h 8 Parity bits P a P b P c P d P e P f P g P h ______________________________________ Associated with the eight words of the signal are eight parity bits P a to P h . With the coventional arrangement of one parity bit assigned to the four most significant digits of each word, the parity bits and the signal bits are related by equations of the form: P.sub.a = a.sub.1 + a.sub.2 + a.sub.3 + a.sub.4 P.sub.b = b.sub.1 + b.sub.2 + b.sub.3 + b.sub.4 . . P.sub.h = h.sub.1 + h.sub.2 + h.sub.3 + h.sub.4 When a parity digit is found to differ from the modulo-2 sum of the first four digits of the associated word, it is known that one of those four digits is incorrect. However, it is not known which digit is incorrect, and thus the whole word is discarded and replaced by concealment. This means that the concealment provides a relatively poor approximation to the correct signal. According to this invention there are provided a method of and apparatus for generating parity digits for a digital signal which comprises a plurality of words each of which consists of a plurality of bits, in which a group of bits of the same significance are selected from several different words with a predetermined selection law, and the bits of the group are combined with a predetermined combination law to provide a parity bit associated with the selected group. When an error is indicated each word which contains a bit from the suspect group can then be compared with the value for that word estimated from nearby words (in the signal or in the information which the signal represents) and the value which gives the best agreement with the estimate can be chosen for the suspect bit. The invention also provides a method of and apparatus for detecting errors in a received digital signal which comprises a plurality of words each of which consists of a plurality of bits, the signal having parity bits, in which one parity bit is generated for each of a group of bits of the received signal to correspond with the received parity bits, the corresponding generated and received parity bits are compared, and when the generated and received parity bits differ in respect of a group, a value is estimated for each word containing a bit from the respective group, and the estimated and received values are compared to detect any word containing an erroneous bit. In this way errors can be corrected rather than concealed, the error caused by concealment being avoided.

Inventors

• 👤 Christopher Keith Perry Clarke

Bibliographic Details