DATV encoding and decoding method and apparatus

BACKGROUND OF THE INVENTION
The invention relates to a method of encoding a television signal in accordance with a plurality of operations each providing another distribution of temporal and/or spatial distribution, at least one of said operations including estimation of motion vectors for first frames out of pairs of television frames and/or estimation of pointers to motion vectors for second frames out of said pairs of television frames, said method further comprising encoding a digitally assisting signal into binary codewords comprising informations about said motion vectors, said pointers and/or according to which one of said plurality of operations the television signal is encoded.
The invention also relates to a method of decoding a television signal in accordance with a plurality of operations each providing another distribution of temporal and/or spatial distribution, at least one of said operations including motion compensated interpolation using motion vectors for first frames out of pairs of television frames and/or using pointers to motion vectors for second frames out of said pairs of television frames, said method further comprising decoding a digitally assisting signal having binary codewords comprising informations about said motion vectors, said pointers and/or according to which one of a plurality of encoding operations the television signal is encoded.
The invention further relates to apparatus for encoding a television signal comprising a plurality of means for operations each providing another distribution of temporal and/or spatial distribution, at least one of said means including means for estimating motion vectors for first frames out of pairs of television frames and/or estimating pointers to motion vectors for second frames out of said pairs of television frames, said apparatus further comprising means for encoding a digitally assisting signal into binary codewords comprising informations about said motion vectors, said pointers and/or according to which one of said plurality of operations the television signal is encoded.
The invention still further relates to apparatus for decoding a television signal comprising a plurality of means for operating on said television signal each providing another distribution of temporal and/or spatial distribution, at least one of said operating means including motion compensated interpolation means using motion vectors for first frames out of pairs of television frames and/or using pointers to motion vectors for second frames out of said pairs of television frames, said apparatus further comprising means for decoding a digitally assisting signal having binary codewords comprising informations about said motion vectors, said pointers and/or according to which one of a plurality of encoding operations the television signal is encoded.
The invention finally relates to encoding and decoding means for use with said encoding and decoding apparati.
Such methods and apparati are described in the non-prepublished French patent application no. 88.08301, filed 21.06.88 (U.S. patent application Ser. No. 366,802, filed June 14, 1989). In that application it is not yet described how to encode the digitally assisting signal into the binary codewords.
SUMMARY OF THE INVENTION
It is an object of the invention to provide fail-safe and efficient methods and apparati.
According to the invention, an encoding method of the kind described in the preamble is therefore characterized in that a Hamming-distance between a first codeword indicating an operation providing a maximum spatial resolution, and a second codeword indicating an operation providing a maximum temporal resolution, is at least one half the number of bits of each codeword.
According to the invention, a decoding method of the kind described in the preamble is therefore characterized in that a Hamming-distance between a first codeword indicating an operation providing a maximum spatial resolution, and a second codeword indicating an operation providing a maximum temporal resolution, is at least one half the number of bits of each codeword.
According to the invention, an encoding apparatus of the kind described in the preamble is therefore characterized in that a Hamming-distance between a first codeword indicating an operation providing a maximum spatial resolution, and a second codeword indicating an operation providing a maximum temporal resolution, is at least one half the number of bits of each codeword.
According to the invention, a decoding apparatus of the kind described in the preamble is therefore characterized in that a Hamming-distance between a first codeword indicating an operation providing a maximum spatial resolution, and a second codeword indicating an operation providing a maximum temporal resolution, is at least one half the number of bits of each codeword.
As is commonly known, the Hamming-distance (or dH) between two codewords is the number of mutually differing bits.
The invention is based on the recognition that in a high definition decoder of the HD-MAC television transmission system, television signals providing a maximum spatial resolution on the one hand, and television signals providing a maximum temporal resolution on the other hand, and decoded in completely different manners. It is therefore important that channel errors, which will occur during transmission, recording, etc., have a minimum effect. According to the invention, at least one half the number of bits of the first (second) codeword should be erroneously detected so that the second (first) codeword is decoded.
As a further measure to reach this object, said first codeword may be the inverse of said second codeword. As a still further measure to reach this object, all codewords having a Hamming-distance between that codeword and said first or said second codeword, being one, may be left unused; on the decoding side, they may be decoded like said first or said second codeword, respectively, so that buffers of unused codewords are created between said first and second codewords on the one hand, and the codewords indicating other operations on the other hand.
Codewords having a Hamming-distance between that codeword and said first or said second codeword, being two, may additionally be left unused; on the decoding side, they may be decoded like codewords indicating an operation providing a medium spatial resolution or like codewords indicating an operation providing a medium spatial resolution in one out of two successive television frames and a low spatial resolution in the other television frame, respectively. This solution is based on the recognition that in the case of channel errors, the first codeword indicating said operation providing a maximum spatial resolution may best be decoded like a codeword indicating the operation providing a medium spatial resolution, and vice versa, and that the second codeword indicating said operation providing a maximum temporal resolution (which implies a low spatial resolution) may best be decoded like a codeword indicating said operation providing a medium spatial resolution in one out of two successive television frames and a low spatial resolution in the other television frame, and vice versa. Preferably, said decoded codewords indicate operations having no or a zero motion vector.
Codewords indicating an operation including estimation of motion vectors and of pointers to motion vectors, may be arranged into a first plurality of bits and a second plurality of bits, said first bits indicating said motion vectors and said second bits indicating said pointers, so that channel errors in the first (second) plurality of bits have no detrimental effect on the information comprised in the second (first) plurality of bits. Preferably, a remaining pointer which is not encoded into said second plurality of bits, is a diagonal pointer, which is based on the recognition that diagonal motion vectors are relatively seldom.
Motion vectors having substantially the same magnitude and direction, may have codewords with small mutual Hamming-distances, so that in the case of channel errors, a motion vector is decoded which is close to the encoded motion vector.
Encoding means for use with an encoding apparatus may comprise memory means, like (programmable) read only memories, being programmed with a table comprising the codeword for each operation, each motion vector and/or each pointer.
Decoding means for use with a decoding apparatus may comprise memory means, like (programmable) read only memories, being programmed with a table comprising the operation, the motion vector and/or the pointer to a motion vecto each codeword.

BRIEF DESCRIPTION OF THE DRAWINGS
The description which will follow, with reference to the accompanying drawings describing non-limiting illustrative embodiments, will provide a good understanding of how the invention may be implemented.
FIG. 1 illustrates a mode of definition of a motion vector.
FIG. 2 is a block diagram of the assembly of the encoding circuits of a transmission system.
FIG. 3 illustrates the definition of various images mentioned in the description of the invention.
FIG. 4 represents image parts in two successive different images.
FIG. 5 is a detailed block diagram of circuit elements serving for the implementation of a part of the invention.
FIG. 6 is a detailed block diagram of circuit elements serving for the implementation of another part of the invention.
FIG. 7 is a detailed diagram of the element 24 of FIG. 6.
FIG. 8 illustrates an algorithm for the determination of a motion vector.

