Video data compressor minimizing propagation of error.

0001The present invention relates to a video data compressor for compressing video data, and in particular, to a video data compressor connectible to a recording apparatus such as a digital video tape recorder or an optical disk for recording thereon digital video data or a transmitting apparatus.

0002Heretofore, there has been known a video data compressing apparatus to be connected to a digital video tape recorder (VTR) or a digital image recording optical disk for compressing video data. In such an apparatus, a two-dimensional (2D) discrete cosine transform (DCT) is conducted to achieve data compression for video blocks each including 8 pixels × 8 lines. The transform has been described, for example, in the Japanese Patent Laid-Open Publication No. 63-308474. Data undergone the transform is then subjected to processing steps such as a zigzag scan, a quantization, and a variable-length coding. These operations are controlled so that a predetermined number of bits are contained in each field or frame. The data compressing method has been described, for example, in an article entitled "Outline and Trend of Standardization of MPEG" (Monthly Interface. Aug. 1992) and the Japanese Patent Laid-Open Publication No. 61-123280.

0003In a video data compressor, the video data is thus compressed to be thereafter treated in the unit of 8-bit data for serial-to-parallel conversion. The data obtained as a result is transmitted to an apparatus such as a video tape recorder, an optical disk, or a data transmitting facility. In the apparatus, the compressed video data is shuffled to additionally produce error correction codes as described, for example, in the Japanese Patent Laid-Open Publication No. 62-199179. The resultant data is then combined with data such as audio data or system data. Thereafter, the data is subjected to a coding for recording thereof, an operation to produce a signal block therefrom, a channel separation for transmission thereof, an amplification by a recording amplifier, and the like. Finally, the data is recorded on a medium or transmitted to an external device.

0004In this regard, in a stage of reproducing recorded data or in a transmission stage of data, there may possibly occur a burst error exceeding an error correcting capacity of the system. In the prior art, the burst error is dispersed in a broad range by a shuffling circuit predetermined for the recorder or transmitter. This provision is arranged to possibly enhance capacity of the error interpolation circuit integrated in the apparatus such as the video tape recorder. In an apparatus in which recording or transmission of data is accomplished in the unit of pixels and there is conducted the operation to disperse the error, it is possible to cope with the error, for example, to conduct interpolation for the error according to peripheral pixels of the erroneous pixels. However, for the compressed video data, this scheme is attended with a problem as follows.

0005For example, assume that an incorrigible error occurs in an operation to process data formed in the video block unit as above. In such a situation, naturally, data following the pertinent video block cannot be identified. Moreover, due to characteristics of variable-length codes, it is impossible to determine a demarcation point between the erroneous block and a video block subsequent thereto. Consequently, the error is also propagated to the subsequent video block. As a result, the error is sequentially passed to the following blocks in this way.

0006Ordinarily, to prevent this disadvantageous event, the compressed data is subdivided into data items each having an appropriate length, thereby producing a sync block. With this provision, the error is prevented from being propagated to a block beyond the block in which the error has occurred. However, in the pertinent block, a one-bit error thereof is propagated to the bits subsequent to the wrong bit. In this case, when the burst error is dispersed to a wider range by a shuffling circuit predetermined for the recording or transmitting apparatus as described above, all sync blocks in the range to which the error is dispersed are regarded to be erroneous. This leads to a problem of an extreme increase in the interpolation probability on the screen.

0007To overcome this problem, there has been proposed, for example, in the Japanese Patent Laid-Open Publication No. 61-181286 in which a high-frequency component of a video signal is subjected to a frequency shift to thereby produce a low-frequency signal. Thereafter, a frequency interleaving is conducted for the attained signal to multiplex the high-frequency component undergone the frequency shift, thereby recording the signal in the form of digital values.

0008However, the proposal has not intention of coping with, for example, the compressing method in which a DCT, a zigzag scan, a quantization, and a coding are conducted. Namely, there has not been described any means to prevent the error propagation.

0009It is therefore an object of the present invention to provide a video data compressor in which even when a burst error occurred in a recording or transmitting apparatus exceeds the error correcting capacity of the apparatus, propagation of the error can be minimized to the maximum extent.

0010In accordance with the present invention, the video data compressor includes compressing means for compressing video data according to a predetermined bit rate and inverse shuffling means for restoring data shuffled by a shuffling operation predetermined for a recording or transmitting apparatus, thereby concentrating errors in the apparatus onto a portion of the video data undergone the compression.

0011Namely, in accordance with the present invention, the data undergone the shuffling operation predetermined for the recording or transmitting apparatus is beforehand restored by the inverse shuffling operation and thereafter dispersed data is sent to the apparatus, thereby possibly lowering the interpolation probability on the screen.

0012Furthermore, in accordance with the present invention, the video data compressor includes compressing means for compressing video data according to a predetermined bit rate, subdividing means for subdividing the data compressed by the compressing means into data items each having a predetermined number of bits and thereby producing data blocks, shuffling means for shuffling the data blocks predetermined for the compressor, and inverse shuffling means for restoring the data shuffled by a shuffling operation determined for a recording or transmitting apparatus, thereby concentrating errors in the apparatus onto a portion of the compressed video data undergone the shuffling.

0013That is, in accordance with the present invention, each of the data blocks obtained by subdividing the video data is subjected to a shuffling operation predetermined for the compressor. To concentrate errors in the apparatus onto a portion of the compressed video data undergone the shuffling, the data undergone the shuffling operation predetermined for the recording or transmitting apparatus is beforehand restored by the inverse shuffling operation. Thereafter, the data is sent to the apparatus, thereby possibly lowering the interpolation probability on the screen and dispersing the data.

0014Moreover, in accordance with the present invention, there are conducted in a final stage of a data recording operation a shuffling operation predetermined for the compressor and an inverse shuffling operation to restore data undergone a shuffling operation predetermined for the recording or transmitting apparatus, thereby outputting the obtained data to a video tape recorder.

BRIEF DESCRIPTION OF THE DRAWINGS

0015The objects and features of the present invention will become more apparent from the consideration of the following detailed description taken in conjunction with the accompanying drawings wherein: <ul id="ul0001" list-style="none"><li>Fig. 1 is a schematic block diagram in which a video data compressor in a first embodiment in accordance with the present invention is connected to a D-2 VTR;</li><li>Fig. 2 is an explanatory diagram of an input data map of the recorder of Fig. 1;</li><li>Fig. 3 is a diagram of a record data map of the recorder of Fig. 1;</li><li>Fig. 4 is an explanatory diagram of a track pattern of the recorder of Fig. 1;</li><li>Fig. 5 is a diagram showing a video block map of high-vision data in the first embodiment;</li><li>Fig. 6 is a diagram in which a video data compressor in a second embodiment in accordance with the present invention is connected to a D-2 VTR;</li><li>Fig. 7 is a diagram of a shuffling layout map of high-vision data in the second embodiment; and</li><li>Fig. 8 is an explanatory diagram useful to explain a shuffling projection map of high-vision data in the second embodiment.</li></ul>

DESCRIPTION OF THE PREFERRED EMBODIMENTS

0016Fig. 1 shows a state in which a first embodiment of the present invention is connected to a D-2 VTR. In this connection, the D-2 VTR is a composite digital VTR conforming to the international standards of the national television standard committee (NTSC) or the phase alteration line (PAL) system. In the embodiment, video data 11 which is high-vision data including high-definition video signals is fed to a video data compressor 12 to obtain compressed data 13. The data 13 is sent to a D-2 VTR 14 to be recorded on a recording medium. In a playback operation, on the other hand, compressed data 15 outputted from the recorder 14 is fed to the compressor 12 so as to create expanded data, thereby obtaining video data 16 including analog signals.

0017The video data 11 in the form of analog signals including a luminance signal and a color difference signal is delivered to an analog-to-digital (A/D) converter 21 in the compressor 12 to be transformed into digital signals. The signals are supplied to a two-dimensional (2D) discrete cosine transform (DCT) circuit 22. In the circuit 22, the digital signals are subjected to the two-dimensional discrete cosine transform operation. The resultant signals are then inputted to a zigzag scan circuit 23 to undergo a zigzag scan and are thereafter inputted to a quantizing circuit 24 to be subjected to a quantization. The obtained signals are fed to a variable-length coding circuit 15 to produce variable-length codes. The codes are delivered to an inverse shuffling circuit 26 to undergo an inverse shuffling operation, thereby restoring the compressed data 13.

