CN102651653B - Low-complexity joint source-channel encoding and decoding method based on space lattice diagram - Google Patents
Low-complexity joint source-channel encoding and decoding method based on space lattice diagram Download PDFInfo
- Publication number
- CN102651653B CN102651653B CN201110047094.4A CN201110047094A CN102651653B CN 102651653 B CN102651653 B CN 102651653B CN 201110047094 A CN201110047094 A CN 201110047094A CN 102651653 B CN102651653 B CN 102651653B
- Authority
- CN
- China
- Prior art keywords
- symbol
- accumulative
- decoding
- source
- variable length
- 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
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to a low-complexity joint source-channel encoding and decoding method based on a space lattice diagram. In a low-complexity joint source-channel encoding and decoding system based on the space lattice diagram, each symbol in an information source assembly is endowed with a weight (named a symbol weight) in probability correlation with the symbol. At the encoding end, the symbol sequence has three constraint values, namely an accumulated symbol number, an accumulated bit number and an accumulated symbol weight, after being subjected to variable-length encoding. At the decoding end, the three constraint values are utilized to construct the space lattice diagram, the three-dimensional coordinates of the space lattice diagram respectively signify 'symbol number index', 'bit status index' and 'weight status index'. A redundant status transfer path on the space lattice diagram is removed firstly, then status nodes and status transfer branches on the space lattice diagram are projected on a two-dimensional plane to generate a simplified variable-length information source code lattice diagram, and the symbol-level maximum posterior probability decoding algorithm is adopted to realize the low-complexity joint source-channel encoding and decoding method.
Description
Technical field
The present invention relates to a kind of combined signal source channel decoding method of communication codec domain, particularly relate to a kind of low-complexity joint message source and channel decoding method based on space networks trrellis diagram.
Background technology
In current communication system, generally all follow " separation theorem " (Separation Theory) of Shannon, by source coding and channel coding independently optimal design, communication system can be made to obtain forced coding performance.But the prerequisite of " separation theorem " is: no matter message sink coding, or chnnel coding, assuming that the time delay (allow coding block length unlimited) of endless can be tolerated; Grasp the statistical property of transmission channel in advance.In reality, the constraint such as the complexity of encoding and decoding, the resource of software and hardware and communication delay makes practical communication system cannot meet this condition, and source coding and channel coding cannot obtain optimum code performance respectively, and therefore the performance of piece-rate system is restricted.
For this reason, there has been proposed combined signal source channel decoding method, its main thought is that redundant information residual in code word after utilizing message sink coding carries out chnnel coding, by signal source and channel combined design.
In recent years, the combined optimization design problem that information source Variable Length Code and channel Turbo encode becomes the focus of coding circle research, scholars propose several combined signal source channel Turbo code decode algorithm, but existing algorithm is all carry out decoding based on the grid chart of bit-level.Bit-level grid chart decoding algorithm can not make full use of the residue redundancy properties of information source variable-length encoding, can not reach optimum encoding efficiency, adopts variable-length symbol incompatible with existing image and video source coding standard simultaneously.In this grid chart, survivor path is many, needs successive ignition for obtaining good interference free performance, and decoding end amount of calculation is large, and complexity is high.In fact, according to forced coding theorem, the binary sequence that information source variable length encoder exports is by several Variable Length Codes VLC (VariableLength Coding, be called for short VLC) code-word symbol cascade composition, using VLC code-word symbol as the processing unit of channel decoding, more meet the variable-length coding method of information source, integrated source and channel variable-length decoding can be realized, improve coding and decoding performance.
Summary of the invention
In order to solve the problem that in traditional elongated source code plane net trrellis diagram, state transitions branch is many, computation complexity is high, the present invention is by building a kind of new variable-length symbol grid chart and coding and decoding structure, propose a kind of low-complexity joint message source and channel decoding method based on space networks trrellis diagram, the method devises a kind of building method of space networks trrellis diagram and corresponding decoding method.
The technical solution adopted for the present invention to solve the technical problems is: based in the low-complexity joint message source and channel coding/decoding system of space networks trrellis diagram, give a symbol weight relevant to this symbol probability to each symbol in information source set, be called " symbol weight ".At coding side, symbol sebolic addressing has after Variable Length Code " accumulative symbolic number ", " accumulative bit number " and " accumulative symbol weight " three binding occurrences, this three binding occurrence structure space networks trrellis diagrams are utilized in decoding end, according to space networks trrellis diagram, symbolization level maximum a posteriori probability decoding algorithm, realizes low-complexity joint message source and channel decoding method.The three-dimensional coordinate of space networks trrellis diagram represents " accumulative symbolic number index ", " accumulative bit number index " and " accumulative symbol weight index " respectively.First the redundant state transfer path in space networks trrellis diagram is removed, again the state node in space networks trrellis diagram and state transitions branch are projected on the two dimensional surface of " accumulative symbolic number index " and " accumulative bit number index ", keep the transfer relationship in figure between state node constant, generate the variable length source code grid chart simplified, according to the variable length source code grid chart simplified, symbolization level maximum a posteriori probability decoding algorithm, realizes combined signal source channel decoding.
Relative to plane net trrellis diagram, space networks trrellis diagram is that each symbol imparts weighted value, and for decoding end adds a constraints when building grid chart, this makes the state transitions branch in grid chart reduce.Preferably " symbol weight " arranges and can simplify elongated source code grid chart largely, and then reduce complexity and the error sign ratio of elongated symbol level maximum a posteriori probability decoding algorithm largely, preferably symbol weight setting can be obtained by testing the distinct symbols sequence from same information source set.
Variable length Turbo code associating coding/decoding system and variable length code can be applied in based on the low-complexity joint message source and channel decoding method of space networks trrellis diagram to be separated with convolution code and to encode, in the system of combined decoding.
The invention has the beneficial effects as follows, space networks trrellis diagram is built by giving a symbol weight relevant to this symbol probability to each symbol in information source set, state transitions numbers of branches in the variable length source code grid chart used when decreasing the decoding of symbol level maximum a posteriori probability, thus decrease the amount of calculation of symbol level maximum a posteriori probability decoding, reduce error sign ratio simultaneously, improve combined signal source channel encoding and decoding performance, be applicable to the variable length such as image, video compression encoding and decoding transmission system.
Accompanying drawing explanation
Fig. 1 is based on the low-complexity joint message source and channel coding/decoding system of space networks trrellis diagram.
In Fig. 1,1. Variable Length Code module, 2. symbol sebolic addressing side information computing module, 3. joint source-channel coding module, 4. channel, 5. based on the combined signal source channel decoding module of space networks trrellis diagram, 6. source symbol sequence U, 7. Variable Length Code output code flow, 8. symbol sebolic addressing side information, 9. joint source-channel coding output code flow, the 10. codeword sequence that receives of decoding end, 11. symbol sebolic addressings obtained after combined signal source channel decoding are estimated
Fig. 2 is based on the low-complexity joint signal source channel decoding method flow diagram of space networks trrellis diagram.
Fig. 2 is the refinement of module 5 in Fig. 1.In Fig. 2, the 10. codeword sequence that receives of decoding end, 11. symbol sebolic addressings obtained after combined signal source channel decoding are estimated
12. according to side information structure space networks trrellis diagram, the elongated source code grid chart that 13. structures simplify, 14. symbol level maximum a posteriori probability combined signal source channel decodings.
Fig. 3 space networks trrellis diagram.
In Fig. 3,15. represent Z coordinate " accumulative bit number index v "; 16. represent Y-coordinate " accumulative symbol weight index w "; 17. represent X-coordinate " accumulative symbolic number index k ", and each scale represents a symbol time interval, and in figure, black circles represents state node, and the line segment between state node represents possible state transitions; 18. represent grid chart initial condition (k=0, v
0=0, w
0=0); 20,21,22,23,24 five possible state transitions branches (this figure is the example of space networks trrellis diagram, and information source set used and parameter thereof are in table 1) when representing k=0; 29,30,31,32 intermediateness node is expressed as; 19. represent grid chart state of termination (k=5, v
5=5, w
5=7); The symbol sebolic addressing path of the survival that 20,25,26,27,28 expression one is complete in figure, show from the initial condition 18 of grid chart, the symbol of encoding in information source set successively arrives the state of termination 19 of grid chart through intermediateness node 29,30,31,32.
Table 1 variable length code word and symbol weighted value table
The elongated source code grid chart that Fig. 4 simplifies.
Fig. 4 is the elongated source code grid chart simplified, and is projected in XZ plane obtain by Fig. 3.Wherein, 17. represent abscissa " accumulative symbolic number index k ", and each scale represents a symbol time interval; 33. represent ordinate " accumulative bit number index v ", in corresponding diagram 3 15.Black circles in figure represents state node, and the line segment between state node represents possible state transitions; 34. represent the initial condition (k=0, the v that represent grid chart
0=0), 18 in corresponding diagram 3; 36,37,38,39,40 represent five bar state transfer branch, respectively 20,21,22,23,24 in the corresponding diagram 3 as k=0 respectively; State of termination (k=5, the v of 35. expression grid charts
5=5), 19 in corresponding diagram 3.The symbol sebolic addressing path of the survival that 36,41,42,43,44 expression one is complete in figure, show from the initial condition 34 of grid chart, the symbol of encoding in information source set successively arrives the state of termination 35 of grid chart through intermediateness node 45,46,47,48.36,20,25,26,27,28 in 41,42,43,44 difference corresponding diagram 3.In 45,46,47,48 difference corresponding diagram 3 29,30,31,32.
Embodiment
1. based on the low-complexity joint message source and channel coding/decoding system of space networks trrellis diagram
Based on space networks trrellis diagram low-complexity joint message source and channel coding/decoding system as shown in Figure 1.
First, source symbol sequence 6 enters in Variable Length Code module 1 and symbol sebolic addressing side information computing module 2 simultaneously, in Variable Length Code module 1, carries out Variable Length Code, exports Variable Length Code code stream 7; " adding up symbolic number K, " accumulative bit number N " and " accumulative symbol weights W ", these three values exported as side information 8 in symbol sebolic addressing side information computing module 2 compute sign sequence.Again Variable Length Code code stream 7 is sent into together with symbol sebolic addressing side information 8 joint source-channel coding module 3 to encode, finally the code stream 9 that joint source-channel coding module 3 exports is sent to channel 4.The combined signal source channel decoding module 5 that the codeword sequence 10 received is sent into based on space networks trrellis diagram is decoded by decoding end, finally obtains symbol sebolic addressing and estimates
2. based on the low-complexity joint signal source and channel new method of space networks trrellis diagram
In Fig. 1, source symbol sequence 6 enters in Variable Length Code module 1 and obtains Variable Length Code code stream 7, simultaneously the side information of module 2 compute sign sequence 6.
The function of side information computing module 2 is cumulative sums (namely " adding up symbol weights W ") of the bit number (i.e. " accumulative bit number N ") that contains of the stream packet after compute sign sequence 6 comprises symbol numbers (i.e. " accumulative symbolic number K "), variable-length encoding and symbol weight.The computational methods of side information computing module 2 are as follows: before coding source symbol sequence 6, the initial value of " accumulative symbolic number ", " accumulative bit number " and " accumulative symbol weight " is all set to 0, a symbol (source symbol set is in table 1) of then often encoding in source symbol sequence 6, " accumulative symbolic number " adds 1, and " accumulative bit number " adds the variable length code word length l that this symbol is corresponding
i(relevant reference value is in table 1), " accumulative symbol weight " adds the symbol weight w that this symbol is corresponding
i.The rest may be inferred, when after each symbol in source symbol sequence 6 of having encoded, obtains final " accumulative symbolic number K ", " accumulative bit number N " and " accumulative symbol weights W ".Then, variable length code stream is sent in joint source-channel coding module 3 together with side information 8 and encodes, finally the code stream 9 after coding is sent to channel 4.
3. based on the low-complexity joint signal source channel decoding new method of space networks trrellis diagram
As shown in Figure 1, decoding end by the codeword sequence 10 received the low-complexity joint signal source channel decoding module 5 sent into based on space networks trrellis diagram decode.Fig. 2 is the low-complexity joint signal source channel decoding method flow diagram based on space networks trrellis diagram, is the refinement of module 5 in Fig. 1.As shown in Figure 2, module 12 utilizes the side information in codeword sequence 10 " accumulative symbolic number K ", " accumulative bit number N " and " accumulative symbol weights W " three binding occurrence structure space networks trrellis diagrams, and three coordinates of space networks trrellis diagram represent " accumulative symbolic number index k ", " accumulative bit index v " and " accumulative symbol weight index w " (wherein respectively as shown in Figure 3
for " bit number index ", l
minfor the minimum code word length in variable length code table, each parameter meaning is see table 1), K bar defines a complete symbol sebolic addressing path by the state transitions branch that symbol time order is connected, all symbol sebolic addressing paths are from initial point, the state transitions of a possible state node, as from (k-1, w
k-1, v
k-1) to (k, w
k, v
k) an all corresponding code word size is (l
i=v
k-v
k-1) and symbol weighted value is (w
i=w
k-w
k-1) variable length code word.The side information " accumulative symbolic number K " of codeword sequence, " accumulative bit number N " (then accumulative bit status V=N-K × l
min) and " accumulative symbol weights W " determine space lattice sink of graph, final all symbol sebolic addressing paths all will converge to this point, and all symbol sebolic addressing paths not meeting three-dimensional constraining condition all will be excluded outside space networks trrellis diagram.Then the state node in space networks trrellis diagram and state transitions branch project on " accumulative symbolic number index " and " accumulative bit number index " two dimensional surface by module 13, form the variable length source code grid chart simplified, module 14 carries out symbol level maximum a posteriori probability combined signal source channel decoding according to this grid chart, obtains the estimated sequence 11 of source symbol sequence.
4. the construction process of space networks trrellis diagram
In Fig. 2, to construct the process of space networks trrellis diagram as follows for module 12: when the symbol moment is 0, only have initial point to be effective status node.From initial point, in each symbol moment, for each state node in this moment, travel through all variable length code words, generate the state transitions branch of this state node to subsequent time, thus obtain all possible state nodes of subsequent time, and only retain " accumulative bit number index " coordinate figure in each moment and be not more than V (V=N-K × l
min), " accumulative symbol weight index " coordinate figure is not more than the state node of W, and the up-to symbol moment is K.Then backward traversal grid chart from the K moment, delete and allly cannot to reach home (K through state transitions branch transition, W, V) state node and when being less than a certain symbol moment of K, without the state node of state transitions branch transferring to subsequent time, and the state transitions branch be connected with these disarmed state nodes, can obtain starting point is initial point, terminal is the space networks trrellis diagram of (K, W, V).
The variable length code word that in table 2 Fig. 3, information source set uses and symbol weighted value table
Fig. 3 is the example of a space networks trrellis diagram, wherein Z coordinate 15 represents " accumulative bit number index v ", Y-coordinate 16 represents " accumulative symbol weight index w ", X-coordinate 17 represents " accumulative symbolic number index k ", the source symbol set that this grid chart is corresponding comprises 12 different symbols altogether, and the symbol weighted value of these 12 symbol corresponding variable length code word lengths and imparting is as shown in table 2.
Space lattice figure shown in Fig. 3 illustrates encoded K=5 symbol, " accumulative bit number " N=10 (then accumulative bit status V=N-K × l after Variable Length Code
min=5), the example of " accumulative symbol weight " W=7.State transitions (k-1, the w of a possible state node
k-1, v
k-1→ k, w
k, v
k) a corresponding code word size is (l
i=v
k-v
k-1) and weighted value is (w
i=w
k-w
k-1) variable length code word C
k, C
k∈ { C (0), C (1), C (2), C (3), C (4), C (5), C (6), C (7), C (8), C (9), C (10), C (11) }.Symbol sebolic addressing path in all grid charts is by initial condition 18 (k=0, w
0=0, v
0=0) set out, converge at state of termination 19 (k=5, w
5=7, v
5=5).State transitions branch in grid chart and the code word one_to_one corresponding in variable length code table.Such as, during k=0 institute likely code word be 20.C (5), 21.C (2), 22.C (3), 23.C (1), 24.C (0).
Symbol sebolic addressing path forming process in Fig. 3 is as follows: after decoding end receives symbol sebolic addressing side information (encoded K=5 symbol, accumulative bit number N=10 i.e. accumulative bit number V=5, accumulative symbol weights W=7), determine state of termination 19 (k=5, the w of space networks trrellis diagram
5=7, v
5=5) the symbol sebolic addressing path of the survival, in space networks trrellis diagram is all from initial condition 18 (k=0, w
0=0, v
0=0) set out.Symbol sebolic addressing path for a wherein survival: from space networks trrellis diagram initial condition 18, to encode a symbol " 5 ", accumulative symbolic number (adding 1) becomes 1, accumulative bit number (adding 2) becomes 2, accumulative symbol weight (adding 4) becomes 4, state node transfers to 29 (k=1, w
1=4, v
1=2), similarly, in succession coded identification " 3 " " 1 " " 0 " " 0 ", the transfer case of state node is as follows: 30 (k=2, w
2=6, v
2=4), 31 (k=3, w
3=7, v
3=5), 32 (k=4, w
4=7, v
4=5), 19 (k=5, w
5=7, v
5=5).All symbol sebolic addressing paths meeting three binding occurrences all should occur in figure 3, ungratified, there will not be in figure 3.
Fig. 4 illustrates the elongated source code grid chart space networks trrellis diagram of Fig. 3 being projected to and the plane at " accumulative symbolic number index " 17 and " accumulative bit number index " 15 places is simplified, corresponding with Fig. 3, initial condition (k=0, the v in the symbol sebolic addressing path of all survivals of 34 expression
0=0), 19 represent state of termination (k=5, v
5=5), 20 ~ 24 represent k=0 time institute likely code word, wherein 20.C (5), 21.C (2), 22.C (3), 23.C (1), 24.C (0) respectively.State node (k, w during projection in Fig. 3
k, v
k) convert state node (k, v in Fig. 4 to
k), the transfer relationship in two figure between state node remains unchanged, and as in figure 3, state node 29 transfers to state node 30 through 25, and this relation still remains unchanged in the diagram.
Claims (2)
1. the low-complexity joint message source and channel decoding method based on space networks trrellis diagram, it is characterized in that: in symbol level variable length code combined signal source channel coding/decoding system, a symbol weight relevant to this symbol probability is given to each symbol in information source set, at coding side, symbol sebolic addressing has accumulative symbolic number after Variable Length Code, accumulative bit number and accumulative symbol weight three binding occurrences, this three binding occurrence structure space networks trrellis diagrams are utilized in decoding end, the three-dimensional coordinate of space networks trrellis diagram represents accumulative symbolic number index respectively, accumulative bit number index and accumulative symbol weight index, first the redundant state transfer path in space networks trrellis diagram is removed, again the state node in space networks trrellis diagram and state transitions branch are projected on the two dimensional surface of accumulative symbolic number index and accumulative bit number index, keep the transfer relationship in figure between state node constant, generate the variable length source code grid chart simplified, according to the variable length source code grid chart simplified, symbolization level maximum a posteriori probability decoding algorithm, realize low-complexity joint signal source channel decoding method.
2. the low-complexity joint message source and channel decoding method based on space networks trrellis diagram according to claim 1, is further characterized in that: be applied in variable length Turbo code associating coding/decoding system and variable length code and be separated with convolution code and encode, in the system of combined decoding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110047094.4A CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110047094.4A CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102651653A CN102651653A (en) | 2012-08-29 |
| CN102651653B true CN102651653B (en) | 2015-07-15 |
Family
ID=46693552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110047094.4A Expired - Fee Related CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102651653B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106559179A (en) * | 2016-12-07 | 2017-04-05 | 天津君邦科技有限公司 | Variable-length symbol-level reversible coding and decoding method for joint information source channel |
| CN108809521B (en) * | 2018-06-26 | 2020-09-11 | 中国联合网络通信集团有限公司 | Variable length decoding method and device and variable length decoder |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI112570B (en) * | 2002-05-31 | 2003-12-15 | Nokia Corp | Procedure and arrangement for enhancing trellis crawling |
| CN101252409B (en) * | 2007-04-12 | 2011-05-11 | 中国科学院研究生院 | New algorithm of combined signal source channel decoding based on symbol level superlattice picture |
-
2011
- 2011-02-28 CN CN201110047094.4A patent/CN102651653B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN102651653A (en) | 2012-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1926769B (en) | Method for compressing a set of correlated signals | |
| Guyader et al. | Joint source-channel turbo decoding of entropy-coded sources | |
| CN101795407B (en) | Method and device for encoding a bit sequence | |
| CN103746708A (en) | Method for constructing Polar-LDPC concatenated codes | |
| CN100517983C (en) | Coding-decoding method for integrated source and channel variable-length symbol Turbo | |
| CN104168085A (en) | Data compression method based on redundant entropy conversion | |
| CN108199723B (en) | Packet Markov superposition coding method based on double recursion | |
| CN106941394B (en) | Joint detection decoding method and device for SCMA (sparse code multiple access) coded by polarization code | |
| CN105846827A (en) | Iterative joint source channel decoding method based on arithmetic coding and low-density parity-check | |
| CN102651653B (en) | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram | |
| CN101252409B (en) | New algorithm of combined signal source channel decoding based on symbol level superlattice picture | |
| CN102195743B (en) | Coding scheme of dynamic real-time fountain code | |
| CN102655588B (en) | Joint source-channel decoding method for video/image transmission | |
| CN113114269A (en) | Belief propagation-information correction decoding method | |
| CN108134612A (en) | Correct the synchronous iterative decoding method with substituting the concatenated code of mistake | |
| CN102388538B (en) | Method and device for encoding an input bit sequence and corresponding decoding method and device | |
| CN103138769B (en) | A kind of coding method with unequal error protection | |
| CN103208997B (en) | It is a kind of while input/while decoding/side output encoder and decoder structure | |
| CN104682966A (en) | Non-destructive compressing method for list data | |
| CN101411071A (en) | MAP decoder with bidirectional sliding window architecture | |
| CN102655589B (en) | Based on the combined signal source channel decoding method of variable length code and arithmetic code | |
| CN102547287B (en) | Raptor code-based image coding method | |
| KR101573983B1 (en) | Method of data compressing, method of data recovering, and the apparatuses thereof | |
| Chen | Side Information-based distributed source coding with Low-Density Parity-Check code | |
| CN112350737B (en) | Method for transmitting packet information update based on LDPC code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 100049, Yuquanlu Road, Beijing No. 19 (a) Applicant after: University of Chinese Academy of Sciences Address before: 100049, Yuquanlu Road, Beijing No. 19 (a) Applicant before: Postgraduate School, Chinese Academy of Sciences |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: POSTGRADUATE SCHOOL, CHINESE ACADEMY OF SCIENCES TO: UNIVERSITY OF CHINESE ACADEMY OF SCIENCES |
|
| 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: 20150715 Termination date: 20210228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |