CN111628782A - Polarization code decoding method and device for segmented overturning continuous cancellation list method - Google Patents
Polarization code decoding method and device for segmented overturning continuous cancellation list method Download PDFInfo
- Publication number
- CN111628782A CN111628782A CN202010631217.8A CN202010631217A CN111628782A CN 111628782 A CN111628782 A CN 111628782A CN 202010631217 A CN202010631217 A CN 202010631217A CN 111628782 A CN111628782 A CN 111628782A
- Authority
- CN
- China
- Prior art keywords
- bit position
- decoding
- path
- segment
- current bit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
Abstract
The invention discloses a polar code decoding method and a device of a segment turning continuous cancellation list method, wherein the method comprises the following steps: s1, initializing the current bit position to be 1 and determining a segmentation point; s2, judging that the current bit position is a segment point, and performing CRC check on the path in the segment corresponding to the current bit position; s3, selecting bit positions with the average LLR value of the paths in the segments smaller than a preset value to construct a turnover set; s4, decoding the first information bit in the corresponding segment again; s5, performing CRC check on the path after re-decoding, and deleting the reversed bit position from the reversed set when judging that no path passes the CRC check after re-decoding; and S6, repeating the step S5 until one path in the paths after being re-decoded passes the CRC check or the overturn set is empty. By using the invention, the performance of the decoding algorithm can be greatly improved. The invention is a polar code decoding method and device by a segment turning continuous cancellation list method, which can be widely applied to the field of communication decoding.
Description
Technical Field
The present invention relates to the field of coding technology of communication systems, and in particular, to a method and an apparatus for decoding a polarization code by a segment-wise-flipping continuous-cancellation list method.
Background
The polar code is a new channel coding technology, a cyclic redundancy check assisted continuous cancellation list method decoding algorithm (CA-SCL algorithm) is a decoding algorithm of the polar code, and has excellent decoding performance, but the decoding performance is general, on the basis, the CA-SCL decoding algorithm is improved in a segmentation mode in the prior art, and the complexity of the algorithm is reduced by stopping the calculation of subsequent bits in advance so as to improve the decoding performance, but the performance improvement of the mode is quite limited.
Disclosure of Invention
In order to solve the above technical problems, an object of the present invention is to provide a method and an apparatus for decoding a polar code by a segment-wise-flipping continuous-cancellation list method, which can greatly improve the performance of a decoding algorithm.
The first technical scheme adopted by the invention is as follows: a polar code decoding method of a segment turning continuous cancellation list method comprises the following steps:
s1, initializing the current bit position to be 1, and determining a segmentation point according to deletion probability distribution;
s2, executing an SCL decoding algorithm, judging that the current bit position is a segmentation point, and performing CRC check on all paths in the segment corresponding to the current bit position;
s3, judging that no path passes CRC check in the segment corresponding to the current bit position, and selecting the bit position with the path average LLR value smaller than the preset value in the segment to construct a turnover set;
s4, using the bit position with the minimum mean LLR value in the reversal set as the first reversal bit position, and starting to decode again from the first information bit in the corresponding segment;
s5, performing CRC check on the path after re-decoding, and deleting the reversed bit position from the reversed set when judging that no path passes the CRC check after re-decoding;
and S6, repeating the step S5, if the upset set is empty, ending the decoding, if the path passes the CRC check, further judging whether the decoding reaches the last bit position, and ending the decoding if the decoding reaches the last bit position, otherwise, adding one to the current bit position and jumping to S2.
Further, the determining the segmentation point according to the deletion probability distribution specifically includes:
calculating the probability of deleting the correct path of the bit position based on a CA-SCL algorithm;
and taking the bit position with the highest deletion probability as a segmentation point.
Further, the step of performing CRC check on all paths in the segment corresponding to the current bit position at the segment point when the current bit position is determined further includes:
if the current bit position is not a segmentation point, performing path expansion on the segments corresponding to the current bit position and reserving a preset number of paths with the maximum probability;
the current bit position is added with one and returned to step S2.
Further, the step of judging that no path passes CRC check in the segment corresponding to the current bit position and selecting a bit with an average LLR value of the path in the segment smaller than a preset value to construct a rolling set further includes:
if a path in the corresponding segment of the current bit position passes through CRC, reserving the path with the maximum probability;
the current bit position is added with one and returned to step S2.
Further, the step of decoding the information bit from the first information bit in the corresponding segment again with the bit position with the minimum mean LLR value in the flipped set as the first flipped bit position further comprises:
when the decoding process is carried out to the current bit position, the path with the probability smaller than the preset value is selected at the bit position to complete the turnover.
The second technical scheme adopted by the invention is as follows: a section turns over the polar code decoding device of the continuous cancellation list method, including:
at least one processor;
at least one memory for storing at least one program;
when the at least one program is executed by the at least one processor, the at least one processor is enabled to implement the polar code decoding method of the segment-wise-reversed-sequential-cancellation list method as described above.
The method and the device have the beneficial effects that: the segmentation scheme based on the path deletion probability achieves the effect of stopping calculation in advance, so that the decoding performance of the polar code is improved, and in addition, a stronger correct path recovery capability is realized by adopting a multi-path turning mode, so that the decoding performance is further improved.
Drawings
FIG. 1 is a flowchart illustrating the steps of a method for decoding polarization codes according to the segmented inversion successive cancellation list method of the present invention;
FIG. 2 is a graph comparing the performance of the algorithm under code words according to an embodiment of the present invention (512,256);
FIG. 3 is a graph of the performance of the algorithm under the code word for the specific embodiment of the present invention (256, 128).
Detailed Description
The invention is described in further detail below with reference to the figures and the specific embodiments. The step numbers in the following embodiments are provided only for convenience of illustration, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
As shown in fig. 1, the present invention provides a polar code decoding method using a segment-wise-flipping continuous cancellation list method, which includes the following steps:
and S1, initializing the current bit position to be 1, and determining a segmentation point according to the deletion probability distribution.
S2, executing an SCL decoding algorithm, judging that the current bit position is a segmentation point, and performing CRC (cyclic redundancy check) on all paths in the segment corresponding to the current bit position;
s3, judging that no path passes CRC check in the segment corresponding to the current bit position, and selecting the bit position with the path average LLR value smaller than the preset value in the segment to construct a turnover set;
specifically, the preset value is set to 5, only one bit position is turned over in each turning, and at most 5 times is turned over in one segment.
S4, using the bit position with the minimum mean LLR value in the flip set as the first flip bit position, and starting to decode from the first information bit in the corresponding segment
S5, performing CRC check on the path after re-decoding, and deleting the reversed bit position from the reversed set when judging that no path passes the CRC check after re-decoding;
and S6, repeating the step S5, if the upset set is empty, ending the decoding, if the path passes the CRC check, further judging whether the decoding reaches the last bit position, and ending the decoding if the decoding reaches the last bit position, otherwise, adding one to the current bit position and jumping to S2.
Specifically, a bit represents 0 or 1, a bit position refers to a bit position to which the current decoding algorithm is executed, and a bit transmitted by a bit position of all bit positions carries information, and is called an information bit.
In addition, the judgment criteria for the decoding end are two points: 1. step S5, no path passes CRC check all the time, that is, the maximum number of flips is reached, and the flip set is empty; 2. the last bit position is decoded in step S6. If any one of the two points is satisfied, the decoding is directly ended.
If any one of the above two points is satisfied, the decoding is directly ended
Further as a preferred embodiment of the method, the determining the segmentation point according to the deletion probability distribution specifically includes:
calculating the probability of deleting the correct path of the bit position based on a CA-SAL algorithm;
and taking the bit position with the highest deletion probability as a segmentation point.
Further as a preferred embodiment of the method, the step of performing CRC check on all paths in the segment corresponding to the current bit position at the segment point when the current bit position is determined further includes:
if the current bit position is not a segmentation point, performing path expansion on the segments corresponding to the current bit position and reserving a preset number of paths with the maximum probability;
the current bit position is added with one and returned to step S2.
Further as a preferred embodiment of the method, the step of determining that no path passes CRC check in the segment corresponding to the current bit position and selecting a bit having an average LLR value of the path in the segment smaller than a preset value to construct a reversed set further includes:
if a path in the corresponding segment of the current bit position passes through CRC, reserving the path with the maximum probability;
the current bit position is added with one and returned to step S2.
As a further preferred embodiment of the method, the step of decoding again from the first information bit in the corresponding segment by using the bit position with the minimum average LLR value in the flipped set as the first flipped bit position further includes:
when the decoding process is carried out to the current bit position, the path with the probability smaller than the preset value is selected at the bit position to complete the turnover.
The specific embodiment of the invention is as follows:
for different signal-to-noise ratios and different list depths, firstly obtaining a probability statistical graph of deleted correct paths under a CA-SCL decoding algorithm, taking a bit position with the highest deletion probability as a segmentation point, recording the current bit position as 1, judging whether the current bit position is the segmentation point, if the current bit position is not the segmentation point, carrying out path expansion, keeping the path with the maximum probability of a preset number after splitting if the number of the paths is greater than a preset value, and adding one to the current bit position to return to the step of judging whether the current bit position is the segmentation point; if the current bit position is a segment point, performing CRC (cyclic redundancy check) on all paths in the segment corresponding to the current bit position and judging whether the paths pass the CRC, if the paths pass the CRC, deleting the paths which cannot pass the CRC in the segment, and if a plurality of paths pass the CRC, reserving one path with the highest probability and adding one to the current bit position and returning to the step of judging whether the current bit position is the segment point; if no path passes through CRC check, selecting a preset number of bit positions with the minimum average LLR value absolute value of the paths in the segments to construct a reversal set, taking the bit position with the minimum average LLR value in the reversal set as a first reversal bit position, starting to decode again from the first information bit in the corresponding segment, performing CRC check on the path after re-decoding and judging whether the path passes through the CRC check, if so, judging whether the bit position is the last bit, if not, adding the current bit positions together and returning to the step of judging whether the current bit position is a segment point, and if so, ending the decoding algorithm; if no path passes the CRC check after the re-decoding, judging whether the maximum turnover frequency is reached, if the maximum turnover frequency is not reached, returning to the step of taking the bit position with the minimum average LLR value in the turnover set as the first turnover bit position, and if the maximum turnover frequency is reached, ending the decoding algorithm.
The beneficial effects of the invention are as follows: the invention adopts the steps of segmentation and turning to improve the decoding performance of the polar code, the performance is improved by a segmentation scheme based on the path deletion probability and a multi-path turning mode, the selection of segmentation points is better than that of the prior art, and meanwhile, compared with a comparison algorithm, the multi-path turning strategy has stronger correct path recovery capability.
The simulation comparison experiment of the invention is as follows:
the invention adopts the block error rate to measure the error correction performance of decoding, adopts the average active path number to measure the calculation complexity, and referring to fig. 2 and fig. 3, the Improved segmented reversed SCL decoding algorithm (ISF-SCL algorithm) provided by the patent has the performance improvement compared with the traditional CA-SCL decoding algorithm and the SCA-SCL algorithm, the experimental parameter selects (1024,512), (512,256), (256,128), (128,64) code words, takes (512,256) code words as an example, L in the figure represents the list width, Seg represents the number of segments, and the segmentation mode adopting the algorithm has about 0.2dB performance gain compared with the traditional CA-SCL decoding algorithm and the SCA SCL algorithm under the condition of low signal to noise ratio. This shows that the segmentation scheme given is more reasonable after considering the erasure probability information of the correct path in the bits. In addition, although the ISF-SCL algorithm adopts the overturning operation to increase the calculation amount, the increased calculation amount only occurs in a local range due to the segmentation, and does not bring too much calculation amount to the whole.
A section turns over the polar code decoding device of the continuous cancellation list method:
at least one processor;
at least one memory for storing at least one program;
when the at least one program is executed by the at least one processor, the at least one processor is enabled to implement the polar code decoding method of the segment-wise-reversed-sequential-cancellation list method as described above.
The contents in the above method embodiments are all applicable to the present apparatus embodiment, the functions specifically implemented by the present apparatus embodiment are the same as those in the above method embodiments, and the advantageous effects achieved by the present apparatus embodiment are also the same as those achieved by the above method embodiments.
A storage medium having stored therein instructions executable by a processor, the storage medium comprising: the processor-executable instructions, when executed by a processor, are for implementing a method of polar code decoding that segment-wise reverses successive cancellation lists as described above.
The contents in the above method embodiments are all applicable to the present storage medium embodiment, the functions specifically implemented by the present storage medium embodiment are the same as those in the above method embodiments, and the advantageous effects achieved by the present storage medium embodiment are also the same as those achieved by the above method embodiments.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (6)
1. A polar code decoding method of a segment turning continuous cancellation list method is characterized by comprising the following steps:
s1, initializing the current bit position to be 1, and determining a segmentation point according to deletion probability distribution;
s2, executing an SCL decoding algorithm, judging that the current bit position is a segmentation point, and performing CRC (cyclic redundancy check) on all paths in the segment corresponding to the current bit position;
s3, judging that no path passes CRC check in the segment corresponding to the current bit position, and selecting the bit position with the path average LLR value smaller than the preset value in the segment to construct a turnover set;
s4, using the bit position with the minimum mean LLR value in the reversal set as the first reversal bit position, and starting to decode again from the first information bit in the corresponding segment;
s5, performing CRC check on the path after re-decoding, and deleting the reversed bit position from the reversed set when judging that no path passes the CRC check after re-decoding;
and S6, repeating the step S5, if the upset set is empty, ending the decoding, if the path passes the CRC check, further judging whether the decoding reaches the last bit position, and ending the decoding if the decoding reaches the last bit position, otherwise, adding one to the current bit position and jumping to S2.
2. The method for decoding polar codes according to claim 1, wherein said determining segmentation points according to the erasure probability distribution specifically comprises:
calculating the probability of deleting the correct path of the bit position based on a CA-SCL algorithm;
and taking the bit position with the highest deletion probability as a segmentation point.
3. The method as claimed in claim 2, wherein the step of performing CRC on all paths in the segment corresponding to the current bit position at the segment point when the current bit position is determined further comprises:
if the current bit position is not a segmentation point, performing path expansion on the segments corresponding to the current bit position and reserving a preset number of paths with the maximum probability;
the current bit position is added with one and returned to step S2.
4. The method as claimed in claim 3, wherein the step of determining that no path passes CRC check in the segment corresponding to the current bit position and selecting bits with an average LLR value of the path smaller than a predetermined value in the segment to construct a reversed set further comprises:
if a path in the corresponding segment of the current bit position passes through CRC, reserving the path with the maximum probability;
the current bit position is added with one and returned to step S2.
5. The method as claimed in claim 4, wherein the step of re-decoding the polar code starting from the first information bit in the corresponding segment by using the bit position with the minimum mean LLR value in the inverted set as the first inverted bit position further comprises:
when the decoding process is carried out to the turning bit position, the path with the probability smaller than the preset value is selected at the bit position to complete the turning.
6. A section turning continuous cancellation list method polar code decoding device is characterized by comprising:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement a method for polar code decoding according to the segmented reversed sequential cancellation list method of any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010631217.8A CN111628782B (en) | 2020-07-03 | 2020-07-03 | Polarization code decoding method and device for segmented overturning continuous cancellation list method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010631217.8A CN111628782B (en) | 2020-07-03 | 2020-07-03 | Polarization code decoding method and device for segmented overturning continuous cancellation list method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111628782A true CN111628782A (en) | 2020-09-04 |
| CN111628782B CN111628782B (en) | 2022-08-09 |
Family
ID=72260317
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010631217.8A Active CN111628782B (en) | 2020-07-03 | 2020-07-03 | Polarization code decoding method and device for segmented overturning continuous cancellation list method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111628782B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112953560A (en) * | 2021-03-11 | 2021-06-11 | 中山大学 | Polar code continuous elimination list overturning decoding method based on key set |
| CN113242045A (en) * | 2021-04-01 | 2021-08-10 | 湖南矩阵电子科技有限公司 | Efficient decoding method and device for polarization code and computer readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180034593A1 (en) * | 2016-07-27 | 2018-02-01 | Qualcomm Incorporated | Design of hybrid automatic repeat request (harq) feedback bits for polar codes |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108292967A (en) * | 2015-09-30 | 2018-07-17 | 华为技术有限公司 | The coding and decoding method and its device of polarization code |
| WO2018133215A1 (en) * | 2017-01-22 | 2018-07-26 | 深圳大学 | Lsc-crc decoding-based segmented polar code encoding and decoding method and system |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| CN110380819A (en) * | 2019-07-03 | 2019-10-25 | 深圳大学 | A kind of segmentation overturning polarization code coding method and intelligent terminal based on LLR |
| CN110474648A (en) * | 2019-08-14 | 2019-11-19 | 山东科技大学 | A kind of serial counteracting list bit-flipping decoding method of low complex degree |
-
2020
- 2020-07-03 CN CN202010631217.8A patent/CN111628782B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108292967A (en) * | 2015-09-30 | 2018-07-17 | 华为技术有限公司 | The coding and decoding method and its device of polarization code |
| US20180034593A1 (en) * | 2016-07-27 | 2018-02-01 | Qualcomm Incorporated | Design of hybrid automatic repeat request (harq) feedback bits for polar codes |
| WO2018133215A1 (en) * | 2017-01-22 | 2018-07-26 | 深圳大学 | Lsc-crc decoding-based segmented polar code encoding and decoding method and system |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| CN110380819A (en) * | 2019-07-03 | 2019-10-25 | 深圳大学 | A kind of segmentation overturning polarization code coding method and intelligent terminal based on LLR |
| CN110474648A (en) * | 2019-08-14 | 2019-11-19 | 山东科技大学 | A kind of serial counteracting list bit-flipping decoding method of low complex degree |
Non-Patent Citations (4)
| Title |
|---|
| 李桂萍: "极化码编译码算法研究", 《中国优秀博士学位论文全文数据库信息科技辑》 * |
| 李桂萍: "极化码编译码算法研究", 《中国优秀博士学位论文全文数据库信息科技辑》, no. 01, 15 January 2019 (2019-01-15), pages 33 - 45 * |
| 穆丽伟等: "高性能时不变LDPC卷积码构造算法研究", 《电子与信息学报》 * |
| 穆丽伟等: "高性能时不变LDPC卷积码构造算法研究", 《电子与信息学报》, vol. 38, no. 09, 30 September 2016 (2016-09-30), pages 2274 - 2279 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112953560A (en) * | 2021-03-11 | 2021-06-11 | 中山大学 | Polar code continuous elimination list overturning decoding method based on key set |
| CN113242045A (en) * | 2021-04-01 | 2021-08-10 | 湖南矩阵电子科技有限公司 | Efficient decoding method and device for polarization code and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111628782B (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110545110B (en) | Concatenated polar coding and sliding window polar coding | |
| CN110380819B (en) | LLR-based segmented reversed polarization code decoding method and intelligent terminal | |
| CN111628782B (en) | Polarization code decoding method and device for segmented overturning continuous cancellation list method | |
| US7716565B2 (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| US10797728B1 (en) | Systems and methods for diversity bit-flipping decoding of low-density parity-check codes | |
| CN110995278B (en) | Improved polarity code serial elimination list bit overturning decoding method and system | |
| JPH0730439A (en) | Operation of cyclic viterbi decoder | |
| US8081719B2 (en) | Method and system for improving reception in wired and wireless receivers through redundancy and iterative processing | |
| JP2009100222A (en) | Device and method for decoding low density parity check code | |
| KR20060032464A (en) | Efficient decoding method and apparatus of low density parity code | |
| JP2000244336A (en) | Method and system for estimating reliability of decoded symbol sequence | |
| CN114070331B (en) | Self-adaptive serial offset list flip decoding method and system | |
| US11418221B2 (en) | Method and polar code decoder for determining to-be-flipped bit position | |
| US10038456B1 (en) | Decoders with look ahead logic | |
| CN111224676A (en) | Self-adaptive serial offset list polarization code decoding method and system | |
| CN110730007B (en) | Polarization code SSCL decoding path splitting method, storage medium and processor | |
| CN111030708B (en) | Iterative adjustable soft serial cancellation list decoding method and device for polarization codes | |
| CN110190857B (en) | CRC (Cyclic redundancy check) auxiliary check polarization code decoding method and intelligent terminal | |
| US6725417B2 (en) | Sequential decoding apparatus and method | |
| US7900123B2 (en) | Method for near maximum-likelihood sequential decoding | |
| CN102142848A (en) | Decoding method and decoder of tail-biting convolutional code | |
| US11777531B2 (en) | Method and apparatus for high-speed decoding of linear code on basis of soft decision | |
| CN102291198A (en) | channel decoding method and device | |
| CN111082813B (en) | Multi-threshold-based Polar code SC-FLIP decoding method, equipment and storage equipment | |
| CN113098533B (en) | Continuous elimination turning decoding method based on absolute value change of log-likelihood ratio |
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 |