CN101977061B - Lossless compression and decompression method for general information - Google Patents
Lossless compression and decompression method for general information Download PDFInfo
- Publication number
- CN101977061B CN101977061B CN 201010515469 CN201010515469A CN101977061B CN 101977061 B CN101977061 B CN 101977061B CN 201010515469 CN201010515469 CN 201010515469 CN 201010515469 A CN201010515469 A CN 201010515469A CN 101977061 B CN101977061 B CN 101977061B
- Authority
- CN
- China
- Prior art keywords
- array
- newly
- deposits
- built
- file
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
本发明公开了一种通用信息的无损压缩与解压缩方法。所述的无损压缩方法是通过对被压缩的文件进行特殊的变换和处理得到，与现有技术相比，本发明所述压缩方法不仅可对常见的文件格式数据进行无损压缩，而且对已经经过常用压缩软件压缩过的数据信息也能进一步再压缩，使压缩得到的文件所占用空间更小，可在原有的压缩比的基础上再去除1～80％的冗余(去除的冗余量情况视文件内部数据冗余不同而不同)，而且本发明所述压缩方法算法简单，易于实现。
The invention discloses a method for lossless compression and decompression of general information. The lossless compression method is obtained by performing special transformation and processing on compressed files. Compared with the prior art, the compression method of the present invention can not only perform lossless compression on common file format data, but also The data information compressed by commonly used compression software can also be further recompressed, so that the space occupied by the compressed file is smaller, and 1 to 80% of redundancy can be removed on the basis of the original compression ratio (the amount of redundancy removed (depending on the internal data redundancy of the file is different), and the compression method of the present invention has a simple algorithm and is easy to implement.
Description
Technical field
The present invention relates to a kind of lossless compress and decompression method of data, be specifically related to a kind of lossless compress and decompression method of general information.
Background technology
Lossless compress is to utilize the statistical redundancy of data to compress, and can reply initial data fully and does not cause any distortion.Now, the data volume of various information systems is increasing, how sooner, more, transmission and harmless storage data become the matter of utmost importance of processing data information better, the data lossless compress technique then is the important method that addresses this problem.
The data lossless compress technique is applied to every field already, but compression ratio is the one theory that receives the data statistics redundancy, and the information after the compression of softwares such as at present popular Winzip, Winrar all can not be carried out lossless compress once more.
Summary of the invention
The technical problem that the present invention will solve provide a kind of not only can lossless compress to common file format data, and the compression and the decompression method that also can further recompress the data message that compressed through compressed software commonly used; The shared space of file by compression method compression according to the invention obtains is littler.
For solving the problems of the technologies described above, the present invention adopts following technical scheme:
A kind of lossless compression method of general information, its step is following:
1) read source file with binary mode, the gained binary sequence deposits among the newly-built array A, and first binary code among the array A deposited among the variable a;
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array A " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array A " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array B;
3) the different element that occurs among the statistics array B, the element that these are different deposits among the newly-built array C by the order that occurs;
4) element among the array C is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
5) use digital n to replace n element value among the array D, institute's calling sequence deposits among the newly-built array E;
6) with element among element among the array D and the array E according to one to one the relation, elements all among the array B is replaced, institute's calling sequence deposits among the newly-built array F;
7) all elements among the array F is done the above-mentioned the 2nd) inverse transformation of step, wherein first code among the array F is the code of being deposited among the variable a, the binary code sequence after the inverse transformation deposits among the newly-built array G;
8) element among the array D being carried out " consequent deduct adjacent preceding paragraph " handles; The result deposits among the newly-built array H; Seek among the array H first more than or equal to 2 element position; If the position of this element in array H is n, preceding n element among the array D all to be deleted, remaining order of elements deposits among the newly-built array I;
9) preserving array I and G is binary file, and this binary file is the file after the source file lossless compress.
Wherein:
In the step 5), digital n begins counting with 1.
In the step 8), element position n begins counting with 1.
In the step 1), said source file can be the data message that uncompressed software compressed, and promptly common file format data can also be through PAQ, winrk, Winzip, the data message that compression such as winrar software compressed.
The decompression method of general information of the present invention, its step is following:
1) reads binary sequence among the array G in the file after the compression, first binary code among the array G deposited among the variable g;
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array G " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array G " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array F;
3) the different element that occurs among the statistics array F, the element that these are different deposits among the newly-built array E by the order that occurs;
4) element among the array E is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
5) read array I in the file after the compression, establish total i element among the array I, the element among i the element use in back among the array D array I is replaced, the sequence after the replacement deposits among the newly-built array C;
6) with element among element among the array D and the array C according to one to one the relation, elements all among the array F is replaced, institute's calling sequence deposits among the newly-built array B;
7) all elements among the array B is done the above-mentioned the 2nd) inverse transformation of step; Wherein first code among the array B is the code of being deposited among the variable g; Binary code sequence after the inverse transformation deposits among the newly-built array A, and A saves as file with array, and this document is source file.
Compared with prior art; Compression method according to the invention not only can carry out lossless compress to common file format data; And also can further recompress the data message that compress through compressed software commonly used, the shared space of file that compression is obtained is littler, can on the basis of original compression ratio, remove 1～80% redundancy (the amount of redundancy situation of removal is looked the redundant difference of file internal data and difference) again; And compression method algorithm according to the invention is simple, is easy to realize.
Description of drawings
Fig. 1 is for carrying out the flow chart of lossless compress to source file;
The flow chart of Fig. 2 for compressed file is decompressed.
Label is among the figure:
101, read source file with binary mode, the gained binary sequence deposits among the newly-built array A, and first binary code among the array A deposited among the variable a;
102, with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array A " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array A " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array B;
103, the different element that occurs among the statistics array B, the element that these are different deposits among the newly-built array C by the order that occurs;
104, the element among the array C is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
105, use digital n to replace n element value among the array D, institute's calling sequence deposits among the newly-built array E;
106, with element among element among the array D and the array E according to one to one the relation, elements all among the array B is replaced, institute's calling sequence deposits among the newly-built array F;
107, all elements among the array F is done the above-mentioned the 2nd) inverse transformation of step, wherein first code among the array F is the code of being deposited among the variable a, the binary code sequence after the inverse transformation deposits among the newly-built array G;
108, element among the array D being carried out " consequent deduct adjacent preceding paragraph " handles; The result deposits among the newly-built array H; Seek among the array H first more than or equal to 2 element position; If the position of this element in array H is n, preceding n element among the array D all to be deleted, remaining order of elements deposits among the newly-built array I;
109, preserving array I and G is binary file, and this binary file is the file after the source file lossless compress.
201, read binary sequence among the array G in the file after the compression, first binary code among the array G deposited among the variable g;
202, with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array G " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array G " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array F;
203, the different element that occurs among the statistics array F, the element that these are different deposits among the newly-built array E by the order that occurs;
204, the element among the array E is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
205, read array I in the file after the compression, establish total i element among the array I, the element among i the element use in back among the array D array I is replaced, the sequence after the replacement deposits among the newly-built array C;
206, with element among element among the array D and the array C according to one to one the relation, elements all among the array F is replaced, institute's calling sequence deposits among the newly-built array B;
207, all elements among the array B is done the above-mentioned the 2nd) inverse transformation of step; Wherein first code among the array B is the code of being deposited among the variable g; Binary code sequence after the inverse transformation deposits among the newly-built array A, and A saves as file with array, and this document is source file.
Embodiment
Fig. 1 carries out the flow chart of lossless compress to source file for compression method according to the invention.As shown in Figure 1, the step of compression is: the file to compressing is read with binary mode, and the gained binary sequence deposits among the newly-built array A, and first binary code among the array A deposited among the variable a (step 101); With all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array A " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array A " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array B (step 102); Add up the different element that occurs among the array B then, the element that these are different deposits among the newly-built array C (step 103) by the order that occurs; By ascending sort, the sequence after the ordering deposits among the newly-built array D (step 104) with the element among the array C; Use digital n to replace n element value among the array D again, institute's calling sequence deposits among the newly-built array E, and wherein digital n begins counting (step 105) with 1; Afterwards, with element among element among the array D and the array E according to one to one the relation, elements all among the array B is replaced, institute's calling sequence deposits among the newly-built array F (step 106); All elements among the array F is done the above-mentioned the 2nd) inverse transformation of step, wherein first code among the array F is the code of being deposited among the variable a, the binary code sequence after the inverse transformation deposits among the newly-built array G (step 107); At last; Element among the array D is carried out " consequent deduct adjacent preceding paragraph " and handle, the result deposits among the newly-built array H, seeks among the array H first more than or equal to 2 element position; If the position of this element in array H is n; Preceding n element among the array D all deleted, and remaining order of elements deposits among the newly-built array I, and said element position n begins counting (step 108) with 1; Preserve array I and G, array I and G are the file (step 109) after the source file lossless compress.
Fig. 2 is for to the flow chart that decompresses of file through compression, and as shown in Figure 2, the step of decompression is: read the binary sequence among the array G in the file after the compression, first binary code among the array G deposited among the variable g (step 201); With all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array G " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array G " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array F (step 202); Then add up the different element that occurs among the array F, the element that these are different deposits among the newly-built array E (step 203) by the order that occurs; Then, by ascending sort, the sequence after the ordering deposits among the newly-built array D (step 204) with the element among the array E; Read the array I in the file after the compression, establish total i element among the array I, the element among i the element use in back among the array D array I is replaced, the sequence after the replacement deposits among the newly-built array C (step 205); Afterwards, with element among element among the array D and the array C according to one to one the relation, elements all among the array F is replaced, institute's calling sequence deposits among the newly-built array B (step 206); At last all elements among the array B is done the above-mentioned the 2nd) inverse transformation of step; Wherein first code among the array B is the code of being deposited among the variable g; Binary code sequence after the inverse transformation deposits among the newly-built array A, and A saves as file with array, and this document is source file (step 207).
The present invention will be described with instance below.
Suppose the file W that certain will compress,
One, the lossless compress process of above-mentioned W file is following:
1) binary code that reads out with binary mode:
A＝｛001001011101001100000111010111110｝，a=0；
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array A " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array A " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array B;
B＝{21211311225311151｝；
3) the different element that occurs among the statistics array B, the element that these are different deposits among the newly-built array C by the order that occurs;
C＝｛2135｝，
4) element among the array C is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
D＝｛1235｝；
5) use digital n to replace n element value among the array D, institute's calling sequence deposits among the newly-built array E;
E＝｛1234｝；
6) with element among element among the array D and the array E according to one to one the relation, elements all among the array B is replaced, institute's calling sequence deposits among the newly-built array F;
F＝｛21211311224311141｝；
7) all elements among the array F is done the above-mentioned the 2nd) inverse transformation of step, wherein first code among the array F is the code of being deposited among the variable a, the binary code sequence after the inverse transformation deposits among the newly-built array G;
G＝｛0010010111010011000011101011110｝；
8) element among the array D being carried out " consequent deduct adjacent preceding paragraph " handles; The result deposits among the newly-built array H; Seek among the array H first more than or equal to 2 element position; If the position of this element in array H is n, preceding n element among the array D all to be deleted, remaining order of elements deposits among the newly-built array I;
H＝｛112｝，I＝｛5｝；
9) preserving array I and G is binary file, and this binary file is the file after the source file lossless compress.
Analyze: relatively array A and array G can find out that array G is than having lacked 2 binary codes among the array A, and promptly array G is than lacking the space that has accounted for 2 bits among the array A.The length of source file sequence A is 33 bits in this example, the length of compression back file sequence G is 31 bits, and meaning is that this algorithm has been removed among the A 6% redundant data, has saved 6% memory space.
Two, the decompression procedure of the W file after the compression:
1) read the binary sequence among the array G in the file after the compression:
G＝｛0010010111010011000011101011110｝,g＝0；
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array G " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array G " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array F;
F＝｛21211311224311141｝；
3) the different element that occurs among the statistics array F, the element that these are different deposits among the newly-built array E by the order that occurs;
E＝｛2134｝；
4) element among the array E is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
D＝｛1234｝；
5) read array I in the file after the compression, establish total i element among the array I, the element among i the element use in back among the array D array I is replaced, the sequence after the replacement deposits among the newly-built array C;
I＝｛5｝，i＝1，C＝｛1235｝；
6) with element among element among the array D and the array C according to one to one the relation, elements all among the array F is replaced, institute's calling sequence deposits among the newly-built array B;
B＝｛21211311225311151｝；
7) all elements among the array B is done the above-mentioned the 2nd) inverse transformation of step; Wherein first code among the array B is the code of being deposited among the variable g; Binary code sequence after the inverse transformation deposits among the newly-built array A, and A saves as file with array, and this document is source file;
A＝｛001001011101001100000111010111110｝。
Claims (5)
1. the lossless compression method of a general information, its step is following:
1) read source file with binary mode, the gained binary sequence deposits among the newly-built array A, and first binary code among the array A deposited among the variable a;
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array A " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array A " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array B;
3) the different element that occurs among the statistics array B, the element that these are different deposits among the newly-built array C by the order that occurs;
4) element among the array C is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
5) use digital n to replace n element value among the array D, institute's calling sequence deposits among the newly-built array E;
6) with element among element among the array D and the array E according to one to one the relation, elements all among the array B is replaced, institute's calling sequence deposits among the newly-built array F;
7) all elements among the array F is done the above-mentioned the 2nd) inverse transformation of step, wherein first code among the array F is the code of being deposited among the variable a, the binary code sequence after the inverse transformation deposits among the newly-built array G;
8) element among the array D being carried out " consequent deduct adjacent preceding paragraph " handles; The result deposits among the newly-built array H; Seek among the array H first more than or equal to 2 element position; If the position of this element in array H is n, preceding n element among the array D all to be deleted, remaining order of elements deposits among the newly-built array I;
9) preserving array I and G is binary file, and this binary file is the file after the source file lossless compress.
2. the lossless compression method of general information according to claim 1 is characterized in that: in the step 5), digital n begins counting with 1.
3. the lossless compression method of general information according to claim 1 is characterized in that: in the step 8), element position n begins counting with 1.
4. according to the lossless compression method of claim 1,2 or 3 described general informations, it is characterized in that: in the step 1), the data message that said source file compressed for uncompressed software, or the data message that compressed through compressed software.
5. the decompression method of a general information, its step is following:
1) reads binary sequence among the array G in the file after the compression, first binary code among the array G deposited among the variable g;
2) with all " 0 " that occurred in the length replacement of " continue 0 be 1 until next bit " among the array G " continue 0 be 1 until next bit "; With all " 1 " that occurred in the length replacement of " continue 1 be 0 until next bit " among the array G " continue 1 be 0 until next bit ", institute's calling sequence deposits among the newly-built array F;
3) the different element that occurs among the statistics array F, the element that these are different deposits among the newly-built array E by the order that occurs;
4) element among the array E is pressed ascending sort, the sequence after the ordering deposits among the newly-built array D;
5) read array I in the file after the compression, establish total i element among the array I, the element among i the element use in back among the array D array I is replaced, the sequence after the replacement deposits among the newly-built array C;
6) with element among element among the array D and the array C according to one to one the relation, elements all among the array F is replaced, institute's calling sequence deposits among the newly-built array B;
7) all elements among the array B is done the above-mentioned the 2nd) inverse transformation of step; Wherein first code among the array B is the code of being deposited among the variable g; Binary code sequence after the inverse transformation deposits among the newly-built array A, and A saves as file with array, and this document is source file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010515469 CN101977061B (en) | 2010-10-19 | 2010-10-19 | Lossless compression and decompression method for general information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010515469 CN101977061B (en) | 2010-10-19 | 2010-10-19 | Lossless compression and decompression method for general information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101977061A CN101977061A (en) | 2011-02-16 |
| CN101977061B true CN101977061B (en) | 2012-12-26 |
Family
ID=43576914
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010515469 Expired - Fee Related CN101977061B (en) | 2010-10-19 | 2010-10-19 | Lossless compression and decompression method for general information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101977061B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104216890A (en) * | 2013-05-30 | 2014-12-17 | 北京赛科世纪数码科技有限公司 | Method and system for compressing ELF file |
| CN103546161A (en) * | 2013-10-31 | 2014-01-29 | 江苏引跑网络科技有限公司 | Lossless compression method based on binary processing |
| CN105022788A (en) * | 2015-06-19 | 2015-11-04 | 江苏新通达电子科技股份有限公司 | Lossless compression algorithm for bin file in PNG picture format and full liquid crystal instrument display system |
| CN105337617B (en) * | 2015-12-09 | 2018-10-26 | 浙江维融电子科技股份有限公司 | A kind of FSN files high-efficiency compression method |
| CN106909398B (en) * | 2017-03-10 | 2020-10-16 | 深圳创维－Rgb电子有限公司 | Compression method and device for executable file |
| CN109039343A (en) * | 2017-06-12 | 2018-12-18 | 吕志强 | Calculating formula binary data invertibity compression method |
| CN109510998B (en) * | 2018-12-21 | 2019-10-08 | 南京理工大学 | How to get uncompressed webcam raw data |
| US10630312B1 (en) | 2019-01-31 | 2020-04-21 | International Business Machines Corporation | General-purpose processor instruction to perform compression/decompression operations |
| US10831497B2 (en) | 2019-01-31 | 2020-11-10 | International Business Machines Corporation | Compression/decompression instruction specifying a history buffer to be used in the compression/decompression of data |
| CN112230032A (en) * | 2020-08-03 | 2021-01-15 | 青岛鼎信通讯股份有限公司 | Electric energy meter data compression and decompression method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1682448A (en) * | 2002-07-12 | 2005-10-12 | 斯利普斯特里姆数据公司 | Method for lossless data compression using greedy sequential context-dependent grammar transform |
| CN101795407A (en) * | 2009-01-30 | 2010-08-04 | 汤姆森许可贸易公司 | Method and device for encoding a bit sequence |
| CN101807924A (en) * | 2010-03-17 | 2010-08-18 | 黄斐芝 | Method for carrying out lossless coding compression on binary data |
-
2010
- 2010-10-19 CN CN 201010515469 patent/CN101977061B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1682448A (en) * | 2002-07-12 | 2005-10-12 | 斯利普斯特里姆数据公司 | Method for lossless data compression using greedy sequential context-dependent grammar transform |
| CN101795407A (en) * | 2009-01-30 | 2010-08-04 | 汤姆森许可贸易公司 | Method and device for encoding a bit sequence |
| CN101807924A (en) * | 2010-03-17 | 2010-08-18 | 黄斐芝 | Method for carrying out lossless coding compression on binary data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101977061A (en) | 2011-02-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101977061B (en) | Lossless compression and decompression method for general information | |
| CN107506153B (en) | Data compression method, data decompression method and related system | |
| KR101841103B1 (en) | Vlsi efficient huffman encoding apparatus and method | |
| CN103152430B (en) | A kind of reduce the cloud storage method that data take up room | |
| US20130307709A1 (en) | Efficient techniques for aligned fixed-length compression | |
| US20090245382A1 (en) | Method and apparatus for data compression and decompression | |
| US20130179413A1 (en) | Compressed Distributed Storage Systems And Methods For Providing Same | |
| CN103685589A (en) | Binary coding-based domain name system (DNS) data compression and decompression methods and systems | |
| US10666289B1 (en) | Data compression using dictionary encoding | |
| US10303402B2 (en) | Data compression using partial statistics | |
| CN103729429A (en) | A Compression Method Based on HBase | |
| JP2017073615A (en) | Encoding program, encoding method, encoder, decoding program, decoding method and decoder | |
| CN104811209B (en) | A kind of the compressed file data embedding method and device of anti-most long matching detection | |
| US9088297B2 (en) | High throughput decoding of variable length data symbols | |
| CN113765620A (en) | Block compression coding method, apparatus, computer equipment and readable storage medium | |
| CN110413580A (en) | Compression method, system and device for FPGA configuration stream | |
| JP5472610B2 (en) | Method and apparatus for encoding / decoding numeric data string | |
| CN105337617A (en) | Method for efficiently compressing full service network (FSN) files | |
| JP5492103B2 (en) | Backup apparatus, backup method, data compression method, backup program, and data compression program | |
| WO2014000443A1 (en) | Image data compression and decompression method and device | |
| KR20200121761A (en) | Using predicates in conditional transcoder for column store | |
| Konecki et al. | Efficiency of lossless data compression | |
| JP2010079535A (en) | Data access device | |
| CN108932315A (en) | A kind of method and relevant apparatus of data decompression | |
| CN103138766A (en) | Method and device of compression and decompression of 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121226 Termination date: 20171019 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |