CN116566404B - Method and device for determining interleaving mapping relation of punctured Turbo codes - Google Patents
Method and device for determining interleaving mapping relation of punctured Turbo codes Download PDFInfo
- Publication number
- CN116566404B CN116566404B CN202310843344.8A CN202310843344A CN116566404B CN 116566404 B CN116566404 B CN 116566404B CN 202310843344 A CN202310843344 A CN 202310843344A CN 116566404 B CN116566404 B CN 116566404B
- Authority
- CN
- China
- Prior art keywords
- polynomial
- relation
- puncturing
- target
- turbo code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 129
- 238000000034 method Methods 0.000 title claims abstract description 51
- 239000011159 matrix material Substances 0.000 claims abstract description 68
- 238000012795 verification Methods 0.000 claims abstract description 19
- 238000004590 computer program Methods 0.000 claims description 14
- 238000010276 construction Methods 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000005070 sampling Methods 0.000 claims description 7
- 101100001674 Emericella variicolor andI gene Proteins 0.000 claims description 6
- 101100379079 Emericella variicolor andA gene Proteins 0.000 claims description 5
- 238000004891 communication Methods 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000004422 calculation algorithm Methods 0.000 description 6
- 101100094096 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) RSC2 gene Proteins 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 5
- 230000009466 transformation Effects 0.000 description 5
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000013178 mathematical model Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000003786 synthesis reaction Methods 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 241000170489 Upis Species 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003902 lesion Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
-
- 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/27—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 using interleaving techniques
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention provides a method and a device for determining an interleaving mapping relation of a puncturing Turbo code, which relate to the technical field of communication coding, and are characterized in that firstly, based on coding data of the puncturing Turbo code, a corresponding polynomial matrix, a puncturing mode and branching data are determined, so that a first polynomial constraint relation of the puncturing Turbo code is constructed, each first target polynomial meeting the first polynomial constraint relation is obtained, each second target polynomial is obtained through expansion according to a power series form, the first polynomial constraint relation is combined, a second polynomial constraint relation related to the interleaving mapping relation of the puncturing Turbo code is determined, each candidate interleaving mapping relation is substituted into the second polynomial constraint relation for verification, and the number of times that the candidate interleaving mapping relation meets the second polynomial constraint relation is larger than a first threshold value is determined as the interleaving mapping relation of the puncturing Turbo code, so that the application range is enlarged by solving the interleaving mapping relation in a positive way.
Description
Technical Field
The invention relates to the technical field of communication coding, in particular to a method and a device for determining interleaving mapping relation of a punctured Turbo code.
Background
Turbo codes are widely used in various digital communication systems due to their excellent performance. To accommodate different channel qualities, turbo codes typically employ puncturing patterns to provide different code rates. Therefore, the analysis and identification and parameter calculation of the punctured Turbo code have stronger practical requirements.
A typical Turbo code is formed by two recursive systematic convolutional code (Recursive System Convolutional, RSC) encoders concatenated in parallel via an interleaver. To ensure the performance of Turbo codes, the interleaver generally adopts a random interleaving mode. Because of the existence of the interleaver, the coding parameter of the Turbo code is much more complex than that of the convolutional code, and the parameter of the punctured Turbo code is always difficult to analyze the channel coding, wherein the most difficult is the random interleaving mapping relation.
At present, the analysis and recognition of the punctured Turbo code generally bypasses the difficulties, and adopts a closed set recognition strategy, namely, various parameters (including interleaving mapping) of the commonly used punctured Turbo code which are grasped in advance are utilized to directly try decoding, and various parameters (including interleaving mapping) of the punctured Turbo code are determined by judging whether the decoding is correct or not. This significantly reduces the range of analytically identifiable.
Disclosure of Invention
The invention provides a method and a device for determining interleaving mapping relation of a punctured Turbo code, which are used for solving the problem that the application range of identification is limited by adopting a closed set identification strategy in the prior art.
The invention provides a method for determining interleaving mapping relation of punctured Turbo codes, which comprises the following steps:
based on the encoded data of the puncturing Turbo code, determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code;
constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
According to the method for determining the interleaving mapping relation of the puncturing Turbo code provided by the invention, the first polynomial constraint relation of the puncturing Turbo code is constructed based on the polynomial matrix, the puncturing mode and the shunt data, and the method comprises the following steps:
constructing a candidate polynomial constraint relation;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation.
According to the method for determining the interleaving mapping relation of the punctured Turbo codes, provided by the invention, the construction of the candidate polynomial constraint relation comprises the following steps:
constructing a formula (1) as the candidate polynomial constraint relation:
（1）；
wherein ,information path data +.>Interleaving sequence->Is>Information path data +.>Interleaving sequence->Is used for the second sampling sequence of (c),for characterizing polynomial matrices,/->For characterizing the puncturing pattern,/for example>And the verification data is used for representing the output of the second component encoder on the branch where the interleaver is located.
According to the method for determining the interleaving mapping relation of the punctured Turbo code provided by the invention, the method for determining the interleaving mapping relation of the punctured Turbo code comprises the steps of substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation, and comprises the following steps:
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain a formula (2) serving as the first polynomial constraint relation:
（2）；
wherein ,、 andIs determined by the polynomial matrix.
According to the method for determining the interleaving mapping relation of the punctured Turbo code provided by the invention, the method for obtaining at least one first target polynomial meeting the constraint relation of the first polynomial, expanding each first target polynomial according to a power series form to obtain at least one second target polynomial comprises the following steps:
obtaining a polynomial satisfying equation (2)、 andAs each of the first target polynomials;
will beExpanding to equation (3):
（3）；
will beExpanding to equation (4):
（4）；
will beExpanding to equation (5):
（5）；
taking equations (3), (4) and (5) as each of the second target polynomials;
the determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship comprises:
substituting each second target polynomial into the first polynomial constraint relation to obtain a formula (6) serving as the second polynomial constraint relation:
（6）；
wherein ,for characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->For characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->Lie +.>Bits at.
According to the method for determining the interleaving mapping relation of the punctured Turbo codes, the polynomial matrix is determined based on the preset generation matrix of the component encoder.
The invention also provides a device for determining the interleaving mapping relation of the punctured Turbo codes, which comprises the following steps:
the first determining module is used for determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code based on the encoded data of the puncturing Turbo code;
the construction module is used for constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing mode and the shunt data;
the acquisition module is used for acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, expanding each first target polynomial according to a power series form and obtaining at least one second target polynomial;
a second determining module, configured to determine a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
the verification module is used for substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and the calculation module is used for calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
The invention also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the method for determining the interleaving mapping relation of the puncturing Turbo codes when executing the program.
The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method of determining a punctured Turbo code interleaving mapping relationship as described in any of the above.
The invention also provides a computer program product, which comprises a computer program, wherein the computer program realizes the determining method of the interleaving mapping relation of the puncturing Turbo codes when being executed by a processor.
Compared with the prior art adopting a closed set identification strategy, the method for determining the interleaving mapping relation of the punctured Turbo code can positively calculate the interleaving mapping relation of the punctured Turbo code, is not limited by the commonly used punctured Turbo code, and effectively expands the application range of identification.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for determining interleaving mapping relation of punctured Turbo codes;
FIG. 2 is a logical block diagram of a punctured Turbo code provided by the present invention;
fig. 3 is a schematic structural diagram of a determining device for interleaving mapping relation of punctured Turbo codes provided by the invention;
fig. 4 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The method and the device for determining the interleaving mapping relation of the punctured Turbo code are described below with reference to the accompanying drawings.
Fig. 1 is a flow chart of a method for determining interleaving mapping relation of punctured Turbo codes, which is provided by the invention, as shown in fig. 1, the method comprises steps 101 to 106; wherein:
step 101, determining a polynomial matrix, a puncturing mode and shunt data corresponding to a puncturing Turbo code based on encoded data of the puncturing Turbo code;
102, constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
step 103, obtaining at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
104, determining a second polynomial constraint relation based on each second target polynomial and the first polynomial constraint relation; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
step 105, substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and 106, calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
In the related art, the parameter calculation of the punctured Turbo code is always a difficult point of channel coding analysis, wherein the most difficult is the calculation of the random interleaving mapping relation.
In the past, the analysis and recognition of the punctured Turbo code generally bypasses the difficulty, and adopts a closed set recognition strategy, namely, the punctured Turbo code which is grasped in advance is tried one by one. This significantly reduces the scope of analytical reconnaissance.
In addition, under the special condition of no error code, the interleaved information sequence can be calculated through deleting the convolutional code model, and then the interleaving mapping can be obtained.
In summary, the existing recognition technology does not better solve the problem of blind recognition of interleaving mapping of the punctured Turbo code under the realistic condition (with error code).
In the embodiment of the invention, firstly, a polynomial matrix, a puncturing mode and branching data corresponding to the puncturing Turbo code are determined based on the encoded data of the puncturing Turbo code, then a first polynomial constraint relation of the puncturing Turbo code is constructed based on the polynomial matrix, the puncturing mode and the branching data, at least one first target polynomial meeting the first polynomial constraint relation is obtained, each first target polynomial is expanded according to a power series form to obtain at least one second target polynomial, further, a second polynomial constraint relation related to the interleaving mapping relation of the puncturing Turbo code is determined based on each second target polynomial and the first polynomial constraint relation, and then at least one preset candidate interleaving mapping relation is substituted into the second polynomial constraint relation for verification, and the target interleaving mapping relation with the number of times that the candidate interleaving mapping relation meets the second polynomial constraint relation being larger than a first threshold is determined as the interleaving mapping relation of the puncturing Turbo code.
Alternatively, the polynomial matrix may be determined based on a pre-set generator matrix of the component encoder.
Compared with the current closed set identification strategy, the method for determining the interleaving mapping relation of the puncturing Turbo codes can positively calculate the interleaving mapping relation of the puncturing Turbo codes, is not limited by the number of relations between various parameters and random interleaving mapping which are already mastered, and effectively expands the application range of identifying the interleaving mapping relation.
Optionally, an implementation manner of constructing the first polynomial constraint relation of the punctured Turbo code based on the polynomial matrix, the puncturing pattern and the branching data may include:
constructing a candidate polynomial constraint relation;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation.
Optionally, an implementation manner of constructing the candidate polynomial constraint relation may include:
constructing a formula (1) as the candidate polynomial constraint relation:
（1）；
wherein ,information path data +.>Interleaving sequence->Is a first 2-sample sequence of +.>Information path data +.>Interleaving sequence->Is a second 2-sample sequence of (c),for characterizing polynomial matrices,/->For characterizing the puncturing pattern,/for example>And the verification data is used for representing the output of the first component encoder on the branch where the interleaver is located.
Optionally, substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation, and obtaining the first polynomial constraint relation may include:
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain a formula (2) serving as the first polynomial constraint relation:
（2）；
wherein ,、 andIs determined by the polynomial matrix.
Optionally, the obtaining at least one first target polynomial that satisfies the constraint relation of the first polynomial, expanding each first target polynomial according to a power series form, and obtaining an implementation manner of at least one second target polynomial may include:
obtaining a polynomial satisfying equation (2)、 andAs each of the first target polynomials;
will beExpanding to equation (3):
（3）；
will beExpanding to equation (4):
（4）；
will beExpanding to equation (5):
（5）；
taking equations (3), (4) and (5) as each of the second target polynomials;
the implementation manner of determining the second polynomial constraint relation based on each second target polynomial and the first polynomial constraint relation may include:
substituting each second target polynomial into the first polynomial constraint relation to obtain a formula (6) serving as the second polynomial constraint relation:
（6）；
wherein ,for characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->For characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->Lie +.>Bits at.
In the formula (6), the formula (6) is represented byIn the subscript andIs unknown, so->Andalso belongs to unknown parameters, need to be about-> andPerforming specific value taking, namely forming at least one candidate interleaving mapping relation, substituting the at least one candidate interleaving mapping relation into the formula (6), and checking whether the substituted value can make two sides of the formula (6) equal, counting multi-frame data, and sequentially solving +_>Specifically solve to +.>Equal to several, may depend on the interleaving length of the interleaver, if the interleaving length of the interleaver is 4, then +.>Taking 0 or 1, which corresponds to +.>。
For example, the interleaving mapping relation of the punctured Turbo code may be:according toSolving->。
The following illustrates a method for determining the interleaving mapping relation of the punctured Turbo code according to an embodiment of the present invention.
The method for determining the interleaving mapping relation of the punctured Turbo code in the embodiment of the invention can comprise the following steps:
firstly, establishing a mathematical model of the punctured Turbo code;
record the whole integer as a setRecord->. For two positive integers>Lesion and pain in the chest>。
Definition of the definitionSubstitution on->The method comprises the following steps:
；
taking outIs->Bit 1, the remaining bits 0 +.>Dimension unit vector, definition matrix->The method comprises the following steps:。
for example, whenWhen (I)>Thereby->。
Proposition 1, alignment integerIs provided with->Order matrix->Here->For matrix->Is>Column, then:
；
definition 2 for finite fieldSequence->Let the name->For the sequence->In the form of a power series.
Definition 3 for finite fieldSequence->And positive integer->The sequence is calledFor the sequence->To->For initiating->-a sampling sequence.
It can be seen that the form power series of the sampled sequence has the following relation to the form power series of the original sequence:。
definition 4 for finite fieldsSequence->And positive integer->The conversion is calledIs +.>Splitting, recorded as->, whereinFor the sequence->To->For initiating->-a sampling sequence. The form of this transformation acting on the power series of the sequence is:。
On the basis of this, a transformation is definedThe method comprises the following steps:
。
definition 5 for finite fieldUpper->Strip sequence->The transformation is called:is +.>Synthesis, denoted->. And call->Is->Is a synthetic sequence of->Is->Is a sampling sequence of (a). The form of this transformation acting on the power series of the sequence is:。
more generally, for finite fieldsUpper->Strip sequence->The transformation is called:is +.>Synthesis, denoted->. wherein ,。
in the form of a power series, there are:
。
for formal power seriesDefinitions->Matrix->The method comprises the following steps:
。
in practice, it is provided withThen。
It is possible to obtain:
。
on the basis, further pairFormal power series matrix>Definitions->Matrix->The method comprises the following steps:
。
for example, set upThen:
；
。
is provided withConvolutional code->Is +.>Will->Input/output of (2) are respectively +.>Beat division, a new +.>Convolutional code->And has:
theorem 6, setConvolutional code->Is +.>Will->Input/output of (2) are respectively +.>New ∈beat division>Convolutional code->Is->。
For example, set upIs a (2, 1, 6) convolutional code whose generator matrix is:
。
for a pair of=3, there are:
；
；
；
so (6, 3) convolutional codesThe generator matrix of (a) is:
；
theory 7, power series of the form of pairsThe method comprises the following steps:。
Theorem 8, designThen:
。
wherein ,for matrix->Is>Row quilt vector->Determinant after replacement.
For example, let the generation matrix of the 1/2 rate RSC encoder be:recordingThen:
；
；
；
；
；
；
；
；
。
therefore:。
trellis diagram of convolutional code, each state having +.>The decoding complexity follows +.>The increase in (c) increases exponentially. Therefore, for high rate convolutional codes, it is often considered as the puncturing code of the low rate convolutional code, which is decoded by the decoder of the low rate mother code. For a convolutional code with 4/5 code rate, consider it as a puncturing code with 2/3 code rate system code as the mother code, and input information sequence for it:
；
。
the output of the mother code with its 2/3 code rate is noted as table 1 below:
table 1 2/3 rate mother code output relation table
The power series expressed as delay operator is:
。
puncturing pattern retrievalThe 2/3 rate encoder is used for realizing the encoding of the 4/5 rate convolutional code, and the output sequence is as follows:。
Using the above-described sequence (power series) split and composite terminology, the above-described encoding process can be expressed as:
。
theorem 9, setting up punctured convolutional codeThe parameter of (2) is->The mother code is->Convolutional code->，If code->Is +.>Puncturing pattern->The reserved bit in (a) is->Code->The generator matrix of (a) is:
。
theorem 10, convolutional code with puncturing systemThe parameter of (2) is->The mother code is->System code->，If codeThe generation matrix of the check part of (2) is +.>Puncturing pattern->The check part in the reserved bit is +.>Code->Is of (1)The test part generation matrix is as follows:
；
wherein ,。
constructing a puncturing Turbo code polynomial constraint relation;
fig. 2 is a logical block diagram of the punctured Turbo code according to the present invention, as shown in fig. 2.
Puncturing logic periodically deletes input symbols and outputs the remaining symbols. In the upper drawingThe sequence is as follows:；。
if the following selective deletion is performed:
；
the puncturing pattern can be used as a matrixAnd (3) representing that 1 represents a reservation and 0 represents a deletion. Two sequences of inputs can also be added +.>Multiplexing into a single sequence->At this time, the puncturing pattern can use vectorsAnd (3) representing.
Handle sequenceGrouping in units of 4 symbols +.>，The remaining symbols may be expressed as:
；
wherein ,。
relative to the input asThe output of the RSC2 encoder at 1/2 code rate is:
；
sequence(s)The RSC2 is used as a mother code, and the puncturing mode is +.>Punctured convolutional code +.>The code rate is 2/3.
Let the generator matrix of the RSC2 encoder be:the method comprises the steps of carrying out a first treatment on the surface of the The relation theorem 10 of the convolution code and the mother code of the puncturing system is used for puncturing the convolution code +.>The generation matrix of the check part of (a) is:
；
from the above, a sequence can be establishedAnd sequence->Equation (constraint relation) between:
；
upon identification of a generator matrix of an RSC2 encoderBased on the above, the constraint relation can be used to calculate the interleaving mapping relation of the punctured Turbo code.
For example, assuming that the puncturing Turbo code has the structure as above, the RSC encoder is a 1/2 rate system convolutional code, and the generating matrix is:
；
puncturing pattern relative to RSC2 system convolutional code isBased on the above analysis, the following formula is given:
；
in the following calculation formula。
First, let theThe method comprises the following steps:
；/>
；
；
；
；
；
；
；
；
；
。
thus, it can be derived that:
；
further, it is possible to obtain:
。
thirdly, constructing a puncturing Turbo code interleaving mapping calculation algorithm (the determining method of the puncturing Turbo code interleaving mapping relation);
on the basis of the first part and the second part, the following algorithm is given:
algorithm: and (5) a calculation algorithm of the interleaving mapping relation of the puncturing Turbo codes.
Input: puncturing Turbo code encoded data.
And (3) outputting: interleaving mappingπ。
1) The code length is identified by the conventional algorithm, the branching of the encoded data is realized, the deleting mode is determined, and the component encoder generating matrix is obtained。
2) Calculating polynomial matrix。
3) Recording information path data in the coded data asCheck data outputted from the encoder 2 +.>Is provided with->Interleaving sequence->Is +.>Determining and extracting a polynomial +_from the calculation result of step 2) and the puncturing pattern such that the following formula is established>：。
4) Is provided with，，RecordingIt can be deduced from the above formula:
。
5) Counting multi-frame data, and sequentially obtaining%π(0),π(1)),(π(2),π(3)),。
6) When there are multiple solutions, the correct one is distinguished by decoding.
The embodiment of the invention relates to three parts of establishment of a puncturing Turbo code mathematical model, construction of a puncturing Turbo code polynomial constraint relation and a puncturing Turbo code interleaving mapping solving algorithm, realizes effective solving of the puncturing Turbo code interleaving mapping, has stronger fault tolerance capability, can adapt to a scene with higher error rate, and solves the technical problem of blind recognition of the puncturing Turbo code.
The determining device of the interleaving mapping relation of the puncturing Turbo code provided by the invention is described below, and the determining device of the interleaving mapping relation of the puncturing Turbo code and the determining method of the interleaving mapping relation of the puncturing Turbo code described below can be correspondingly referred to each other.
Fig. 3 is a schematic structural diagram of a determining device for interleaving mapping relation of punctured Turbo codes, where, as shown in fig. 3, determining device 300 for interleaving mapping relation of punctured Turbo codes includes:
a first determining module 301, configured to determine a polynomial matrix, a puncturing mode and split data corresponding to a puncturing Turbo code based on encoded data of the puncturing Turbo code;
a construction module 302, configured to construct a first polynomial constraint relationship of the punctured Turbo code based on the polynomial matrix, the puncturing pattern and the split data;
an obtaining module 303, configured to obtain at least one first target polynomial that satisfies the constraint relation of the first polynomial, and expand each first target polynomial according to a power series form to obtain at least one second target polynomial;
a second determining module 304, configured to determine a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
a verification module 305, configured to replace at least one preset candidate interleaving mapping relationship into the second polynomial constraint relationship for verification;
and a calculating module 306, configured to calculate the number of times that each candidate interleaving mapping relation satisfies the second polynomial constraint relation, and determine the target interleaving mapping relation with the number of times greater than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
In the determining device for the interleaving mapping relation of the puncturing Turbo code provided by the embodiment of the invention, a first determining module determines a polynomial matrix corresponding to the puncturing Turbo code, a puncturing mode and branching data based on the encoding data of the puncturing Turbo code, a constructing module constructs a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing mode and the branching data, an obtaining module obtains at least one first target polynomial meeting the first polynomial constraint relation, each first target polynomial is expanded according to a power series form to obtain at least one second target polynomial, a second determining module determines a second polynomial constraint relation related to the interleaving mapping relation of the puncturing Turbo code based on each second target polynomial and the first polynomial constraint relation, a verifying module substitutes at least one candidate interleaving mapping relation set in advance into the second polynomial constraint relation, and a calculating module determines that the candidate interleaving mapping relation meets the first target interleaving mapping relation with times greater than the first threshold value as interleaving mapping relation of the puncturing Turbo code. Compared with the prior art adopting a closed set identification strategy, the invention provides a determination device for the interleaving mapping relation of the punctured Turbo code, which can positively calculate the interleaving mapping relation of the punctured Turbo code, is not limited by the number of the relations between various parameters and random interleaving mapping which are already mastered, and effectively expands the application range of identifying the interleaving mapping relation.
Optionally, the construction module 302 is specifically configured to:
constructing a candidate polynomial constraint relation;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation.
Optionally, the construction module 302 is further specifically configured to:
constructing a formula (1) as the candidate polynomial constraint relation:
（1）；
wherein ,information path data +.>Interleaving sequence->Is>For characterising a subjectInformation path data in the shunt data +.>Interleaving sequence->Is used for the second sampling sequence of (c),for characterizing polynomial matrices,/->For characterizing the puncturing pattern,/for example>And the verification data is used for representing the output of the second component encoder on the branch where the interleaver is located.
Optionally, the construction module 302 is further specifically configured to:
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain a formula (2) serving as the first polynomial constraint relation:
（2）；
wherein ,、 andIs determined by the polynomial matrix.
Optionally, the obtaining module 303 is specifically configured to:
obtaining a polynomial satisfying equation (2)、 andAs each of the first target polynomials;
will beExpanding to equation (3):
（3）；
will beExpanding to equation (4):
（4）；
will beExpanding to equation (5):
（5）；
taking equations (3), (4) and (5) as each of the second target polynomials;
the second determining module 304 is specifically configured to:
substituting each second target polynomial into the first polynomial constraint relation to obtain a formula (6) serving as the second polynomial constraint relation:
（6）；
wherein ,for characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->For characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->Lie +.>Bits at.
Optionally, the polynomial matrix is determined based on a pre-set generator matrix of the component encoder.
Fig. 4 is a schematic structural diagram of an electronic device according to the present invention, as shown in fig. 4, the electronic device may include: processor 410, communication interface (Communications Interface) 420, memory 430 and communication bus 440, wherein processor 410, communication interface 420 and memory 430 communicate with each other via communication bus 440. Processor 410 may invoke logic instructions in memory 430 to perform a method of determining a punctured Turbo code interleaving mapping relationship, the method comprising:
based on the encoded data of the puncturing Turbo code, determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code;
constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
Further, the logic instructions in the memory 430 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product, where the computer program product includes a computer program, where the computer program can be stored on a non-transitory computer readable storage medium, and when the computer program is executed by a processor, the computer can perform a method for determining the puncturing Turbo code interleaving mapping relationship provided by the above methods, and the method includes:
based on the encoded data of the puncturing Turbo code, determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code;
constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
In still another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the method for determining the interleaving mapping relation of punctured Turbo codes provided by the above methods, the method comprising:
based on the encoded data of the puncturing Turbo code, determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code;
constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
and calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (4)
1. A method for determining interleaving mapping relation of punctured Turbo codes is characterized by comprising the following steps:
based on the encoded data of the puncturing Turbo code, determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code; wherein the polynomial matrix is determined based on a preset generator matrix of the component encoder;
constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the shunt data;
acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, and expanding each first target polynomial according to a power series form to obtain at least one second target polynomial;
determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code;
the constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing pattern and the branching data includes:
constructing a candidate polynomial constraint relation;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation;
the constructing candidate polynomial constraint relation comprises the following steps:
constructing a formula (1) as the candidate polynomial constraint relation:
（1）；
wherein ,information path data +.>Interleaving sequence->Is a first 2-sample sequence of +.>Information path data +.>Interleaving sequence->Is a second 2-sampling sequence of +.>For characterizing polynomial matrices,/->For characterizing the puncturing pattern,/for example>The verification data is used for representing the output of the second component encoder on the branch where the interleaver is located;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation, wherein the method comprises the following steps of:
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain a formula (2) serving as the first polynomial constraint relation:
（2）；
wherein ,、 andIs determined by the polynomial matrix;
the obtaining at least one first target polynomial meeting the constraint relation of the first polynomials, expanding each first target polynomial according to a power series form to obtain at least one second target polynomial, and the method comprises the following steps:
obtaining a polynomial satisfying equation (2)、 andAs each of the first target polynomials;
will beExpanding to equation (3):
（3）；
will beExpanding to equation (4):
（4）；
will beExpanding to equation (5):
（5）；
taking equations (3), (4) and (5) as each of the second target polynomials;
the determining a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship comprises:
substituting each second target polynomial into the first polynomial constraint relation to obtain a formula (6) serving as the second polynomial constraint relation:
（6）；
wherein ,for characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->For characterising->The interleaving map value corresponding to the position,information path data of the characterizing branch data is located +.>Bit at->Lie +.>Bits at.
2. A determining device for interleaving mapping relation of punctured Turbo codes, comprising:
the first determining module is used for determining a polynomial matrix, a puncturing mode and shunt data corresponding to the puncturing Turbo code based on the encoded data of the puncturing Turbo code; wherein the polynomial matrix is determined based on a preset generator matrix of the component encoder;
the construction module is used for constructing a first polynomial constraint relation of the puncturing Turbo code based on the polynomial matrix, the puncturing mode and the shunt data;
the acquisition module is used for acquiring at least one first target polynomial meeting the constraint relation of the first polynomials, expanding each first target polynomial according to a power series form and obtaining at least one second target polynomial;
a second determining module, configured to determine a second polynomial constraint relationship based on each of the second target polynomials and the first polynomial constraint relationship; wherein the second polynomial constraint relationship is related to the interleaving mapping relationship of the punctured Turbo code;
the verification module is used for substituting at least one preset candidate interleaving mapping relation into the second polynomial constraint relation for verification;
the calculation module is used for calculating the times that each candidate interleaving mapping relation meets the second polynomial constraint relation, and determining a target interleaving mapping relation with the times larger than a first threshold value as the interleaving mapping relation of the puncturing Turbo code;
the construction module is specifically configured to:
constructing a candidate polynomial constraint relation;
substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain the first polynomial constraint relation;
the constructing candidate polynomial constraint relation comprises the following steps:
constructing a formula (1) as the candidate polynomial constraint relation:
（1）；
wherein ,information path data +.>Interleaving sequence->Is a first 2-sample sequence of +.>Information path data +.>Interleaving sequence->Is a second 2-sampling sequence of +.>For characterizing polynomial matrices,/->For characterizing the puncturing pattern,/for example>The verification data is used for representing the output of the second component encoder on the branch where the interleaver is located;
the construction module is also specifically used for: substituting the polynomial matrix, the puncturing pattern and the shunt data into the candidate polynomial constraint relation to obtain a formula (2) serving as the first polynomial constraint relation:
（2）；
wherein ,、 andIs determined by the polynomial matrix;
the acquisition module is specifically configured to:
obtaining a polynomial satisfying equation (2)、 andAs each of the first target polynomials;
will beExpanding to equation (3):
（3）；
will beExpanding to equation (4):
（4）；
will beExpanding to equation (5):
（5）；
taking equations (3), (4) and (5) as each of the second target polynomials;
the second determining module is specifically configured to:
substituting each second target polynomial into the first polynomial constraint relation to obtain a formula (6) serving as the second polynomial constraint relation:
（6）；
wherein ,for characterising->Interleaving mapping value corresponding to position,Information path data of the characterizing branch data is located +.>Bit at->For characterising->The interleaving map value corresponding to the position,information path data of the characterizing branch data is located +.>Bit at->Lie +.>Bits at.
3. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for determining the interleaving mapping relation of the punctured Turbo code according to claim 1 when executing the program.
4. A non-transitory computer readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the method for determining the puncturing Turbo code interleaving mapping relationship as claimed in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310843344.8A CN116566404B (en) | 2023-07-11 | 2023-07-11 | Method and device for determining interleaving mapping relation of punctured Turbo codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310843344.8A CN116566404B (en) | 2023-07-11 | 2023-07-11 | Method and device for determining interleaving mapping relation of punctured Turbo codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116566404A CN116566404A (en) | 2023-08-08 |
| CN116566404B true CN116566404B (en) | 2023-09-19 |
Family
ID=87498635
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310843344.8A Active CN116566404B (en) | 2023-07-11 | 2023-07-11 | Method and device for determining interleaving mapping relation of punctured Turbo codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116566404B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003060513A (en) * | 2001-08-20 | 2003-02-28 | Fujitsu Ltd | Turbo decoder |
| CN102244554A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind recognition method of punctured Turbo coding parameters |
| CN104683072A (en) * | 2015-03-26 | 2015-06-03 | 山东大学 | Parameter blind identification method of puncturing turbo code component coder |
| CN107370566A (en) * | 2017-07-28 | 2017-11-21 | 西安电子科技大学 | A kind of punctured Turbo codes blind-identification method under the conditions of error code |
| CN108234077A (en) * | 2017-12-26 | 2018-06-29 | 中国电子科技集团公司第三十研究所 | A kind of punctured safe Turbo coding methods of dynamic by cipher control |
| CN110690907A (en) * | 2019-09-27 | 2020-01-14 | 电子科技大学 | Known branch information turbo code deletion mode estimation method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7260770B2 (en) * | 2001-10-22 | 2007-08-21 | Motorola, Inc. | Block puncturing for turbo code based incremental redundancy |
| US7543197B2 (en) * | 2004-12-22 | 2009-06-02 | Qualcomm Incorporated | Pruned bit-reversal interleaver |
-
2023
- 2023-07-11 CN CN202310843344.8A patent/CN116566404B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003060513A (en) * | 2001-08-20 | 2003-02-28 | Fujitsu Ltd | Turbo decoder |
| CN102244554A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind recognition method of punctured Turbo coding parameters |
| CN104683072A (en) * | 2015-03-26 | 2015-06-03 | 山东大学 | Parameter blind identification method of puncturing turbo code component coder |
| CN107370566A (en) * | 2017-07-28 | 2017-11-21 | 西安电子科技大学 | A kind of punctured Turbo codes blind-identification method under the conditions of error code |
| CN108234077A (en) * | 2017-12-26 | 2018-06-29 | 中国电子科技集团公司第三十研究所 | A kind of punctured safe Turbo coding methods of dynamic by cipher control |
| CN110690907A (en) * | 2019-09-27 | 2020-01-14 | 电子科技大学 | Known branch information turbo code deletion mode estimation method |
Non-Patent Citations (2)
| Title |
|---|
| "Turbo码编码参数盲识别研究";王艳涛;《中国优秀硕士学位论文全文数据库 信息科技辑》;17-37 * |
| Tiny Turbo: Efficient Turbo Decoders on Edge;S. Ashwin Hebbar 等;ArXiv: 2209.15614v1 [cs.IT];全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116566404A (en) | 2023-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102694625B (en) | Polarization code decoding method for cyclic redundancy check assistance | |
| CN107370560B (en) | Method, device and equipment for coding and rate matching of polarization code | |
| JP4038519B2 (en) | Method and apparatus for decoding low density parity check code using integrated node processing | |
| EP3602794B1 (en) | Check bit concatenated polar codes | |
| US20130185610A1 (en) | Joint encoding and decoding methods for improving the error rate performance | |
| CN100512020C (en) | Decoding method and decoding device | |
| CN107453807B (en) | A kind of polarization method, device and the electronic equipment of atmospheric optical communication channel model | |
| CN104025459A (en) | Decoding processing method and decoder | |
| CN111277277B (en) | Method and device for reducing decoding delay of polarization code continuous cancellation table decoding algorithm | |
| CN107370566B (en) | Punctured Turbo code blind identification method under error code condition | |
| RU2571597C2 (en) | Turbocode decoding method and device | |
| CN109768846B (en) | Hole drilling method, system, device and medium based on two-core three-core mixed polarization code | |
| CN108712232A (en) | A kind of multi-code word parallel decoding method in continuous variable quantum key distribution system | |
| Cluzeau et al. | Reconstruction of punctured convolutional codes | |
| CN116318185A (en) | Polar code coding and decoding method and low-frequency wireless communication system using same | |
| Ding et al. | An improved blind recognition method for synchronization position and coding parameters of k/n rate convolutional codes in a noisy environment | |
| CN116566404B (en) | Method and device for determining interleaving mapping relation of punctured Turbo codes | |
| CN110995279A (en) | Polarization code combined SCF spherical list overturning decoding method | |
| CN109672498B (en) | Decoding method and device | |
| CN100433836C (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| CN110324111B (en) | Decoding method and device | |
| CN113131950A (en) | Self-adaptive continuous elimination priority decoding method for polarization code | |
| WO2019137231A1 (en) | Decoding method and device | |
| JP5169771B2 (en) | Decoder and decoding method | |
| CN109639290B (en) | Semi-random grouping superposition coding and decoding method |
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 |