US20010041984A1 - Data compression and expansion of an n-level information signal - Google Patents
Data compression and expansion of an n-level information signal Download PDFInfo
- Publication number
- US20010041984A1 US20010041984A1 US09/089,628 US8962898A US2001041984A1 US 20010041984 A1 US20010041984 A1 US 20010041984A1 US 8962898 A US8962898 A US 8962898A US 2001041984 A1 US2001041984 A1 US 2001041984A1
- Authority
- US
- United States
- Prior art keywords
- signal
- data
- prediction
- information signal
- probability
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00007—Time or data compression or expansion
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00007—Time or data compression or expansion
- G11B2020/00014—Time or data compression or expansion the compressed signal being an audio signal
- G11B2020/00065—Sigma-delta audio encoding
Definitions
- the invention relates to a data compression apparatus for data compressing an n-level information signal, to a data compression method, a transmitter comprising the data compression apparatus, a record carrier having the data compressed audio signal recorded on it in a track of said record carrier, to a data expansion apparatus for data expanding a data compressed n-level information signal, to a data expansion method, and to a receiver comprising the data expansion apparatus.
- Oversampling delta-sigma data converters are applied for high quality analog-to-digital conversion. Usually, these converters are designed such as to produce a binary, two level digital output signal, also referred to as bitstream or DSD signal. Although it is also possible to design delta-sigma data converters that produce output signals with more than two levels, such converters were not used in practice because of distortion products and noise caused by non-linearities in such multi-level converters.
- the invention aims at providing an apparatus for enabling a data compression step on the 3-level, more specifically, an n-level information signal, and aims at providing an apparatus for enabling a data expansion step on the data compressed n-level information signal so as to regain a replica of the n-level information signal.
- the data compression apparatus in accordance with the invention for data compressing an information signal, which is in n-level form, n being larger than 2, comprises
- lossless coding means having an input for receiving an input signal, for carrying out a lossless encoding step on the input signal, so as to obtain a data compressed output signal at an output, said lossless encoding means comprising an entropy encoder for carrying out the lossless encoding step on the input signal in response to a probability signal,
- prediction means for carrying out a prediction step on the n-level information signal so as to obtain a prediction signal
- probability signal determining means for generating the probability signal in response to said prediction signal
- output means for supplying said data compressed output signal.
- the data expansion apparatus in accordance with the invention for data expanding a data compressed input signal so as to obtain an information signal, which is in n-level form, n being larger than 2, comprises
- input means for receiving the data compressed input signal
- lossless decoding means having an input for receiving the data compressed input signal, for carrying out a lossless decoding step on the data compressed input signal, so as to obtain a data expanded output signal at an output, said lossless decoding means comprising an entropy decoder for carrying out the lossless decoding step on the data compressed input signal in response to a probability signal,
- prediction means for carrying out a prediction step on the information signal so as to obtain a prediction signal
- probability signal determining means for generating the probability signal in response to said prediction signal.
- FIG. 1 shows an embodiment of the data compression apparatus
- FIG. 2 shows an embodiment of a corresponding data expansion apparatus
- FIG. 3 shows a second embodiment of the data compression apparatus
- FIG. 4 shows an embodiment of the corresponding data expansion apparatus
- FIG. 5 shows a data compression apparatus incorporated in a transmitter, which is in the form of as a recording apparatus, and
- FIG. 6 shows a data expansion apparatus incorporated in a receiver, which is in the form of a reproduction apparatus.
- FIG. 1 shows an embodiment of the data compression apparatus, comprising an input terminal 1 for receiving the n-level information signal.
- n-level information signal has been obtained from converting an audio signal using a delta-sigma modulator.
- the input terminal 1 is coupled to an input 2 of an entropy encoder which is in the present case in the form of an arithmetic coder 4 .
- An output 6 of the arithmetic coder is coupled to an output terminal 8 of the compression apparatus.
- the input terminal 1 is further coupled to an input 10 of a prediction filter, which has an output 14 coupled to an input 16 of a probability determining unit 18 .
- the output 20 of the probability unit 18 is coupled to a control input 22 of the arithmetic coder 4 .
- the arithmetic coder 4 encodes the signal applied to its input 4 into a data compressed information signal in response to probability values p supplied to its control input 22 and supplies the data compressed information signal to its output 6 .
- the probability determining unit 18 determines a probability value indicating the probability that a symbol in the n-value information signal supplied to the input terminal 1 has a predetermined level. In the case of a three valued information signal, those levels (or values) can be ⁇ 1, 0 or +1.
- This probability value, denoted p in FIG. 1 is supplied to the arithmetic coder 4 so as to enable the data compression of the n-level information signal in the arithmetic coder 4 .
- the determining unit 18 determines the probability values p from the output signal of the prediction filter 12 .
- the arithmetic coder 4 can data compress the n-level information signal on a frame-by-frame basis.
- the prediction filter 12 realizes a prediction filtering on the n-level information so as to obtain a multi value output signal.
- the prediction filter unit 12 and the probability determining unit 18 are fixed (static) units, in the sense that their behaviour does not change in time.
- the filter unit 12 is adaptive, so that it can adapt itself to a changing input signal characteristic, so as to obtain the best prediction result.
- the probability unit 18 can again be fixed.
- the prediction filter unit 12 can be fixed and the probability determining unit 18 can be adaptive. This adaptivity will be explained later.
- both units 12 and 18 are adaptive.
- the multi value output signal supplied by the prediction filter unit 12 can have a plurality of levels within a range of eg. +3 and ⁇ 3. Further, for each of a plurality of subintervals in the value range of the multi level output signal, it is determined what the probability is that the symbol in the level in the n-level information signal is a ‘+1’, ‘0’ or ‘ ⁇ 1’, assuming a 3-level information signal, as explained above. This could have been realized in advance, or in real time, during the data compression itself, eg. by counting the number of ‘+1’s, ‘0’s and ‘ ⁇ 1’s occurring in the n-level information signal during a specific time interval, when the multi level output signal of the prediction filter 12 falls in one of such ranges.
- the probability determining unit 18 For each symbol supplied to the coder 4 , the probability determining unit 18 supplies the three probabilities for ‘+1’, ‘0’ and ‘ ⁇ 1’ that correspond to the subinterval in which the multi level output signal for that symbol is located.
- the data compressed n-level information signal is supplied by the arithmetic coder 14 to the output terminal 8 , eg. for transmission via a transmission medium or a record carrier.
- FIG. 2 shows a corresponding data expansion apparatus for decoding the data compressed n-level information signal, received via an input terminal 30 .
- the data expansion apparatus of FIG. 2 comprises an entropy decoder 32 , which receives the data compressed n-level information signal via an input 34 .
- the entropy decoder 32 is in the form of an arithmetic decoder that carries out an arithmetic decoding step on the data compressed n-level information signal, under the influence of a probability signal p, supplied to a control input 36 so as to generate a replica of the original n-level information signal which is supplied to an output 38 .
- the output 38 of the decoder 32 is coupled to an output terminal 40 as well as to an input 42 of a prediction filter 44 , which has an output 46 coupled to an input 48 of a probability determining unit 50 .
- the probability determining unit 50 has an output 52 which is coupled to the control input 36 of the decoder 32 .
- the data expansion apparatus of FIG. 2 is complementary to the data compression apparatus of FIG. 1, in the sense that, if the prediction filter 12 and the unit 18 are both fixed, the prediction filter 44 and the unit 50 are fixed, that if the prediction filter 12 is adaptive also the filter 44 is adaptive, and that if the unit 18 is adaptive, the unit 50 is also adaptive.
- the filters 12 and 44 When the filters 12 and 44 are adapted, it is required to transmit side information from the compression apparatus to the expansion apparatus. Such side information then include the filter coefficients.
- the units 18 and 50 When, the units 18 and 50 are adaptive, it is also required to transmit side information to the expansion apparatus, such side information comprising information concerning the conversion of the multi-level information signal supplied by the filter 44 into the probabilities p generated in response thereto by the unit 50 .
- the entropy encoder used in the embodiment of FIG. 1 is adapted to encode the n-level information signal using a probability signal in order to obtain the data compressed information signal, which is a binary signal.
- One such entropy encoder is the arithmetic coder described above.
- One other type of such entropy coder is, as an example, the well known finite state coder.
- the entropy decoder used in the embodiment of FIG. 2 is adapted to decode the data compressed information signal using a probability signal in order to obtain a replica of the n-level information signal.
- One such entropy decoder is the arithmetic decoder described above.
- One other type of such entropy decoder is, as an example, the well known finite state decoder.
- FIG. 3 shows another embodiment of the data compression apparatus.
- the data compression apparatus shows much resemblance with the data compression apparatus of FIG. 1, but further comprises a quantizer 60 having an input 62 coupled to the output 14 of the prediction filter 12 and an output 64 coupled to a first input 66 of a signal combination unit 70 .
- the signal combination unit 70 has a second input 68 coupled to the input terminal 1 and an output 72 which is coupled to the input 2 of the arithmetic coder 4 .
- the quantizer 60 is adapted to quantize the multi value prediction signal generated by the prediction filter 12 into an n-level output signal which is a predicted version of the n-level information signal supplied to the input 1 .
- the signal combination unit 70 combines the n-level information signal applied to its input 68 and the predicted version of the n-level information signal supplied to its input 66 in a subtractive way so as to obtain a residual information signal, which is supplied to its output 72 .
- the advantage of generating a residual information signal is that, by combining the n-level information signal and the predicted n-level information signal, the probability of occurrence of symbols with zero level in the residual information signal is significantly increased. This can simplify the subsequent data compression in the arithmetic coder 4 .
- the probability determining unit 18 now generates a probability value indicating the probability that a value of the residual information signal supplied by the combination unit 70 has a predetermined value, such as ‘+1’.
- This probability value denoted p in FIG. 3, is supplied to the arithmetic coder 14 so as to enable the data compression of the n-level information signal in the arithmetic coder 14 .
- the determining unit 18 determines the probability values again from the output signal of the prediction filter 12 .
- the probability values p for data compressing the residual information signal are obtained from the prediction signal generated by the prediction filter 12 , which has a relation with the n-level information signal, and not from a signal that has a relation with the residual information signal. This has an advantage, in that a higher compression ratio can be obtained with the arithmetic coder 14 .
- the arithmetic coder 14 can data compress the residual information signal on a frame-by-frame basis.
- both the filter 12 and the unit 18 can be static, or one or both of the filter 12 and the unit 18 can be adaptive.
- the prediction filter 12 again realizes a prediction filtering on the n-level information signal so as to obtain the multi value output signal.
- the multi value output signal lies again within a range of eg. +3 and ⁇ 3.
- the quantizer 60 receives the multi value output signal and generates a predicted version of the n-level information signal therefrom, eg. by allocating a value of ‘+1’ if the multi value output signal is eg. larger than +1, by allocating a value ‘ ⁇ 1’ if the multi value prediction signal is smaller than ⁇ 1 and by allocating a value ‘0’, if the multi value prediction signal lies between ⁇ 1 and +1.
- the residual information signal can have values ‘ ⁇ 2’, ‘ ⁇ 1’, ‘0’, ‘+1’ and ‘+2’. For each of a plurality of subintervals in the value range of the multi value output signal, it is determined what the probability is that the corresponding value of the residual signal is eg. ‘+1’. In the adaptive embodiment of the unit 18 , this can be realized by counting the number of ‘+2’s, ‘+1’s, ‘0’s, ‘ ⁇ 1’s and ‘ ⁇ 2’s occurring in the residual information signal during a specific time interval, when the multi value output signal falls in one of such ranges. The probabilities thus obtained for the various values in the multi value output signal are subsequently supplied as the probability signal p to the arithmetic coder 14 .
- the data compressed residual information signal is supplied by the arithmetic coder 14 to the output terminal 8 , for transmission via a transmission medium or for recording.
- FIG. 4 shows a corresponding data processing apparatus for decoding the data compressed signal, received via the transmission or recording medium.
- the data processing apparatus of FIG. 4 shows a large resemblance with the data expansion apparatus of FIG. 2, with the difference that that apparatus of FIG. 4 further comprises a quantizer 80 and a signal combination unit 90 .
- the quantizer has an input 82 coupled to the output 46 of the prediction filter 44 , and an output 84 which is coupled to a first input 86 of the signal combination unit 90 .
- the signal combination unit 90 has a second input 88 which is coupled to the output 38 of the decoder 32 .
- the output 92 of the signal combination unit 92 is coupled to the output terminal 40 and to the input 42 of the prediction filter.
- the decoder 32 receives the data compressed residual information signal via its input 34 .
- the decoder 32 carries out an arithmetic decoding step on the data compressed residual information signal under the influence of the probability signal p, supplied to the control input 36 so as to generate a replica of original residual information signal which is supplied to its output 38 .
- the replica is supplied to the input 88 of the signal combination unit 90 .
- the signal combination unit 90 further receives a predicted version of the n-level information signal via its input 86 and generates a replica of the original n-level information signal at its output 92 in response thereto.
- the functioning of the prediction filter 44 and the quantize, 80 can be identical to the functioning of the prediction filter 12 and the quantizer 60 in FIG. 3.
- side information will be transmitted concerning the filter coefficients in the filter 44 .
- the side information will also include information concerning the conversion of the multi value output signal into the probabilities p.
- the entropy encoder used in the embodiment of FIG. 3 is adapted to encode the residual information signal using a probability signal in order to obtain the data compressed residual information signal.
- One of such entropy encoder is the arithmetic coder described above.
- One other type of such entropy coder is, as an example, the well known finite state coder.
- the entropy decoder used in the embodiment of FIG. 4 is adapted to decode the data compressed residual information signal using a probability signal in order to obtain a replica of the residual information signal.
- One of such entropy decoder is the arithmetic decoder described above.
- One other type of such entropy decoder is, as an example, the well known finite state decoder.
- FIG. 5 shows an embodiment of a transmission apparatus which is in the form of a recording apparatus.
- the recording apparatus comprises the data compression apparatus shown in FIG. 1 or 3 .
- the recording apparatus further comprises a write unit 106 for writing the data compressed n-level information signal in a track on the record carrier 108 .
- the record carrier 108 is a magnetic record carrier, so that the write unit 106 comprises at least one magnetic head 110 for writing the data compressed n-level information signal in the record carrier 108 .
- the record carrier may however be an optical record carrier, such as a CD disk or a DVD disk.
- FIG. 5 shows such signal processing steps.
- the recording arrangement of FIG. 5 therefore comprises an error correction encoder 102 , well known in the art, and a channel encoder 104 , also well known in the art.
- FIG. 6 shows the data expansion apparatus of FIG. 2 or 4 incorporated in a receiver apparatus, which is in the form of a reproduction apparatus.
- the reproducing apparatus further comprises a read unit 112 for reading the data compressed n-level information signal from a track on the record carrier 108 .
- the record carrier 108 is a magnetic record carrier, so that the read unit 112 comprises at least one magnetic head 114 for reading the data compressed n-level information signal from the record carrier 108 .
- the record carrier may however be an optical record carrier, such as a CD disk or a DVD disk.
- FIG. 6 shows the signal processing steps of channel decoding and error correction carried out on the received signal, received by the reading means 112 .
- the reproducing arrangement of FIG. 6 therefore comprise a channel decoder 116 , well known in the art, and an error correction unit 118 , also well known in the art, so as to obtain a replica of the data compressed n-level information signal.
- the invention lies in each and every novel feature or combination of features.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
A data compression apparatus is disclosed for data compressing an information signal, which is in n-level form, n being larger than 2. The data compression apparatus comprises an input terminal (1) for receiving the n-level information signal, an entropy coder, such as an arithmetic coder (4) having an input (2) for receiving an input signal, which is adapted to carry out a lossless encoding step on the input signal, so as to obtain a data compressed output signal at an output (6). The apparatus further comprises a prediction filter (12) for carrying out a prediction step on the n-level information signal so as to obtain a prediction signal and a probability signal determining unit (18) for generating the probability signal in response to said prediction signal. An output terminal (8) is available for supplying said data compressed output signal. (FIG. 1) Further, a data expansion apparatus is disclosed. (FIG. 2)
Description
- The invention relates to a data compression apparatus for data compressing an n-level information signal, to a data compression method, a transmitter comprising the data compression apparatus, a record carrier having the data compressed audio signal recorded on it in a track of said record carrier, to a data expansion apparatus for data expanding a data compressed n-level information signal, to a data expansion method, and to a receiver comprising the data expansion apparatus.
- Oversampling delta-sigma data converters are applied for high quality analog-to-digital conversion. Usually, these converters are designed such as to produce a binary, two level digital output signal, also referred to as bitstream or DSD signal. Although it is also possible to design delta-sigma data converters that produce output signals with more than two levels, such converters were not used in practice because of distortion products and noise caused by non-linearities in such multi-level converters.
- Recently, however, a converter was described for generating a 3-level information signal. Reference is made in this respect to the AES preprint 4443, ‘A 120 dB dynamic range, 96 kHz, stereo 24-bit analog-to-digital converter’, by K. Leung et al 102nd AES convention (Munich, Germany). The 3-level information signal is available as an internal representation in the converter.
- The invention aims at providing an apparatus for enabling a data compression step on the 3-level, more specifically, an n-level information signal, and aims at providing an apparatus for enabling a data expansion step on the data compressed n-level information signal so as to regain a replica of the n-level information signal.
- The data compression apparatus in accordance with the invention for data compressing an information signal, which is in n-level form, n being larger than 2, comprises
- input means for receiving the n-level information signal,
- lossless coding means having an input for receiving an input signal, for carrying out a lossless encoding step on the input signal, so as to obtain a data compressed output signal at an output, said lossless encoding means comprising an entropy encoder for carrying out the lossless encoding step on the input signal in response to a probability signal,
- prediction means for carrying out a prediction step on the n-level information signal so as to obtain a prediction signal,
- probability signal determining means for generating the probability signal in response to said prediction signal,
- output means for supplying said data compressed output signal.
- The data expansion apparatus in accordance with the invention for data expanding a data compressed input signal so as to obtain an information signal, which is in n-level form, n being larger than 2, comprises
- input means for receiving the data compressed input signal,
- lossless decoding means having an input for receiving the data compressed input signal, for carrying out a lossless decoding step on the data compressed input signal, so as to obtain a data expanded output signal at an output, said lossless decoding means comprising an entropy decoder for carrying out the lossless decoding step on the data compressed input signal in response to a probability signal,
- output means for supplying said information signal,
- prediction means for carrying out a prediction step on the information signal so as to obtain a prediction signal,
- probability signal determining means for generating the probability signal in response to said prediction signal.
- By this, a more efficient storage or transmission of the n-level information signal can be achieved.
- These and other aspects of the invention will be apparent from and elucidated further with reference to the embodiments described in the following figure description, in which
- FIG. 1 shows an embodiment of the data compression apparatus,
- FIG. 2 shows an embodiment of a corresponding data expansion apparatus,
- FIG. 3 shows a second embodiment of the data compression apparatus,
- FIG. 4 shows an embodiment of the corresponding data expansion apparatus,
- FIG. 5 shows a data compression apparatus incorporated in a transmitter, which is in the form of as a recording apparatus, and
- FIG. 6 shows a data expansion apparatus incorporated in a receiver, which is in the form of a reproduction apparatus.
- FIG. 1 shows an embodiment of the data compression apparatus, comprising an
input terminal 1 for receiving the n-level information signal. In the present example, n-level information signal has been obtained from converting an audio signal using a delta-sigma modulator. Theinput terminal 1 is coupled to aninput 2 of an entropy encoder which is in the present case in the form of anarithmetic coder 4. Anoutput 6 of the arithmetic coder is coupled to anoutput terminal 8 of the compression apparatus. - The
input terminal 1 is further coupled to aninput 10 of a prediction filter, which has anoutput 14 coupled to aninput 16 of aprobability determining unit 18. Theoutput 20 of theprobability unit 18 is coupled to acontrol input 22 of thearithmetic coder 4. - The
arithmetic coder 4 encodes the signal applied to itsinput 4 into a data compressed information signal in response to probability values p supplied to itscontrol input 22 and supplies the data compressed information signal to itsoutput 6. Theprobability determining unit 18 determines a probability value indicating the probability that a symbol in the n-value information signal supplied to theinput terminal 1 has a predetermined level. In the case of a three valued information signal, those levels (or values) can be −1, 0 or +1. This probability value, denoted p in FIG. 1, is supplied to thearithmetic coder 4 so as to enable the data compression of the n-level information signal in thearithmetic coder 4. The determiningunit 18 determines the probability values p from the output signal of theprediction filter 12. Thearithmetic coder 4 can data compress the n-level information signal on a frame-by-frame basis. - The functioning of the apparatus of FIG. 1 is as follows. The
prediction filter 12 realizes a prediction filtering on the n-level information so as to obtain a multi value output signal. - Various embodiments of the
prediction filter unit 12 and theprobability determining unit 18 are possible. In a first embodiment, theprediction filter unit 12 and theprobability determining unit 18 are fixed (static) units, in the sense that their behaviour does not change in time. In a second embodiment, thefilter unit 12 is adaptive, so that it can adapt itself to a changing input signal characteristic, so as to obtain the best prediction result. Theprobability unit 18 can again be fixed. In a third embodiment, theprediction filter unit 12 can be fixed and theprobability determining unit 18 can be adaptive. This adaptivity will be explained later. In a fourth embodiment, bothunits - The multi value output signal supplied by the
prediction filter unit 12 can have a plurality of levels within a range of eg. +3 and −3. Further, for each of a plurality of subintervals in the value range of the multi level output signal, it is determined what the probability is that the symbol in the level in the n-level information signal is a ‘+1’, ‘0’ or ‘−1’, assuming a 3-level information signal, as explained above. This could have been realized in advance, or in real time, during the data compression itself, eg. by counting the number of ‘+1’s, ‘0’s and ‘−1’s occurring in the n-level information signal during a specific time interval, when the multi level output signal of theprediction filter 12 falls in one of such ranges. For each symbol supplied to thecoder 4, theprobability determining unit 18 supplies the three probabilities for ‘+1’, ‘0’ and ‘−1’ that correspond to the subinterval in which the multi level output signal for that symbol is located. The data compressed n-level information signal is supplied by thearithmetic coder 14 to theoutput terminal 8, eg. for transmission via a transmission medium or a record carrier. - FIG. 2 shows a corresponding data expansion apparatus for decoding the data compressed n-level information signal, received via an
input terminal 30. The data expansion apparatus of FIG. 2 comprises anentropy decoder 32, which receives the data compressed n-level information signal via aninput 34. In the present example, theentropy decoder 32 is in the form of an arithmetic decoder that carries out an arithmetic decoding step on the data compressed n-level information signal, under the influence of a probability signal p, supplied to acontrol input 36 so as to generate a replica of the original n-level information signal which is supplied to anoutput 38. Theoutput 38 of thedecoder 32 is coupled to anoutput terminal 40 as well as to aninput 42 of aprediction filter 44, which has anoutput 46 coupled to aninput 48 of aprobability determining unit 50. Theprobability determining unit 50 has anoutput 52 which is coupled to thecontrol input 36 of thedecoder 32. - The data expansion apparatus of FIG. 2 is complementary to the data compression apparatus of FIG. 1, in the sense that, if the
prediction filter 12 and theunit 18 are both fixed, theprediction filter 44 and theunit 50 are fixed, that if theprediction filter 12 is adaptive also thefilter 44 is adaptive, and that if theunit 18 is adaptive, theunit 50 is also adaptive. - When the
filters units filter 44 into the probabilities p generated in response thereto by theunit 50. - The entropy encoder used in the embodiment of FIG. 1 is adapted to encode the n-level information signal using a probability signal in order to obtain the data compressed information signal, which is a binary signal. One such entropy encoder is the arithmetic coder described above. One other type of such entropy coder is, as an example, the well known finite state coder. The entropy decoder used in the embodiment of FIG. 2 is adapted to decode the data compressed information signal using a probability signal in order to obtain a replica of the n-level information signal. One such entropy decoder is the arithmetic decoder described above. One other type of such entropy decoder is, as an example, the well known finite state decoder.
- FIG. 3 shows another embodiment of the data compression apparatus. The data compression apparatus shows much resemblance with the data compression apparatus of FIG. 1, but further comprises a
quantizer 60 having aninput 62 coupled to theoutput 14 of theprediction filter 12 and anoutput 64 coupled to afirst input 66 of asignal combination unit 70. Thesignal combination unit 70 has asecond input 68 coupled to theinput terminal 1 and anoutput 72 which is coupled to theinput 2 of thearithmetic coder 4. - The functioning of the apparatus of FIG. 3 is as follows. The
quantizer 60 is adapted to quantize the multi value prediction signal generated by theprediction filter 12 into an n-level output signal which is a predicted version of the n-level information signal supplied to theinput 1. Thesignal combination unit 70 combines the n-level information signal applied to itsinput 68 and the predicted version of the n-level information signal supplied to itsinput 66 in a subtractive way so as to obtain a residual information signal, which is supplied to itsoutput 72. The advantage of generating a residual information signal, is that, by combining the n-level information signal and the predicted n-level information signal, the probability of occurrence of symbols with zero level in the residual information signal is significantly increased. This can simplify the subsequent data compression in thearithmetic coder 4. - The
probability determining unit 18 now generates a probability value indicating the probability that a value of the residual information signal supplied by thecombination unit 70 has a predetermined value, such as ‘+1’. This probability value, denoted p in FIG. 3, is supplied to thearithmetic coder 14 so as to enable the data compression of the n-level information signal in thearithmetic coder 14. The determiningunit 18 determines the probability values again from the output signal of theprediction filter 12. - It should be noted that the probability values p for data compressing the residual information signal are obtained from the prediction signal generated by the
prediction filter 12, which has a relation with the n-level information signal, and not from a signal that has a relation with the residual information signal. This has an advantage, in that a higher compression ratio can be obtained with thearithmetic coder 14. Thearithmetic coder 14 can data compress the residual information signal on a frame-by-frame basis. - The functioning of the apparatus of FIG. 3 is as follows. As stated above, both the
filter 12 and theunit 18 can be static, or one or both of thefilter 12 and theunit 18 can be adaptive. Theprediction filter 12 again realizes a prediction filtering on the n-level information signal so as to obtain the multi value output signal. The multi value output signal lies again within a range of eg. +3 and −3. Thequantizer 60 receives the multi value output signal and generates a predicted version of the n-level information signal therefrom, eg. by allocating a value of ‘+1’ if the multi value output signal is eg. larger than +1, by allocating a value ‘−1’ if the multi value prediction signal is smaller than −1 and by allocating a value ‘0’, if the multi value prediction signal lies between −1 and +1. - The residual information signal can have values ‘−2’, ‘−1’, ‘0’, ‘+1’ and ‘+2’. For each of a plurality of subintervals in the value range of the multi value output signal, it is determined what the probability is that the corresponding value of the residual signal is eg. ‘+1’. In the adaptive embodiment of the
unit 18, this can be realized by counting the number of ‘+2’s, ‘+1’s, ‘0’s, ‘−1’s and ‘−2’s occurring in the residual information signal during a specific time interval, when the multi value output signal falls in one of such ranges. The probabilities thus obtained for the various values in the multi value output signal are subsequently supplied as the probability signal p to thearithmetic coder 14. The data compressed residual information signal is supplied by thearithmetic coder 14 to theoutput terminal 8, for transmission via a transmission medium or for recording. - FIG. 4 shows a corresponding data processing apparatus for decoding the data compressed signal, received via the transmission or recording medium. The data processing apparatus of FIG. 4 shows a large resemblance with the data expansion apparatus of FIG. 2, with the difference that that apparatus of FIG. 4 further comprises a
quantizer 80 and asignal combination unit 90. The quantizer has aninput 82 coupled to theoutput 46 of theprediction filter 44, and anoutput 84 which is coupled to afirst input 86 of thesignal combination unit 90. Thesignal combination unit 90 has asecond input 88 which is coupled to theoutput 38 of thedecoder 32. Theoutput 92 of thesignal combination unit 92 is coupled to theoutput terminal 40 and to theinput 42 of the prediction filter. - The
decoder 32 receives the data compressed residual information signal via itsinput 34. Thedecoder 32 carries out an arithmetic decoding step on the data compressed residual information signal under the influence of the probability signal p, supplied to thecontrol input 36 so as to generate a replica of original residual information signal which is supplied to itsoutput 38. The replica is supplied to theinput 88 of thesignal combination unit 90. Thesignal combination unit 90 further receives a predicted version of the n-level information signal via itsinput 86 and generates a replica of the original n-level information signal at itsoutput 92 in response thereto. - The functioning of the
prediction filter 44 and the quantize, 80 can be identical to the functioning of theprediction filter 12 and thequantizer 60 in FIG. 3. When thefilters filter 44. When theunits - The entropy encoder used in the embodiment of FIG. 3 is adapted to encode the residual information signal using a probability signal in order to obtain the data compressed residual information signal. One of such entropy encoder is the arithmetic coder described above. One other type of such entropy coder is, as an example, the well known finite state coder. The entropy decoder used in the embodiment of FIG. 4 is adapted to decode the data compressed residual information signal using a probability signal in order to obtain a replica of the residual information signal. One of such entropy decoder is the arithmetic decoder described above. One other type of such entropy decoder is, as an example, the well known finite state decoder.
- FIG. 5 shows an embodiment of a transmission apparatus which is in the form of a recording apparatus. The recording apparatus comprises the data compression apparatus shown in FIG. 1 or3. The recording apparatus further comprises a
write unit 106 for writing the data compressed n-level information signal in a track on therecord carrier 108. In the present example, therecord carrier 108 is a magnetic record carrier, so that thewrite unit 106 comprises at least onemagnetic head 110 for writing the data compressed n-level information signal in therecord carrier 108. The record carrier may however be an optical record carrier, such as a CD disk or a DVD disk. - Transmission via a transmission medium, such as a radio frequency link or a record carrier, generally requires an error correction encoding and a channel encoding carried out on the data compressed information signal to be transmitted. FIG. 5 shows such signal processing steps. The recording arrangement of FIG. 5 therefore comprises an
error correction encoder 102, well known in the art, and achannel encoder 104, also well known in the art. - FIG. 6 shows the data expansion apparatus of FIG. 2 or4 incorporated in a receiver apparatus, which is in the form of a reproduction apparatus. The reproducing apparatus further comprises a
read unit 112 for reading the data compressed n-level information signal from a track on therecord carrier 108. In the present example, therecord carrier 108 is a magnetic record carrier, so that theread unit 112 comprises at least onemagnetic head 114 for reading the data compressed n-level information signal from therecord carrier 108. The record carrier may however be an optical record carrier, such as a CD disk or a DVD disk. - As has been explained above, transmission via a transmission medium, such as a radio frequency link or a record carrier, generally requires an error correction encoding and a channel encoding carried out on the data compressed n-level information signal to be transmitted, so that a corresponding channel decoding and error correction can be carried out upon reception. FIG. 6 shows the signal processing steps of channel decoding and error correction carried out on the received signal, received by the reading means112. The reproducing arrangement of FIG. 6 therefore comprise a
channel decoder 116, well known in the art, and anerror correction unit 118, also well known in the art, so as to obtain a replica of the data compressed n-level information signal. - Whilst the invention has been described with reference to preferred embodiments thereof, it is to be understood that these are not limitative examples. Thus, various modifications may become apparent to those skilled in the art, without departing from the scope of the invention, as defined by the claims.
- Further, the invention lies in each and every novel feature or combination of features.
Claims (17)
1. Data compression apparatus for data compressing an information signal, which is in n-level form, n being larger than 2, the data compression apparatus comprising
input means for receiving the n-level information signal,
lossless coding means having an input for receiving an input signal, for carrying out a lossless encoding step on the input signal, so as to obtain a data compressed output signal at an output, said lossless encoding means comprising an entropy encoder for carrying out the lossless encoding step on the input signal in response to a probability signal,
prediction means for carrying out a prediction step on the n-level information signal so as to obtain a prediction signal,
probability signal determining means for generating the probability signal in response to said prediction signal,
output means for supplying said data compressed output signal.
2. Data compression apparatus as claimed in , wherein the prediction means comprises a prediction filter for carrying out a prediction filtering operation on the n-level information signal so as to obtain a multi value prediction signal and wherein said probability signal determining means is adapted to generate the probability signal in response to said multi value prediction signal.
claim 1
3. Data compression apparatus as claimed in or , wherein the apparatus further comprises quantizing means and signal combination means, the quantizing means being adapted to quantize the multi value prediction signal so as to obtain a predicted version of the n-level information signal, the signal combination means being adapted to combine the n-level information signal and the predicted version of the n-level information signal so as to obtain a residual information signal so as to supply the residual information signal to said entropy encoder for data compression.
claim 1
2
4. Data compression apparatus as claimed in , wherein the entropy encoder is in the form of an arithmetic coder.
claim 1
5. Data compression method of data compressing an information signal, which is in n-level form, n being larger than 2, the data compression method comprising the steps of
receiving the n-level information signal,
carrying out a lossless encoding step on an input signal, so as to obtain a data compressed output signal, said lossless encoding step comprising an entropy encoding step for carrying out the lossless encoding step on the input signal in response to a probability signal,
carrying out a prediction step on the n-level information signal so as to obtain a prediction signal,
generating the probability signal in response to said prediction signal,
supplying said data compressed output signal.
6. Data expansion apparatus for data expanding a data compressed input signal so as to obtain an information signal, which is in n-level form, n being larger than 2, the data expansion apparatus comprising
input means for receiving the data compressed input signal,
lossless decoding means having an input for receiving the data compressed input signal, for carrying out a lossless decoding step on the data compressed input signal, so as to obtain a data expanded output signal at an output, said lossless decoding means comprising an entropy decoder for carrying out the lossless decoding step on the data compressed input signal in response to a probability signal,
output means for supplying said information signal,
prediction means for carrying out a prediction step on the information signal so as to obtain a prediction signal,
probability signal determining means for generating the probability signal in response to said prediction signal.
7. Data expansion apparatus as claimed in , wherein the prediction means comprises a prediction filter for carrying out a prediction filtering operation on the n-level information signal so as to obtain a multi value prediction signal and wherein said probability signal determining means is adapted to generate the probability signal in response to said multi value prediction signal.
claim 6
8. Data expansion apparatus as claimed in or , wherein the apparatus further comprises quantizing means and signal combination means, the quantizing means being adapted to quantize the multi value prediction signal so as to obtain a predicted version of the n-level information signal, the signal combination means being adapted to combine the output signal of the entropy decoder and the predicted version of the n-level information signal so as to obtain said information signal.
claim 6
7
9. Data expansion apparatus as claimed in , wherein the entropy decoder is in the form of an arithmetic decoder.
claim 6
10. Data expansion method for data expanding a data compressed input signal so as to obtain an information signal, which is in n-level form, n being larger than 2, the data expansion method comprising the steps of
receiving the data compressed input signal,
carrying out a lossless decoding step on the data compressed input signal, so as to obtain a data expanded output signal at an output, said lossless decoding step comprising an entropy decoding step on the data compressed input signal in response to a probability signal,
supplying said information signal,
carrying out a prediction step on the information signal so as to obtain a prediction signal, generating the probability signal in response to said prediction signal.
11. Transmitter for transmitting an n-level information signal via a transmission medium, comprising the data compression apparatus as claimed in anyone of the to , further comprising error correction encoding means and/or channel encoding means for error correction encoding and/or channel encoding the output signal of the entropy encoder, and transmission means for applying the error correction encoded and/or channel encoded output signal of the entropy encoder to the transmission medium.
claims 1
5
12. Transmitter as claimed in , wherein the transmitter is in the form of an apparatus for recording the n-level information signal on a record carrier and the transmission means is in the form of writing means for writing the error correction encoded and/or channel encoded output signal of the entropy encoder on the record carrier.
claim 11
13. Transmitter as claimed in , wherein the record carrier is an optical or a magnetic record carrier.
claim 12
14. Record carrier obtained with the transmitter as claimed in , provided with the error correction encoded and/or channel encoded output signal of the entropy encoder.
claim 12
15. Receiver for receiving an n-level information signal via a transmission medium, comprising the data expansion apparatus as claimed in anyone of the to , the receiver further comprising receiving means for retrieving a channel encoded and/or error correction encoded transmission signal from the transmission, channel decoding means and/or error correction means for channel decoding and/or error correcting the channel encoded and/or error correction encoded transmission signal so as to obtain said input signal for the entropy decoder.
claims 6
10
16. Receiver as claimed in , wherein the receiver is in the form of an apparatus for reading the n-level information signal from a record carrier and the receiving means is in the form of reading means for reading the error correction encoded and/or channel encoded transmission signal from the record carrier.
claim 15
17. Transmitter as claimed in , wherein the record carrier is an optical or a magnetic record carrier.
claim 16
Applications Claiming Priority (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP97201680.2 | 1997-06-04 | ||
EP97201680 | 1997-06-04 | ||
EP97201680 | 1997-06-04 | ||
EP97202137 | 1997-07-11 | ||
EP97202137 | 1997-07-11 | ||
EP97203144 | 1997-10-09 | ||
EP97203144 | 1997-10-09 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20010041984A1 true US20010041984A1 (en) | 2001-11-15 |
US6385588B2 US6385588B2 (en) | 2002-05-07 |
Family
ID=27238453
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/089,628 Expired - Fee Related US6385588B2 (en) | 1997-06-04 | 1998-06-02 | Data compression and expansion of an N-level information signal |
Country Status (4)
Country | Link |
---|---|
US (1) | US6385588B2 (en) |
EP (1) | EP0922334A2 (en) |
JP (1) | JP2001501421A (en) |
WO (1) | WO1998056116A2 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120078641A1 (en) * | 2009-06-01 | 2012-03-29 | Huawei Technologies Co., Ltd. | Compression coding and decoding method, coder, decoder, and coding device |
US20140214431A1 (en) * | 2011-07-01 | 2014-07-31 | Dolby Laboratories Licensing Corporation | Sample rate scalable lossless audio coding |
US10193565B2 (en) | 2015-03-03 | 2019-01-29 | Sony Corporation | Compressive encoding apparatus, compressive encoding method, decoding apparatus, decoding method, and program |
US10742231B2 (en) | 2016-05-24 | 2020-08-11 | Sony Corporation | Compression/encoding apparatus and method, decoding apparatus and method, and program |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ATE371298T1 (en) * | 1996-11-07 | 2007-09-15 | Koninkl Philips Electronics Nv | TRANSMISSION OF A BIT STREAM SIGNAL |
US6873437B1 (en) * | 1999-10-14 | 2005-03-29 | Matsushita Electric Industrial Co., Ltd. | Image processing method and image processing apparatus |
US6819275B2 (en) * | 2000-09-08 | 2004-11-16 | Koninklijke Philips Electronics N.V. | Audio signal compression |
WO2002023727A2 (en) * | 2000-09-11 | 2002-03-21 | Broadcom Corporation | Method and apparatus for mismatch shaping of an oversampled converter |
US6531973B2 (en) * | 2000-09-11 | 2003-03-11 | Broadcom Corporation | Sigma-delta digital-to-analog converter |
US6924756B2 (en) | 2003-05-28 | 2005-08-02 | Texas Instruments Incorporated | Method and system for processing a digital signal |
US7570746B2 (en) * | 2004-03-18 | 2009-08-04 | Sony Corporation | Method and apparatus for voice interactive messaging |
KR100829558B1 (en) * | 2005-01-12 | 2008-05-14 | 삼성전자주식회사 | Scalable audio data arithmetic decoding method and apparatus, and method for truncating audio data bitstream |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3973081A (en) * | 1975-09-12 | 1976-08-03 | Trw Inc. | Feedback residue compression for digital speech systems |
US4749983A (en) * | 1986-04-29 | 1988-06-07 | International Business Machines Corporation | Compression of multilevel signals |
IT1211612B (en) * | 1987-12-22 | 1989-11-03 | Esercizio Delle Telecomunicazi | PROCEDURE AND DECODING DEVICE WITH DETECTION OF CANCELLATIONS FOR MULTI-LEVEL TRANSMISSION SYSTEMS |
JPH07114419B2 (en) * | 1989-04-12 | 1995-12-06 | 株式会社東芝 | QAM communication system |
US5025258A (en) * | 1989-06-01 | 1991-06-18 | At&T Bell Laboratories | Adaptive probability estimator for entropy encoding/decoding |
US5274375A (en) * | 1992-04-17 | 1993-12-28 | Crystal Semiconductor Corporation | Delta-sigma modulator for an analog-to-digital converter with low thermal noise performance |
JP2798172B2 (en) * | 1993-12-27 | 1998-09-17 | 富士ゼロックス株式会社 | Image encoding / decoding device |
JPH09501788A (en) * | 1994-03-09 | 1997-02-18 | フィリップス エレクトロニクス ネムローゼ フェンノートシャップ | Transmission / reception device, transmission / reception method, record carrier obtained by this transmission / reception method or transmission device |
US5884269A (en) * | 1995-04-17 | 1999-03-16 | Merging Technologies | Lossless compression/decompression of digital audio data |
US5680129A (en) * | 1995-07-18 | 1997-10-21 | Hewlett-Packard Company | System and method for lossless image compression |
US5960116A (en) * | 1995-11-02 | 1999-09-28 | Canon Kabushiki Kaisha | Image processing apparatus and method for performing prediction data encoding |
EP0876709B1 (en) * | 1996-11-11 | 2003-08-06 | Koninklijke Philips Electronics N.V. | Data compression/expansion using a rice encoder/decoder |
KR100622590B1 (en) * | 1998-03-16 | 2006-09-11 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | Arithmetic encoding/decoding of a multi-channel information signal |
-
1998
- 1998-05-25 JP JP10542104A patent/JP2001501421A/en active Pending
- 1998-05-25 WO PCT/IB1998/000796 patent/WO1998056116A2/en not_active Application Discontinuation
- 1998-05-25 EP EP98919411A patent/EP0922334A2/en not_active Withdrawn
- 1998-06-02 US US09/089,628 patent/US6385588B2/en not_active Expired - Fee Related
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120078641A1 (en) * | 2009-06-01 | 2012-03-29 | Huawei Technologies Co., Ltd. | Compression coding and decoding method, coder, decoder, and coding device |
US8489405B2 (en) * | 2009-06-01 | 2013-07-16 | Huawei Technologies Co., Ltd. | Compression coding and decoding method, coder, decoder, and coding device |
US20140214431A1 (en) * | 2011-07-01 | 2014-07-31 | Dolby Laboratories Licensing Corporation | Sample rate scalable lossless audio coding |
US10193565B2 (en) | 2015-03-03 | 2019-01-29 | Sony Corporation | Compressive encoding apparatus, compressive encoding method, decoding apparatus, decoding method, and program |
US10742231B2 (en) | 2016-05-24 | 2020-08-11 | Sony Corporation | Compression/encoding apparatus and method, decoding apparatus and method, and program |
Also Published As
Publication number | Publication date |
---|---|
EP0922334A2 (en) | 1999-06-16 |
US6385588B2 (en) | 2002-05-07 |
WO1998056116A2 (en) | 1998-12-10 |
WO1998056116A3 (en) | 1999-03-04 |
JP2001501421A (en) | 2001-01-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0879465B1 (en) | Data processing of a bitstream signal | |
EP0865685B1 (en) | Data compression and expansion of an audio signal | |
US6229463B1 (en) | Arithmetic encoding/decoding of a multi-channel information signal | |
US6778965B1 (en) | Data compression and expansion of an audio signal | |
US6385588B2 (en) | Data compression and expansion of an N-level information signal | |
AU757097B2 (en) | Arithmetic encoding/decoding of a digital information signal | |
AU762152B2 (en) | Prediction on data in a transmission system | |
US6266368B1 (en) | Data compression/expansion on a plurality of digital information signals | |
MXPA98005510A (en) | Data processing of a bitstream signal |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: U.S. PHILIPS CORPORATION, NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VAN DER VLEUTEN, RENATUS J.;REEL/FRAME:009352/0907 Effective date: 19980626 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20100507 |