0018On the other hand, in a playback operation, the compressed data 16 supplied from the VTR 14 to an inverse de-shuffling circuit 31. The signal undergone the inverse de-shuffling is inputted to a variable-length decoding circuit 32 to undergo a decoding operation. The resultant data is fed to a de-quantizing circuit 33 so as to attain de-quantizaed data. The data is delivered to a zigzag scan circuit 34 and is then inputted to a two-dimensional inverse discrete cosine transform (IDCT) circuit 35 to be subjected to an inverse discrete cosine transform operation. The inversely transformed data is thereafter fed to a digital-to-analog (D/A) converter circuit 36, thereby creating video data 16 in the form of analog signals.

0019As for operation of the compressor 12, description will be specifically given of an operation process of compressing the video data 11.

0020Figs. 2 to 4 show shuffling formats predetermined for a D-2 VTR recording or transmitting apparatus. Fig. 2 shows a one-frame screen. In the vertical direction, there are shown effective lines L (510 lines in total) of each frame; whereas, in the horizontal direction, there are presented effective samples H (768 samples in total) of each line. Assuming that "ih" is Int(H/2), the effective line L, effective sample H, and ih take the following values.    L = 0, 1, 2, ..., 509    H = 0, 1, 2, ..., 767    ih = 0, 1, 2, ..., 383    Fig. 3 shows a projected image the map of Fig. 2 in which letters p, q, and r take the following values.    p = 0, 1, 2, ..., 84    q = 0, 1, 2, ..., 5    r = 0, 1, 2, ..., 767    Under the conditions, the effective line L, effective sample H, and ih can be expressed as follows. <maths id="math0001" num=""><math display="inline"><mrow><mtext>L = p + 85 · Int(r/128)</mtext></mrow></math><img file="EP0613301A2_D0001.tif" /></maths><maths id="math0002" num=""><math display="inline"><mrow><mtext>ih = [12 · p + 277 · q + 258 · (r · mod 64)]mod 384</mtext></mrow></math><img file="EP0613301A2_D0002.tif" /></maths><maths id="math0003" num=""><math display="inline"><mrow><mtext>H = 2 · ih + [L + Int(r/64)]mod 2   (1)</mtext></mrow></math><img file="EP0613301A2_D0003.tif" /></maths>    Fig. 3 specifically shows relationships between a field F, a segment S, and a channel T, which respectively take the following values.    F = 0, 1, S = 0, 2, T = 0, 1    Consequently, these values can be expressed as follows. <maths id="math0004" num=""><math display="inline"><mrow><mtext>F = Int(r/384)</mtext></mrow></math><img file="EP0613301A2_D0004.tif" /></maths><maths id="math0005" num=""><math display="inline"><mrow><mtext>S = [Int(r/128)]mod 3</mtext></mrow></math><img file="EP0613301A2_D0005.tif" /></maths><maths id="math0006" num=""><math display="inline"><mrow><mtext>T = [Int(r/64)]mod 2   (2)</mtext></mrow></math><img file="EP0613301A2_D0006.tif" /></maths>    The recording operation is effected in an order as indicated by an arrow denoted as SB (sync block) in Fig. 3. The recording is horizontally conducted for each line from the upper-most line to the lower-most line, namely, for r = 0, q = 0, p = 0 to 84 and r = 0, q = 0, p = 0 to 84 with conditions of q = 0 to 1, 2 to 3, and 4 to 5 and then with conditions of r = 0 to 767. The recording order "X" (0 ≦ X ≦ 391679) is expressed as follows. <maths id="math0007" num=""><math display="inline"><mrow><mtext>X = p + 85 · q + 510 · r   (3)</mtext></mrow></math><img file="EP0613301A2_D0007.tif" /></maths>    In this connection, in the actual format, there is employed another order exchange in the recording order of the code r. However, influence therefrom is ignorable and is hence not taken into consideration in this embodiment.

0021Fig. 5 shows a video block map of high-vision data. As shown in the map, including the luminance and color signals, there are obtained 1088 lines × 1536 samples for each frame. The block generating operation is conducted to produce video blocks each including 8 lines × 8 samples. As a result, each frame includes 136 × 192 = 26112 video blocks.

0022In the compressor 12 of Fig. 1, the transform operation is first conducted for each video block 41; thereafter, a zigzag scan, a quantization, and a variable-length coding are effected for the obtained data. The control operation is resultantly accomplished to allocate an appropriate number of bits to each block such that the size of each frame does not exceed the number of bits (3133440 bits) predetermined for the D-2 VTR 14.

0023Subsequently, the video data is subjected to a serial-to-parallel conversion in the inverse shuffling circuit 26, thereby restoring the data undergone the shuffling described above. First, the compressed data after the conversion is sequentially arranged as shown in Fig. 3 according to the following order: r = 0, q = 0, p = 0 to 84 and r = 0, q = 1, p = 0 to 84 with conditions of q = 0 to 1, 2 to 3, 4 to 5; moreover, r = 0 to 767. Namely, the order X (0 ≦ X ≦ 391679) of the compressed data undergone the conversion is represented by the expression (3).

0024Next, the data of Fig. 3 is mapped as shown in Fig. 2 in which the effective line L, the effective sample H, ih, and symbols p, q, and r are as already described. Relationships between the values respectively of L, H, and ih are represented by the expression (1).

0025Finally, as the compressed data 13 from the compressor 12, there is produced data for H = 0 to 767 with L = 0. While incrementing the value of effective line L up to 509 by an increment of one, the data is sequentially created, thereby transmitting one frame of the compressed data 13 to the recorder 14. Namely, the output data order Y (0 ≦ X ≦ 391679) is expressed as follows. <maths id="math0008" num=""><math display="inline"><mrow><mtext>Y = H + 768 × L   (4)</mtext></mrow></math><img file="EP0613301A2_D0008.tif" /></maths>    As a result, there is implemented an inverse shuffling to restore data undergone the shuffling predetermined for the recording or transmitting apparatus. In a video playback operation, data supplied from the recorder 14 to the compressor 12 is subjected to an inverse de-shuffling by the inverse de-shuffling circuit 31 in the first stage of operation.

0026Fig. 6 shows a state in which a video data compressor in a second embodiment of the present invention is connected to a D-2 VTR. Also in the second embodiment, video data 11 in the form of high-vision data is fed to a video data compressor 51. The compressed data 52 is sent to a D-2 VTR 14 to be recorded therein. On the other hand, in a playback operation, compressed data 53 is delivered from the recorder 14 to the compressor 51 to be resultantly expanded, thereby outputting video data 54 including analog signals. In this diagram, the same components as those of Fig. 1 are assigned with the same reference numerals, and hence a redundant description thereof will be avoided.

0027In the compressor 51 of the embodiment, data outputted from a zigzag scan circuit 23 is delivered to a quantizing and coding circuit 61 to undergo a quantization and a coding operation. The resultant data is then inputted to a shuffling circuit 62 to be subjected to a shuffling predetermined for the compressor 51, thereby sending the obtained data to an inverse shuffling circuit 63. In the circuit 63, the data undergoes an inverse shuffling so as to restore the data shuffled by a shuffling operation predetermined for the recording or transmitting apparatus, thereby transmitting the resultant compressed data 52 to the recorder 14. Conversely, in a playback operation, the compressed data 53 is supplied from the recorder 14 to an inverse de-shuffling circuit 64 to undergo an inverse de-shuffling. The data is then de-shuffled by a de-shuffling circuit 65. The obtained data undergoes a de-quantization and a decoding operation in a de-quantizing and decoding circuit 66 and is then fed to a zigzag scan circuit 34. In this connection, the circuit 61 is implemented by combining the quantizing circuit 24 with the variable-length coding circuit 2 of the first embodiment; whereas, the circuit 66 includes the variable-length decoding circuit 32 and the de-quantizing circuit 33 of the first embodiment.

0028In regard to the circuit operation of the compressor 51, description will be specifically given of an operation process of compressing the video data 11. In the description, the drawings related to the first embodiment will be referenced when necessary.

0029As described in conjunction with Fig. 5, a frame of high-vision data including the luminance and color difference signals includes 1088 × 1536 samples. The data is partitioned into video blocks each including 8 lines × 8 samples such that each frame contains 26112 video blocks as described above.

0030Also in the compressor 51 of the second embodiment, the two-dimensional discrete cosine transform is first accomplished for each video block 41. The data is then subjected the zigzag scan, quantization, and variable-length coding so as to allocate an appropriate number of bits to each block. As a result, the control operation is effected such that the size of each frame is equal to or more than a number of bits (3133440 bits = 391680 bytes) predetermined for the D-2 VTR 14. Subsequently, the video data is shuffled in the 8-bit unit by the shuffling circuit 62 so as to conduct a serial-to-parallel conversion thereof, thereby achieving a shuffling operation predetermined for the compressor 51.

0031Fig. 7 shows a data layout for the shuffling operation in which rows and arrays are respectively designated by letters m and k. The compressed data undergone the conversion is first arranged in an order of m = 0 to 169.

