CN101483778B - Decoding method and apparatus for decoding data bit stream - Google Patents
Decoding method and apparatus for decoding data bit stream Download PDFInfo
- Publication number
- CN101483778B CN101483778B CN 200910003091 CN200910003091A CN101483778B CN 101483778 B CN101483778 B CN 101483778B CN 200910003091 CN200910003091 CN 200910003091 CN 200910003091 A CN200910003091 A CN 200910003091A CN 101483778 B CN101483778 B CN 101483778B
- Authority
- CN
- China
- Prior art keywords
- code
- basic
- bit stream
- symbol
- data bit
- 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.)
- Active
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
A decoding method and device for decoding data bit stream, wherein the decoding device comprises a search table so that the decoding device can generate corresponding symbol string stream via decoding received data bit stream according to this search table, the search table comprises basic code of a plurality of basic symbols and combined codes corresponding to a plurality of combined symbols, wherein the combined codes comprise all combinations of two or more combined basic codes less than N bits, N is predetermined as positive integer. This invention can save storage space for search table and time for decoding effectively.
Description
Technical field
The present invention is relevant for a kind of code translator, and is particularly to a kind of code translator of deciphering a plurality of basic symbols (source symbol) with combined code simultaneously.
Background technology
Share along with digital multimedia data a large amount of use and utilize network that digital multimedia data is luxuriant to be agitation, thus the compression of multi-medium data and decoding technique become quite important.And many image standards are arranged is to set up for different purpose, and for example MPEG is used for multimedia, H.263 is used for video conference; When image datas such as film are stored in various storage medium; In order to save shared storage area, all can use image compression standard usually like dynamic image expert association (Motion Picture ExpertGroup, be called for short MPEG) etc.; Compress the raw video data, the compression ratio of MPEG does not generally wait to 40 times by 8 times.
And the coding and decoding technology of these standards all can be applied to discrete cosine transform (discrete cosine transform; DCT), motion compensation (motioncompensation; MC), quantize (quantization) and variable-length decoding (variable length decode, VLD) etc.Wherein variable-length decoding is that the character code (codeword) of taking out in the data crossfire is done the action of tabling look-up, with the coefficient (DC/AC coefficients) that solves this character code representative.
When carrying out coding and decoding, the coded system of the most often using is Huffman encoding (Huffman Coding), and with Huffman tree (being optimum binary tree (binary tree)), just the minimum binary tree of weighted path length carries out data compression." Huffman encoding " claimed " entropy coding method " (entropy coding) again, when carrying out digital coding, can use a special coding schedule (look-up table) that basic symbol (source symbol) (for example symbol, word or a numeral in certain file) is encoded.This coding schedule is to set up according to the estimation probability that each basic symbol occurs; The high word of probability wherein occurs and use short coding; Otherwise low then the using than long coding of probability appears; This just makes the average expectation length of the bit string after the coding reduce, and reaches the purpose of lossless compress data.
At variable length decoder (variable length decoder) when deciphering; (bitstream BS), can comprise symbol (symbol) and code (code) to the data bit stream that then oppositely decoding is imported according to look-up table in the look-up table; As shown in Figure 1, Fig. 1 is the look-up table according to prior art.Wherein look-up table 100 included [symbols] are example with a, b, c, d, and its corresponding [code] is respectively 0,10,110,111.If data bit stream be [00000010100010110111], the code that variable length decoder can be compared look-up table 100 in proper order in regular turn according to the character code (codeword) of data bit stream is to decipher out relative symbol.After decoding; [00000010100010110111] pairing stream of symbols (symbol stream) then is [aaaaaabbaabcd]; Its required time of decoding is total up to 13 cycles; The required size of code that stores look-up table 100 is 12 (the longest the pairing code of symbol d is 3, amounts to 4 symbols).
Summary of the invention
The present invention provides a kind of code translator; Be applicable to variable-length decoding; Wherein the look-up table in order to decoding has basic code and combined code; And utilize bit length to limit and choose required combined code, not only can save the required storage space of look-up table, more can effectively reduce the required time of decoding.
The present invention provides a kind of interpretation method, utilizes bit length to limit and chooses required combined code, except that can saving the required storage space of look-up table, more can accelerate decoding speed.
Hold above-mentionedly, the present invention proposes a kind of code translator in order to decoding data bit stream, and this code translator comprises an input port, a decoding unit and an output port.Wherein, input port is in order to receive a data bit stream, and above-mentioned data bit stream comprises a plurality of codes; Decoding unit has a look-up table; And the above-mentioned data bit stream that decoding is received according to above-mentioned look-up table is to produce the corresponding symbol crossfire; Above-mentioned look-up table comprises a plurality of basic codes and a plurality of combined code; Basic code is corresponding to basic symbol, and combined code is corresponding to composite symbol, and wherein the combinations thereof code comprises all combinations smaller or equal to the N position of the length of plural basic code composition.The stream of symbols that output port is then deciphered out in order to output.Wherein, N is for predetermined positive integer and more than or equal to the figure place of basic code the longest in the above-mentioned basic code.
In an embodiment of the present invention, above-mentioned decoding unit also according to the corresponding above-mentioned basic symbol of the order of above-mentioned code output or combinations thereof symbol to form stream of symbols.
In an embodiment of the present invention, wherein if basic symbol is a binary digit, then the number of basic symbol is 2; If basic symbol is a decimal number, then the number of basic symbol is 10; If basic symbol is an English alphabet, then the number of basic symbol is 26.Basic symbol is numeral, letter, symbol or bit string, and the form of basic code and combined code is a binary system.
In an embodiment of the present invention, above-mentioned decoding unit comprises a variable length decoder, and the above-mentioned data bit stream that decoding is received according to above-mentioned look-up table is to produce the corresponding symbol crossfire, and wherein above-mentioned data bit stream is the variable length code form.
The present invention proposes a kind of interpretation method in order to decoding data bit stream in addition, this interpretation method comprise the following steps: to receive one comprise a plurality of codes data bit stream; Decipher above-mentioned data bit stream to produce a symbol bit stream according to a look-up table, above-mentioned symbol bit stream comprises a plurality of symbols corresponding to above-mentioned code; And export above-mentioned symbol bit stream; Wherein this look-up table comprises a plurality of basic codes and a plurality of combined code; Said basic code is corresponding to a plurality of basic symbols; Said combined code is corresponding to a plurality of composite symbols; The combinations thereof code comprises all combinations smaller or equal to N of length that at least two basic codes form, and N is for predetermined positive integer and more than or equal to the figure place of basic code the longest in the above-mentioned basic code., repeat no more please with reference to the explanation of above-mentioned code translator about all the other details of operations of this interpretation method at this.
From another perspective; The present invention proposes a kind of interpretation method in order to decoding data bit stream in addition; This interpretation method comprises the following steps: at first, forms a plurality of combined codes that generation length is less than or equal to N according to a plurality of basic codes, and N is predetermined positive integer; Produce corresponding a plurality of basic symbols and a plurality of composite symbol according to above-mentioned basic code and combinations thereof code; Receive one and comprise a plurality of data bit stream; Last rheme according to above-mentioned basic code and the above-mentioned data bit stream of combinations thereof code division is the combination of maximum length; That searches rheme in regular turn cuts apart combination corresponding to one of above-mentioned basic symbol and combinations thereof symbol; And make up the above-mentioned corresponding above-mentioned basic symbol of combination and the combinations thereof symbol cut apart to produce a stream of symbols of above-mentioned data bit stream correspondence.Wherein N is more than or equal to the figure place of basic code the longest in the above-mentioned basic code., repeat no more please with reference to the explanation of above-mentioned code translator about all the other details of operations of this interpretation method at this.
The present invention limits the combination of symbol and keeps the code that basic symbol contrasted because of adopting bit length, so the present invention only need increase the size of look-up table in a small amount, just can decipher a plurality of basic symbols simultaneously to reach the effect that reduces decoding time.Aspect the decoding flow process,, therefore can reduce decoding required operation times and time because the present invention can decipher out a plurality of symbols simultaneously.
Description of drawings
Fig. 1 is the look-up table according to prior art.
Fig. 2 is the multi-medium data code translator figure according to first embodiment of the invention.
Fig. 3 is the tabulation according to the look-up table 215 of first embodiment of the invention.
Fig. 4 is the data bit stream decoding sketch map according to first embodiment of the invention.
Fig. 5 is the look-up table according to second embodiment of the invention.
Fig. 6 is the data bit stream decoding sketch map according to second embodiment of the invention.
Fig. 7 is the interpretation method flow chart according to third embodiment of the invention.
Fig. 8 is the interpretation method flow chart according to fourth embodiment of the invention.
Embodiment
For letting the above-mentioned feature and advantage of the present invention can be more obviously understandable, hereinafter is special lifts preferred embodiment, and cooperates appended graphicly, elaborates as follows.
Though the present invention cooperates diagram to set forth explanation by following examples, not in order to limit the scope of application of the present invention.
First embodiment
Please with reference to Fig. 2, Fig. 2 is the multi-medium data code translator figure according to first embodiment of the invention.Code translator 200 comprises decoding unit 201 (being made up of variable length decoder 210 and 215 of look-up tables), inverse quantization module (inverse quantization) 220 and anti-discrete cosine modular converter (inverse DCT) 230.Wherein inverse quantization module 220 is coupled between variable length decoder 210 and the anti-discrete cosine modular converter 230, and look-up table 215 is coupled to variable length decoder 210.In the present embodiment; Look-up table 215 can be stored in the memory element; For example flash memory (flash memory), memory cache (Cache Memory), read-only memory (Read Only Memory; ROM) or random access memory (Random Assess Memory, RAM) or hard disk (Hard Disk, but HD) wait the medium of general reference storage data.
Next, further specify the symbol of look-up table 215 and the corresponding relation of code.Please be simultaneously with reference to Fig. 1 and Fig. 3, Fig. 3 is the tabulation according to the look-up table 215 of present embodiment, and wherein basic symbol (source symbol) is identical with Fig. 1, is the example explanation with a, b, c, d, and so-called basic symbol is promptly represented primary word or the symbol in the initial data.For instance, if initial data is binary data, then basic symbol has two kinds, is respectively 1 and 0; If initial data is made up of English alphabet, then basic symbol has 26 letters.All the other basic symbols, bracket for example, comma or bit string etc. also can be a kind of of basic symbol, and those skilled in the art should know all the other basic symbols by inference easily after via exposure of the present invention, do not add tired stating at this.
In Fig. 3, [symbol] in the present embodiment comprises all basic symbols (being example with a, b, c, d only in the present embodiment) in the initial data and the composite symbol of being made up of basic symbol, like aaa, aa, ab, ba.Be called basic code (promptly 0,10,110,111) corresponding to the code of basic symbol, and be called combined code (promptly 000,00,010,100) corresponding to the code of composite symbol, the corresponding relation between all symbols and the code is then please with reference to Fig. 3.
Combined code is formed by the bit string of basic code combination; With basic symbol [a] is example, and its corresponding basic code is [0], and therefore the combined code corresponding to composite symbol [aaa] is [000]; Promptly be the bit string that is combined by 3 basic codes [0], then the rest may be inferred for all the other combined codes.In addition, in the present embodiment, choosing of combined code is to decide according to its bit length.At first, the length restriction of combined code must be more than or equal to the figure place of the longest basic code (promptly 111), just 3.Fig. 3 promptly is to be that length restriction is chosen corresponding combined code with 3, and Fig. 3 lists all basic codes and all length smaller or equal to 3 combined code.After comparison, therefore the length of composite symbol aaa, aa, ab, the pairing combined code of ba listed in the look-up table 215 smaller or equal to 3 in the lump.
In other words, can form a plurality of bit strings corresponding to the code of basic symbol, combined code comprises that then all length is less than or equal to the said bit string of N position; N is predetermined positive integer, that is to say that combined code comprises that plural basic code merges all combinations smaller or equal to the N position of back length, and wherein the numerical value of N can be decided according to design requirement; The N value is big more; Combined code in the look-up table is many more, and the speed of its decoding is fast more, but the required memory space of look-up table is big more.In the present embodiment, only equaling 3 with N is the example explanation, but N is not limited to 3.
The flow process of decoding is please with reference to Fig. 4, and Fig. 4 is the data bit stream decoding sketch map according to present embodiment.Wherein, data bit stream is [00000010100010110111], and in cycle T 1, the code comparison decodable code among data bit [000] and Fig. 3 goes out symbol [aaa]: in cycle T 2, the code comparison decodable code among data bit [000] and Fig. 3 goes out symbol [aaa]; In cycle T 3, the code comparison decodable code among data bit [10] and Fig. 3 goes out symbol [b]; In cycle T 4, the code comparison decodable code among data bit [100] and Fig. 3 goes out symbol [ba]; In cycle T 5, the code comparison decodable code among data bit [010] and Fig. 3 goes out symbol [ab]; In cycle T 6, the code comparison decodable code among data bit [110] and Fig. 3 goes out symbol [c]; In cycle T 7, the code comparison decodable code among data bit [111] and Fig. 3 goes out symbol [d].
It should be noted that the data bit [101] in the cycle T 3, only have [10] to be interpreted as symbol [b], its last data bit [1] is not deciphered as yet, therefore includes in the cycle T 4, proceeds comparison and decoding.When carrying out the cutting apart of data bit stream, can cut apart for minimum principle according to the number of codes of forming data bit stream.For example, 6 positions be " 0 " before the data bit stream among Fig. 4, so can it be divided into two " 000 " with corresponding to two composite symbols " aaa ", and can it be divided into the combination of 6 " 0 ".In other words, can make during the partition data bit stream form data bit stream number of codes for minimum.After decoding is accomplished, decoding unit 201 according to the corresponding said basic symbol of the order output of said code or said composite symbol to form stream of symbols.
Therefore, utilize the look-up table 215 of present embodiment, variable length decoder 210 can be accomplished decoding with output corresponding symbol string [aaaaaabbaabcd] in 7 cycles.Look-up table (please with reference to Fig. 1) compared to prior art; The required decoding time of present embodiment is reduced to 7 cycles by 13 cycles; And the required storage space of code only rises to 24 (4 basic codes add 4 combined codes, and the required storage area of each code is 3) by 12 in the look-up table 215.Therefore, present embodiment only needs slightly to promote the size of look-up table, can significantly reduce the required time of decoding.
Second embodiment
In another embodiment of the present invention, the restriction of the code length of look-up table can be adjusted into 4 (N equals 4), and the composition of its look-up table is please with reference to Fig. 5, and Fig. 5 is the look-up table according to second embodiment of the invention.Comprise in the look-up table 500 that all basic codes and all length are smaller or equal to 4 combined code.Wherein, basic code is corresponding to all basic symbols, and all combined codes then are to be combined by two or more basic code, and are corresponding to a plurality of composite symbols, as shown in Figure 5.About choosing of combined code, can select the mode that makes up according to the length of basic code, for example make up 1 with the basic code of 3 bit lengths or 2 basic code with 2 bit lengths, perhaps 1 basic code with 2 bit lengths, the rest may be inferred by analogy for it.As long as the length of the bit string after the basic code combination is smaller or equal to 4 categories that all belong to the combined code of present embodiment.Combined code can be combined by identical basic code or different basic codes, and present embodiment is not limited, as long as the length of combined code is smaller or equal to the N position that sets.
Utilize flow process that the look-up table 500 of Fig. 5 deciphers please with reference to Fig. 6, Fig. 6 is the data bit stream decoding sketch map according to second embodiment of the invention.Wherein, Data bit stream is [00000010100010110111]; In cycle T 61, the code comparison decodable code among data bit [0000] and Fig. 5 goes out symbol [aaaa]: in cycle T 62, the code comparison decodable code among data bit [0010] and Fig. 5 goes out symbol [aab]: in cycle T 63; Code comparison decodable code among data bit [1000] and Fig. 5 goes out symbol [baa]: in cycle T 64; Code comparison decodable code among data bit [1011] and Fig. 5 goes out symbol [b]: in cycle T 65, the code comparison decodable code among data bit [1101] and Fig. 5 goes out symbol [c]: in cycle T 66, the code comparison decodable code among data bit [111] and Fig. 5 goes out symbol [c].
The required storage space of code is 68 in the look-up table 500, but the time of its decoding can shorten to 6 cycles, therefore compared to prior art, the stool and urine that the present invention only needs slightly to promote look-up table can effectively promote the speed of decoding.Please with reference to the explanation of above-mentioned first embodiment, do not add tired stating about all the other details of present embodiment at this.
In addition; It should be noted that; In the present embodiment, the character code of data bit stream BS (codeword) can be represented a plurality of change values/level value sign indicating number (run-length code), and its representation is respectively run, level; Wherein change value " run " is before the discrete cosine transform coefficient of non-zero, continuously zero number; Level value " level " then is the coefficient value of non-zero, can calculate the DC of this character code representative or the absolute value of AC coefficient in view of the above.215 corresponding relations that store code and symbol of look-up table, code can be corresponding to the character code order of data bit stream BS, the numerical value that symbol then is worth corresponding to change value/level.In addition, it should be noted that the described data bit stream BS of present embodiment is not limited to multi-medium data, so long as the data after variable length code all can.
Aspect the code length restriction of setting look-up table; As long as maximum length greater than basic code (corresponding to basic symbol); For example when the length of the longest basic code in the basic code is 3, the combined code that the user can select the length (as 3,4 or 5) more than 3 to select to meet length is to form look-up table.The code length that sets is longer, the combined code that meets just the more, the required storage space of its look-up table is bigger, but it is shorter to decipher the required time.The designer can according to different decoding demands, sets to be fit to the longest code length.In addition, when the designer finds out all combined codes that meet bit length restriction, still therefrom deletion combined code (for example using the lower combined code of probability in the original document) with the size of further reduction look-up table.Look-up table of the present invention is not restricted to the foregoing description, and the user can adjust according to self-demand.
The 3rd embodiment
The explanation of comprehensive above-mentioned first embodiment and second embodiment, the present invention can summarize a kind of interpretation method in order to decipher a data bit stream, and please with reference to Fig. 7, Fig. 7 is the interpretation method flow chart according to third embodiment of the invention.At first, receive one comprise a plurality of codes data bit stream (step S710), then according to a look-up table decoding data bit stream to produce a symbol bit stream, the symbol bit stream comprises a plurality of symbols (step S720) corresponding to above-mentioned code.After decoding is accomplished, output symbol bit stream (step S730).
Wherein it should be noted that; Comprise the pairing a plurality of basic symbols of a plurality of basic codes and a plurality of combined code and a plurality of composite symbol in the above-mentioned look-up table; The combinations thereof code comprises all combinations smaller or equal to N of the length of at least two basic codes compositions; Wherein, N is a positive integer and more than or equal to the figure place of basic code the longest in the basic code., repeat no more please with reference to the explanation of above-mentioned first embodiment and second embodiment about the details of operation of the composition of look-up table and interpretation method at this.
The 4th embodiment
From another perspective, the present invention proposes a kind of interpretation method, and please with reference to Fig. 8, Fig. 8 is the interpretation method flow chart according to fourth embodiment of the invention.At first, form a plurality of combined codes that generation length is less than or equal to N according to a plurality of basic codes, N is positive integer (step S810); Then, produce corresponding a plurality of basic symbols and a plurality of composite symbol (step S820) according to above-mentioned basic code and combined code.Next, receive one and comprise a plurality of data bit stream (step S830), the data bit stream that is received according to above-mentioned basic code and combinations thereof code division then be the combination of maximum length (step S840).In step S840, the combination of so-called maximum length is meant in decode procedure, cuts apart and decoding according to the dominant bit length in the combined code.Like Fig. 3 and shown in Figure 4,, so be to be that unit comes the partition data bit stream and deciphers among Fig. 4 with per 3 positions because of the dominant bit length of the code in the look-up table 215 is 3.
Then; That searches rheme in regular turn cuts apart one (the step S850s) of combination corresponding to basic symbol in the look-up table and composite symbol; And making up above-mentioned combination pairing basic symbol and the composite symbol cut apart to produce a stream of symbols (step S860) of data bit stream correspondence, its decoded mode is then as shown in Figure 4.Wherein, it should be noted that N is a positive integer and more than or equal to the figure place of basic code the longest in the basic code., repeat no more please with reference to the explanation of above-mentioned first embodiment and second embodiment about the details of operation of the composition of look-up table and interpretation method at this.
In sum; The present invention selects combined code to form look-up table because of utilizing bit length to limit; And in look-up table, keep basic code; Therefore when carrying out variable-length decoding, can decipher a plurality of symbols or single symbol simultaneously, compared to prior art, the present invention can significantly reduce required decoding time.In addition, the generation type of look-up table of the present invention is quite convenient, does not need can form via complex calculations, and required storage space is also less.Therefore, the user can set out the look-up table that meets storage space and decoding speed demand faster.
The above is merely preferred embodiment of the present invention; So it is not in order to limit scope of the present invention; Any personnel that are familiar with this technology; Do not breaking away from the spirit and scope of the present invention, can do further improvement and variation on this basis, so the scope that claims were defined that protection scope of the present invention is worked as with the application is as the criterion.
The simple declaration of symbol is following in the accompanying drawing:
200: code translator
201: decoding unit
210: variable length decoder
215,500 look-up tables
220: inverse quantization module
230: the anti-discrete cosine modular converter
T1～T7, T61～T66: cycle
BS: data bit stream
S710～S730, S810～S860: decoding step.
Claims (12)
1. the code translator in order to decoding data bit stream is characterized in that, this code translator comprises:
One input port, in order to receive a data bit stream, this data bit stream comprises a plurality of codes, and this data bit stream is the variable length code form;
One decoding unit; Has a look-up table; And this data bit stream that decoding is received according to this look-up table to be to produce the corresponding symbol crossfire, and this look-up table comprises a plurality of basic codes and a plurality of combined code, and said basic code is corresponding to a plurality of basic symbols; Said combined code is corresponding to a plurality of composite symbols; Wherein said combined code comprises all combinations smaller or equal to the N position of the length of plural said basic code composition, and N is predetermined positive integer, and N is more than or equal to the figure place of basic code the longest in the said basic code; And
One output port is in order to export this stream of symbols.
2. the code translator in order to decoding data bit stream according to claim 1 is characterized in that, this decoding unit also according to the corresponding said basic symbol of the order of said code output or said composite symbol to form this stream of symbols.
3. the code translator in order to decoding data bit stream according to claim 1 is characterized in that, if this basic symbol is a binary digit, then the number of said basic symbol is 2; If this basic symbol is a decimal number, then the number of said basic symbol is 10; If this basic symbol is an English alphabet, then the number of said basic symbol is 26.
4. the code translator in order to decoding data bit stream according to claim 1 is characterized in that, said basic symbol is numeral, letter, symbol or bit string.
5. the code translator in order to decoding data bit stream according to claim 1 is characterized in that, the form of said basic code and said combined code is a binary system.
6. the code translator in order to decoding data bit stream according to claim 1 is characterized in that, this decoding unit comprises:
One variable length decoder, this data bit stream that decoding is received according to this look-up table is to produce the corresponding symbol crossfire.
7. the interpretation method in order to decoding data bit stream is characterized in that, this interpretation method comprises:
Reception one comprises the data bit stream of a plurality of codes, and this data bit stream is the variable length code form;
To produce a symbol bit stream, this symbol bit stream comprises a plurality of symbols corresponding to said code according to this data bit stream of look-up table decoding; And
Export this symbol bit stream;
Wherein this look-up table comprises a plurality of basic codes and a plurality of combined code; Said basic code is corresponding to a plurality of basic symbols; Said combined code is corresponding to a plurality of composite symbols; Said combined code comprises all combinations smaller or equal to N of the length of at least two basic codes compositions, and N is predetermined positive integer, and N is more than or equal to the figure place of basic code the longest in the said basic code.
8. the interpretation method in order to decoding data bit stream according to claim 7 is characterized in that, said symbol bit stream is according to the order output of corresponding said code.
9. the interpretation method in order to decoding data bit stream according to claim 7 is characterized in that, comprises that also cutting apart this data bit stream makes the said number of codes of forming this data bit stream for minimum.
10. the interpretation method in order to decoding data bit stream according to claim 7 is characterized in that, if this basic symbol is a binary digit, then the number of said basic code is 2; If this basic symbol is a decimal number, then the number of said basic code is 10; If this basic symbol is an English alphabet, then the number of said basic code is 26.
11. the interpretation method in order to decoding data bit stream is characterized in that, this interpretation method comprises:
Form a plurality of combined codes that generation length is less than or equal to N according to a plurality of basic codes, N is predetermined positive integer, and N is more than or equal to the figure place of basic code the longest in the said basic code;
Produce corresponding a plurality of basic symbols and a plurality of composite symbol according to said basic code and said combined code;
Receive one and comprise a plurality of data bit stream, this data bit stream is the variable length code form;
Institute's rheme of cutting apart this data bit stream according to said basic code and said combined code is the combination of maximum length;
That searches institute's rheme in regular turn cuts apart combination corresponding to one of said basic symbol and said composite symbol; And
Make up the said corresponding said basic symbol of combination and the said composite symbol cut apart to produce the corresponding stream of symbols of this data bit stream.
12. the interpretation method in order to decoding data bit stream according to claim 11 is characterized in that, if this basic symbol is a binary digit, then the number of said basic code is 2; If this basic symbol is a decimal number, then the number of said basic code is 10; If this basic symbol is an English alphabet, then the number of said basic code is 26.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910003091 CN101483778B (en) | 2009-01-19 | 2009-01-19 | Decoding method and apparatus for decoding data bit stream |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910003091 CN101483778B (en) | 2009-01-19 | 2009-01-19 | Decoding method and apparatus for decoding data bit stream |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101483778A CN101483778A (en) | 2009-07-15 |
| CN101483778B true CN101483778B (en) | 2012-05-09 |
Family
ID=40880679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910003091 Active CN101483778B (en) | 2009-01-19 | 2009-01-19 | Decoding method and apparatus for decoding data bit stream |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101483778B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103840835A (en) * | 2012-11-26 | 2014-06-04 | 艺伦半导体技术股份有限公司 | Data decompression method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1193427A (en) * | 1996-03-15 | 1998-09-16 | 菲利浦电子有限公司 | Method of and device for coding digital information signal |
| GB2367223A (en) * | 1997-01-21 | 2002-03-27 | Fujitsu Ltd | Data compression encoding where groups of character whose codes exactly fill a transmission data unit are stored in the encoding table |
-
2009
- 2009-01-19 CN CN 200910003091 patent/CN101483778B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1193427A (en) * | 1996-03-15 | 1998-09-16 | 菲利浦电子有限公司 | Method of and device for coding digital information signal |
| GB2367223A (en) * | 1997-01-21 | 2002-03-27 | Fujitsu Ltd | Data compression encoding where groups of character whose codes exactly fill a transmission data unit are stored in the encoding table |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101483778A (en) | 2009-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101106377B (en) | System for maintaining decoding table | |
| KR100959532B1 (en) | Decoding method of CAVLC | |
| US6653955B1 (en) | Multi-symbol variable length code decoder | |
| US6943710B2 (en) | Method and arrangement for arithmetic encoding and decoding binary states and a corresponding computer program and a corresponding computer-readable storage medium | |
| US20030085822A1 (en) | High performance memory efficient variable-length coding decoder | |
| CA2452175A1 (en) | Variable length coding method and variable length decoding method | |
| CN101562455A (en) | Context-based adaptive binary arithmetic coding (cabac) decoding apparatus and decoding method thereof | |
| Cho et al. | A low power variable length decoder for MPEG-2 based on nonuniform fine-grain table partitioning | |
| US8938001B1 (en) | Apparatus and method for coding using combinations | |
| CN101483778B (en) | Decoding method and apparatus for decoding data bit stream | |
| CN100466743C (en) | Method for programmable entropy decoding based on shared storage and countra-quantization | |
| US7439886B2 (en) | Variable-length decoder, video decoder and image display system having the same, and variable-length decoding method | |
| WO2003067763A2 (en) | Video compression using analytical entropy coding | |
| Ezhilarasan et al. | A new entropy encoding technique for multimedia data compression | |
| JPH08223055A (en) | Variable-length cord decoder | |
| JP2013009167A (en) | Entropy encoding apparatus, entropy decoding apparatus, entropy encoding method and entropy decoding method | |
| Jagadeesh et al. | An approach for image compression using adaptive Huffman coding | |
| US6794999B1 (en) | Resilient parameterized prefix codes for adaptive coding | |
| Hoffman et al. | High-throughput CAVLC architecture for real-time H. 264 coding using reconfigurable devices | |
| JP2003174365A (en) | Decoding device and its method | |
| Liu et al. | A low-power group-based VLD design | |
| Bingbo et al. | A high-performance VLSI architecture for CABAC decoding in H. 264/AVC | |
| CN101707484A (en) | Fast exp-Golomb decoding method suitable to be implemented by hardware | |
| TW201015875A (en) | Method and apparatus for decoding data bitstream | |
| Li et al. | A Novel ANS Coding with Low Computational Complexity |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |