EP1119108A1 - Procede et dispositif de codage a compression sans perte, et procede et dispositif de decodage a compression sans perte - Google Patents

Procede et dispositif de codage a compression sans perte, et procede et dispositif de decodage a compression sans perte Download PDF

Info

Publication number
EP1119108A1
EP1119108A1 EP99970220A EP99970220A EP1119108A1 EP 1119108 A1 EP1119108 A1 EP 1119108A1 EP 99970220 A EP99970220 A EP 99970220A EP 99970220 A EP99970220 A EP 99970220A EP 1119108 A1 EP1119108 A1 EP 1119108A1
Authority
EP
European Patent Office
Prior art keywords
data
huffman
lossless compression
correlation
decoding
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.)
Withdrawn
Application number
EP99970220A
Other languages
German (de)
English (en)
Other versions
EP1119108A4 (fr
Inventor
Naoki Ejima
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Panasonic Corp
Original Assignee
Matsushita Electric Industrial Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Matsushita Electric Industrial Co Ltd filed Critical Matsushita Electric Industrial Co Ltd
Publication of EP1119108A1 publication Critical patent/EP1119108A1/fr
Publication of EP1119108A4 publication Critical patent/EP1119108A4/fr
Withdrawn legal-status Critical Current

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
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code

Definitions

  • the present invention relates to encoding and compression for transmitting and recording super-audio signals having a quality of reproduced sound much higher than that of compact disk.
  • the compression rate for converting audio data directly by the Huffman compression is generally 90 to 95 %, and similar data have been confirmed through a series of experiments by the inventors.
  • the rate may slightly be increased to 85 to 90 %.
  • the major parameters of the DVD audio technology include sampling frequencies of 48 kHz/96 kHz/192 kHz and 44.1 kHz/88.2 kHz/176.4 kHz, number of linear PCM quantization bits of 16/20/24, and maximum number of channels (ch) of 6. It is to be noted that the maximum bit rate is set to 9.6 Mbps. Any combination of the above parameters can be accepted as far as the bit rate is not greater than the determined level. For instance, a combination of 96 kHz, 24 bits, and 4 ch has bit rate of 9.216 Mbps, and it can be utilized.
  • multi-channel systems becomes popular particularly in the United States of America.
  • Some of home appliances employ multi-channel systems such as 5.1 channel (three channels at front center, left, and right, two channels at rear left and right, and one channel for a subwoofer), and others may follow before long.
  • a multi-channel system is also desired to employ the super-audio format. It is known that a combination of 96 kHz, 24 bits, and 6 ch is feasible with the use of high performance recording equipments available. It is then proposed to transmit and record DVD audio signals without degradation. Hence, the DVD audio technique is now demanded for the application of 96 kHz, 24 bits, and 6 ch.
  • the recording time of 74 minutes on a single recording side is also desired, similarly to CD.
  • the invention is developed to achieve the above requirements, and its object is to provide a method and an apparatus for carrying outlossless compression encoding and decoding of data (a) in a perfectly reversible mode, (b) at a peak transmission rate of not higher than 9.6 Mbps, (c) at average transmission rate of not higher than 8.47 Mbps for playback time of 74 minutes, and (d) at compression rate of 60 % or less when playback time of 74 minutes is attained in the format of 96 kHz, 24 bits, and 6 ch.
  • a given number of input data samples in a predetermined length of time is grouped to blocks, correlation between the samples in each block is deleted, redundant run lengths are determined in the data after subjected to the correlation deletion, and minimum of the redundant run length or run length of a common redundant portion in the samples is detected. Then, the common redundant portion is deleted from each sample, the data which have been subjected to the deleting the common redundant portion are subjected to the Huffman conversion, and the run length data of the common redundant portion and the Huffman-converted data for each sample are provided.
  • code data are received which comprises run length data of a common redundant portion and data subjected to Huffman conversion in each sample, the data having been obtained by the steps of grouping a given number of input data samples in a predetermined length of time to blocks, deleting correlation between the samples in each block, determining redundant run length or run length of a common redundant portion in the samples after the correlation deletion, and deleting the redundant run length from each sample.
  • a conversion algorithm is get from the input data, and it is used for the Huffman decoding, and the run length data of the common redundant portion is gotten and added to the decoded data after the Huffman decoding.
  • correlation decoding is performed on the data to which the redundant portion is added.
  • the redundant portion is deleted by using correlation in the input signals, and the signals are further compressed efficiently with use of bias in the data profile.
  • the data is reduced to a size substantially equal to the entropy of the input signals.
  • the compressed data are decoded in the reverse sequence.
  • the input signals of audio signals of a wide-band multi-channel format can be reproduced completely without degradation.
  • the method and apparatus for lossless compression encoding or decoding can be provided where complete lossless compression is realized and the amount of data to be transmitted can be reduced to 60 % or less.
  • the predictor or the predictive filter comprises a circuit for integer calculation having accuracy equal to a range of integers of the input data.
  • the data after deleting the common redundant portion are separated to an upper part having a predetermined number of bits and a lower part of the other bits, and only the upper part is subjected to the Huffman conversion.
  • the input data are separated to an upper part in correspondence to a given pattern of the Huffman conversion and a lower part having a predetermined number of bits determined by the data transmitted as a parameter for each block, and only the upper part is subjected to the Huffman decoding.
  • the apparatus of lossless compression encoding comprises a plurality of sets of the above-mentioned correlation deleter, common redundant bits deleter and Huffman conversion device. Further a maximum efficiency data output device is provided to select and output data which provide maximum efficiency from the output data of the plurality of the Huffman conversion devices. Itt outputs a combination of the data which provides the maximum efficiency and transmits a parameter indicative of the combination.
  • the most advantageous is selected among a plurality of correlation deletion characteristics.
  • a plurality of correlation deleters are provided to delete correlation. Output data of each of the correlation deleters are subjected to the deletion of the common redundant portion, and each data after the deletion of the common redundant portion is subjected to the Huffman conversion. Then, a combination having the maximum efficiency is selected among the data subjected to the Huffman conversion, and a parameter indicative of the combination is transmitted.
  • the Huffman conversion is performed by selecting and using one of conversion algorithms which provides the maximum efficiency for the block, and a parameter indicative of the algorithm is transmitted.
  • a sum of a predictive data generated by the local predictor or the local predictive filter and the transmitted input data is taken out.
  • the local predictor or the local predictive filter comprises, for example, a circuit for integer calculation operated at accuracy equal to that of a range of integers of playback data.
  • a signal is selected having a property determined by the data transmitted for each block.
  • the apparatus for lossless compression decoding further comprises an associate data detector which detects an associate data associated with the received coded data.
  • the Huffman decoder includes a plurality of Huffman tables, and the associate data detector selects one of the Huffman tables corresponding to the associate data.
  • sample data positioned at a particular position in the top of each block are linear pulse code modulation data.
  • the speed to return from error propagation can be increased, and reproduced sound of special mode of cue/review can be heard with ease.
  • a recording apparatus may comprise the above-mentioned lossless compression encoding apparatus and a DVD formatter which converts the signals received from the lossless compression encoding apparatus to DVD format signals, and the like.
  • a playback apparatus may comprise the above-mentioned lossless compression decoder, a DVD de-formatter which converts the signals to code data, and the like.
  • An advantage of the method and apparatus for lossless compression encoding and decoding according to the present invention is that a large volume of data can be compressed without degradation thus for recording and play-backing more information throughout a longer time.
  • a lossless compression encoding apparatus detects and normalizes correlation of input signals with its correlation deleter, deletes redundant portions in the signals with a common redundant bits (CRB) deleter, and compresses the remaining signals through conversion with use of bias of the data distribution of its Huffman compressor.
  • a lossless compression decoding apparatus decodes the compressed data in reverse sequence by a Huffman decoder, a CRB decoder (a common redundant bits adder), and a correlation decoder. As a result, the audio signals of wide-band multi-channel mode can be transmitted, received and outputted without degradation. This allows the input signals to be compressed to a size substantially equal to the entropy of the signals.
  • Fig. 1 is a block diagram of the apparatuses for lossless compression encoding and decoding of data according to the invention.
  • the lossless compression encoding apparatus comprises a lossless compression encoder 100 for lossless compression encoding and a DVD formatter 200 which converts compressed signals to DVD format signals to record the output Z thereof in a medium.
  • the lossless compression encoder 100 comprises a correlation deleter 110, a common redundant bits (CRB) deleter 120, a Huffman compressor 130, and a maximum efficiency data outputting device 140.
  • the lossless compression encoder 100 outputs main data as output Y and its associate data as output Ysub.
  • the DVD formatter 200 transmits the output signal Z in the DVD format for recording.
  • the lossless compression decoding apparatus comprises a DVD deformatter 400 for decoding and a lossless compression deciding means 500 for getting the DVD format signals from the playback signals.
  • the DVD deformatter 400 extracts the main data Y and the associate data Ysub.
  • the lossless compression decoder 500 comprises a Huffman decoder 530, a common redundant bits (CRB) adder (or a CRB decoder) 520, a correlation decoder 510, and an associate data detector 540.
  • the associate data detector 540 distributes the parameter Ysub associated with the main data Y to the other components. Common redundancy bit is referrred to as CRB hereinafter.
  • the correlation deleter 110 receives input signals X.
  • the input signals X carries data in 96 kHz/24 bits/6 ch format.
  • a blocking device 1100 is provided at an input stage for grouping a given number of input signals X in a predetermined length of time into blocks, each block having 2880 samples (refer to Fig. 2). The following steps are carried out for each block.
  • the correlation deleter 110 normalizes intrinsic properties of the input signals X , bias in the frequency spectrum which occurs when two adjacent samples are high correlated and/or other properties. It is assumed that the above-mentioned correlation between samples includes correlation between channels.
  • the properties to be examined may include a frequency spectrum characteristic and similarity of waveforms between channels.
  • the normalization of the properties is implemented by using a frequency band filter and an inter-channel cross filter. For simplicity, preferably the filter has a range of integers identical to that of the input signals.
  • Fig. 2 illustrates the correlation deleter 110 in detail.
  • the correlation deleter 110 outputs first to fifth order differential values as predictive differences. More specifically, five circuits is provided to delete correlation. Each circuit comprises a pair of a delay device 1121 to 1125 and a subtracter 1111 to 1115, and the five circuits are connected one another as a predictor to have five stages, where the output of the blocking device 1100 is calculated to provide the first to fifth order differential values DL1 to DL5 (predictive errors).
  • a delay device may be implemented as predictive filter.
  • the output DL0 of the blocking device 1100 is a zeroth order signal.
  • the compression efficiency is calculated for all the combinations. While the encoding and decoding is carried out at the accuracy of integer level, the reversibility of data can be conserved by taking care of overflow. Accordingly, the lossless compression can be ensured completely. At the calculation at the accuracy of real number level, a requantizer may be added for providing the similar advantage. Thus, the correlation in the signals can successfully be deleted, while conserving the reversibility. As a result, the signal output of the correlation deleter 110 has a spectrum profile where the amplitude of waveform is decreased similarly to that of white noises.
  • Fig. 3 is a block diagram of the common redundant bits (CRB) deleter 120.
  • the common redundant bits deleter 120 detects redundancy of upper bits in each block or namely run lengths in sample data where 0s or 1s of upper bits exist continuously. Assuming that actual music signals in the 96 kHz/24 bits/6 ch format has average run length of 10 bits, the run length LA0 common to the samples is detected by the common redundant run length detector 1220. Meanwhile, the main data is delayed by a delay device 1230 to adjust timing for the processing of data in the block.
  • a common redundant bits deleter 1240 deletes common redundant bits from the main data.
  • the original word length of 24 bits is reduced to 60 % on the average.
  • the compressed signals are then sent as CRB0, while the common redundant run length LA0 is sent as a parameter.
  • the signals DL1 to DL5 are also processed independently in the same way.
  • the compressed signals are sent to the Huffman compressor 130.
  • the above-mentioned processing for run length may be implemented, similarly to a known run-length encoding technique.
  • Fig. 4 is a block diagram of the Huffman compressor 130.
  • the input signals are separated by a separator 1300 into, for example, an upper half B0 of seven bits and a lower half C0 of the remaining bits. This is carried out to make the Huffman conversion faster and to simplify the algorithm therefor.
  • the upper half B0 of seven bits is subjected to variable length encoding by using eight different types of the Huffman conversion tables.
  • a group of Huffman compressors 13100 to 13107 assign code words of short patterns to higher frequency data and code words of longer patterns to lower frequency data and sends them as H00.
  • the remaining half of lower bits in the data is not processed and combined with each of H00 to H07 by a combining device 1320, which in turn sends a group of outputs HC00 to HC07.
  • the other compressed data CRB1 to CRB5 are processed in the same way. Accordingly, 48 (8 x 6) types of compressed data are attained, from the first group of HC00 to HC07 to the sixth group of HC50 to HC57. These are sent to the maximum efficiency data output device 140.
  • an upper portion of bits in the block after the correlation deleting is subjected to the conversion of the Huffman compressor, while the lower portion of the other bits is directly provided. This allows the Huffman conversion process to be processed in a predetermined or simplified way, thus decreasing the number of branching processings, to contribute to the speeding up of the operation.
  • the maximum efficiency data output device 140 selects a combination of the samples at the maximum efficiency, or a combination of minimum sum in the block and sends it as output Y. Simultaneously, the parameter of the combination is sent as associate data Ysub.
  • the associate data may include the lower bit portion C, correlation filter parameter DID, the common redundant run length LA, and Huffman table identification parameter HID.
  • the DVD formatter 200 then converts the main and associate data to a DVD format signal to be outputted as recording signal Z.
  • the recording signal Z is transmitted and recorded in a DVD medium.
  • the compression efficiency will be increased. Further, as any optimum parameter is assigned for the correlation characteristic, the compression will be carried out in a wider level.
  • the DVD de-formatter 400 receives the recording signal Z reproduced from a DVD medium and gets the main data Y and its associate data Ysub from the signal Z before sending them to the lossless compression decoder 500.
  • Fig. 5 is a block diagram of the Huffman decoder 530, the common redundant bits adder 521 (equivalent to the CRB decoder 520) and the associate data detector 540 in the lossless compression encoder 500.
  • the main data Y and its associate data Ysub are sent from the DVD de-formatter 400 to the Huffman decoder 530 and the associate data detector 540 respectively.
  • the associate data detector 540 gets the lower bits C, the common redundant run length LA, the Huffman table identification parameter HID and the like for decoding.
  • the Huffman decoder 530 upon receiving the Huffman table identification parameter HID from the associate data detector 540 selects one Huffman table 532 out of eight tables of different types by means of Huffman table selecter.
  • the selected Huffman table 532 is used for the decoding of a Huffman decoder 531. Because the input data has been subjected to variable length encoding, the data is decoded sequentially from the first bit, and a resultant decoded data is then combined directly with its corresponding remaining bit data C0.
  • the word length of C0 is identical to a number of bits calculated by subtracting bits of the common redundant run length LA and seven bits from the original length of 24 bits.
  • the Huffman decoding and the addition of the remaining bit data C0 are carried out alternately. The addition is conducted by a combining device 533 which then sends the combined data CRB of the upper half of seven bits and the lower half C0 of the other bits.
  • the Huffman decoder 530 decodes the upper part of data which corresponds to a desired conversion pattern while the lower part containing a number of bits determined by the data transmitted in the form of a parameter in each block. As the highest in the efficiency of the Huffman compression properties is detected and selected, the compression efficiency will be increased. Further, such flexibility that the best of the Huffman tables can be selected in a wide range of amplitude from silence to the climax will be provided.
  • the CRB decoder 520 includes a common redundant bits adder 521 which generates and adds redundant bits to the CRB data by using the common redundant run length LA.
  • a resultant sum data is sent as DL by the CRB decoder 520.
  • the data DL is then transmitted to the correlation decoder 510.
  • Fig. 6 is a block diagram of the correlation decoder 510 where the correlation decoding is carried out by using the correlation filter parameter DID received from the associate data detector 540.
  • the correlation decoding is reverse of the operation of the correlation deleter 110.
  • the correlation decoder 510 provides a sum of the predictive data produced by a local predictor or a local predictive filter and the received data. While the correlation deleter 110 generates a difference, the correlation decoder 510 handles a sum.
  • the order number is determined from the correlation filter parameter DID, and a selector 513 of correlation filter order number selects and outputs it.
  • the output X of the selector 513 is a playback signal in 96 kHz/24 bits format.
  • the local predictor or the local predictive filter may perform integer calculation at accuracy equal to that of the playback signals. Those processings are explained above on channel 1, but the similar procedure is repeated for the other channels. As a result, signals in the 96 kHz/24 bits/6 ch format can be reproduced.
  • each block extends in a time length of about 15 ms.
  • the top five samples in the block are not converted but transmitted as linear PCM signals. In that case, five samples are not subjected to the common redundant bits deletion and the Huffman conversion, so that the advantage of the common redundant bits deletion cannot be canceled by the five samples. Because the samples at the top of the block remain as linear PCM signals, each block data are initialized, the accumulation of errors is reset, and the returning speed from error propagation can be made faster. Accordingly, the error propagation will be avoided, and the sound can correctly be reproduced in specific playback operations such as cue/review, and the playback sound can be heard with ease.
  • each operation is performed at the accuracy of integer level. Further, in case of overflow or underflow, the combination with the parameter is not used. Because the decoding is reverse of the encoding, the entropy in the input signals can precisely be conserved, and more particularly, the lossless compression encoding and decoding can successfully be made without degradation.
  • the data of 96 kHz/24 bits/6 ch at source rate of 13.824 Mbps can be compressed at a ratio of 0.54. Then, the bit rate of compressed data is 7.465 Mbps.
  • the bit rate of 7.465 Mbps is far lower than 9.6 Mbps of the maximum rate of the DVD format and is yet smaller than 8.47 Mbps required for allowing a playback time of 74 minutes.
  • As the target of the compression rate is set not greater than 60 %, it can be achieved by comfortable margin of 10 %.
  • the method can be utilized not only in the above-mentioned apparatus but also by implementing a software program with a digital signal processor (DSP) for processing the data.
  • the software program may be transmitted over a communication network.
  • Fig. 7 is a flowchart of a procedure of a software program for lossless compression encoding.
  • the procedure starts with grouping the data of input signals to 2880 blocks per channel (S10).
  • data in the n-th block zeroth order output L0(n) is calculated in n-th block (S14).
  • a first order differential value D1(n) and a second order differential value D2(n) are calculated and outputted (S16 and S18).
  • D1(n) D0(n)-D0(n)
  • D2(n) D1(n) - D1(n).
  • n is incremented (S20).
  • the zero to second order differential values D0(n), D1(n), and D2(n) are subjected to the common run length shift-up (S24, S28, and S32) and the Huffman encoding (at S26, S30, and S34).
  • An optimum combination of the data is selected for ensuring the maximum compression efficiency, and the selected signal Y(n) is outputted (S36). This procedure is similar to the lossless compression encoding in the compression encoding apparatus shown in Fig. 1.
  • an output sample and a format ID in the DVD format are generated from the signal Y(n) (at S38).
  • the value of n is 1 at the start , and the steps are repeated until n becomes 2880.
  • the flow returns back to step S12 (S22) for processing the data in a next block.
  • a software program for the lossless compression decoding is similar, and its explanation is not repeated here.
  • Fig. 8 is a block diagram of a record/playback apparatus equipped with the above-mentioned lossless compression encoding and decoding apparatuses.
  • the record/playback apparatus has a known structure, except the lossless compression encoder and decoder 100 and 500.
  • An optical disk 10 is driven for rotation by a spindle motor 12.
  • an optical head 14 directs a laser beam to the optical disk or medium 10 for recording data and for reproducing the data as playback signals based on reflection of the laser beam from the optical disk 10.
  • the playback signals are converted to digital data by an RF signal circuit 16 and sent to an error correction circuit (ECC) in the DVD de-formatter 400.
  • ECC error correction circuit
  • signals are then decoded by the above-mentioned operation of the lossless compression decoder 500.
  • signals are encoded by the lossless compression encoder/decoder 100 and sent via an ECC circuit in the DVD formatter 200 to the RF signal circuit 16 where they are converted to analog signals.
  • the method and apparatus for lossless compression encoding according to the invention detects correlation in the input signals with the correlation deleter for normalization, deletes a signal redundancy with the CRB deleter and compresses the remaining data of the signals with the Huffman compression processing means by using bias in the data profile.
  • the method and apparatus for lossless compression decoding according to the invention decodes the compressed data in reverse sequence with the Huffman decoder, the CRB decoder, and the correlation decoder so that the input signals of a wide-band multi-channel format of audio data can be received and played without degradation. As the data of the input signal is compressed to a size substantially equal to the entropy of the input signal, the number of modes employed for the DVD audio format can be increased.
  • the playback time of DVD audio data will significantly be extended. Since a large amount of data of the super-audio technology are compressed to a desired size without degradation, the data of a 96 kHz/24 bits/6 ch source format can be stored in a DVD audio medium, allowing a higher quality and a longer playback period.
EP99970220A 1998-10-06 1999-10-06 Procede et dispositif de codage a compression sans perte, et procede et dispositif de decodage a compression sans perte Withdrawn EP1119108A4 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP28368798 1998-10-06
JP28368798 1998-10-06
PCT/JP1999/005507 WO2000021199A1 (fr) 1998-10-06 1999-10-06 Procede et dispositif de codage a compression sans perte, et procede et dispositif de decodage a compression sans perte

Publications (2)

Publication Number Publication Date
EP1119108A1 true EP1119108A1 (fr) 2001-07-25
EP1119108A4 EP1119108A4 (fr) 2002-03-06

Family

ID=17668782

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99970220A Withdrawn EP1119108A4 (fr) 1998-10-06 1999-10-06 Procede et dispositif de codage a compression sans perte, et procede et dispositif de decodage a compression sans perte

Country Status (5)

Country Link
US (1) US6420980B1 (fr)
EP (1) EP1119108A4 (fr)
JP (1) JP3723740B2 (fr)
CN (1) CN1197254C (fr)
WO (1) WO2000021199A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1352878A2 (fr) 2002-02-27 2003-10-15 Degussa AG Dispersion comprenant une poudre d'un oxide mixte de silicium et de titanium, pâtes et formes en verres obtenus à partir de cette poudre
US7375597B2 (en) 2005-08-01 2008-05-20 Marvell World Trade Ltd. Low-noise fine-frequency tuning

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7082478B2 (en) * 2001-05-02 2006-07-25 Microsoft Corporation Logical semantic compression
US6762700B2 (en) * 2001-05-07 2004-07-13 Jiannhwa Sun NEO method and system for lossless compression and decompression
US7433824B2 (en) * 2002-09-04 2008-10-07 Microsoft Corporation Entropy coding by adapting coding between level and run-length/level modes
ES2297083T3 (es) * 2002-09-04 2008-05-01 Microsoft Corporation Codificacion entropica por adaptacion de la codificacion entre modos por longitud de ejecucion y por nivel.
US7479905B2 (en) * 2003-07-28 2009-01-20 International Business Machines Corporation Apparatus, system and method for data compression using irredundant patterns
US7724827B2 (en) * 2003-09-07 2010-05-25 Microsoft Corporation Multi-layer run level encoding and decoding
JP4037875B2 (ja) * 2005-02-24 2008-01-23 株式会社東芝 コンピュータグラフィックスデータ符号化装置、復号化装置、符号化方法、および、復号化方法
US8108219B2 (en) * 2005-07-11 2012-01-31 Lg Electronics Inc. Apparatus and method of encoding and decoding audio signal
US7693709B2 (en) * 2005-07-15 2010-04-06 Microsoft Corporation Reordering coefficients for waveform coding or decoding
US7684981B2 (en) * 2005-07-15 2010-03-23 Microsoft Corporation Prediction of spectral coefficients in waveform coding and decoding
US7599840B2 (en) * 2005-07-15 2009-10-06 Microsoft Corporation Selectively using multiple entropy models in adaptive coding and decoding
US7565018B2 (en) * 2005-08-12 2009-07-21 Microsoft Corporation Adaptive coding and decoding of wide-range coefficients
US8599925B2 (en) * 2005-08-12 2013-12-03 Microsoft Corporation Efficient coding and decoding of transform blocks
US7933337B2 (en) * 2005-08-12 2011-04-26 Microsoft Corporation Prediction of transform coefficients for image compression
US7720094B2 (en) * 2006-02-21 2010-05-18 Verso Backhaul Solutions, Inc. Methods and apparatus for low latency signal aggregation and bandwidth reduction
US8552891B2 (en) * 2006-05-27 2013-10-08 Samsung Electronics Co., Ltd. Method and apparatus for parallel data interfacing using combined coding and recording medium therefor
US8184710B2 (en) * 2007-02-21 2012-05-22 Microsoft Corporation Adaptive truncation of transform coefficient data in a transform-based digital media codec
US7774205B2 (en) * 2007-06-15 2010-08-10 Microsoft Corporation Coding of sparse digital media spectral data
US8179974B2 (en) 2008-05-02 2012-05-15 Microsoft Corporation Multi-level representation of reordered transform coefficients
US8406307B2 (en) 2008-08-22 2013-03-26 Microsoft Corporation Entropy coding/decoding of hierarchically organized data
US8174761B2 (en) * 2009-06-10 2012-05-08 Universitat Heidelberg Total internal reflection interferometer with laterally structured illumination
CN102263560B (zh) * 2010-05-28 2013-11-20 富士通株式会社 差分编码方法和系统
JP5794421B2 (ja) * 2011-09-20 2015-10-14 横河電機株式会社 測定データの圧縮方法および測定データの圧縮装置
CN107809252B (zh) * 2017-10-28 2021-11-05 深圳市睿臻信息技术服务有限公司 一种新型24位adpcm音频压缩/解压缩方法
CN110868221B (zh) * 2019-10-31 2021-06-25 重庆大学 一种多模态数据自动压缩方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61267456A (ja) * 1985-05-22 1986-11-27 Hitachi Ltd フアクシミリ信号冗長度抑圧方式
EP0427884A1 (fr) * 1989-11-14 1991-05-22 Siemens Nixdorf Informationssysteme Aktiengesellschaft Méthode et dispositif pour la compression et décompression de données
WO1997029549A1 (fr) * 1996-02-08 1997-08-14 Matsushita Electric Industrial Co., Ltd. Codeur, decodeur, codeur-decodeur et support d'enregistrement de signal audio large bande
WO1999046885A1 (fr) * 1998-03-13 1999-09-16 Matsushita Electric Industrial Co., Ltd. Procede de brouillage partiel/de desembrouillage et dispositif de brouillage partiel/de desembrouillage

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4797902A (en) * 1984-12-29 1989-01-10 Sony Corporation Digital signal transmission device
JPH02131038A (ja) * 1988-11-10 1990-05-18 Pioneer Electron Corp 信号伝送装置
JPH04150522A (ja) * 1990-10-15 1992-05-25 Sony Corp ディジタル信号処理装置
JPH05308328A (ja) * 1992-04-30 1993-11-19 Olympus Optical Co Ltd データ圧縮・復調方式
ATE246858T1 (de) * 1996-11-11 2003-08-15 Koninkl Philips Electronics Nv Datenkompression und -dekompression durch rice- kodierer/-dekodierer
US6023233A (en) * 1998-03-20 2000-02-08 Craven; Peter G. Data rate control for variable rate compression systems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61267456A (ja) * 1985-05-22 1986-11-27 Hitachi Ltd フアクシミリ信号冗長度抑圧方式
EP0427884A1 (fr) * 1989-11-14 1991-05-22 Siemens Nixdorf Informationssysteme Aktiengesellschaft Méthode et dispositif pour la compression et décompression de données
WO1997029549A1 (fr) * 1996-02-08 1997-08-14 Matsushita Electric Industrial Co., Ltd. Codeur, decodeur, codeur-decodeur et support d'enregistrement de signal audio large bande
WO1999046885A1 (fr) * 1998-03-13 1999-09-16 Matsushita Electric Industrial Co., Ltd. Procede de brouillage partiel/de desembrouillage et dispositif de brouillage partiel/de desembrouillage

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
"COMPETITIVE PARALLEL PROCESSING FOR COMPRESSION OF DATA" NTIS TECH NOTES, US DEPARTMENT OF COMMERCE. SPRINGFIELD, VA, US, 1 May 1990 (1990-05-01), page 379 XP000137349 ISSN: 0889-8464 *
CRAVEN P ET AL: "LOSSLESS CODING FOR AUDIO DISCS" JOURNAL OF THE AUDIO ENGINEERING SOCIETY, AUDIO ENGINEERING SOCIETY. NEW YORK, US, vol. 44, no. 9, 1 September 1996 (1996-09-01), pages 706-720, XP000699724 ISSN: 0004-7554 *
D. A. Lelewer et al.: "Data Compression", ACM Computing Surveys, September 1987, vol. 19, No. 3, p. 261-296 XP002186220 *
PARTIAL ENGLISH TRANSLATION OF "RADIO TECHNOLOGY" BY IA PUBLISHING, VOL. 52, NO. 6, JUNE 1998, PAGE 75 *
PATENT ABSTRACTS OF JAPAN vol. 011, no. 119 (E-499), 14 April 1987 (1987-04-14) & JP 61 267456 A (HITACHI LTD), 27 November 1986 (1986-11-27) & Derwent English Title of JP-A-61 267 456 *
RADIO TECHNOLOGY, vol. 52, no. 6, June 1998 (1998-06), pages 73-77, *
See also references of WO0021199A1 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1352878A2 (fr) 2002-02-27 2003-10-15 Degussa AG Dispersion comprenant une poudre d'un oxide mixte de silicium et de titanium, pâtes et formes en verres obtenus à partir de cette poudre
US7375597B2 (en) 2005-08-01 2008-05-20 Marvell World Trade Ltd. Low-noise fine-frequency tuning

Also Published As

Publication number Publication date
CN1322406A (zh) 2001-11-14
EP1119108A4 (fr) 2002-03-06
JP3723740B2 (ja) 2005-12-07
CN1197254C (zh) 2005-04-13
WO2000021199A1 (fr) 2000-04-13
US6420980B1 (en) 2002-07-16

Similar Documents

Publication Publication Date Title
US6420980B1 (en) Lossless compression encoding method and device, and lossless compression decoding method and device
US6041302A (en) Data compression/expansion using a rice encoder/decoder
EP0702368B1 (fr) Procédé pour l'enregistrement et de la reproduction des signaux vocaux numériques et appareil pour sa mise en oeuvre
US6675148B2 (en) Lossless audio coder
JP3336617B2 (ja) 信号符号化又は復号化装置，及び信号符号化又は復号化方法，並びに記録媒体
KR100352352B1 (ko) 정보부호화방법,정보복호화방법및장치,정보전송방법,및정보기록매체에정보를기록하는방법
US6353807B1 (en) Information coding method and apparatus, code transform method and apparatus, code transform control method and apparatus, information recording method and apparatus, and program providing medium
EP0820664B1 (fr) Transmission a n voies, compatible avec une transmission a deux voies et une transmission a une voie
EP0899886B1 (fr) Appareil de codage /décodage audio de haute qualité
JP2843443B2 (ja) オーディオデータのカスケード式符号化復号化方法
JPH03121633A (ja) 可聴音信号符号化方法
RU2219655C2 (ru) Устройство и способ для передачи цифрового информационного сигнала, носитель записи и устройство для приема сигнала
US6038369A (en) Signal recording method and apparatus, recording medium and signal processing method
JP2005149608A (ja) 音声データ記録／再生システムとその音声データ記録媒体
JP2002050967A (ja) 信号記録媒体
US6266368B1 (en) Data compression/expansion on a plurality of digital information signals
JPH1083197A (ja) ディジタル信号処理方法
JP3387084B2 (ja) 記録媒体、音声復号装置
JP3513879B2 (ja) 情報符号化方法及び情報復号化方法
JP3387097B2 (ja) 音声符号化方法及び音声復号方法
JPH1083198A (ja) ディジタル信号処理方法及び装置
JP3387093B2 (ja) 音声符号化方法
JP3354472B2 (ja) 情報符号化方法
JP2004233901A (ja) オーディオ信号処理装置及びオーディオ信号処理方法
JPH06295490A (ja) 情報検出再生装置及び情報記録装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20010507

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

A4 Supplementary search report drawn up and despatched

Effective date: 20020116

AK Designated contracting states

Kind code of ref document: A4

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 20050610

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: PANASONIC CORPORATION

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20130103