CN107682018A - Coding/decoding method and device - Google Patents
Coding/decoding method and device Download PDFInfo
- Publication number
- CN107682018A CN107682018A CN201710893279.4A CN201710893279A CN107682018A CN 107682018 A CN107682018 A CN 107682018A CN 201710893279 A CN201710893279 A CN 201710893279A CN 107682018 A CN107682018 A CN 107682018A
- Authority
- CN
- China
- Prior art keywords
- symbol
- code
- address
- code word
- group
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The problem of disclosure provides a kind of coding/decoding method and device, is related to electronic information technical field, and decoding efficiency is low during can solve the problem that Hafman decoding, and resource cost is big.Concrete technical scheme is：Target bits stream is obtained, target bits stream includes code length information and data message, code length of the code length packet containing at least one symbol, and data message is that initial data encodes generation according to Huffman encoding algorithm；The code word of each symbol at least one symbol is calculated according to code length information；Decoding table is generated according to the code word of each symbol；Data message is decoded according to decoding table to obtain initial data.The present invention is used for Hafman decoding.
Description
Technical field
This disclosure relates to electronic information technical field, more particularly to a kind of coding/decoding method and device.
Background technology
Huffman (English：Huffman) coding is a kind of prefix code technology, and code is constructed according to character probability of occurrence
Word, shorter coded representation is used for the more symbol of occurrence number, used for the less symbol of occurrence number longer
Coded representation.
During being decoded, static Hafman decoding and dynamic Hafman decoding are generally comprised.Static Huffman
Decoding, according to specific application scenarios, a kind of universal character probabilities are counted, build fixed binary tree and Huffman code table,
Then decoded according to fixed code table；Dynamic Hafman decoding, design multiple code tables for different code lengths and decode simultaneously, most
After select it is correct one solution code value.
But during stating decoding in realization, static Hafman decoding decodes according to fixed code table, decoding efficiency compared with
It is low, and although dynamic Hafman decoding can adapt to different code length, still, different code tables, resource are designed for every kind of code length
Expend too big.
The content of the invention
The embodiment of the present disclosure provides a kind of coding/decoding method and device, can solve the problem that decoding efficiency during Hafman decoding
It is low, the problem of resource cost is big.Technical scheme is as follows：
According to the first aspect of the embodiment of the present disclosure, there is provided a kind of coding/decoding method, this method include：
Target bits stream is obtained, target bits stream includes code length information and data message, and code length packet is containing at least one
The code length of symbol, data message are that initial data encodes generation according to Huffman encoding algorithm；
The code word of each symbol at least one symbol is calculated according to code length information；
Decoding table is generated according to the code word of each symbol；
Data message is decoded according to decoding table to obtain initial data.
Data message for encoding generation according to Huffman encoding algorithm, directly calculate the code word and generated code of each symbol
Table, only a code table, it is not necessary to code table is separately designed according to different code length, reduces the resource expended in decoding process, together
When, because decoding table is according to target data stream calculation, target data stream is can adapt to, improves decoding efficiency.
In one embodiment, the code word of each symbol at least one symbol is calculated according to code length information, including：
At least one symbol is grouped according to the code length of at least one symbol, code length identical symbol is divided into one
Group；
The code word of each group code is calculated respectively.
Symbol is grouped according to code length, calculates the code word per group code respectively, treatment effeciency is higher, and calculating speed is more
It hurry up.
In one embodiment, the code word of each group code is calculated respectively, including：
Calculate the code word of first symbol in each group code respectively according to normal form Huffman encoding algorithm；
According to the code word of first symbol in each group code, the code word of each group code is calculated respectively.
Because the code word of each group code of normal form Huffman has certain rule, therefore, symbol is calculated according to Huffman encoding algorithm
Code word speed faster.
In one embodiment, decoding table is generated according to the code word of each symbol, including：
The address of each symbol in each group code is determined respectively；
Decoding table is generated according to the address of each symbol.
The address of each symbol and symbol are mutually corresponding, and code word is directly found in decoding table according to address can,
Improve decoding efficiency.
In one embodiment, the address of each symbol in each group code is determined respectively, including：
The address of first symbol in m group codes is determined, m is the integer more than 0；
According to formula Kn=K1+(Pn-P0) calculate except first outer symbol other symbols address, wherein, KnRepresent m groups
The address of nth symbol, K in symbol1Represent the address of first symbol, PnRepresent the code word of nth symbol, P0Represent first symbol
Number code word, n is integer more than 0.
The address per group code is calculated according to formula, corresponding relation is clear and definite between address and code word, and decoding efficiency is higher.
In one embodiment, data message is decoded according to decoding table to obtain initial data, including：
Data message is divided into by least one character field according to code length information；
Calculate the address of each character field at least one character field；
According to the address of decoding table and each character field, each character field is decoded to obtain initial data.
Because calculating decoding table according to code length information, in decoding, directly it is assured that according to the address of character field
Code word, data message is decoded, improve decoding efficiency.
According to the second aspect of the embodiment of the present disclosure, there is provided a kind of decoding apparatus, the decoding apparatus include：
Acquisition module, for obtaining target bits stream, target bits stream includes code length information and data message, code length information
The code length of at least one symbol is included, data message is that initial data encodes generation according to Huffman encoding algorithm；
Code word module, for calculating the code word of each symbol at least one symbol according to code length information；
Code table module, for generating decoding table according to the code word of each symbol；
Decoder module, for being decoded to obtain initial data to data message according to decoding table.
In one embodiment, code word module includes packet submodule and calculating sub module；
Submodule is grouped, at least one symbol is grouped for the code length according at least one symbol, by code length phase
Same symbol is divided into one group；
Calculating sub module, for calculating the code word of each group code respectively.
In one embodiment, calculating sub module, for being calculated respectively in each group code according to normal form Huffman encoding algorithm
The code word of first symbol；According to the code word of first symbol in each group code, the code word of each group code is calculated respectively.
In one embodiment, code table module includes address submodule and mapping submodule；
Address submodule, for determining the address of each symbol in each group code respectively；
Mapping submodule, for generating decoding table according to the address of each symbol.
In one embodiment, address submodule, for determining the address of first symbol in m group codes, m is more than 0
Integer；According to formula Kn=K1+(Pn-P0) calculate except first outer symbol other symbols address, wherein, KnRepresent m groups
The address of nth symbol, K in symbol1Represent the address of first symbol, PnRepresent the code word of nth symbol, P0Represent first symbol
Number code word, n is integer more than 0.
In one embodiment, decoder module includes segmentation submodule, character field submodule and initial data submodule；
Submodule is segmented, for data message to be divided into at least one character field according to code length information；
Character field submodule, for calculating the address of each character field at least one character field；
Initial data submodule, for the address according to decoding table and each character field, each character field is solved
Code obtains initial data.
It should be appreciated that the general description and following detailed description of the above are only exemplary and explanatory, not
The disclosure can be limited.
Brief description of the drawings
Accompanying drawing herein is merged in specification and forms the part of this specification, shows the implementation for meeting the disclosure
Example, and be used to together with specification to explain the principle of the disclosure.
Fig. 1 is a kind of flow chart for coding/decoding method that the embodiment of the present disclosure provides；
Fig. 2 is a kind of flow chart for coding/decoding method that another embodiment of the disclosure provides；
Fig. 3 is a kind of symbol packet schematic diagram that the embodiment of the present disclosure provides；
Fig. 4 is a kind of code word schematic diagram that the embodiment of the present disclosure provides；
Fig. 5 is a kind of decoding table schematic diagram that the embodiment of the present disclosure provides；
Fig. 6 is a kind of segment information schematic diagram that the embodiment of the present disclosure provides；
Fig. 7 is a kind of structure chart for decoding apparatus that the embodiment of the present disclosure provides；
Fig. 8 is a kind of structure chart for decoding apparatus that the embodiment of the present disclosure provides；
Fig. 9 is a kind of structure chart for decoding apparatus that the embodiment of the present disclosure provides；
Figure 10 is a kind of structure chart for decoding apparatus that the embodiment of the present disclosure provides.
Embodiment
Here exemplary embodiment will be illustrated in detail, its example is illustrated in the accompanying drawings.Following description is related to
During accompanying drawing, unless otherwise indicated, the same numbers in different accompanying drawings represent same or analogous key element.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistent with the disclosure.On the contrary, they be only with it is such as appended
The example of the consistent apparatus and method of some aspects be described in detail in claims, the disclosure.
The embodiment of the present disclosure provides a kind of coding/decoding method, as shown in figure 1, the coding/decoding method comprises the following steps：
101st, target bits stream is obtained.
Target bits stream includes code length information and data message, code length of the code length packet containing at least one symbol, data
Information is that initial data encodes generation according to Huffman encoding algorithm.Optionally, data message can be calculated according to normal form Huffman
Method coding generation.
It should be noted that symbol is the unit for forming initial data, for example, initial data is an article, then symbol
Just include Chinese character therein, letter, numeral, punctuate etc..And for example, initial data is a two field picture, and then symbol just includes each face
The colour component of color, such as RGB (RGB) component.Certainly, simply exemplary illustration herein.
102nd, the code word of each symbol at least one symbol is calculated according to code length information.
Code word is the character string generated after symbol encodes according to Huffman encoding algorithm, is binary coding.
In one embodiment, the code word of each symbol at least one symbol is calculated according to code length information, including：According to
The code length of at least one symbol is grouped at least one symbol, and code length identical symbol is divided into one group；Calculate respectively every
The code word of one group code.
Symbol is grouped according to code length, calculates the code word per group code respectively, treatment effeciency is higher, and calculating speed is more
It hurry up.
In one embodiment, the code word of each group code is calculated respectively, including：Counted respectively according to normal form Huffman encoding algorithm
Calculate the code word of first symbol in each group code；According to the code word of first symbol in each group code, each group of symbol is calculated respectively
Number code word.
Specifically, in each group code of normal form Huffman, the code word of the latter symbol is that the code word of previous symbol adds " 1 "
Obtain；The code word of first symbol in latter group code, it is that the code word of last symbol in a upper group code moves to left one
Again plus " 1 " obtains.Because the code word of each group code of normal form Huffman has certain rule, therefore, according to Huffman encoding algorithm meter
The code word speed of operator number is faster.
103rd, decoding table is generated according to the code word of each symbol.
The corresponding relation that decoding table is used between designated symbol and code word.
In one embodiment, decoding table is generated according to the code word of each symbol, including：Determine respectively in each group code
The address of each symbol；Decoding table is generated according to the address of each symbol.
In this embodiment, decoding table is used to indicating corresponding relation between address and symbol, the address of each symbol and
Symbol is mutually corresponding, and code word is directly found in decoding table according to address can, improves decoding efficiency.
In one embodiment, the address of each symbol in each group code is determined respectively, including：Determine m group codes
In first symbol address, m is integer more than 0；According to formula Kn=K1+(Pn-P0) calculate except other of first outer symbol accord with
Number address, wherein, KnRepresent the address of nth symbol in m group codes, K1Represent the address of first symbol, PnRepresent n-th
The code word of individual symbol, P0The code word of first symbol is represented, n is the integer more than 0.
The address per group code is calculated according to formula, corresponding relation is clear and definite between address and code word, and decoding efficiency is higher.
104th, data message is decoded according to decoding table to obtain initial data.
In one embodiment, data message is decoded according to decoding table to obtain initial data, including：According to code length
Data message is divided at least one character field by information；Calculate the address of each character field at least one character field；According to solution
The address of code table and each character field, each character field is decoded to obtain initial data.
Because calculating decoding table according to code length information, in decoding, directly it is assured that according to the address of character field
Code word, data message is decoded, improve decoding efficiency.
The coding/decoding method that the embodiment of the present disclosure provides, the data message for encoding generation according to Huffman encoding algorithm, directly
Calculate the code word of each symbol and generate code table, only a code table, it is not necessary to code table is separately designed according to different code length, reduced
The resource expended during decoding, meanwhile, because decoding table is according to target data stream calculation, it can adapt to target data
Stream, improve decoding efficiency.
Based on the coding/decoding method described in embodiment corresponding to above-mentioned Fig. 1, another embodiment of the disclosure provides a kind of solution
Code method, as shown in Fig. 2 the coding/decoding method comprises the following steps：
201st, target bits stream is obtained.
Target bits stream includes code length information and data message, code length of the code length packet containing at least one symbol, data
Information is that initial data encodes generation according to normal form Huffman encoding algorithm.
202nd, at least one symbol is grouped according to code length information, code length identical symbol is divided into one group.
As shown in figure 3, a kind of symbol packet schematic diagram that Fig. 3, which is the embodiment of the present disclosure, to be provided, in Fig. 3, with symbol " A, B,
C, exemplified by D, E ", symbol A and symbol B code length are 2, and symbol C, symbol D and symbol E code length are 3.
203rd, the code word of each group code is calculated respectively according to normal form Huffman encoding algorithm.
First, the code word of first symbol in each group code is calculated respectively according to normal form Huffman encoding algorithm；According to each group
The code word of first symbol in symbol, the code word of each group code is calculated respectively.In each group code of normal form Huffman, the latter symbol
Number code word be that the code word of previous symbol adds " 1 " to obtain；The code word of first symbol in latter group code, it is upper one group of symbol
The code word of last symbol moves to left one again in number plus " 1 " obtains.Because the code word of each group code of normal form Huffman has
Certain rule, therefore, the code word speed of symbol is calculated faster according to Huffman encoding algorithm.
As shown in figure 4, Fig. 4 is a kind of code word schematic diagram that the embodiment of the present disclosure provides.In Fig. 4, symbol A code word is
00, symbol B code length are identical with symbol A code length, and symbol A code word is added into 1 code word 01 for just obtaining symbol B；Symbol C is code
First symbol in a length of 3 group code, symbol B code word is moved to left one and adds 1 to obtain symbol C code word 011 again, then will
Symbol C code word adds 1 to obtain symbol D code word 100, and similarly symbol E code word is 101.
204th, the address of each symbol in each group code is determined respectively.
Specifically, it may be determined that the address of first symbol in m group codes, m are the integer more than 0；According to formula Kn=K1
+(Pn-P0) calculate except first outer symbol other symbols address, wherein, KnRepresent the ground of nth symbol in m group codes
Location, K1Represent the address of first symbol, PnRepresent the code word of nth symbol, P0The code word of first symbol is represented, n is more than 0
Integer.
205th, decoding table is generated according to the address of each symbol.
The corresponding relation that decoding table is used between designated symbol and address.
As shown in figure 5, Fig. 5 is a kind of decoding table schematic diagram that the embodiment of the present disclosure provides.It is 2 first group codes by code length
First symbol A address be defined as 0, code length is that the address that the first symbol C of 3 first group codes address is A adds first group
The number of symbol, then C address is 2；In each group of symbol, the address of the latter symbol is that the address of a upper symbol adds 1.
206th, data message is divided into by least one character field according to code length information.
In one embodiment, 0 can will be added behind the code word of all symbols, the code length of each symbol is supplied
Most long code length digit, data message is segmented according to the code word after the long digit of maximum length code is supplied.
As shown in fig. 6, Fig. 6 is a kind of segment information schematic diagram that the embodiment of the present disclosure provides.In Fig. 6, symbol it is most long
Code length is 3, and all symbols are all supplied into 3, symbol A code word 00 supply 3 after be 000, symbol B code word 01 supplies 3
It is 010 afterwards.
Judge which section first 3 of data message belong to, and are then assured that how first 3 should be segmented.It is for example, preceding
3 are 001, and between 000 and 010, then it is a character field that can determine front two, then proceedes to judge 3-5 positions；If
First 3 are 011, identical with symbol C code word, then 3 are a character fields before can determining, then proceed to judge 4-6 positions.
In this manner it is possible to data message is divided at least one character field.
207th, the address of each character field at least one character field is calculated.
Each character field after segmentation is exactly the code word after each symbol encodes according to Huffman encoding algorithm, calculates at least one
The address of each character field in individual character field.Calculation is corresponding with the calculation of address in step 204, with target character
Exemplified by section, target character section is any one character field, address=(code of target character section-first symbol of target character section
Word)+first symbol address, first symbol is the first symbol of the set of symbols where the target character section.
208th, according to the address of decoding table and each character field, each character field is decoded to obtain initial data.
Decoding table have recorded the corresponding relation between symbol and address, according to the address of character field, it is possible to pass through decoding
Table search symbol corresponding to, and then data message is decoded.
The coding/decoding method that the embodiment of the present disclosure provides, the data message for encoding generation according to Huffman encoding algorithm, directly
Calculate the code word of each symbol and generate code table, only a code table, it is not necessary to code table is separately designed according to different code length, reduced
The resource expended during decoding, meanwhile, because decoding table is according to target data stream calculation, it can adapt to target data
Stream, improve decoding efficiency.
Based on embodiment corresponding to above-mentioned Fig. 1 and Fig. 2, the embodiment of the present disclosure provides a kind of decoding apparatus, for execution
The coding/decoding method described in embodiment corresponding to Fig. 1 and Fig. 2 is stated, as shown in fig. 7, the decoding apparatus 70 includes：Acquisition module
701st, code word module 702, code table module 703 and decoder module 704；
Acquisition module 701, for obtaining target bits stream, target bits stream includes code length information and data message, code length
Code length of the packet containing at least one symbol, data message are that initial data encodes generation according to Huffman encoding algorithm；
Code word module 702, for calculating the code word of each symbol at least one symbol according to code length information；
Code table module 703, for generating decoding table according to the code word of each symbol；
Decoder module 704, for being decoded to obtain initial data to data message according to decoding table.
In one embodiment, as shown in figure 8, code word module 702 includes packet submodule 7021 and calculating sub module
7022；
Submodule 7021 is grouped, at least one symbol is grouped for the code length according at least one symbol, by code
Long identical symbol is divided into one group；
Calculating sub module 7022, for calculating the code word of each group code respectively.
In one embodiment, calculating sub module 7022, for calculating each group of symbol respectively according to normal form Huffman encoding algorithm
The code word of first symbol in number；According to the code word of first symbol in each group code, the code word of each group code is calculated respectively.
In one embodiment, as shown in figure 9, code table module 703 includes address submodule 7031 and mapping submodule
7032；
Address submodule 7031, for determining the address of each symbol in each group code respectively；
Mapping submodule 7032, for generating decoding table according to the address of each symbol.
In one embodiment, address submodule 7031, for determining the address of first symbol in m group codes, m is big
In 0 integer；According to formula Kn=K1+(Pn-P0) calculate except first outer symbol other symbols address, wherein, KnRepresent m
The address of nth symbol, K in group code1Represent the address of first symbol, PnRepresent the code word of nth symbol, P0Represent first
The code word of symbol, n are the integer more than 0.
In one embodiment, as shown in Figure 10, decoder module 704 includes segmentation submodule 7041, character field submodule
7042 and initial data submodule 7043；
Submodule 7041 is segmented, for data message to be divided into at least one character field according to code length information；
Character field submodule 7042, for calculating the address of each character field at least one character field；
Initial data submodule 7043, for the address according to decoding table and each character field, each character field is entered
Row decoding obtains initial data.
The decoding apparatus that the embodiment of the present disclosure provides, the data message for encoding generation according to Huffman encoding algorithm, directly
Calculate the code word of each symbol and generate code table, only a code table, it is not necessary to code table is separately designed according to different code length, reduced
The resource expended during decoding, meanwhile, because decoding table is according to target data stream calculation, it can adapt to target data
Stream, improve decoding efficiency.
Those skilled in the art will readily occur to the disclosure its after considering specification and putting into practice disclosure disclosed herein
Its embodiment.The application is intended to any modification, purposes or the adaptations of the disclosure, these modifications, purposes or
Person's adaptations follow the general principle of the disclosure and including the undocumented common knowledges in the art of the disclosure
Or conventional techniques.Description and embodiments are considered only as exemplary, and the true scope of the disclosure and spirit are by following
Claim is pointed out.
It should be appreciated that the precision architecture that the disclosure is not limited to be described above and is shown in the drawings, and
And various modifications and changes can be being carried out without departing from the scope.The scope of the present disclosure is only limited by appended claim.
Claims (12)
1. a kind of coding/decoding method, it is characterised in that methods described includes：
Target bits stream is obtained, the target bits stream includes code length information and data message, and the code length packet is containing at least
The code length of one symbol, the data message are that initial data encodes generation according to Huffman encoding algorithm；
The code word of each symbol at least one symbol is calculated according to the code length information；
Decoding table is generated according to the code word of each symbol；
The data message is decoded according to the decoding table to obtain the initial data.
2. according to the method for claim 1, it is characterised in that at least one symbol is calculated according to the code length information
In each symbol code word, including：
At least one symbol is grouped according to the code length of at least one symbol, code length identical symbol is divided into
One group；
The code word of each group code is calculated respectively.
3. according to the method for claim 2, it is characterised in that the code word for calculating each group code respectively, including：
Calculate the code word of first symbol in each group code respectively according to normal form Huffman encoding algorithm；
According to the code word of first symbol in each group code, the code word of each group code is calculated respectively.
4. according to the method for claim 2, it is characterised in that the code word according to each symbol generates decoding
Table, including：
The address of each symbol in each group code is determined respectively；
The decoding table is generated according to the address of each symbol.
5. according to the method for claim 4, it is characterised in that determine the ground of each symbol in each group code respectively
Location, including：
The address of first symbol in m group codes is determined, m is the integer more than 0；
According to formula Kn=K1+(Pn-P0) calculate except the first outer symbol other symbols address, wherein, KnDescribed in expression
The address of nth symbol in m group codes, K1Represent the address of the first symbol, PnThe code word of the nth symbol is represented,
P0The code word of the first symbol is represented, n is the integer more than 0.
6. according to the method for claim 4, it is characterised in that described that the data message is carried out according to the decoding table
Decoding obtains the initial data, including：
The data message is divided into by least one character field according to the code length information；
Calculate the address of each character field at least one character field；
According to the address of the decoding table and each character field, each character field is decoded to obtain the original
Beginning data.
7. a kind of decoding apparatus, it is characterised in that the decoding apparatus includes：
Acquisition module, for obtaining target bits stream, the target bits stream includes code length information and data message, the code length
Code length of the packet containing at least one symbol, the data message are that initial data encodes generation according to Huffman encoding algorithm；
Code word module, for calculating the code word of each symbol at least one symbol according to the code length information；
Code table module, for generating decoding table according to the code word of each symbol；
Decoder module, for being decoded to obtain the initial data to the data message according to the decoding table.
8. device according to claim 7, it is characterised in that the code word module includes packet submodule and calculates submodule
Block；
The packet submodule, at least one symbol is grouped for the code length according at least one symbol,
Code length identical symbol is divided into one group；
The calculating sub module, for calculating the code word of each group code respectively.
9. device according to claim 8, it is characterised in that
The calculating sub module, for calculating the code word of first symbol in each group code respectively according to normal form Huffman encoding algorithm；
According to the code word of first symbol in each group code, the code word of each group code is calculated respectively.
10. device according to claim 8, it is characterised in that code table module includes address submodule and mapping submodule；
The address submodule, for determining the address of each symbol in each group code respectively；
The mapping submodule, for generating the decoding table according to the address of each symbol.
11. device according to claim 10, it is characterised in that
The address submodule, for determining the address of first symbol in m group codes, m is the integer more than 0；According to formula Kn
=K1+(Pn-P0) calculate except the first outer symbol other symbols address, wherein, KnRepresent n-th in the m group codes
The address of individual symbol, K1Represent the address of the first symbol, PnRepresent the code word of the nth symbol, P0Represent described first
The code word of symbol, n are the integer more than 0.
12. device according to claim 10, it is characterised in that the decoder module includes segmentation submodule, character field
Submodule and initial data submodule；
The segmentation submodule, for the data message to be divided into at least one character field according to the code length information；
The character field submodule, for calculating the address of each character field at least one character field；
The initial data submodule, for the address according to the decoding table and each character field, to described each
Character field is decoded to obtain the initial data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710893279.4A CN107682018B (en) | 2017-09-28 | 2017-09-28 | Decoding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710893279.4A CN107682018B (en) | 2017-09-28 | 2017-09-28 | Decoding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107682018A true CN107682018A (en) | 2018-02-09 |
| CN107682018B CN107682018B (en) | 2021-06-04 |
Family
ID=61137811
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710893279.4A Active CN107682018B (en) | 2017-09-28 | 2017-09-28 | Decoding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107682018B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1268810A (en) * | 1999-03-30 | 2000-10-04 | 松下电器产业株式会社 | Decoding device |
| CN1889366A (en) * | 2006-07-13 | 2007-01-03 | 浙江大学 | Hafman decoding method |
| CN101022552A (en) * | 2007-03-13 | 2007-08-22 | 北京中星微电子有限公司 | Method and device for realizing Hoffman decodeng |
| CN101051846A (en) * | 2007-05-09 | 2007-10-10 | 上海广电（集团）有限公司中央研究院 | Quick Huffman decoding method based on context |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| CN101741392A (en) * | 2008-11-27 | 2010-06-16 | 安凯（广州）软件技术有限公司 | Huffman decoding method for fast resolving code length |
| US20100149005A1 (en) * | 2008-12-10 | 2010-06-17 | Core Logic, Inc. | Variable length decoding apparatus and method |
| CN102438145A (en) * | 2011-11-22 | 2012-05-02 | 广州中大电讯科技有限公司 | Image lossless compression method on basis of Huffman code |
| JP2012124679A (en) * | 2010-12-07 | 2012-06-28 | Internatl Business Mach Corp <Ibm> | Apparatus and method for decoding encoded data |
| US20120319875A1 (en) * | 2010-05-19 | 2012-12-20 | Hon Hai Precision Industry Co., Ltd. | Method for storing node information of huffman tree and corresponding decoding method |
| US20160077957A1 (en) * | 2014-09-16 | 2016-03-17 | Cisco Technology, Inc. | Decoding techniques using a programmable priority encoder |
-
2017
- 2017-09-28 CN CN201710893279.4A patent/CN107682018B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1268810A (en) * | 1999-03-30 | 2000-10-04 | 松下电器产业株式会社 | Decoding device |
| CN1889366A (en) * | 2006-07-13 | 2007-01-03 | 浙江大学 | Hafman decoding method |
| CN101022552A (en) * | 2007-03-13 | 2007-08-22 | 北京中星微电子有限公司 | Method and device for realizing Hoffman decodeng |
| CN101051846A (en) * | 2007-05-09 | 2007-10-10 | 上海广电（集团）有限公司中央研究院 | Quick Huffman decoding method based on context |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| CN101741392A (en) * | 2008-11-27 | 2010-06-16 | 安凯（广州）软件技术有限公司 | Huffman decoding method for fast resolving code length |
| US20100149005A1 (en) * | 2008-12-10 | 2010-06-17 | Core Logic, Inc. | Variable length decoding apparatus and method |
| US20120319875A1 (en) * | 2010-05-19 | 2012-12-20 | Hon Hai Precision Industry Co., Ltd. | Method for storing node information of huffman tree and corresponding decoding method |
| JP2012124679A (en) * | 2010-12-07 | 2012-06-28 | Internatl Business Mach Corp <Ibm> | Apparatus and method for decoding encoded data |
| CN102438145A (en) * | 2011-11-22 | 2012-05-02 | 广州中大电讯科技有限公司 | Image lossless compression method on basis of Huffman code |
| US20160077957A1 (en) * | 2014-09-16 | 2016-03-17 | Cisco Technology, Inc. | Decoding techniques using a programmable priority encoder |
Non-Patent Citations (2)
| Title |
|---|
| VIDHYAA VG等: ""Huffman Encoding and Decoding algorithm using IJulia"", 《INTERNATIONAL CONFERENCE ON COMMUNICATION AND SIGNAL PROCESSING》 * |
| 锻钢等: ""一种哈夫曼码的编——译码实验设备"", 《河北大学学报（自然科学版）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107682018B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108154167B (en) | Chinese character font similarity calculation method | |
| CN108418683B (en) | Carrier-free text steganography method based on Chinese character structural features | |
| CN107094021A (en) | Data compression | |
| CN107729409A (en) | A kind of short chain delivers a child into method and device | |
| CN107332570B (en) | Polarization code coding method of segmented cascade Hash sequence | |
| CN104850619A (en) | Receipt code generation method and apparatus | |
| CN112016061A (en) | Excel document data protection method based on robust watermarking technology | |
| CN103543980A (en) | Digital data processing method and device | |
| CN104090865B (en) | Text similarity calculation method and device | |
| CN105391514A (en) | Character coding and decoding method and device | |
| EP0304608B1 (en) | Multi-mode dynamic code assignment for data compression | |
| CN112948895A (en) | Data watermark embedding method, watermark tracing method and device | |
| CN111159394A (en) | Text abstract generation method and device | |
| CN107682018A (en) | Coding/decoding method and device | |
| CN113343042A (en) | Data fragment storage method and device, electronic equipment and storage medium | |
| CN111428442A (en) | Data conversion method, system and storage medium without dictionary table | |
| CN104468022A (en) | Transport format combination decoding method and device | |
| CN107609059B (en) | Chinese domain name similarity measurement method based on J-W distance | |
| CN108108267B (en) | Data recovery method and device | |
| CN112612762A (en) | Data processing method and related equipment | |
| US20130222159A1 (en) | Entropy method of binary-ternary lossless data coding | |
| Gagie | Dynamic shannon coding | |
| CN115640585A (en) | Data processing method and device and readable storage medium | |
| CN102832953B (en) | Convolutional code decoder method and device | |
| US20160043736A1 (en) | System and method to concurrently match any type, combination and/or range of characters defined by a regular expression on a hardware implementation using a single detection logic |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |