CN113438055A - Convolutional network coding transmission method based on unequal redundancy insertion - Google Patents
Convolutional network coding transmission method based on unequal redundancy insertion Download PDFInfo
- Publication number
- CN113438055A CN113438055A CN202110702736.3A CN202110702736A CN113438055A CN 113438055 A CN113438055 A CN 113438055A CN 202110702736 A CN202110702736 A CN 202110702736A CN 113438055 A CN113438055 A CN 113438055A
- Authority
- CN
- China
- Prior art keywords
- data packets
- group
- matrix
- packets
- encoded data
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 33
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000003780 insertion Methods 0.000 title claims abstract description 5
- 230000037431 insertion Effects 0.000 title claims abstract description 5
- 239000000284 extract Substances 0.000 claims abstract description 7
- 239000011159 matrix material Substances 0.000 claims description 39
- 238000004891 communication Methods 0.000 claims description 11
- 238000012937 correction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0059—Convolutional codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
本发明公开了一种基于不等冗余插入的卷积网络编码传输方法，主要解决现有技术时延大且不能应对无线信道突发错误的问题，其方案为：将所有待发送的数据包均匀分组并编码；将编码数据包进行卷积网络编码并发送到无线信道；通过接收端提取的编码数据包是否满秩判断并记录该组数据包能否正确译码；根据记录情况动态调整当前组加入冗余包的数量；接收端提取L组编码数据包，计算其自由度DOF；生成并发送DOF个重传数据包；对所提取的编码数据包进行译码，并记录译码时刻，完成编码数据包的传输。本发明减少了重传次数，并根据信道状况动态调整添加冗余编码包的数量，降低了时延，能应对信道突发的错误，可用于单路单跳和具有时延的实际网络。
The invention discloses a convolutional network coding transmission method based on unequal redundancy insertion, which mainly solves the problem that the prior art has large time delay and cannot deal with burst errors of wireless channels. Evenly group and encode the encoded data packets; perform convolutional network encoding on the encoded data packets and send them to the wireless channel; judge and record whether the encoded data packets extracted by the receiving end are full rank and whether the group of data packets can be correctly decoded; dynamically adjust the current The number of redundant packets added to the group; the receiver extracts L groups of encoded data packets, and calculates its degree of freedom DOF; generates and sends DOF retransmission data packets; decodes the extracted encoded data packets, and records the decoding time, Complete the transmission of the encoded packet. The invention reduces the number of retransmissions, dynamically adjusts the number of redundant coding packets added according to the channel conditions, reduces the time delay, can cope with channel burst errors, and can be used in single-channel, single-hop and actual networks with delay.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a convolutional network coding transmission method which can be used for a single-path single-hop actual network with time delay.
Background
The single-path single-hop wireless network is the most basic point-to-point network transmission model and consists of a transmitting end and a receiving end. The data packet in the single-path single-hop wireless network is generated and sent by a sending end, transmitted through a wireless communication channel and finally reaches a receiving end of the wireless network. In actual wireless communication, a wireless channel is affected by various factors, and there may be a case where a data packet is lost during channel transmission. Automatic repeat request ARQ and erasure code EC are two main methods to solve the problem of channel packet loss. However, in ARQ, the feedback of each data packet occupies network resources and has a time delay, and since a wireless communication channel may generate a burst error, the number of data retransmissions of some nodes is too large, which causes an increase in the delay of other data in a data queue, thereby reducing the effective utilization rate of the channel. The overhead due to feedback is also very large in case of poor channel performance. In linear block codes, the throughput of random linear network coding RLNC and systematic codes increases with increasing packet size, but with a large decoding delay. Therefore, the correlation of the data packets is increased by using a convolution mode, the number of the redundant packets added to the next group of data packets is dynamically adjusted according to the decoding condition of the previous group, and higher throughput can be achieved under the condition of low time delay. Network coding NC was originally proposed by Ahlswede et al in 2000, the essence of which was to allow relay nodes to perform forwarding operations after processing the information they received. However, in the single-hop network, each data packet is directly sent to the receiving end by the sending end without an intermediate node, and in order to improve the throughput of the single-hop network and fully utilize the wireless resources, the network coding technology is applied to the source node of the single-hop communication system, that is, when the source node sends the data packet, the source node sends the mixed packet after linear mixing of network coding, so that the purposes of improving the throughput of the single-hop network, ensuring the reliability of data transmission and fully utilizing the wireless resources are achieved.
The patent document of Nanjing university of science and engineering, "an end-to-end real-time reliable transmission method based on network coding" (application date: 2020, 12, month and 01, application number: 2020109303908, application publication number: CN112019304A) discloses an end-to-end real-time reliable transmission method based on network coding, which mainly solves the problems of network congestion, prolonged data transmission time, poor reliability and the like caused by node link instability, channel interference and the like in end-to-end network transmission. Firstly, designing a coding matrix, and coding on the basis of ensuring the linear independence between coding packets; secondly, in the decoding process of the receiving end, a rapid parallel decoding scheme is designed to reduce the calculation pressure of the receiving end; finally, the data transmission is carried out by utilizing the network coding based on the streaming processing. The method has one of two disadvantages, namely, only considering packet loss rate and communication radius of nodes when adding redundant packets according to network conditions, and cannot well cope with channel burst errors. Secondly, the coded data packet matrix is only related to the original data packet of the group, when the data packet received by the group cannot be decoded correctly, only feedback can be sent to the sending end and the sending end is waited to retransmit the coded packet, and decoding can be performed only when the number of the retransmitted effective data packets reaches a certain number, so that great time delay consumption can be generated.
Disclosure of Invention
The present invention aims at the defects of the prior art, and provides a convolutional network coding transmission method based on unequal redundancy insertion, so as to adaptively adjust the number of added redundant packets according to the real-time state of a channel, better cope with channel burst errors, and equivalently increase the coding length and the error correction capability through a convolutional network coding mode, thereby reducing the retransmission times and reducing the time delay.
The technical idea of the invention is as follows: the problem that the random linear network coding RLNC applied to high time delay of point-to-point wireless network transmission and a mode of expanding an original data packet cannot deal with burst errors of a wireless channel is solved. By carrying out convolutional network coding on the packet data packet, if the current group can not be decoded, when the data packet of the next group is received, the data packet of the current group can be decoded in a combined manner without waiting for the last retransmission data packet to be decoded, so that the problem of high time delay of random linear network coding is solved; the increased number of the next group of redundant packets is dynamically adjusted according to the decoding condition of the previous packet, rather than setting the number of the redundant packets to a fixed value, thereby solving the problem of channel burst errors.
According to the above thought, the implementation scheme of the invention comprises the following steps:
(1) uniformly dividing all data packets to be transmitted into M groups, storing each group of data packets in a matrix form, selecting a coding coefficient matrix on a finite field and multiplying the coding coefficient matrix by a packet data packet matrix to generate M groups of coding data packets, wherein the value range of M is [2, + ∞ ];
(2) performing convolutional network coding on M groups of coded data packets according to each L groups of data packets, and sequentially adding the obtained convolutional coded data packets into a sending queue of a sending end, wherein L represents the convolutional depth selected in the value range of [1,10], and k represents the number of each group of data packets;
(3) the method comprises the steps that a sending end sequentially sends convolution coding data packets in a queue to a wireless communication channel, and a receiving end extracts all coding data packets with the same group number as a received coding data packet from a receiving buffer queue after receiving the convolution coding data packets;
(4) judging whether the group of data packets can be correctly decoded according to whether the receiving end coded data packet matrix is full-rank: if the coding data packet matrix is full rank, recording 1 as a correct decoding state; otherwise, recording 0 as the state which can not be decoded correctly;
(5) according to the recording condition, dynamically adjusting the number of the redundant packets added into the current group, and inserting the redundant packets into a sending queue of L groups of coded data packets for sending so as to deal with burst errors of a channel;
(6) the receiving end extracts L groups of coded data packets from the receiving buffer queue and calculates the DOF of the coded data packets, if the DOF is 0, the step (8) is executed, otherwise, the step (7) is executed;
(7) selecting a coding coefficient matrix on a limited domain, left-multiplying the data packet matrix to generate DOF coding retransmission data packets, inserting the DOF coding retransmission data packets into a sending queue for sending, finishing one retransmission, adding one to the retransmission times, and judging whether the current retransmission times reach the set maximum retransmission times: if yes, sending the next group of data packets; otherwise, returning to the step (6);
(8) and the receiving end decodes the extracted coded data packet by using a Gaussian elimination method, records corresponding decoding time and completes transmission of the coded data packet.
Compared with the prior art, the invention has the following advantages:
firstly, because the invention generates and sends the coded data packet, the coding mode is convolution, namely the data packet is subjected to linear mixing in groups and between groups, the correlation among the data packets is enhanced, and the throughput of system transmission is improved; the number of redundancy of the next group of data packets is dynamically adjusted according to the receiving condition of the previous group of data packets, so that the decoding probability of the data packets which cannot be decoded is greatly improved, and the transmission delay of the data packets in the single-hop wireless network is reduced;
secondly, because the receiving end utilizes the convolution coding and decoding method, the error correction capability of the code with the packet length of kxL can be obtained, namely the throughput is large, and the decoding time delay is close to the time delay of the code with the packet length of k.
Thirdly, because the invention adaptively adjusts the next group of data packets according to the receiving condition of the previous group of data packets to increase the number of redundancies, more redundancies can be increased to resist burst errors of a channel under the condition of poor channel state, thereby overcoming the defects that the loss of coded packets in the same batch in the prior art affects the rank of the coded packets in the same batch in a receiving node, and further affects the decoding of a receiving end, so that the transmission success rate of a single-hop wireless network is reduced, the probability that the receiving end receives full-rank coded data packets is improved, and further the transmission success rate of the single-hop wireless network is improved.
Drawings
FIG. 1 is a diagram of a use scenario of the present invention;
fig. 2 is a flow chart of the implementation of the present invention.
Detailed Description
Embodiments of the present invention will be described in further detail below with reference to the accompanying drawings.
Referring to fig. 1, the present embodiment is a process of performing data transmission and feedback retransmission based on a single-path single-hop network topology model, where the model is composed of a sending end and a receiving end, the sending end sends out a coded data packet for convolutional network coding, and transmits the data packet to the receiving end through a channel, and the receiving end feeds back the sending end according to the receiving condition, and if the receiving end feeds back an acknowledgement character ACK, the sending end sends the next group of data packets; otherwise, the transmitting end transmits the retransmission coding data packet.
Referring to fig. 2, an implementation of this example includes the following steps:
step 1, uniformly grouping and coding all data packets to be sent.
Uniformly dividing all data packets to be sent into M groups at a sending end, and storing each group of data packets in a matrix form; in that
The coding coefficient matrix selected from GF (2) and GF (2) in finite field3)、GF(26)、GF(28) Any value randomly chosen in these finite fields;
and the selected coding coefficient matrix is multiplied by the grouped data packet matrix to generate M groups of coding data packets, wherein the value range of M is [2, + ∞ ].
And 2, carrying out convolutional network coding on the coded data packet.
Selecting front L groups of data packets from the M groups of coded data packets to carry out convolutional network coding;
randomly selecting a coding coefficient matrix of k rows and k columns in a finite field, and performing left multiplication on the group of data packet matrices to complete the coding of an original data packet;
randomly selecting a convolution coding coefficient matrix of Y rows and k multiplied by L columns in a finite field, and performing left multiplication on a data packet matrix formed by splicing a group where a data packet to be transmitted is located and all groups transmitted before the group to complete convolution operation of the data packet;
and adding the obtained convolution coding data packets into a sending queue of a sending end in sequence, wherein L represents the selected convolution depth in the value range of [1,10], k represents the number of each group of data packets, and Y is the number of the added redundant packets.
And 3, the transmitting end transmits the convolution coding data packet, and the receiving end extracts the coding data packet.
The transmitting end sequentially transmits the convolution coding data packets in the queue to a wireless communication channel, and after receiving the convolution coding data packets, the receiving end extracts all coding data packets with the same group number as the received coding data packets from the receiving buffer queue.
And 4, judging whether the group of data packets can be correctly decoded according to whether the receiving end coded data packet matrix is full rank.
The rank of the receiving matrix of i × N rows and i × k columns is calculated as r by calling the rank function of Matlab, and is compared with the number of columns of the receiving matrix:
if r is i × k, the decoding is full rank and correct, and the state is recorded as 1;
otherwise, the decoding can not be correctly carried out, and the state is marked as 0;
where i is the number of groups and N is the total number of original and redundant packets.
And 5, dynamically adjusting the number of the redundant packets added into the current group according to the recording condition.
Counting the number j of groups which are not decoded correctly, generating j multiplied by X redundant coding packets, and inserting the redundant coding packets into a transmission queue of L groups of coding data packets for transmission so as to deal with burst errors of a channel, wherein X represents a linear coefficient with the value range of [1, k ].
And 6, extracting the L groups of coded data packets from the receiving buffer queue by the receiving end, and calculating the DOF of the L groups of coded data packets.
Extracting L groups of coded data packets from a receiving end, calling rank function of Matlab to calculate rank r' of receiving matrix of L multiplied by N rows and L multiplied by k columns,
comparing the rank r' with the number of columns L × k of the receive matrix, the degree of freedom DOF is obtained:
if r' is L × k, the degree of freedom DOF is 0, and step 8 is performed;
otherwise, DOF — L × k-r', step 7 is performed.
And 7, generating and sending the retransmission data packet.
Selecting a coding coefficient matrix on a limited domain, left-multiplying the data packet matrix to generate DOF coding retransmission data packets, inserting the DOF coding retransmission data packets into a transmission queue for transmission, completing one retransmission,
and adding one to the retransmission times, and judging whether the current retransmission times reach the set maximum retransmission times:
if yes, sending the next group of data packets; otherwise, the procedure returns to the step 6,
wherein, the set maximum retransmission times is set according to one of the following two conditions:
the method comprises the following steps that a sending end sends a group of data packets to a receiving end, in order to guarantee reliability, the retransmission times of the receiving end when the receiving end can decode with the probability close to 1 are calculated, and the retransmission times are set as the maximum retransmission times;
and secondly, when the erasure probability of the wireless communication channel is in the interval of [0.2,1], in order to prevent the generation of huge transmission delay caused by repeated retransmission, an integer randomly selected in the value range of [0,4] is set as the maximum retransmission time.
And 8, decoding the extracted coded data packet by the receiving end by using a Gaussian elimination method, and recording corresponding decoding time to finish the transmission of the coded data packet.
The foregoing description is only an example of the present invention and is not intended to limit the invention, so that it will be apparent to those skilled in the art that various changes and modifications in form and detail may be made therein without departing from the spirit and scope of the invention.
Claims (7)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110702736.3A CN113438055B (en) | 2021-06-24 | 2021-06-24 | Convolutional Network Coding Transmission Method Based on Unequal Redundancy Insertion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110702736.3A CN113438055B (en) | 2021-06-24 | 2021-06-24 | Convolutional Network Coding Transmission Method Based on Unequal Redundancy Insertion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113438055A true CN113438055A (en) | 2021-09-24 |
| CN113438055B CN113438055B (en) | 2022-04-08 |
Family
ID=77755305
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110702736.3A Active CN113438055B (en) | 2021-06-24 | 2021-06-24 | Convolutional Network Coding Transmission Method Based on Unequal Redundancy Insertion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113438055B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114630369A (en) * | 2022-03-17 | 2022-06-14 | 西安电子科技大学 | An access network data transmission method, system, medium, device and terminal |
| CN115022838A (en) * | 2022-05-31 | 2022-09-06 | 中国电子科技集团公司信息科学研究院 | Network coding communication method and device based on layered network architecture |
| CN115134307A (en) * | 2022-06-27 | 2022-09-30 | 长沙理工大学 | A Load Balancing Method Based on Packet Loss Rate Coding in Cloud Computing |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080134005A1 (en) * | 2004-12-02 | 2008-06-05 | Izzat Hekmat Izzat | Adaptive Forward Error Correction |
| CN105991227A (en) * | 2015-02-15 | 2016-10-05 | 中兴通讯股份有限公司 | Data encoding method and apparatus |
| CN107547436A (en) * | 2017-07-19 | 2018-01-05 | 西南交通大学 | Coding and Decoding Method of Transmission Control Protocol Based on Network Coding |
| CN110149123A (en) * | 2019-04-25 | 2019-08-20 | 中国科学院上海微系统与信息技术研究所 | A kind of nonopiate FHMA communication means of small flow multi-user |
| CN110191065A (en) * | 2019-06-08 | 2019-08-30 | 西安电子科技大学 | High performance load balancing system and method based on software defined network |
| CN112600647A (en) * | 2020-12-08 | 2021-04-02 | 西安电子科技大学 | Multi-hop wireless network transmission method based on network coding endurance |
-
2021
- 2021-06-24 CN CN202110702736.3A patent/CN113438055B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080134005A1 (en) * | 2004-12-02 | 2008-06-05 | Izzat Hekmat Izzat | Adaptive Forward Error Correction |
| CN105991227A (en) * | 2015-02-15 | 2016-10-05 | 中兴通讯股份有限公司 | Data encoding method and apparatus |
| CN107547436A (en) * | 2017-07-19 | 2018-01-05 | 西南交通大学 | Coding and Decoding Method of Transmission Control Protocol Based on Network Coding |
| CN110149123A (en) * | 2019-04-25 | 2019-08-20 | 中国科学院上海微系统与信息技术研究所 | A kind of nonopiate FHMA communication means of small flow multi-user |
| CN110191065A (en) * | 2019-06-08 | 2019-08-30 | 西安电子科技大学 | High performance load balancing system and method based on software defined network |
| CN112600647A (en) * | 2020-12-08 | 2021-04-02 | 西安电子科技大学 | Multi-hop wireless network transmission method based on network coding endurance |
Non-Patent Citations (2)
| Title |
|---|
| MINGYE LIU，等: "Adaptive Construction and Decoding of Random Convolutional Network Error-correction Coding", 《2019 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC)》 * |
| 吴冀衍等: "面向异构无线网移动视频传输的联合信源信道编码方式", 《计算机学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114630369A (en) * | 2022-03-17 | 2022-06-14 | 西安电子科技大学 | An access network data transmission method, system, medium, device and terminal |
| CN115022838A (en) * | 2022-05-31 | 2022-09-06 | 中国电子科技集团公司信息科学研究院 | Network coding communication method and device based on layered network architecture |
| CN115134307A (en) * | 2022-06-27 | 2022-09-30 | 长沙理工大学 | A Load Balancing Method Based on Packet Loss Rate Coding in Cloud Computing |
| CN115134307B (en) * | 2022-06-27 | 2024-01-26 | 长沙理工大学 | Load balancing method based on packet loss rate coding in cloud computing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113438055B (en) | 2022-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1317811B1 (en) | Hybrid arq for packet data transmission | |
| Cohen et al. | Adaptive causal network coding with feedback | |
| CN101621364B (en) | Automatic retransmission controller and retransmission block reassembly device | |
| CN101878612B (en) | Method and system for data transmission in a data network | |
| CN113438055B (en) | Convolutional Network Coding Transmission Method Based on Unequal Redundancy Insertion | |
| CN112600647B (en) | Multi-hop wireless network transmission method based on network coding endurance | |
| Malak et al. | Tiny codes for guaranteeable delay | |
| KR20020003526A (en) | Hybrid automatic repeat request method and apparatus for improving mobile communication systems | |
| CN109889308B (en) | Hybrid automatic repeat request method for joint polarization coding and decoding in Internet of things | |
| CN109510687A (en) | A kind of fountain code encoding method based on satellite communication | |
| Badia et al. | Markov analysis of selective repeat type II hybrid ARQ using block codes | |
| CN101938334A (en) | An Adaptive Error Control Method Combined with Random Network Coding and Automatic Repeat Request | |
| Chitre et al. | Reliable point-to-point underwater acoustic data transfer: To juggle or not to juggle? | |
| CN103067137A (en) | Multicast retransmission method based on network codes | |
| CN106254044B (en) | Dynamic linear combination retransmission method based on multicast network coding | |
| Li et al. | N-in-1 retransmission with network coding | |
| CN109495213A (en) | A kind of broadcast repeating method and system based on Hamming weight coding | |
| Malak et al. | ARQ with cumulative feedback to compensate for burst errors | |
| Gossink et al. | Reliable multicast and integrated parity retransmission with channel estimation considerations | |
| Malak et al. | Throughput and delay analysis for coded ARQ | |
| CN103346859B (en) | The encoding and decoding method of distributed unequal error protection LT code | |
| CN109005011B (en) | Data transmission method and system for underwater acoustic network and readable storage medium | |
| WO2008043315A1 (en) | A method and system for applying the error correction code technology to the data transmission | |
| RU2419997C2 (en) | Secure group transfer with linear independent coding of data packages | |
| Bian et al. | Endurance Network Coding for Multi-Hop Wireless Communications |
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 |