DETAILED DESCRIPTION OF AN EMBODIMENT OF THE INVENTION
The purpose of the system described here by way of example is to transmit images emanating from generators with 1152 useful lines, each of 1440 pixels, by using only one video pass band equal to that of a standard of 625 lines (576 useful lines of 720 pixels).
In order to permit the reconstruction of a part of the missing video information, digital data are associated with the video data.
For the transmission of the video signals, three different modes are used.
In an "80 ms" mode, with the aid of an appropriate digital filtering, the transmission takes place, for example, first of all during a period of 20 ms, of the odd pixels of the odd lines, during the following 20 ms of the odd pixels of the even lines, during the following 20 ms of the even pixels of the odd lines, and then finally of the even pixels of the even lines, the time employed for totally transmitting an image being therefore 80 ms. Nevertheless, during each period of 20 ms, the entire surface of an image is described; this permits compatibility with the old 625-line standards. By appropriately re-combining the pixels described in the course of four consecutive periods each of 20 ms, it is possible to recreate a high definition image. To do this, it is necessary that the source image should virtually not have varied in the course of the 80 ms. This mode is therefore applicable to fixed or quasi-fixed images.
In a "40 ms" mode, still after appropriate digital filtering, the transmission takes place, for example, of only the even lines, all the pixels of which are transmitted on two occasions. During a period of 20 ms the transmission takes place of the odd pixels, and then during the following period of the even pixels (it would also be possible to contemplate the transmission of only one pixel in two, but for all the lines). Accordingly, one half of the definition has been lost, but the image is described in 40 ms, that is to say twice as fast as in the "80 ms" mode; this permits certain movements.
In this "40 ms" mode, a motion vector is moreover available for each image part. FIG. 1 shows a motion vector, which represents the displacement of an object in the image in the course of time, and which has in this case co-ordinates ordinates x=+4, y=+3 expressed in pixels/40 ms. If a requirement is imposed of not processing co-ordinates greater than .+-.6 pixels, each possible motion vector corresponds to the distance between the central pixel at the origin of the vector and one of the pixels each represented by one of the squares of the checkered pattern of 13.times.13 which is illustrated by FIG. 1; this represents 169 possible vectors.
The motion vector permits the creation in the receiver, of an intermediate image and the temporal insertion thereof between two transmitted images. In order to create an intermediate image, a start is made from a transmitted image, and the movable parts are displaced therein along the appropriate motion vector, which is indicated by the transmitter. It is also possible to make use of the two images between which a supplementary image is to be inserted. For further details on the manner of recreating this image it is possible to refer to the publication mentioned in the preamble. By virtue of the image thus added, there is a further doubling of the temporal definition of the image; this permits the use of this mode even when large motions are present in the image. Nevertheless, the intermediate image is correct only if the motions are stable or quasi-stable. In the opposite case, where high accelerations are present, use is made of a third "20 ms" mode.
In the "20 ms" mode, the transmission takes place only, during a period of 20 ms, of for example the odd pixels of the odd lines, and in the course of the following 20 ms the transmission takes place, in an identical manner, of a new image. Thus, the temporal definition is excellent, on account of the fact that the image repetition rate is 50 Hz; this permits the transmission of all the movements without blur effects or jerky movement effects. On the other hand, the spatial definition is low (only one pixel in four has been transmitted) and corresponds to that of the 625-line standard. This is not too troublesome, since the eye is less sensitive to the absence of spatial definition when the objects observed move rapidly.
The image is divided into parts, for example in this case squares of 16.times.16 pixels, and for each one of these parts or "blocks", a different mode may be used. Further, in the case of movable objects in front of a background landscape, the latter will be able to be described with all its details in the "80 ms" mode, while within polygons formed of squares of 16.times.16 pixels and surrounding the movable objects most closely, a "40 ms" or "20 ms" mode will be locally used.
Moreover, in order to simplify the processing of the data, it is appropriate to process the sequences of images within the framework of invariable time intervals of 80 ms, and not to divide these 80 ms into more than two different phases. Each interval of 80 ms is processed as an independent whole, that is to say independent of the adjacent intervals.
FIG. 2 represents a block diagram of an encoding system on transmission, in order to define the context of the invention as well as its substantive situation.
The images arrive sequentially, according to a line scanning, at the connection 34. They are processed simultaneously by three parallel channels, respectively (9, 26), (10, 27), (11, 28).
The "80 ms" channel comprises, in cascade, a preprocessing element 9, and a sampling circuit 26 performing "sub-sampling", that is to say a sampling at one quarter of the frequency which corresponds to the complete definition of the pixels. This branch describes a complete image in 80 ms.
The "20 ms" channel comprises, in cascade, a preprocessing element 10 and a sub-sampling circuit 27, sampling a complete image in 20 ms. This channel describes a complete image, with low definition, in 20 ms.
The "40 ms" channel comprises a pre-processing element 11 and a sub-sampler 28. It transmits one image every 40 ms.
The input signal 34 is also passed to a circuit 25 for the estimation of the motion vectors, which computes the motion corresponding to each one of the image parts as defined hereinabove. This circuit 25 supplies on the connection 21 the value of the motion vectors.
A selection control circuit 31 receives at the same time the description of the original image by the connection 34, the speed vectors by the connection 21, and the description emanating from each one of the three channels by its inputs S.sub.1, S.sub.2, S.sub.3. This complex circuit performs, for each square of 16.times.16 pixels, on the basis of each one of the three channels, a decoding simulating that which might be undertaken on reception, particularly with the aid of the motion vector in the case of the "40 ms" channel, and compares with the original image 34 the images decoded on the basis of each one of the three channels. The channel of which the decoded image is closest to the original image is selected, a specific choice thus being made between the three modes for each one of the squares. This control circuit 31 supplies simultaneously on the connections 22, 23, respectively, two decisions concerning two successive images.
The reference 35 designates a block which contains in particular the means for transmitting, on an associated digital channel, data defining the mode selected for each one of the parts and all the motion vectors of the parts for which the first mode is selected. It may also comprise elements for the correction of the decisions emanating from the selection control circuit 31. The motion vectors are supplied to it by the connection 21, and the initial decisions by the connections 22, 23. The corrected decisions are supplied on the connections 16, 17, and the digital elements to be transmitted on the connection 18.
Depending on the decisions 16, 17 and on the basis of the signals 41, 42, 43 supplied by the three channels, a multiplexer 32 transmits the selected channel on the analog output 33 having a compressed pass band.
With the exception of the DATV encoder 35, all these elements form part of the prior art, and a more detailed description, particularly with regard to the processes for pre-processing and for sampling, is provided by the document mentioned in the preamble, and also by the document "An HD-MAC coding system" by F.W.P. Vreeswijk et al, presented at the Aquila conference, 29 February-3 March 1988, and by the French patent application No. 88-05,010 filed earlier, which are incorporated here by reference.
The invention may be applied to the motion estimator 25, the operation of which is based on a block comparison algorithm ("BMA").
FIG. 3 shows five checkered patterns with 36 squares, which each symbolise the same 36 pixels of five temporally consecutive original images 50 to 54. These images are represented symbolically one in front of the other in perspective, but in reality there is only a single visual display support; the image 50 is that obtained at a given instant and the image 54 is that obtained 80 ms later. The images represented are those which are all present within the framework of a time interval of 80 ms mentioned above.
The images 50 and 54 are at the same time the last image of an interval, and the first image of another interval; they are present in each one of the intervals on which they border. The motion estimation is undertaken for the first interval of 40 ms with the three images 50, 51, 52, and then for the second interval of 40 ms with the three images 52, 53, 54. The even-numbered images therefore "serve" on two occasions.
The images effectively transmitted are indicated by arrows 44. The original images 51 and 53, which are available at the camera output, are not transmitted and will have to be recreated on reception, on the basis of a motion vector. For example, a motion vector having a horizontal amplitude x of 2 pixels per 40 ms and a vertical amplitude y of 4 pixels per 40 ms corresponds to the displacement indicated by the arrows 45 or 46.
Any type of motion estimator may be used for the pair of images 50-52. For the following pair 52-54, the estimator must be of the BMA type. For the sake of simplification, it is assumed here that an estimator of the BMA type is used in all cases.
The search for the motion vector then consists, in the presence of a first and of a second successive image 50-52, in examining a part of one of the images, for example 52, in comparing it in turns with a series of parts of the other image, for example 50, these parts occupying a series of position such that, if they were each displaced along one of the possible motion vectors, they would coincide with the examined part. The motion vector selected following such a series of comparisons is, of course, that which corresponds to that one of the parts of the series under consideration which offers the greatest similarity to the examined part of the image 52. An example of a function expressing such a similarity is given hereinbelow.
A priori, introducing a limitation to motions of .+-.6 pixels/40 ms, the possible vectors are those illustrated by FIG. 1: there are 169 of these. In practice, no 169 comparisons are carried out, by virtue of a three-stage process which is illustrated by FIG. 8, and which consists in exploring first of all only the series of positions indicated by circles in the figure. Then, assuming that the position indicated by the black circle has given the best result, the positions indicated by stars are explored, and finally the positions indicated by triangles, around the star which has given the best result. Thus, the number of comparisons to be carried out in the case of a maximum motion of .+-.6 pixels/40 ms would be 25.
In practice, consideration is given not only to the images 50 and 52 but also to the image 51, the minimization function which expresses the similarity between two squares relying on the semi-sum of the differences of intensities of pixels between the image 51 and the image 50 on the one hand, and between the image 51 and the image 52 on the other hand. Thus, a determination is made of a single motion vector for a pair of images 50, 52, and a determination will then be made of another motion vector for the pair of images 52, 54. It is in the determination of this second motion vector appropriate for the pair 52, 54 that the invention is operative.
In the presence of the new pair of images 52, 54 which follows the pair 50, 52, the manner of proceeding is different. In this pair, the first image 52 is also the second image of the preceding pair, for the parts of which motions have already been determined in relation to the first image 50.
FIG. 4 shows a part R in the course of examination in the image 53. With this part R there is associated a group 5 of a plurality of parts of the preceding image 51. This group contains the part E occupying in the image the same position as the part R examined, and likewise the eight adjacent parts which surround the part E.
Now, instead of considering as possible for the element R all motion vectors of amplitude less than or equal to .+-.6 pixels, that is to say one hundred and sixty-nine vectors, consideration is given only to the nine vectors corresponding to the nine parts of the group 5, these vectors having been determined in the course of the examination of the image 51 associated with the preceding pair of images 50, 52.
These nine motion vectors give rise to nine comparisons between the part R and the nine parts (not represented) occupying positions such that, if they were each displaced along one of the nine motion vectors in question, they would coincide with the part R. In the course of these comparisons use is made of semi-sums of differences between the images 52, 53, 54, as in the case of the images 50, 51, 52: only the number of comparisons is different, and the same hardware or software equipment can be used, to a large extent. This appears in the device of FIG. 5, which permits the estimation of motion according to the invention, and which comprises two sets of similar elements.
A first set 29, 57, 58, 49, 61 is identical to the device of the prior art as described in the document mentioned in the preamble. At the input, the spatial filter 29 ensures an appropriate pre-filtering; two delay elements 57, 58 each contribute a delay of 20 ms, that is to say equal to the time between two source images. The three connections 50, 51, 52 thus each carry, at the same instant, information regarding parts corresponding to successive images. (The references of these connections are the same as those of the image which correspond to them respectively, in FIG. 3.) The element 49 for correlation between frames effects the computation of a function C expressing the difference between images parts, for example: ##EQU1## where -V is the order number of the vector considered among those which are possible:
-N is the number of pixels of an image part
-I (Pj, Fi) is the intensity of the pixel Pj of the field Fi
-Pj.+-.V is the pixel offset in relation to Pj by a quantity corresponding to the vector.
The element 61 records all the values of C(V) determined by the element 49 and indicates which is the smallest.
According to the invention, the device is supplemented by another assembly comprising two delay elements 55, 56 in such a manner as to process the five images of FIG. 3 at the same time, and a second set of elements 48, 60 corresponding respectively to the elements 49, 61. The set 49, 61 processes the parts of images 50, 51, 52 while the set 48, 60 processes the parts of images 52, 53, 54. The results of the groups of images 50-52 and 52-54 are supplied respectively to the output connections 62, 63.
The element 59 is constituted by delay elements, the principle of which will be explained in greater detail herein below with reference to FIG. 7 which permit the presentation at the same time, of the nine vectors of the elements of the group 5 of FIG. 4, and the supply thereof to the element 48. The element 48 is different from the element 49 in that, instead of considering all the possible vectors (see FIG. 2), it considers only the nine vectors which the element 59 supplies to it.
The two elements 49, 48 operate one after the other, because one needs the results of the other in order to operate.
For two successive pairs of images, the comparisons relate to twenty-five motion vectors per image part for the first pair, and nine motion vectors for the second pair, i.e. in total 34 comparisons, in place of 2.times.25=50 in the prior art. The gain is significant and permits, for example, the processing of motion vectors of larger maximum amplitude, with an equipment of given performance. When the maximum amplitude increases, the gain in time contributed by the invention tends towards two.
This device operates very well for the following reasons:
let us consider the group of nine squares comprising the square E in FIG. 4 and the adjacent squares. If the image comprises an object 4, which is larger than the group and which covers it, this object moving in a single block, all the motions corresponding to the nine parts are the same, and if the object 4 still covers the square R in the following image and its motion has not varied, the motion corresponding to the square R is also the same. The motion corresponding to the part R of the image 53 is equal to that corresponding to any one of the nine squares of the image 51, the central 25 square, for example. This case is fairly frequent.
it may also be that in front of an immovable background a small object is moving, for example an object 7, covering the square H, having a motion VH of co-ordinates x,y. Let us assume, first of all, that x=0, y=16. This is only an instructional case, but its analysis is very simple. After a period of time of 40 ms, the object, maintaining the same motion, has ascended by 16 pixels: it covers the square R of the image 53. A definition is then given of the motion of the square R by indicating that it is equal to that of the square H of the image 51 (the term "motion of the square" must be understood as "motion of the object occupying the square").
If, in a more general way, the motion is, for example, x=0, y=4, it is necessary to have four times 40 ms in order that the object 5 should ascend by one square. While it occupies only a very small surface of the square R, where the background is, for example, immovable, the motion of this square R is zero: it is that of the square E of the image 51. When the object occupies a medium proportion of the square R of the image 53, it may be that no motion vector is appropriate: a change is then made to the "20 ms" mode for this square. As from the moment when the object occupies a very predominant surface of the square R, the motion for this square becomes that of the object 7, that is to say that of the square H of the image 51 (assuming that the object is large enough to cover the two squares at the same time).
There has thus been the discovery of a means for being able to determine in the majority of cases the motion corresponding to a part of an image in relation to parts of the preceding image, the data of which have already been determined. As the greatest vectors which it is agreed to consider in the "40 ms" mode are less than 16 pixels/40 ms, an object cannot, in 40 ms, come from a square further distant than the adjacent square. It is thus unnecessary to consider more than nine squares in the image 51.
The determination of the motion vector in the images 52-54 results from a minimization process. The most probable motion has thus been found from among those which are possible. It is further necessary to verify that the decoded image which emerges therefrom is the best one.
To this end, means are provided for carrying out a decoding simulating the decoding on reception and for determining, by comparison between the decoded image and the original, the degree of quality of the part of the second pair of images in the process of processing, having the motion vector determined as described herein above. These means simply consist of the selection control circuit 31 which processes the parts of images 52-54, with their motion vector determined according to the invention, precisely in the same way as it processes the parts 50-52 in a known manner.
Moreover, the invention also permits the performance of the transmission of the speed vectors of a second pair of images such as 52, 54 with a reduced digital throughput, this taking place independently of the fact that use has or has not been made of the invention in the motion estimator.
The computation of the required digital throughput will now be explained: in order to fill each interval of 80 ms which is processes as a whole, there are only five possible cases:
1--with a single "80 ms" image
2--with a "40 ms" image followed by two "20 ms" images
3--with two "20 ms" images followed by one "40 ms" image
4--with two "40 ms" images
5--or with four "20 ms" images.
For each interval of 80 ms, the definition of the case used among the five cases described here above, as well as data associated with each one of the modes, must be transmitted to the receivers. The required number of bits is dependent upon the number of possible situations: the first case 1 corresponds to a single situation. It is the same for the case 5. On the other hand, in the cases 2 and 3 which comprise a "40 ms" mode, it is necessary to transmit the value of the motion vector as well.
Let us assume, first of all, that the invention is not implemented. Let consideration be given to a motion vector with a maximum amplitude (in each vertical/horizontal direction) of .+-.6 pixels. This corresponds to 13.sup.2 =169 possible vectors, i.e. 169 possible situations (see FIG. 1).
In the case 4, it is necessary to define two vectors (one for each one of the two periods of 40 ms); this corresponds to 169 first vectors.times.169 second vectors, i.e. 169.sup.2 situations.
The total number of situations corresponding to the five cases is the sum of the situations in each case, i.e.:
______________________________________ Case 1: 1 Case 2: 169 Case 3: 169 Case 4: 169.sup.2 = 28561 Case 5: 1 Total 28901______________________________________
One situation from among 28,901 can be defined by means of 15 bits.
These 15 bits must be redefined for each one of the parts of the image. If these parts are squares of 16.times.16, in an image of 1440.times.1152 pixels, there are 6480 parts. Moreover, there are 12.5 intervals of 80 ms per second. In total, a throughput of 15 bits.times.6480 squares.times.12.5 intervals=1,215,000 bits/second will be necessary. This throughput is greater than that which it is intended to allocate to this type of information in, for example, the D2MAC packet standard (approximately 1M bits/s during the field returns).
There is thus an obligation, in the prior art, to limit the vectors to .+-.3 pixels. In fact, there are then, for each square, 7.sup.2 =49 possible vectors, and in total to describe the five cases: 1+49+49+49.sup.2 +1=2501 situations, which 12 bits can describe. The throughput is then 12.times.6480.times.12.5=972,000 bits/sec, which is acceptable. However, it is regrettable to limit the magnitude of the motion vectors which can be used to the detriment of the quality of the image. An attempt was therefore made to find a means for transmitting vectors of .+-.6 pixels or even larger still, with an available maximum digital throughput of approximately 1M bits/second.
Let us assume that all the motion vectors have been evaluated for all the images, with or without the motion estimator according to the invention, and that the selection control circuit 31 has selected the 40 ms mode for an image part of the second period of 40 ms of an interval of 80 ms. As the system is equipped with means similar to those described hereinabove with reference to FIG. 4, these means associate the nine parts 5 of an image of the first period of the interval of 80 ms with the part R of the second image of this interval. Means are provided for comparing the motion vector of the part R with each one of the motion vectors of the nine parts 5. For this comparison, it is possible to choose to seek the total identity or only a difference less than a predetermined threshold.
If there is total identity between a motion vector of a part of a group 5 and the motion vector of the part R, it is possible to confirm the selection of the 40 ms mode for the part R of the second period of the interval of 80 ms, and to transmit the value of the corresponding motion vector, not by reference to the 169 sets of possible co-ordinates (FIG. 1), but quite simply by indicating from which element of the group 5 the comparison was positive. There are thus nine possibilities only, instead of one hundred and sixty-nine, and the digital throughput can be considerably reduced.
If a choice has been made in favour of seeking only the smallest difference or a difference less than a predetermined threshold, on account of the difference then possible between the "true" vector of the square R and that of the square of the group 5 which it is desired to use in its place, it may be that the "40 ms" mode is no longer the best for the part R. It is then necessary to provide means for determining, by comparison between the decoded image and the original, the selection of the most satisfactory mode for the examined part having the motion vector of the element of the group 5 which is the closest to that of the element R.
To state that the "40 ms" mode has been adopted for the second phase of an interval of 80 ms signifies that one of the cases 3 or 4 mentioned hereinabove is applicable: the case 3 is also possible since, even if the "20 ms" mode has been selected for the element E during the first phase of the interval, comparisons are nevertheless capable of being carried out with other parts adjacent to E in the group 5, for which parts the "40 ms" mode was selected in the first phase.
These means are once again, of course, those of the control circuit 31 (FIG. 2) and, in the case where they would confirm the selection of the 40 ms mode for the part R, the value of the motion vector is transmitted as previously, indicating for which element of the group 5 the comparison was positive.
In the case where no comparison is positive, it would be possible to transmit the motion vector of the square R by its co-ordinates, but this process exhibits the disadvantage that the required digital throughput is larger and unforeseeable. It is therefore both simpler and more satisfactory to change over again to the "20 ms" mode.
In the case where the BMA motion estimator making use of the invention has been employed, the transmission of the motion vector is, of course, base on the same principle, that is to say that the transmission means indicate for the second period, which is that one of the elements of the group 5 which has provided the optimal motion vector.
The total number of situations for the five cases set forth hereinabove is now:
______________________________________ Case 1: 1 Case 2: 169 Case 3: 169 (or 9) Case 4: 169 .times. 9 Case 5: 1 1861______________________________________
A situation from among 1861 can be defined by means of 11 bits; this now corresponds to a throughput of 891,000 bits/second which is entirely compatible with the capacity offered by the field returns of the D- and D2MAC packet standards.
The television receivers intended to use associated digital data permitting the processing of an image are equipped with pixel memories, and in the case where motion vectors are provided, the receivers are also equipped with memories to record these vectors. As a result of this, it is possible to find the motion vectors of the preceding image, in the receiver, with the memory means normally provided. The only element to be added in order to implement the invention is a very simple processor element which, on the basis of the knowledge of the image part in the course of processing and of the number, received from the transmitter, designating one of the nine parts of the preceding image (according to the description appearing hereinabove), computes the memory address at which the motion vector of the designated part is located, initiates reading thereof, and inscribes it as motion vector of the current part. In practice, as the receiver is equipped with a processor system which carries out digital operations apertaining to the parts of images, the additional element referred to hereinabove is provided by software means, which a person skilled in the art can construct easily.
In order to make a further gain on the throughput of data, the transmission system may further comprise means for determining in the set of motion vectors, in the course of the processing of the image 51 referred to as the preceding image, associated with the images 50, 52, a sub-set containing the motion vectors which are encountered most frequently and for transmitting once per image the characteristics of all the motion vectors of the sub-set, the motion vector of each image part then being defined by reference to this sub-set. If the variation vector of an image part to be transmitted is not an element of this sub-set, the second mode is used for this image part.
With this arrangement, the digital throughput which is necessary to define the first image 51 is further reduced. On the other hand, it may be that one or more of the squares of the group 5 have been processed in the "20 ms" mode in the image 51 (because their speed vectors do not form part of the said sub-set) while the square R of the image 53 may itself be processed in the "40 ms" mode. Nevertheless, there is no renouncing of the application of the invention, but there is then a limitation of the search for identity to those of the squares of the group 5 which have been processed in the 40 ms mode.
These means may be implemented by virtue of the circuit of FIG. 6, which is a part of the DATV encoder 35 of FIG. 2.
The indices 0 and -1 used in this figure refer respectively to an image and to the preceding image.
The decisions (of selection between the three modes) D(-1) and D(0) emanating from the selection control circuit 31 of FIG. 2 are conducted for the connections 22, 23. The motion vectors are supplied on the connection 21.
The motion vector signal passes through a circuit 2 contributing a delay of 40 ms, in order to place each vector of the image 0 in phase with that of the image -1. A circuit 12 receives this delayed motion vector and also the decision D(-1) of selection of one from among the three channels, concerning the image -1. The circuit 12 is a processor element which, following the complete description of an image, establishes a classification of the motion vectors by order of frequency of occurrence and supplies to an element 20 the description of the sub-set of the most frequent vectors. The motion vector signal present at the input of the circuit 12 is transmitted to the element 20 by a delay circuit 14, which corresponds to the time employed by the processor 12 to establish the classification. The element 20 determines whether the motion vector transmitted by the circuit 14 forms part of the sub-set delivered by the processor 12. If this is not the case, the decision D(-1) is possibly modified in order to impose the selection of the "20 ms" channel. The modified final selection signal is referenced MD(-1). If the "40 ms" mode is selected (the motion vector forms part of the sub-set) the number of the corresponding motion vector (V(-1) is supplied. The selection effected by means of the elements 12, 14, 20 is that concerning the first "40 ms" image of an interval of 80 ms.
Through a circuit 19 for the compensation of delay corresponding to the duration of the various processings executed in the elements 12, 20, the motion vector is conducted to the element 24. The decision D(0) concerning the image 0, on the connection 23, is also conducted to the element 24, as well as the decision MD(-1) and the vector V(-1).
The element 24 is described in greater detail in FIG. 7. It finally supplies the decision MD(0) and possibly the vector V(0) to the shaper circuit 15 which receives on the one hand the description of the sub-sets of motion vectors to be transmitted once per period of 80 ms, and then for each image part the decision MD(-1) and the decision MD(0) as well as possibly the two corresponding motion vectors V(0) and V(-1). The element 36 is a delay element which compensates for the delays introduced by the element 24.
The element 15 edits the data and supplies them to the output 18, to be transmitted according to a predetermined format on the digital transmission channel.
The circuit 24 detailed in FIG. 7 receives the decisions and--where appropriate--the corresponding vectors on the connections 38, 39 respectively for the images -1 and 0. Elements referenced 1BD, 2BD and 1LBD are delay elements contributing a delay, respectively, of one image part ("block delay") two image parts, and one line of image parts ("line of block delay"). In other words "1BD" is the time for passing, for example, from a part A to a part B, "2BD" for passing from a part A to a part C and "1LBD" for passing from a part A to a part D. By virtue of the scheme represented, the operation of which, based on the contribution of appropriate delays, is evident, the data concerning the parts A and I of the block 5 are conducted, all at the same moment, to the connections which are themselves also referenced A to I.
A circuit of the same type is used in the element 59 of FIG. 5 to conduct together the data of the nine parts of the group 5 to the computation circuit 48.
In the circuit 24 of FIG. 7, each element referenced "CP" performs the comparison between the coordinates of the motion vectors present on its two inputs, at the sides in the drawing. The result of the comparisons is transmitted via a common bus of all the "CP" blocks to a decision element 37 which supplies on the connection 3 the corrected decision MD(0) for the examined image (which is, for example, the image 53 of FIG. 3). If no comparison is positive, the decision MD(0) is the selection of the "20 ms" mode; otherwise, the "40 ms" mode is confirmed and the motion vector is transmitted by means of a digit which designates which one of the "CP" elements corresponding to the connections A to I has supplied a positive comparison.
A comparison may be judged to be positive if there is absolute identity between the co-ordinates of the motion vectors compared. In this case, no new verification of the suitability of the "40 ms" mode is required.
The comparison criterion may also be that the difference between the motion vectors compared is less than a pre-determined threshold. In this case, it is still necessary to perform a decoding simulating the decoding on reception and to determine, by comparison between the decoded image and the original, the selection of the most satisfactory mode for the examined part, having the motion vector determined with the means described with reference to FIG. 7. This decision is advantageously taken by means of the element 31, which has already performed the same comparison between the decoded image and the original for the initial decisions D(0) and D(1).
If the statistical method described hereinabove for reducing the number of vectors to be transmitted for the first pair of images of a period of "80 ms" is not used, the elements 12, 14, 20 of FIG. 6 disappear, the decision D(-1) being conducted without correction to the element 24.
If, moreover, the means described with reference to FIG. 5 are used, the circuits of FIGS. 6 and 7 become of no avail, because the first decision is taken by the selection control circuit 31 relates immediately to a motion vector selected from among nine, as far as the second pair of images is concerned, and the DATV encoder 35 of FIG. 2 is reduced to a data editing circuit.
The following tables describe the mapping of the DATV encoder and decoder into 11 bits DATV codewords, and vice versa. The tables are based on the following table describing the number of possibilities of each route of branch decisions:
______________________________________branch decisionframe 1 frame 2 number of possibilities______________________________________1:80 80 12:40 20 1693:20 40 84:40 40 169* 95:20 20 1 + 1700______________________________________
Case 3 has only 8 possibilities since it is of no use to provide a pointer to the motion vector of the corresponding block of pixels in the previous frame if that block is encoded without motion vectors.
TABLE 1 gives the indexing of the 169 possible motion vectors;
TABLE 2 gives the indexing of the relative vector addresses, i.e. pointers to motion vectors relation the previous television frame;
TABLE 3 gives the coding of branch decision and vector information; obviously, a received codeword is decoded using the inverse of the coding table; and
TABLE 4 gives the retrieval of branch decision and vector information from the non-codewords. In the case that transmission errors occur, the decoder may receive 11-bit words, that are not specified in the encoder table (non-codewords).
Table 3 may be stored in a (programmable) read only memory which forms part of the element 35 of FIG. 2, more specifically of the element 15 of FIG. 6.
PROPERTIES OF THE DE(CODING) TABLES
The tables 3 and 4 are constructed in a way to minimize the error sensitivity of the branch decision information in the DATV codestream. Therefore, the 1700 codewords are divided into 5 sets, each of them having the same branch decision information (route). The route on frame basis is used to indicate the set. By dH(a, b) the minimum number of positions in a codeword of set a is denoted, that must be affected by an error before branch decision b is decoded.
______________________________________dH(80-80, 40-40) = 2 dH(40-20, 80-80) = 5dH(80-80, 40-20) = 6 dH(40-20, 40-40) = 1dH(80-80, 20-40) = 5 dH(40-20, 20-40) = 5dH(80-80, 20-20) = 10 dH(40-20, 20-20) = 2dH(40-40, 80-80) = 2 dH(20-40, 80-80) = 4dH(40-40, 40-20) = 1 dH(20-40, 40-40) = 1dH(40-40, 20-40) = 1 dH(20-40, 40-20) = 4dH(40-40, 20-20) = 2 dH(20-40, 20-20) = 5dH(20-20, 80-80) = 10dH(20-20, 40-40) = 3dH(20-20, 40-20) = 2dH(20-20, 20-40) = 6______________________________________
As can be seen in table 3, first and second codewords indicating the 80-80 and 20-20 operations, respectively, have a maximum mutual Hamming-distance: they are each other's inverse. As can be seen in table 4, codewords having a Hamming-distance between that codeword and the first or second codeword, being one or two, are left unused on the encoding side, so that buffers of unused codewords are created between said first and second codewords on the one hand, and the codewords indicating other operations on the other hand. On the decoding side, the codewords having a Hamming-distance between that codeword and the first or second codeword, being one, are decoded like these first or second codeword, respectively. Further, the codewords having a Hamming-distance between that codeword and the first codeword, being two, are decoded like the codeword indicating the 40-40 operation with a motion vector and a pointer vector being both zero. The codewords having a Hamming-distance between that codeword and the second codeword, being two, are decoded like the codeword indicating the 40-20 operation with a motion vector being zero, so that at least one of the frames, in this case the second frame, is decoded like the 20-20 operation. These choices are believed to be the best possible solutions in the case of channel errors.
As can be seen in table 3, the 9 pointers to motion vectors in the case of 40-40 operations, are split up into a group of 8 pointers being encoded into 3 separate bits of the 11 bit fixed length codeword, and into a remaining pointer, so that channel errors in these 3 bits have no detrimental effect on the information comprised in the other 8 bits, and vice versa. Further, the 3 bit words are chosen such, that mutual nearby pointers have mutual nearby 3 bit words, in order to obtain a optimum decoding in the case of channel errors. The remaining 9th pointer is chosen to be one of the diagonal pointers, which is based on the recognition that diagonal motion vectors are relatively seldom.
As can be seen in table 1, the index numbers of the motion vectors are chosen such, that mutual nearby motion vectors have mutual nearby index numbers, which is translated into mutual nearby codewords in table 3, so that an optimum decoding in the case of channel errors is obtained.
HOW TO READ THE (DE)CODING TABLES
The branch decisions over 80 ms per block constitute 5 temporal routes. In the tables the routes are specified on field basis.
The vector information over 80 ms is split into a motion vector (range: [-6,6;6,6]) in the first frame (FRM 1) and a relative vector address (9 block positions) in the second frame (FRM 2). The 169 motion vectors in FRM 1 are indexed according to TABLE 1. The 9 relative vector addresses are indexed according to TABLE 2.
In cases that the route is 40-40-40-40 and the relative vector address is not equal to 9 the corresponding codeword consists of an 8-bits prefix and a 3-bit suffix (***). The prefix specifies the vector (FRM 1). The 8 possible relative vector addresses are specified in the suffix by using the following table. ##STR1##
fb indicates the first bit of an transmitted 11-bit word.
lb indicates the last bit of an transmitted 11-bit word.
A bar (-) in a column indicates that the corresponding vector information is irrelevant.
TABLE 4 only describes the decoding of non-codewords. The branch-decision and vector information from a received codeword is retrieved by using the inverse of TABLE 3.
The number of non-codewords is 2**11-1700=348. These are categorized by their Hamming weight (H. weight), which specifies the number of `1`s in a word.
Between brackets the number of words per category is given.
TABLE 1__________________________________________________________________________Indexing of the 169 vectors.__________________________________________________________________________ ##STR2## ##STR3## ##STR4## ##STR5## ##STR6## ##STR7## ##STR8## ##STR9## ##STR10## ##STR11## ##STR12## ##STR13## ##STR14##__________________________________________________________________________
TABLE 2______________________________________Indexing of the relative vector addresses.______________________________________ ##STR15##______________________________________
TABLE 3______________________________________CODING OF BRANCH-DECISION ANDVECTOR INFORMATION VECTOR REL. ADDRESSROUTE (FRM 1) (FRM 2) CODEWORD______________________________________80-80-80-80 -- -- 0000000000040-40-40-40 1 1 to 8 (including) 11100000***40-40-40-40 2 1 to 8 (including) 11010000***40-40-40-40 3 1 to 8 (including) 11001000***40-40-40-40 4 1 to 8 (including) 11000100***40-40-40-40 5 1 to 8 (including) 11000010***40-40-40-40 6 1 to 8 (including) 11000001***40-40-40-40 7 1 to 8 (including) 10110000***40-40-40-40 8 1 to 8 (including) 10101000***40-40-40-40 9 1 to 8 (including) 10100100***40-40-40-40 10 1 to 8 (including) 10100010***40-40-40-40 11 1 to 8 (including) 10100001***40-40-40-40 12 1 to 8 (including) 10011000***40-40-40-40 13 1 to 8 (including) 10010100***40-40-40-40 14 1 to 8 (including) 10010010***40-40-40-40 15 1 to 8 (including) 10010001***40-40-40-40 16 1 to 8 (including) 10001100***40-40-40-40 17 1 to 8 (including) 10001010***40-40-40-40 18 1 to 8 (including) 10001001***40-40-40-40 19 1 to 8 (including) 10000110***40-40-40-40 20 1 to 8 (including) 10000101***40-40-40-40 21 1 to 8 (including) 10000011***40-40-40-40 22 1 to 8 (including) 01110000***40-40-40-40 23 1 to 8 (including) 01101000***40-40-40-40 24 1 to 8 (including) 01100100***40-40-40-40 25 1 to 8 (including) 01100010***40-40-40-40 26 1 to 8 (including) 01100001***40-40-40-40 27 1 to 8 (including) 01011000***40-40-40-40 28 1 to 8 (including) 01010100***40-40-40-40 29 1 to 8 (including) 01010010***40-40-40-40 30 1 to 8 (including) 01010001***40-40-40-40 31 1 to 8 (including) 01001100***40-40-40-40 32 1 to 8 (including) 01001010***40-40-40-40 33 1 to 8 (including) 01001001***40-40-40-40 34 1 to 8 (including) 01000110***40-40-40-40 35 1 to 8 (including) 01000101***40-40-40-40 36 1 to 8 (including) 01000011***40-40-40-40 37 1 to 8 (including) 00111000***40-40-40-40 38 1 to 8 (including) 00110100***40-40-40-40 39 1 to 8 (including) 00110010***40-40-40-40 40 1 to 8 (including) 00110001***40-40-40-40 41 1 to 8 (including) 00101100***40-40-40-40 42 1 to 8 (including) 00101010*** .dwnarw. .dwnarw. fb lb40-40-40-40 43 1 to 8 (including) 00101001***40-40-40-40 44 1 to 8 (including) 00100110***40-40-40-40 45 1 to 8 (including) 00100101***40-40-40-40 46 1 to 8 (including) 00100011***40-40-40-40 47 1 to 8 (including) 00011100***40-40-40-40 48 1 to 8 (including) 00011010***40-40-40-40 49 1 to 8 (including) 00011001***40-40-40-40 50 1 to 8 (including) 00010110***40-40-40-40 51 1 to 8 (including) 00010101***40-40-40-40 52 1 to 8 (including) 00010011***40-40-40-40 53 1 to 8 (including) 00001110***40-40-40-40 54 1 to 8 (including) 00001101***40-40-40-40 55 1 to 8 (including) 00001011***40-40-40-40 56 1 to 8 (including) 00000111***40-40-40-40 57 1 to 8 (including) 11110000***40-40-40-40 58 1 to 8 (including) 11101000***40-40-40-40 59 1 to 8 (including) 11100100***40-40-40-40 60 1 to 8 (including) 11100010***40-40-40-40 61 1 to 8 (including) 11100001***40-40-40-40 62 1 to 8 (including) 11011000***40-40-40-40 63 1 to 8 (including) 11010100***40-40-40-40 64 1 to 8 (including) 11010010***40-40-40-40 65 1 to 8 (including) 11010001***40-40-40-40 66 1 to 8 (including) 11001100***40-40-40-40 67 1 to 8 (including) 11001010***40-40-40-40 68 1 to 8 (including) 11001001***40-40-40-40 69 1 to 8 (including) 11000110***40-40-40-40 70 1 to 8 (including) 11000101***40-40-40-40 71 1 to 8 (including) 11000011***40-40-40-40 72 1 to 8 (including) 10111000***40-40-40-40 73 1 to 8 (including) 10110100***40-40-40-40 74 1 to 8 (including) 10110010***40-40-40-40 75 1 to 8 (including) 10110001***40-40-40-40 76 1 to 8 (including) 10101100***40-40-40-40 77 1 to 8 (including) 10101010***40-40-40-40 78 1 to 8 (including) 10101001***40-40-40-40 79 1 to 8 (including) 10100110***40-40-40-40 80 1 to 8 (including) 10100101***40-40-40-40 81 1 to 8 (including) 10100011***40-40-40-40 82 1 to 8 (including) 10011100***40-40-40-40 83 1 to 8 (including) 10011010***40-40-40-40 84 1 to 8 (including) 10011001***40-40-40-40 85 1 to 8 (including) 10010110***40-40-40-40 86 1 to 8 (including) 10010101***40-40-40-40 87 1 to 8 (including) 10010011***40-40-40-40 88 1 to 8 (including) 10001110***40-40-40-40 89 1 to 8 (including) 10001101*** .dwnarw. .dwnarw. fb lb40-40-40-40 90 1 to 8 (including) 10001011***40-40-40-40 91 1 to 8 (including) 10000111***40-40-40-40 92 1 to 8 (including) 01111000***40-40-40-40 93 1 to 8 (including) 01110100***40-40-40-40 94 1 to 8 (including) 01110010***40-40-40-40 95 1 to 8 (including) 01110001***40-40-40-40 96 1 to 8 (including) 01101100***40-40-40-40 97 1 to 8 (including) 01101010***40-40-40-40 98 1 to 8 (including) 01101001***40-40-40-40 99 1 to 8 (including) 01100110***40-40-40-40 100 1 to 8 (including) 01100101***40-40-40-40 101 1 to 8 (including) 01100011***40-40-40-40 102 1 to 8 (including) 01011100***40-40-40-40 103 1 to 8 (including) 01011010***40-40-40-40 104 1 to 8 (including) 01011001***40-40-40-40 105 1 to 8 (including) 01010110***40-40-40-40 106 1 to 8 (including) 01010101***40-40-40-40 107 1 to 8 (including) 01010011***40-40-40-40 108 1 to 8 (including) 01001110***40-40-40-40 109 1 to 8 (including) 01001101***40-40-40-40 110 1 to 8 (including) 01001011***40-40-40-40 111 1 to 8 (including) 01000111***40-40-40-40 112 1 to 8 (including) 00111100***40-40-40-40 113 1 to 8 (including) 00111010***40-40-40-40 114 1 to 8 (including) 00111001***40-40-40-40 115 1 to 8 (including) 00110110***40-40-40-40 116 1 to 8 (including) 00110101***40-40-40-40 117 1 to 8 (including) 00110011***40-40-40-40 118 1 to 8 (including) 00101110***40-40-40-40 119 1 to 8 (including) 00101101***40-40-40-40 120 1 to 8 (including) 00101011***40-40-40-40 121 1 to 8 (including) 00100111***40-40-40-40 122 1 to 8 (including) 00011110***40-40-40-40 123 1 to 8 (including) 00011101***40-40-40-40 124 1 to 8 (including) 00011011***40-40-40-40 125 1 to 8 (including) 00010111***40-40-40-40 126 1 to 8 (including) 00001111***40-40-40-40 127 1 to 8 (including) 11111000***40-40-40-40 128 1 to 8 (including) 11110100***40-40-40-40 129 1 to 8 (including) 11110010***40-40-40-40 130 1 to 8 (including) 11110001***40-40-40-40 131 1 to 8 (including) 11101100***40-40-40-40 132 1 to 8 (including) 11101010***40-40-40-40 133 1 to 8 (including) 11101001***40-40-40-40 134 1 to 8 (including) 11100110***40-40-40-40 135 1 to 8 (including) 11100101***40-40-40-40 136 1 to 8 (including) 11100011*** .dwnarw. .dwnarw. fb lb40-40-40-40 137 1 to 8 (including) 11011100***40-40-40-40 138 1 to 8 (including) 11011010***40-40-40-40 139 1 to 8 (including) 11011001***40-40-40-40 140 1 to 8 (including) 11010110***40-40-40-40 141 1 to 8 (including) 11010101***40-40-40-40 142 1 to 8 (including) 11010011***40-40-40-40 143 1 to 8 (including) 11001110***40-40-40-40 144 1 to 8 (including) 11001101***40-40-40-40 145 1 to 8 (including) 11001011***40-40-40-40 146 1 to 8 (including) 11000111***40-40-40-40 147 1 to 8 (including) 10111100***40-40-40-40 148 1 to 8 (including) 10111010***40-40-40-40 149 1 to 8 (including) 10111001***40-40-40-40 150 1 to 8 (including) 10110110***40-40-40-40 151 1 to 8 (including) 10110101***40-40-40-40 152 1 to 8 (including) 10110011***40-40-40-40 153 1 to 8 (including) 10101110***40-40-40-40 154 1 to 8 (including) 10101101***40-40-40-40 155 1 to 8 (including) 10101011***40-40-40-40 156 1 to 8 (including) 10100111***40-40-40-40 157 1 to 8 (including) 10011110***40-40-40-40 158 1 to 8 (including) 10011101***40-40-40-40 159 1 to 8 (including) 10011011***40-40-40-40 160 1 to 8 (including) 10010111***40-40-40-40 161 1 to 8 (including) 10001111***40-40-40-40 162 1 to 8 (including) 01111100***40-40-40-40 163 1 to 8 (including) 01111010***40-40-40-40 164 1 to 8 (including) 01111001***40-40-40-40 165 1 to 8 (including) 01110110***40-40-40-40 166 1 to 8 (including) 01110101***40-40-40-40 167 1 to 8 (including) 01110011***40-40-40-40 168 1 to 8 (including) 01101110***40-40-40-40 169 1 to 8 (including) 01101101***40-40-40-40 1 9 0000000011140-40-40-40 2 9 1000000011040-40-40-40 3 9 1000000010140-40-40-40 4 9 1000000001140-40-40-40 5 9 1000000011140-40-40-40 6 9 0100000011040-40-40-40 7 9 0100000010140-40-40-40 8 9 0100000001140-40-40-40 9 9 0100000011140-40-40-40 10 9 0010000011040-40-40-40 11 9 0010000010140-40-40-40 12 9 0010000001140-40-40-40 13 9 00100000111 .dwnarw. .dwnarw. fb lb40-40-40-40 14 9 0001000011040-40-40-40 15 9 0001000010140-40-40-40 16 9 0001000001140-40-40-40 17 9 0001000011140-40-40-40 18 9 0000100011040-40-40-40 19 9 0000100010140-40-40-40 20 9 0000100001140-40-40-40 21 9 0000100011140-40-40-40 22 9 0000010011040-40-40-40 23 9 0000010010140-40-40-40 24 9 0000010001140-40-40-40 25 9 0000010011140-40-40-40 26 9 0000001011040-40-40-40 27 9 0000001010140-40-40-40 28 9 0000001001140-40-40-40 29 9 0000001011140-40-40-40 30 9 0000000111040-40-40-40 31 9 0000000110140-40-40-40 32 9 0000000101140-40-40-40 33 9 0000000111140-40-40-40 34 9 1100000010040-40-40-40 35 9 1100000001040-40-40-40 36 9 1100000000140-40-40-40 37 9 1100000011040-40-40-40 38 9 1100000010140-40-40-40 39 9 1100000001140-40-40-40 40 9 1100000011140-40-40-40 41 9 1010000010040-40-40-40 42 9 1010000001040-40-40-40 43 9 1010000000140-40-40-40 44 9 1010000011040-40-40-40 45 9 1010000010140-40-40-40 46 9 1010000001140-40-40-40 47 9 1010000011140-40-40-40 48 9 1001000010040-40-40-40 49 9 1001000001040-40-40-40 50 9 1001000000140-40-40-40 51 9 1001000011040-40-40-40 52 9 1001000010140-40-40-40 53 9 1001000001140-40-40-40 54 9 1001000011140-40-40-40 55 9 1000100010040-40-40-40 56 9 1000100001040-40-40-40 57 9 1000100000140-40-40-40 58 9 1000100011040-40-40-40 59 9 10001000101 .dwnarw. .dwnarw. fb lb40-40-40-40 60 9 1000100001140-40-40-40 61 9 1000100011140-40-40-40 62 9 1000010010040-40-40-40 63 9 1000010001040-40-40-40 64 9 1000010000140-40-40-40 65 9 1000010011040-40-40-40 66 9 1000010010140-40-40-40 67 9 1000010001140-40-40-40 68 9 1000010011140-40-40-40 69 9 1000001010040-40-40-40 70 9 1000001001040-40-40-40 71 9 1000001000140-40-40-40 72 9 1000001011040-40-40-40 73 9 1000001010140-40-40-40 74 9 1000001001140-40-40-40 75 9 1000001011140-40-40-40 76 9 1000000110040-40-40-40 77 9 1000000101040-40-40-40 78 9 1000000100140-40-40-40 79 9 1000000111040-40-40-40 80 9 1000000110140-40-40-40 81 9 1000000101140-40-40-40 82 9 1000000111140-40-40-40 83 9 0110000010040-40-40-40 84 9 0110000001040-40-40-40 85 9 0110000000140-40-40-40 86 9 0110000011040-40-40-40 87 9 0110000010140-40-40-40 88 9 0110000001140-40-40-40 89 9 0110000011140-40-40-40 90 9 0101000010040-40-40-40 91 9 0101000001040-40-40-40 92 9 0101000000140-40-40-40 93 9 0101000011040-40-40-40 94 9 0101000010140-40-40-40 95 9 0101000001140-40-40-40 96 9 0101000011140-40-40-40 97 9 0100100010040-40-40-40 98 9 0100100001040-40-40-40 99 9 0100100000140-40-40-40 100 9 0100100011040-40-40-40 101 9 0100100010140-40-40-40 102 9 0100100001140-40-40-40 103 9 0100100011140-40-40-40 104 9 0100010010040-40-40-40 105 9 01000100010 .dwnarw. .dwnarw. fb lb40-40-40-40 106 9 0100010000140-40-40-40 107 9 0100010011040-40-40-40 108 9 0100010010140-40-40-40 109 9 0100010001140-40-40-40 110 9 0100010011140-40-40-40 111 9 0100001010040-40-40-40 112 9 0100001001040-40-40-40 113 9 0100001000140-40-40-40 114 9 0100001011040-40-40-40 115 9 0100001010140-40-40-40 116 9 0100001001140-40-40-40 117 9 0100001011140-40-40-40 118 9 0100000110040-40-40-40 119 9 0100000101040-40-40-40 120 9 0100000100140-40-40-40 121 9 0100000111040-40-40-40 122 9 0100000110140-40-40-40 123 9 0100000101140-40-40-40 124 9 0100000111140-40-40-40 125 9 0011000010040-40-40-40 126 9 0011000001040-40-40-40 127 9 0011000000140-40-40-40 128 9 0011000011040-40-40-40 129 9 0011000010140-40-40-40 130 9 0011000001140-40-40-40 131 9 0011000011140-40-40-40 132 9 0010100010040-40-40-40 133 9 0010100001040-40-40-40 134 9 0010100000140-40-40-40 135 9 0010100011040-40-40-40 136 9 0010100010140-40-40-40 137 9 0010100001140-40-40-40 138 9 0010100011140-40-40-40 139 9 0010010010040-40-40-40 140 9 0010010001040-40-40-40 141 9 0010010000140-40-40-40 142 9 0010010011040-40-40-40 143 9 0010010010140-40-40-40 144 9 0010010001140-40-40-40 145 9 0010010011140-40-40-40 146 9 0010001010040-40-40-40 147 9 0010001001040-40-40-40 148 9 0010001000140-40-40-40 149 9 0010001011040-40-40-40 150 9 0010001010140-40-40-40 151 9 00100010011 .dwnarw. .dwnarw. fb lb40-40-40-40 152 9 0010001011140-40-40-40 153 9 0010000110040-40-40-40 154 9 0010000101040-40-40-40 155 9 0010000100140-40-40-40 156 9 0010000111040-40-40-40 157 9 0010000110140-40-40-40 158 9 0010000101140-40-40-40 159 9 0010000111140-40-40-40 160 9 0001100010040-40-40-40 161 9 0001100001040-40-40-40 162 9 0001100000140-40-40-40 163 9 0001100011040-40-40-40 164 9 0001100010140-40-40-40 165 9 0001100001140-40-40-40 166 9 0001100011140-40-40-40 167 9 0001010010040-40-40-40 168 9 0001010001040-40-40-40 169 9 0001010000140-40-20-20 1 -- 1111110000040-40-20-20 2 -- 1111110010040-40-20-20 3 -- 1111110001040-40-20-20 4 -- 1111110000140-40-20-20 5 -- 1111110011040-40-20-20 6 -- 1111101000040-40-20-20 7 -- 1111101010040-40-20-20 8 -- 1111101001040-40-20-20 9 -- 1111101000140-40-20-20 10 -- 1111101011040-40-20-20 11 -- 1111100100040-40-20-20 12 -- 1111100110040-40-20-20 13 -- 1111100101040-40-20-20 14 -- 1111100100140-40-20-20 15 -- 1111100111040-40-20-20 16 -- 1111011000040-40-20-20 17 -- 1111011010040-40-20-20 18 -- 1111011001040-40-20-20 19 -- 1111011000140-40-20-20 20 -- 1111011011040-40-20-20 21 -- 1111010100040-40-20-20 22 -- 1111010110040-40-20-20 23 -- 1111010101040-40-20-20 24 -- 1111010100140-40-20-20 25 -- 11110101110 .dwnarw. .dwnarw. fb lb40-40-20-20 26 -- 1111001100040-40-20-20 27 -- 1111001110040-40-20-20 28 -- 1111001101040-40-20-20 29 -- 1111001100140-40-20-20 30 -- 1111001111040-40-20-20 31 -- 1110111000040-40-20-20 32 -- 1110111010040-40-20-20 33 -- 1110111001040-40-20-20 34 -- 1110111000140-40-20-20 35 -- 1110111011040-40-20-20 36 -- 1110110100040-40-20-20 37 -- 1110110110040-40-20-20 38 -- 1110110101040-40-20-20 39 -- 1110110100140-40-20-20 40 -- 1110110111040-40-20-20 41 -- 1110101100040-40-20-20 42 -- 1110101110040-40-20-20 43 -- 1110101101040-40-20-20 44 -- 1110101100140-40-20-20 45 -- 1110101111040-40-20-20 46 -- 1110011100040-40-20-20 47 -- 1110011110040-40-20-20 48 -- 1110011101040-40-20-20 49 -- 1110011100140-40-20-20 50 -- 1110011111040-40-20-20 51 -- 1101111000040-40-20-20 52 -- 1101111010040-40-20-20 53 -- 1101111001040-40-20-20 54 -- 1101111000140-40-20-20 55 -- 1101111011040-40-20-20 56 -- 1101110100040-40-20-20 57 -- 1101110110040-40-20-20 58 -- 1101110101040-40-20-20 59 -- 1101110100140-40-20-20 60 -- 1101110111040-40-20-20 61 -- 1101101100040-40-20-20 62 -- 1101101110040-40-20-20 63 -- 1101101101040-40-20-20 64 -- 1101101100140-40-20-20 65 -- 1101101111040-40-20-20 66 -- 1101011100040-40-20-20 67 -- 1101011110040-40-20-20 68 -- 1101011101040-40-20-20 69 -- 1101011100140-40-20-20 70 -- 1101011111040-40-20-20 71 -- 11001111000 .dwnarw. .dwnarw. fb lb40-40-20-20 72 -- 1100111110040-40-20-20 73 -- 1100111101040-40-20-20 74 -- 1100111100140-40-20-20 75 -- 1100111111040-40-20-20 76 -- 1011111000040-40-20-20 77 -- 1011111010040-40-20-20 78 -- 1011111001040-40-20-20 79 -- 1011111000140-40-20-20 80 -- 1011111011040-40-20-20 81 -- 1011110100040-40-20-20 82 -- 1011110110040-40-20-20 83 -- 1011110101040-40-20-20 84 -- 1011110100140-40-20-20 85 -- 1011110111040-40-20-20 86 -- 1011101100040-40-20-20 87 -- 1011101110040-40-20-20 88 -- 1011101101040-40-20-20 89 -- 1011101100140-40-20-20 90 -- 1011101111040-40-20-20 91 -- 1011011100040-40-20-20 92 -- 1011011110040-40-20-20 93 -- 1011011101040-40-20-20 94 -- 1011011100140-40-20-20 95 -- 1011011111040-40-20-20 96 -- 1010111100040-40-20-20 97 -- 1010111110040-40-20-20 98 -- 1010111101040-40-20-20 99 -- 1010111100140-40-20-20 100 -- 1010111111040-40-20-20 101 -- 1001111100040-40-20-20 102 -- 1001111110040-40-20-20 103 -- 1001111101040-40-20-20 104 -- 1001111100140-40-20-20 105 -- 1001111111040-40-20-20 106 -- 0111111000040-40-20-20 107 -- 0111111010040-40-20-20 108 -- 0111111001040-40-20-20 109 -- 0111111000140-40-20-20 110 -- 0111111011040-40-20-20 111 -- 0111110100040-40-20-20 112 -- 0111110110040-40-20-20 113 -- 0111110101040-40-20-20 114 -- 0111110100140-40-20-20 115 -- 0111110111040-40-20-20 116 -- 0111101100040-40-20-20 117 -- 01111011100 .dwnarw. .dwnarw. fb lb40-40-20-20 118 -- 0111101101040-40-20-20 119 -- 0111101100140-40-20-20 120 -- 0111101111040-40-20-20 121 -- 0111011100040-40-20-20 122 -- 0111011110040-40-20-20 123 -- 0111011101040-40-20-20 124 -- 0111011100140-40-20-20 125 -- 0110111100040-40-20-20 126 -- 0110111110040-40-20-20 127 -- 0110111101040-40-20-20 128 -- 0110111100140-40-20-20 129 -- 0101111100040-40-20-20 130 -- 0101111110040-40-20-20 131 -- 0101111101040-40-20-20 132 -- 0101111100140-40-20-20 133 -- 0011111100040-40-20-20 134 -- 0011111110040-40-20-20 135 -- 0011111101040-40-20-20 136 -- 0011111100140-40-20-20 137 -- 1111111000040-40-20-20 138 -- 1111111010040-40-20-20 139 -- 1111111001040-40-20-20 140 -- 1111111000140-40-20-20 141 -- 1111110100040-40-20-20 142 -- 1111110110040-40-20-20 143 -- 1111110101040-40-20-20 144 -- 1111110100140-40-20-20 145 -- 1111101100040-40-20-20 146 -- 1111101110040-40-20-20 147 -- 1111101101040-40-20-20 148 -- 1111101100140-40-20-20 149 -- 1111011100040-40-20-20 150 -- 1111011110040-40-20-20 151 -- 1111011101040-40-20-20 152 -- 1111011100140-40-20-20 153 -- 1110111100040-40-20-20 154 -- 1110111110040-40-20-20 155 -- 1110111101040-40-20-20 156 -- 1110111100140-40-20-20 157 -- 1101111100040-40-20-20 158 -- 1101111110040-40-20-20 159 -- 1101111101040-40-20-20 160 -- 1101111100140-40-20-20 161 -- 1011111100040-40-20-20 162 -- 1011111110040-40-20-20 163 -- 10111111010 .dwnarw. .dwnarw. fb lb40-40-20-20 164 -- 1011111100140-40-20-20 165 -- 0111111100040-40-20-20 166 -- 0111111110040-40-20-20 167 -- 0111111101040-40-20-20 168 -- 0111111100140-40-20-20 169 -- 1111111100020-20-40-40 -- 2 0000101011120-20-40-40 -- 3 0000010111120-20-40-40 -- 4 0000001111120-20-40-40 -- 5 0001000111120-20-40-40 -- 6 0000100111120-20-40-40 -- 7 0000110011120-20-40-40 -- 8 0000011011120-20-40-40 -- 9 0001001011120-20-20-20 -- -- 11111111111 .dwnarw. .dwnarw. fb lb______________________________________
TABLE 4______________________________________DECODING OF NON-CODEWORDS REL. VECTOR ADDRESS11-bit word (#) ROUTE (FRM 1) (FRM 2)______________________________________H. weight = 1 (11) 80-80-80-80 -- --H. weight = 2 (55) 40-40-40-40 1 1H. weight = 9 (55) 40-40-20-20 1 --H. weight = 10 (11) 20-20-20-20 -- --remaining words (216) 40-40-40-40 1 1______________________________________ (#) H. weight = Hamming weight (number of `1`s in a word) (..),(...) = the number of 11bit words per category

Number	Name	Date
4661849	Hinman	Apr 1987
4727422	Hinman	Feb 1988
4901149	Fernando et al.	Feb 1990
4931855	Salvadorini	Jun 1990
4937668	Hosaka	Jun 1990

DATV encoding and decoding method and apparatus

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Abstract

Description

Claims

Priority Claims (1)

US Referenced Citations (5)

Foreign Referenced Citations (1)

Non-Patent Literature Citations (1)