CN101325417A - Encoding method supporting dynamic regulation of byte length - Google Patents
Encoding method supporting dynamic regulation of byte length Download PDFInfo
- Publication number
- CN101325417A CN101325417A CNA2007101101673A CN200710110167A CN101325417A CN 101325417 A CN101325417 A CN 101325417A CN A2007101101673 A CNA2007101101673 A CN A2007101101673A CN 200710110167 A CN200710110167 A CN 200710110167A CN 101325417 A CN101325417 A CN 101325417A
- Authority
- CN
- China
- Prior art keywords
- byte length
- sample
- pane
- proportionality constant
- length value
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a coding method of dynamically adjusting the length of the byte, comprising: setting the allowable error of the coder and the acceptable byte length range; partitioning the original data into a plurality of sample frame, wherein according to the allowable error, each sample frame sets numerical binary value of the minimum byte length of each sample frame according to a proportional constant of each sample frame; completing the coding of all the sample frame data. The coding method of dynamically adjusting the length of the byte comprises: when the byte length and the proportional constant are stored in the coding alorithm, the coding is based on the byte length and the proportional constant of the coded data; if the byte length and the proportional constant are stored in the coded data in the way of question blank, the same question blank with the coded sequence is used in the decoding process, the byte length and the proportional constant of the coded data are inquired in the way of table look-up to decode.
Description
Technical field
The present invention relates to a kind of coding and interpretation method of supporting dynamically to adjust byte length, be provided in the calculating process of compression and decompression, dynamically adjusted the byte length of packed data.
Background technology
The storage of video-audio signal and transmission, or in general communication system, be the internal memory of saving storage or the bandwidth (band width) of communication channel, how can make lossy compression method (lossycompression) or lossless compress (lossless compression) the signal that stores or communicate by letter.Generally in order to reduce compressor reducer (compressor) and the software of decompressor (de-compressor) or the requirement of hardware circuit, normal scalar quantization (scalar quantization) the time domain waveform coding that is implemented on the time domain (time domain) and the lossy compression method of decoding algorithm used.
Traditional scale quantizes time domain waveform coding and interpretation method, can comprise following algorithm: 1. logarithmic pulse code modulated (Logarithmic Pulse Code Modulation, Log PCM); The adaptability pulse code modulated (Adaptive Pulse Code Modulation, APCM); The difference pulse code modulated (Differential Pulse Code Modulation, DPCM); The adaptability difference pulse code modulated (Adaptive Differential Pulse Code Modulation, ADPCM); Delta modulation (DeltaModulation, DM); The adaptability delta modulation (Adaptive Delta Modulation, ADM).
Above-mentioned coding and decoded mode have a common characteristic, when exactly the initial data of single group being compressed, all with fixed byte length (word length), just with fixed number of bits, represent each sample of signal (sample), the absolute value that the connotation of this so-called " sample " comprises sample (for example, logarithmic pulse code modulated and adaptability pulse code modulation system), difference (for example, difference pulse code modulated with previous sample perhaps refers to sample, the adaptability difference pulse code modulated, systems such as delta modulation or adaptability delta modulation).Represent the parameter (bits persample) of a sample with bit number, promptly be called byte length (word length).And in the general known algorithm, all use the algorithm that does not change byte length.
Yet the algorithm of fixed byte length has a shortcoming, and promptly in the less part of the amplitude of signal, the absolute error of compression will be less; Opposite, in the big more part of the amplitude of signal, then absolute error will be bigger.In order to take the compression quality of signal amplitude when big into account, byte length can not be adjusted too shortly, otherwise the rapid variation of compression quality is to accepting.Yet long byte length but can be when the less signal of compression, produces in a large number not the redundant bit (redundancy bit) with any expression and significance (non-significant), thereby has increased the bandwidth requirement of stored memory or communication channel.
For example, when expressing numerical value 7d (decimal system) with the compression method of the byte length of fixing 5 bits (5bit), binary form is shown 00111b (5 positions), wherein, high-order two 0 is redundant (redundancy), because no matter be 0111b (4 positions) or 111b (3 positions), all can express identical numerical value 7d information equally, and without any error.Yet, represent numerical value 7d with the byte length of 5 positions or 4 positions, because redundant bit has increased the bandwidth requirement that stores internal memory or communication channel.
Summary of the invention
The present invention aims to provide a kind of coding and interpretation method of supporting dynamically to adjust byte length.The invention provides in the calculating process of compression and decompression, dynamically adjust the byte length of packed data,, or reach in tolerable error (acceptable tolerance) scope in compression quality variation not, save the redundant bit of compression back data, to obtain higher compression ratio.
According to the present invention, this coding method is to be applied in the general encryption algorithm, in compression quality variation or reach in the tolerable error range not, calculates minimum byte length value.Coding method of the present invention comprises the following step: A. sets the tolerable error amount (acceptable tolerance) of encoder, with acceptable byte length scope; B. initial data is divided into a plurality of sample pane, each sample pane is according to the tolerable error amount, and according to a proportionality constant of each sample pane, sets the number of the having binary numeral of the minimum byte length value of each sample pane; C. finish the coding of all sample pane data.
Wherein, acceptable byte length and proportionality constant can be stored in the coded data, also the byte length scope can be formulated a question blank according to proportionality constant and be stored in the coded data.
And support dynamically to adjust the interpretation method of byte length, and be when acceptable byte length and proportionality constant are stored in the encryption algorithm, then decode procedure can be deciphered according to the byte length and the proportionality constant of coded data.If byte length and proportionality constant are stored in the coded data in the question blank mode, then decode procedure uses the question blank identical with coded program, by the byte length and the proportionality constant of lookup table mode inquiry coded data, deciphers.
In addition, this proportionality constant of each this sample pane among the step B of coding method of the present invention is to calculate with the proportional meter of the highest acceptable byte length value by the maximum dynamic range sample of each this sample pane.
In addition, in the steps A of coding method of the present invention, the highest accepted word joint length value and a minimum accepted word joint length value in this this encryption algorithm of byte length scope definition.
In addition, this byte length value of this proportionality constant of each this sample pane of the step B of coding method of the present invention and each this sample pane can be stored in the coded data.
In addition, coding method of the present invention can also be in this step C, adds an end code at the least significant end of coded data, to finish the coding of all each these sample pane data.
In addition, coding method step B of the present invention can also comprise the following steps:
A. an initial data is divided into a plurality of sample pane, and each this sample pane is set an index number in regular turn;
B. the byte length value of a sample pane of initial index numbering appointment is set at the highest accepted word joint length value;
C. find out the sample of a maximum dynamic range of this sample pane, and calculate this proportionality constant of this sample pane conversion with the byte length value of this sample value and this sample pane;
D. change this proportionality constant according to this sample pane, the original sample in this sample pane is converted into the number of the having binary numeral of the specified less bit number of the byte length value of this sample pane;
E. calculate the square-error summation of the byte length value of this sample pane, after the number of the having binary numeral by the less bit number in this sample pane multiply by this proportionality constant, the difference of the initial data that adds up again corresponding sample square;
The byte length value of this sample pane of f. successively decreasing, and judge whether to equal a minimum accepted word joint length value, if not, then get back to this step c;
G. when equaling this minimum accepted word joint length value among this step f, find out a minimum byte length value, it is by the square-error summation when the byte length value correspondence of this sample pane, the square-error summation that is calculated less than this highest acceptable byte length value and this tolerable error amount with the time determine.；
H. insert this proportionality constant and this minimum byte length value of the correspondence of this sample pane at the section start of this sample pane; And
I. increase progressively this index number, and judge whether to be the largest index index value, if not, then get back to this step b.
In addition, in this steps A of coding method of the present invention, can be according to this tolerable error amount, in advance this byte length scope is formulated a question blank that is called the suitable proportionality constant scope table of a byte length value according to proportionality constant.
In addition, the step B of coding method of the present invention can also comprise the following steps:
I. set when the extremely reasonable initial level of last proportionality constant;
Ii. an initial data is divided into a plurality of sample pane, and each this sample pane is set index number in regular turn;
Iii. according to this proportionality constant of this step I, inquire about the suitable proportionality constant scope table of this byte length value, initial index is numbered the number of the having binary numeral that original sample in this sample pane of appointment is converted into the specified less bit number of the byte length value of this sample pane;
Iv. predict the proportionality constant of the original sample of next this sample pane; And
V. increase progressively this index number, and judge whether to be the largest index label, if not, then get back to this step I ii.
In addition, among this step I of coding method of the present invention v, can pass through a fallout predictor, it is according to the trend of current original sample and original sample before, prediction and suitably setting be used to the to encode proportionality constant of original sample of next this sample pane.
In addition, interpretation method of the present invention is according to this proportionality constant and this minimum byte length value of the correspondence of each this sample pane in the coded data, deciphers.
In addition, interpretation method of the present invention comprises the following step:
I. use be somebody's turn to do " the suitable proportionality constant scope table of byte length value " identical with this coding method;
Ii. set a current proportionality constant to identical reasonable initial level with this coded program;
Iii. to each the coded samples frame set index number in regular turn, according to this proportionality constant of this step I i, this of decoding initial index numbering appointment be the coded samples frame data;
Iv. predict the next proportionality constant of the original sample of coded samples frame;
V. increase progressively this index number, and judge whether to be the largest index label; And
Vi. finish all translators.
By supporting dynamically to adjust the coding and the interpretation method of byte length, in the calculating process of compression and decompression, dynamically adjust the byte length of packed data, in compression quality variation not, or reach in tolerable error (acceptable tolerance) scope, save the redundant bit of compression back data, thereby obtain higher compression ratio.
Description of drawings
Below in conjunction with accompanying drawing the specific embodiment of the present invention is described in further detail.
Fig. 1 is the first embodiment of the present invention, and an a kind of schematic flow sheet supporting dynamically to adjust the coding method of byte length is described;
Fig. 2 is the first work example of the present invention, and a schematic flow sheet supporting dynamically to adjust the coding method of byte length is described;
Fig. 3 is the second work example of the present invention, and a schematic flow sheet supporting dynamically to adjust the coding method of byte length is described;
Fig. 4 dynamically adjusts a schematic flow sheet of the interpretation method of byte length for the support of the present invention's second work example.
Wherein, description of reference numerals is as follows:
101 set the tolerable error amount of encoder, with acceptable byte length scope
102 are divided into a plurality of sample pane with initial data, and each sample pane is according to the tolerable error amount, and according to a proportionality constant of each sample pane, set the number of the having binary numeral of the minimum byte length value of each sample pane
103 finish the coding of all sample pane data
201 set the tolerable error amount of encoder, with acceptable byte length scope, comprise the highest accepted word joint length value and minimum accepted word joint length value
202 are divided into a plurality of sample pane with initial data, and each sample pane is set index number in regular turn
The byte length of the sample pane of 203 initial index numbering appointment is set at the highest accepted word joint length value
204 find out the sample of the maximum dynamic range of this sample pane, and with this sample value therewith the byte length value of sample pane calculate a proportionality constant of this sample pane conversion
205 proportionality constants according to the conversion of this sample pane convert the original sample in the sample pane to the number of the having binary numeral of the specified less bit number of the byte length value of sample pane for this reason
206 calculate the square-error summation of the byte length value of these sample pane, and the number of the having binary numeral by the less bit number in this sample pane multiply by the actual expression values behind this proportionality constant, the difference of the initial data that adds up again corresponding sample square
The 207 byte length values of this sample pane of successively decreasing, and judge whether to equal minimum accepted word joint length value
208 find out minimum byte length value, and it is by the square-error summation when the byte length value correspondence of this sample pane, the square-error summation that is calculated less than the highest acceptable byte length value and tolerable error amount with the time determine.
209 section starts in this sample pane insert the proportionality constant and the minimum byte length value of the correspondence of this sample pane
210 increments index numbering, and judge whether to be the largest index label
211 finish the coding of all sample pane data
301 set the tolerable error amount of encoder, according to the tolerable error amount, formulate by " the suitable proportionality constant scope table of byte length value "
302 set a current proportionality constant to reasonable initial level
303 are divided into a plurality of sample pane with initial data, and each sample pane is set index number in regular turn
304 proportionality constants current according to step 302, the number of the having binary numeral that original sample in the sample pane of appointment converts the specified less bit number of the byte length value of sample pane for this reason to numbered initial index by the suitable proportionality constant scope table of inquiry byte length value
The proportionality constant of the original sample of the next sample pane of 305 predictions
306 increments index numbering, and judge whether to be the largest index label
307 finish the coding of all sample pane data
401 use " the suitable proportionality constant scope table of byte length value " identical with coded program
402 set a current proportionality constant to identical reasonable initial level with coded program
403 to each the coded samples frame set index number in regular turn, according to the proportionality constant of step 402, the frame data of coded samples of initial index numbering appointment is deciphered
The next proportionality constant of the original sample of coded samples frame of 404 predictions
405 increments index numbering, and judge whether to be the largest index label
406 finish all translators
Embodiment
Fig. 1 is the first embodiment of the present invention, and an a kind of schematic flow sheet supporting dynamically to adjust the coding method of byte length is described.This method is to be applied in the general encryption algorithm, in compression quality variation or reach in the tolerable error range not, calculates minimum byte length value.In the step 101, set the tolerable error amount of encoder, with acceptable byte length scope.Then, in the step 102, initial data is divided into a plurality of sample pane, each sample pane is according to the tolerable error amount, and according to a proportionality constant of each sample pane, sets the number of the having binary numeral of the minimum byte length value of each sample pane.At last, finish the coding of all sample pane data, shown in step 103.
Tolerable error amount in the step 101 can be the square-error summation of sample pane.The byte length scope is to have defined the highest accepted word joint length value (maximum word length) in the encryption algorithm and minimum accepted word joint length value (minimum word length).The calculating of the proportionality constant of each sample pane is by the maximum dynamic range sample of this sample pane and the byte length value of this sample pane, calculates the conversion proportion constant of this sample pane.And acceptable byte length and proportionality constant can be stored in the coded data, also the byte length scope can be formulated a question blank according to proportionality constant and be stored in the coded data.In the step 102, initial data can be speech data or image data.
In general, Fig. 2 is the first work example (working example) of the present invention, and a schematic flow sheet supporting dynamically to adjust the coding method of byte length is described.This work example is the adaptability pulse code modulated (APCM) based on equal interval quantizing, and with the square-error summation of sample pane as tolerable error range.With reference to figure 2, at first, set the tolerable error amount of encoder, with acceptable byte length scope, comprise the highest accepted word joint length value and minimum accepted word joint length value, shown in step 201.Then, initial data is divided into a plurality of sample pane, and each sample pane is set index number in regular turn, shown in step 202.The byte length of the sample pane of initial index numbering appointment is set at the highest accepted word joint length value, shown in step 203.Find out the sample of the maximum dynamic range of this sample pane, and with this sample value therewith the byte length value of sample pane calculate a proportionality constant of this sample pane conversion, shown in step 204.Then, according to the proportionality constant of this sample pane conversion, convert the original sample in the sample pane number of the having binary numeral of the specified less bit number of the byte length value of sample pane for this reason to, shown in step 205.
Calculate the square-error summation of the byte length value of this sample pane, the number of having binary numeral by the less bit number in this sample pane multiply by the actual expression values behind this proportionality constant, the difference of the initial data that adds up again corresponding sample square is shown in step 206.The byte length value of this sample pane of successively decreasing, and judge whether to equal minimum accepted word joint length value, shown in step 207.If not, then get back to step 204.So, the circulation of step 204-step 207 can be calculated the square-error summation of whole acceptable byte length values.
In step 207, when the byte length value of this sample pane equals minimum accepted word joint length value; Can find out minimum byte length value, be the square-error summation when the byte length value correspondence of this sample pane, square-error summation that is calculated less than the highest acceptable byte length value and tolerable error amount and, shown in step 208.Then, insert the proportionality constant and the minimum byte length value of the correspondence of this sample pane at the section start of this sample pane, shown in step 209.The increments index numbering, and judge whether into the largest index label, shown in step 210.If not, get back to step 203.If finish the coding of all sample pane data, shown in step 211.
In sum, in this first work example, the proportionality constant of the correspondence of its each sample pane and minimum byte length value, all,, and be stored in the coded data as step 204-step 208 by calculating in the encryption algorithm, as step 209, therefore, when decoding, can directly read proportionality constant and minimum byte length value in the coded data, in order to deciphering action.This way can reduce the burden (software or the hardware that comprise decoder) of decoder, and the integrated circuit for only making decoder can reduce its hardware cost.But owing in coded data, store the proportionality constant and the minimum byte length value of the correspondence of each sample pane, then can increase the actual bit rate (bit rate) of coded data, and reduce actual average compression ratio.
Fig. 3 is the second work example of the present invention, and a schematic flow sheet supporting dynamically to adjust the coding method of byte length is described.This work example is the adaptability pulse code modulated (APCM) based on equal interval quantizing, and with the square-error summation of sample pane as tolerable error range, in this work example, be that the byte length scope is formulated a question blank according to proportionality constant.With reference to figure 3, at first, set the tolerable error amount of encoder, according to the tolerable error amount, formulate by " the suitable proportionality constant scope table of byte length value ", shown in step 301.Set a current proportionality constant to reasonable initial level, shown in step 302.Then, initial data is divided into a plurality of sample pane, and each sample pane is set index number in regular turn, shown in step 303.
The proportionality constant current according to step 302, the suitable proportionality constant scope table of inquiry byte length value, initial index is numbered original sample in the sample pane of appointment and convert the number of the having binary numeral of the specified less bit number of the byte length value of sample pane for this reason to, shown in step 304.Then, predict the proportionality constant of the original sample of next sample pane, shown in step 305.The increments index numbering, and judge whether into the largest index label, shown in step 306.If, get back to step 304 for not.If for to be, finish the coding of all sample pane data, shown in step 307.
Wherein, in the step 305, be to pass through a fallout predictor (predictor), according to the trend of current original sample and some each original samples before, prediction and suitably setting be used to the to encode proportionality constant of next original sample.In this second work example, be, be stored in the coded data, therefore, in translator, can use and the identical question blank of encoding, be beneficial to decoding the question blank of proportionality constant and byte length scope.
What deserves to be mentioned is, in first and second work example, can add an end code at the least significant end of whole coded data, in addition to finish the coding of all sample pane data.
In general, Fig. 4 dynamically adjusts a schematic flow sheet of the interpretation method of byte length for the support of the second work example of Fig. 3.With reference to figure 4, use " the suitable proportionality constant scope table of byte length value " identical with coded program, shown in step 401.Set and work as last proportionality constant to identical reasonable initial level, shown in step 402 with coded program.And to each the coded samples frame set index number in regular turn, according to the proportionality constant of step 402, to the frame data of the coded samples decoding of initial index numbering appointment, shown in step 403.Then, the next proportionality constant of the original sample of coded samples frame of prediction is shown in step 404.The increments index numbering, and judge whether into the largest index label, shown in step 405.If, get back to step 403 for not.If for to be, finish all translators, shown in step 406.
The above only for the most preferred embodiment of invention, can not limit scope of the invention process according to this.Be that all equalizations of being done in the present patent application protection range that is included in change and modification, all should belong to the scope that patent of the present invention contains.
Claims (11)
1. a coding method of supporting dynamically to adjust byte length is applied in the traditional encryption algorithm, it is characterized in that this method comprises the following step:
A. set a tolerable error amount of this encryption algorithm, with acceptable byte length scope;
B. an initial data is divided into a plurality of sample pane, each this sample pane is according to this tolerable error amount, and according to a proportionality constant of each this sample pane, sets the number of the having binary numeral of a byte length value of each this sample pane; And
C. finish the coding of each these sample pane data.
2. the coding method of byte length is dynamically adjusted in support according to claim 1, this proportionality constant that it is characterized in that each this sample pane among this step B is to calculate with the proportional meter of the highest acceptable byte length value by the maximum dynamic range sample of each this sample pane.
3. the coding method of byte length is dynamically adjusted in support according to claim 1, it is characterized in that in this steps A the highest accepted word joint length value and a minimum accepted word joint length value in this this encryption algorithm of byte length scope definition.
4. the coding method of byte length is dynamically adjusted in support according to claim 1, it is characterized in that this proportionality constant of each this sample pane of this step B and this byte length value of each this sample pane, can be stored in the coded data.
5. the coding method of byte length is dynamically adjusted in support according to claim 1, and it is characterized in that can also be in this step C, adds an end code at the least significant end of coded data, to finish the coding of all each these sample pane data.
6. the coding method of byte length is dynamically adjusted in support according to claim 1, it is characterized in that this step B also comprises the following steps:
A. an initial data is divided into a plurality of sample pane, and each this sample pane is set an index number in regular turn;
B. the byte length value of a sample pane of initial index numbering appointment is set at the highest accepted word joint length value;
C. find out the sample of a maximum dynamic range of this sample pane, and calculate this proportionality constant of this sample pane conversion with the byte length value of this sample value and this sample pane;
D. change this proportionality constant according to this sample pane, the original sample in this sample pane is converted into the number of the having binary numeral of the specified less bit number of the byte length value of this sample pane;
E. calculate the square-error summation of the byte length value of this sample pane, after the number of the having binary numeral by the less bit number in this sample pane multiply by this proportionality constant, the difference of the initial data that adds up again corresponding sample square;
The byte length value of this sample pane of f. successively decreasing, and judge whether to equal a minimum accepted word joint length value, if not, then get back to this step c;
G. when equaling this minimum accepted word joint length value among this step f, find out a minimum byte length value, it is by the square-error summation when the byte length value correspondence of this sample pane, the square-error summation that is calculated less than this highest acceptable byte length value and this tolerable error amount with the time determine;
H. insert this proportionality constant and this minimum byte length value of the correspondence of this sample pane at the section start of this sample pane; And
I. increase progressively this index number, and judge whether to be the largest index index value, if not, then get back to this step b.
7. the coding method of byte length is dynamically adjusted in support according to claim 6, it is characterized in that deciphering the method for coded data, is according to this proportionality constant and this minimum byte length value of the correspondence of each this sample pane in the coded data, deciphers.
8. the coding method of byte length is dynamically adjusted in support according to claim 1, it is characterized in that in this steps A, can in advance this byte length scope be called the question blank of the suitable proportionality constant scope table of a byte length value according to proportionality constant formulation one according to this tolerable error amount.
9. the coding method of byte length is dynamically adjusted in support according to claim 8, it is characterized in that this step B also comprises the following steps:
I. set when the extremely reasonable initial level of last proportionality constant;
Ii. an initial data is divided into a plurality of sample pane, and each this sample pane is set index number in regular turn;
Iii. according to this proportionality constant of this step I, inquire about the suitable proportionality constant scope table of this byte length value, initial index is numbered the number of the having binary numeral that original sample in this sample pane of appointment is converted into the specified less bit number of the byte length value of this sample pane;
Iv. predict the proportionality constant of the original sample of next this sample pane; And
V. increase progressively this index number, and judge whether to be the largest index label, if not, then get back to this step I ii.
10. the coding method of byte length is dynamically adjusted in support according to claim 9, it is characterized in that among this step I v, can be by a fallout predictor according to the trend of current original sample and original sample before, prediction and suitably setting be used to the to encode proportionality constant of original sample of next this sample pane.
11. the coding method of byte length is dynamically adjusted in support according to claim 8, it is characterized in that deciphering the method for coded data, this interpretation method comprises the following step:
I. use be somebody's turn to do " the suitable proportionality constant scope table of byte length value " identical with this coding method;
Ii. set a current proportionality constant to identical reasonable initial level with this coded program;
Iii. to each the coded samples frame set index number in regular turn, according to this proportionality constant of this step I i, this of decoding initial index numbering appointment be the coded samples frame data;
Iv. predict the next proportionality constant of the original sample of coded samples frame;
V. increase progressively this index number, and judge whether to be the largest index label; And
Vi. finish all translators.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101101673A CN101325417A (en) | 2007-06-14 | 2007-06-14 | Encoding method supporting dynamic regulation of byte length |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101101673A CN101325417A (en) | 2007-06-14 | 2007-06-14 | Encoding method supporting dynamic regulation of byte length |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101325417A true CN101325417A (en) | 2008-12-17 |
Family
ID=40188786
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101101673A Pending CN101325417A (en) | 2007-06-14 | 2007-06-14 | Encoding method supporting dynamic regulation of byte length |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101325417A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103229508A (en) * | 2010-11-29 | 2013-07-31 | 夏普株式会社 | Image encoding device, and image encoding method |
| CN110198446A (en) * | 2019-07-18 | 2019-09-03 | 上海兆芯集成电路有限公司 | Image processing method and image processing apparatus |
-
2007
- 2007-06-14 CN CNA2007101101673A patent/CN101325417A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103229508A (en) * | 2010-11-29 | 2013-07-31 | 夏普株式会社 | Image encoding device, and image encoding method |
| CN103229508B (en) * | 2010-11-29 | 2016-04-13 | 夏普株式会社 | Picture coding device and method for encoding images |
| CN110198446A (en) * | 2019-07-18 | 2019-09-03 | 上海兆芯集成电路有限公司 | Image processing method and image processing apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR940005516B1 (en) | Adaptable quantize corder | |
| TWI350107B (en) | Conversion of synthesized spectral components for encoding and low-complexity transcoding | |
| CN1080036C (en) | Transmission system implementing different coding principles | |
| EP0848559A3 (en) | Video coding and decoding method and apparatus | |
| RU2719008C1 (en) | Audio encoder for encoding an audio signal, a method for encoding an audio signal and a computer program which take into account a detectable spectral region of peaks in the upper frequency range | |
| US20020018490A1 (en) | Encoding and decoding of a digital signal | |
| Quackenbush et al. | Noiseless coding of quantized spectral components in MPEG-2 Advanced Audio Coding | |
| KR920704494A (en) | Method and system for compressing image with suitable block size | |
| BRPI0711190A2 (en) | method and apparatus for lossless encoding of a source signal using a lossy encoded data stream and a lossless extension data stream | |
| AU5832600A (en) | Method for improving the coding efficiency of an audio signal | |
| KR20120096541A (en) | Method, system, and apparatus for compression or decompression of digital signals | |
| EP1617417A1 (en) | Voice coding/decoding method and apparatus | |
| US8571112B2 (en) | Specification method and apparatus for coding and decoding | |
| CN101325417A (en) | Encoding method supporting dynamic regulation of byte length | |
| CA3045515A1 (en) | A signal encoder, decoder and methods using predictor models | |
| CA2947726C (en) | Data compression of a sequence of binary data | |
| JPS5875341A (en) | Data compression device using finite difference | |
| JPS6333025A (en) | Sound encoding method | |
| CN103035249B (en) | Audio arithmetic coding method based on time-frequency plane context | |
| AU718561B2 (en) | Encoding system and decoding system for audio signals including pulse quantization | |
| TWI453733B (en) | Device and method for audio quantization codec | |
| US8502706B2 (en) | Bit allocation for encoding track information | |
| Tabus et al. | Using context dependent distributions for coding prediction residuals of companded audio signals | |
| KR0138868B1 (en) | Lsp frequency quantizer | |
| EP1750447A3 (en) | Method and apparatus for encoding and decoding key data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20081217 |