0032Namely, in a direction denoted by an arrow "SB (sync block)" in a range of k = 0 to 2303.

0033Next, with the row direction, namely, the value of m kept unchanged, the value of k denoting the column direction is shuffled so as to determine combinations of symbols m and n, thereby allocating rows and columns to the map. Fig. 8 shows a map including the rows and columns represented by symbols m and n, respectively. In Figs. 7 and 8, the symbols m, k, and n take the following values.    m = 0, 1, 2, ..., 169    k = 0, 1, 2, ..., 2303    n = 0, 1, 2, ..., 2303    Assume that the values of k and n are controlled so that the following relationships are satisfied. <maths id="math0009" num=""><math display="inline"><mrow><mtext>k = 48 · (n mod 48) + Int(n/48)</mtext></mrow></math><img file="EP0613301A2_D0009.tif" /></maths><maths id="math0010" num=""><math display="inline"><mrow><mtext>n = 48 · (k mod 48) + Int(k/48)   (5)</mtext></mrow></math><img file="EP0613301A2_D0010.tif" /></maths>    Assumed that the compressed data is sequentially arranged in an order of m = 0 to 169 (in the direction of the arrow "SB") with n ranging from 0 to 2303.

0034Subsequently, the data is delivered to an inverse shuffling circuit 26 to be subjected to an inverse shuffling predetermined for the recording or transmitting apparatus. Data series attained by inversely shuffling the compressed data undergone the conversion are arranged as shown in Fig. 3 in an order as follows: r = 0, q = 0, p = 0 to 84 and r = 0, q = 1, and p = 0 to 84 with q = 0 to 1, 2 to 3, and 4 to 5; moreover, r = 0 to 767. That is, the order X (0 ≦ X ≦ 391679) of compressed data undergone the conversion is represented by the expression (3).

0035Next, the data thus arranged in Fig. 3 is mapped as shown in Fig. 2 in which the effective line L, the effective sample H, ih, and symbols p, q, and r are as already described above. Relationships between L, H, and ih are represented by the expression (1).

0036Finally, as the compressed data 13 from the compressor 12, there is produced data for H = 0 to 767 with L = 0. While incrementing by one the value of L up to 509, the compressed data 13 is outputted to the reader 14. As a result, one frame of compressed data 13 is transmitted to the recorder 14. Namely, the output data order Y (0 ≦ Y ≦ 391679) is represented by the expression (4). Through the operation described above, there is achieved an inverse shuffling to restore data shuffled by the shuffling operation predetermined for the recording or transmitting device.

0037On the recording side, in a stage near the end stage thereof, there are conducted a shuffling operation predetermined for the compressor and an inverse shuffling to restore data shuffled by a shuffling operation predetermined for the recorder or transmitter, thereby sending the resultant compressed data 52 to the recorder 14. In a video signal playback operation, data supplied from the recorder 14 to the compressor 51 is fed to the inverse de-shuffling circuit 64 in the first stage thereof to undergo an inverse de-shuffling. The obtained data is then de-shuffled by the de-shuffling circuit 65.

0038Incidentally, in the description of the first and second embodiments, the high-vision data is compressed to be recorded in the D-2 VTR. However, it is to be appreciated that the present invention is similarly applicable to other recording and transmitting facilities.

0039In accordance with the present invention as described above, video data is compressed according to a predetermined bit rate. To concentrate errors in a recording or transmitting apparatus onto a portion of the compressed video data, data shuffled by a shuffling operation predetermined for the apparatus is restored such that dispersed data is supplied to the apparatus, thereby possibly lowering the interpolation probability on the screen.

0040Furthermore, in accordance with the present invention as described above, video data is compressed according to a predetermined bit rate. The attained data thus compressed is subdivided into data blocks each having a predetermined bits.

0041The data blocks are subjected to a shuffling predetermined for the compressor; moreover, to concentrate errors in a recording or transmitting apparatus onto a portion of the compressed video data undergone the shuffling, the data shuffled by a shuffling operation predetermined for the apparatus is restored such that the resultant data is sent to the apparatus, thereby possibly lowering the interpolation probability on the screen and dispersing the data.

0042While the present invention has been described with reference to the particular illustrative embodiments, it is not to be restricted by those embodiments but only by the appended claims. It is to be appreciated that those skilled in the art can change or modify the embodiments without departing from the scope and spirit of the present invention.