CN104158628B - Relay transfer method based on unique decodable code - Google Patents
Relay transfer method based on unique decodable code Download PDFInfo
- Publication number
- CN104158628B CN104158628B CN201410421529.0A CN201410421529A CN104158628B CN 104158628 B CN104158628 B CN 104158628B CN 201410421529 A CN201410421529 A CN 201410421529A CN 104158628 B CN104158628 B CN 104158628B
- Authority
- CN
- China
- Prior art keywords
- user
- channel
- time slot
- relay
- node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 21
- 239000013598 vector Substances 0.000 claims description 18
- 238000009826 distribution Methods 0.000 claims description 2
- 238000013507 mapping Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 4
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 238000004088 simulation Methods 0.000 description 14
- 238000011160 research Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Radio Relay Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Relay transfer method based on unique decodable code, the present invention relates to the relay transfer method based on unique decodable code.The present invention is to solve existing physical-layer network coding in Rayleigh channel bit error rate height and in M (M>3) in the relay system of node, it is necessary to transmission number of timeslots increase, the problem of handling capacity of system is reduced.For the relay system of a M node, including 1 user node of M and a via node, any one user node obtains other any user node transmitted informations using two time slots by via node；In first time slot, all 1 user nodes of M will carry out the information after unique decodable code coding, be sent to via node；In second time slot, via node is by judgement and forwards, and the result after judgement is sent in the form of broadcasting, each user node is by matching the broadcast message received with the decoding of unique decodable code.The present invention is applied to the communications field.
Description
Technical Field
The invention relates to a relay forwarding method based on unique decipherable codes.
Background
With the development of scientific technology, Network Coding (NC) is becoming a popular research field in the communication field. Network coding can be used in wireless network systems and wired network systems, and gives great influence to aspects of information theory, wireless communication, network architecture and the like. Physical-layer network coding (PNC) has gradually become an important research hotspot in the field of network coding. The PNC improves the throughput of the system by effectively utilizing the properties of the relay nodes and by reducing the number of time slots required to be transmitted between the nodes, and moreover, the PNC can be regarded as cooperative communication.
The research on PNC has mainly focused on the following directions. First, the PNC coding scheme is studied, including convolutional codes, Low Density Parity Check codes (LDPC), LDPC accumulation codes, and the like. Next, the research on the PNC Modulation method includes different Modulation methods, including Frequency-shift keying (FSK), Quadrature Amplitude Modulation (QAM), and the like. In addition, there have been studies on problems such as synchronization in PNC and channel capacity.
Most of the existing research on PNC is under gaussian channel (AWGN), and PNC has excellent performance under gaussian channel. In the rayleigh channel, PNC is difficult to perform, and the existing solution is to use a Multiple-antenna system (MIMO). But this would waste the degree of freedom gain from MIMO technology. Furthermore, in an M (M >3) node relay system, including M-1 user nodes and 1 relay node, it is difficult for the PNC to implement an exclusive or (XOR) operation.
Disclosure of Invention
The invention provides a relay forwarding method based on unique decipherable code, aiming at solving the problems that the number of time slots needing to be transmitted is increased and the throughput of the system is reduced in a relay system of an M (M >3) node due to high Rayleigh channel error rate of the traditional physical layer network coding.
The relay forwarding method based on the unique decipherable code is realized according to the following steps:
the relay system of the M node comprises M-1 user nodes and a relay node, wherein any user node obtains information sent by any other user node through the relay node by utilizing two time slots;
in the first time slot, all M-1 user nodes send information subjected to unique decodable coding to the relay node;
and then in a second time slot, the relay node judges and forwards, the judged result is sent in a broadcast mode, and each user node matches the received broadcast information with the unique decodable code, so that the information sent by other user nodes is obtained, and the relay forwarding method based on the unique decodable code is completed.
The invention has the following effects:
aiming at the defects of PNC in a multi-node relay system, the invention starts from the coding angle, applies the only decodable code to the physical layer, and maps different user terminals through the data information of the relay node, thereby improving the throughput of the system. Not only that. The relay forwarding strategy based on the unique decipherable code provided by the invention has good error rate performance even in a Rayleigh channel.
In gaussian channel, when M is 3, the channel capacity of the present invention is higher (SNR >8dB), compared with PNC, the present invention will have a qualitative improvement, and will break through the upper limit of channel capacity of PNC (0.5) when M is 3, and use a unique decodable code with better performance, even the upper limit of channel capacity can be close to 0.75. And when M is greater than 3, the only decodable relay forwarding system is utilized, the transmission time slot can be greatly reduced, and the transmission can be completed through 2 time slots, so that the throughput of the system is greatly improved.
The relay forwarding strategy based on the unique decipherable code provided by the invention has acceptable symbol error performance and better channel capacity when the time slot 1 is a Rayleigh channel under the condition that M is 3, and can still break through the theoretical upper bound 0.5 of the PNC channel capacity at the moment.
Drawings
Fig. 1 is a block diagram of a relay system of an M node in a first embodiment;
fig. 2 is a system block diagram of a timeslot 1 in the second embodiment;
fig. 3 is a system block diagram of timeslot 2 in the third embodiment;
fig. 4 is a system flowchart of timeslot 1 in the second embodiment;
fig. 5 is a system flow chart of timeslot 2 in the third embodiment;
FIG. 6 is a bit error rate simulation graph in a simulation experiment;
fig. 7 is a graph of throughput simulation in a simulation experiment.
Detailed Description
The first embodiment is as follows: the relay forwarding method based on the unique decipherable code in the embodiment is realized by the following steps:
the relay system of the M node comprises M-1 user nodes and a relay node, wherein any user node obtains information sent by any other user node through the relay node by utilizing two time slots;
in the first time slot, all M-1 user nodes send information subjected to unique decodable coding to the relay node;
and then in a second time slot, the relay node judges and forwards, the judged result is sent in a broadcast mode, and each user node matches the received broadcast information with the unique decodable code, so that the information sent by other user nodes is obtained, and the relay forwarding method based on the unique decodable code is completed.
The second embodiment is as follows: the first difference between the present embodiment and the specific embodiment is: the first time slot is executed as follows:
step one, all M-1 user nodes pass the effective information data of the user nodes through a unique decodable encoder to obtain a coded code word d1,d2,...,dM-1(ii) a Wherein each of the codewords is an n-dimensional vector;
step two, obtaining M-1 code words d in step one1,d2,...,dM-1Respectively, are modulated into s1,s2,...,sM-1Wherein s isiRepresents the modulated symbol transmitted by the ith user in the first time slot, wherein i is 1, 2.
Step three, the s in the step two1,s2,...,sM-1Respectively through channel h1,h2,...,hM-1Receiving a signal r at a relay nodeR；
Wherein,
wherein, the wRDenotes white Gaussian noise at the relay node in the first slot, and wRIs an n-dimensional vector;
the channel h1,h2,...,hM-1If h is1＝h2＝…＝hM-11, in the time slot 1, the channel of each user and the relay node is a gaussian channel;
if channel h1,h2,…hM-1The channel of each user and each relay node is a Rayleigh channel;
step four, mixing rRThe decision is the decided symbol through the decision device of the relay node
Step five, calculating a setWherein,hirepresenting the channel parameter, s, of the first time slot from the ith user to the relay nodeiIs an n-dimensional vector, i represents the ith user;
step six, judgingWhether or not it belongs to RRelayIf yes, the time slot is finished, if no, the step three is carried out, and s is adjusted1,s2,...,sM-1Respectively through channel h1,h2,...,hM-1Retransmission, receiving signal r at the relay nodeR。
Other steps and parameters are the same as those in the first embodiment.
The third concrete implementation mode: the present embodiment differs from the first or second embodiment in that: the second time slot is executed as follows:
step one, theThrough a relay node in the form of a broadcast through a channel h1′,h2′,…h′M-1Sending out; wherein the channel h1′,h2′,…h′M-1If h is1′＝h2′＝…＝h′M-11, then in the 2 nd time slot, the broadcast channel of the relay node and each user is the rayleigh channel;
if channel h1′,h2′,…h′M-1All the time slots are rayleigh distributions which are independent and distributed, and then in the 2 nd time slot, the broadcast channels of the relay node and each user are rayleigh channels;
step two, in all M-1 users, the received broadcast information r is transmitted1,r2,...,rM-1Is decided as
Wherein r isiRepresenting the signal received by the ith user in the second time slot, ri(1. ltoreq. i. ltoreq.M-1) is
Wherein, wi(i is more than or equal to 1 and less than or equal to M-1) is independently and identically distributed Gaussian white noise,wi，riare all n-dimensional vectors;
indicating the signal r received by the ith subscriber in the second time slotiA result after being judged;
step three, calculatinghi' denotes a second time slot from the relay node to the ith user channel;
step four, judgingWhether or not all are in RuserIf yes, the fifth step is carried out, and the second time slot is ended; otherwise, turning to the step one, andretransmitting in a broadcast form through the relay node;
step five, respectively arranging the M-1 user nodesMapped by a uniquely decodable encoder, decoded intoAnd ending the second time slot.
Other steps and parameters are the same as those in the first or second embodiment.
The fourth concrete implementation mode: the difference between this embodiment mode and one of the first to third embodiment modes is: the unique decodable encoding is specifically:
in a relay system with M nodes, the only decodable word set for the ith user (1 ≦ i ≦ M-1) is assumed to be CiAnd assume that in each user's codeword set, there is | CiL code words, each of which has a length of n, known from the definition of unique decodable code, and in the ith user, any two different code words uiAnd ui', need to satisfy
Wherein, both ends of the formula (3) are n-dimensional vectors, and the vectors are M-system;
let set E be a set of bitwise sums of all possible codewords of length n for M-1 user nodes, set E being denoted asWhere i 1, 2.., M-1, given the definition of unique codable, it is known that set E containsEach element is an n-dimensional M-system vector;
in the decoding process, due to the unique decodable property of M-1 users, the sum of any M-1 code words can be uniquely mapped into the M-1 code words by knowing, namely, the unique decodable decoding mode is that the M-1 code words are restored by mapping according to the sum vector of the code words.
Other steps and parameters are the same as those in one of the first to third embodiments.
The fifth concrete implementation mode: the difference between this embodiment and one of the first to fourth embodiments is: if the modulation mode in the second step of executing the first time slot is BPSK, the modulation mode is the BPSK
si＝2·di-I,(i＝1,2,...,M-1) (4)
Wherein, I is an n-dimensional all-1 vector, i.e., (1, 1., 1).
Other steps and parameters are the same as in one of the first to fourth embodiments.
The sixth specific implementation mode: the difference between this embodiment and one of the first to fifth embodiments is: the decision is a hard decision or a soft decision. Other steps and parameters are the same as those in one of the first to fifth embodiments.
Simulation experiment:
gaussian channel
In the gaussian channel, the simulation parameters are shown in table 1.
TABLE 1 Gauss channel simulation parameters
R at this timeRelayIs { (-2, -2), (0,0), (-2,0), (0,2), (0, -2), (2,0) }. In the same way, R at this time can be obtaineduserIs { (-2, -2), (0,0), (-2,0), (0,2), (0, -2), (2,0) }. The results of the bit error rate simulation and the channel capacity simulation are respectively asAs shown in fig. 6 and 7.
From fig. 6 and 7, in the gaussian channel, although the symbol error performance of the relay forwarding strategy based on unique decoding proposed by the present invention is slightly worse than that of the PNC. However, when the signal-to-noise ratio is high (SNR >8dB), the channel capacity of the present invention is substantially improved relative to the PNC, and when M is 3, the upper limit of the channel capacity of the PNC is (0.5). With better performance unique decodable, the upper bound of channel capacity can even be made close to 0.75.
(II) Rayleigh channel
Under the rayleigh channel, the simulation parameters are shown in table 2.
TABLE 2 Rayleigh channel simulation parameters
For convenience of illustration, x is not represented as h1+h2，y＝h1-h2. R at this timeRelayIs { (-x, -x), (y, y), (-x, -y), (y, x), (-y, -x), (x, y) }. In the same way, R at this time can be obtaineduserIs { (-x, -x), (y, y), (-x, -y), (y, x), (-y, -x), (x, y) }. The results of the bit error rate simulation and the channel capacity simulation are shown in table 3, respectively.
Table 3 performance under rayleigh channel of this simulation experiment
As can be seen from table 3, in the relay forwarding strategy based on unique decoding proposed in the present invention, when M is 3, when timeslot 1 becomes a rayleigh channel, there is still acceptable symbol error performance, and there is better channel capacity, at this time, the theoretical upper bound of PNC channel capacity can still be broken through by 0.5.
In conclusion, the relay forwarding strategy based on the unique decipherable code provided by the invention can be applied to a relay system of the M node, the throughput of the system is greatly improved, and the error rate is ensured to be within an acceptable range.
Claims (5)
1. The relay forwarding method based on the unique decipherable code is characterized in that the relay forwarding method based on the unique decipherable code is realized according to the following steps:
the relay system of the M node comprises M-1 user nodes and a relay node, wherein any user node obtains information sent by any other user node through the relay node by utilizing two time slots;
in the first time slot, all M-1 user nodes send information subjected to unique decodable coding to the relay node;
then in the second time slot, the relay node judges and forwards, the judged result is sent in a broadcast mode, each user node matches the received broadcast information with the unique decodable code, and thus the information sent by other user nodes is obtained, namely the relay forwarding method based on the unique decodable code is completed;
the first time slot is executed as follows:
step one, all M-1 user nodes pass the effective information data of the user nodes through a unique decodable encoder to obtain a coded code word d1,d2,...,dM-1(ii) a Wherein each codeword is an n-dimensional vector;
step two, obtaining M-1 code words d in step one1,d2,...,dM-1Respectively, are modulated into s1,s2,...,sM-1Wherein s isiRepresents the modulated symbol transmitted by the ith user in the first time slot, wherein i is 1, 2.
Step three, the s in the step two1,s2,...,sM-1Respectively through channel h1,h2,...,hM-1Receiving a signal r at a relay nodeR；
Wherein,
wherein, the wRDenotes white Gaussian noise at the relay node in the first slot, and wRIs an n-dimensional vector;
the channel h1,h2,...,hM-1If h is1＝h2＝…＝hM-11, in the time slot 1, the channel of each user and the relay node is a gaussian channel;
if channel h1,h2,…hM-1The channel of each user and each relay node is a Rayleigh channel;
step four, mixing rRBy relaysThe decision of the node is the decided symbol
Step five, calculating a setWherein h isiRepresenting the channel parameter, s, of the first time slot from the ith user to the relay nodeiIs an n-dimensional vector, i represents the ith user;
step six, judgingWhether or not it belongs to RRelayIf yes, the time slot is finished, if no, the step three is carried out, and s is adjusted1,s2,...,sM-1Respectively through channel h1,h2,...,hM-1Retransmission, receiving signal r at the relay nodeR。
2. The unique decodable based relay forwarding method according to claim 1, wherein said second time slot is executed by the following steps:
step one, theThrough a relay node in the form of a broadcast through a channel h1′,h2′,…h′M-1Sending out; wherein the channel h1′,h2′,…h′M-1If h is1′＝h2′＝…＝h′M-11, then in the 2 nd time slot, the broadcast channel of the relay node and each user is the rayleigh channel;
if channel h1′,h2′,…h′M-1All the time slots are rayleigh distributions which are independent and distributed, and then in the 2 nd time slot, the broadcast channels of the relay node and each user are rayleigh channels;
step two, in all M-1 users, the received broadcast information r is transmitted1,r2,...,rM-1Is decided asWherein r isiRepresenting the signal received by the ith user in the second time slot, ri(1. ltoreq. i. ltoreq.M-1) is
Wherein, wi(i is more than or equal to 1 and less than or equal to M-1) is independently and identically distributed Gaussian white noise,wi，riare all n-dimensional vectors;
indicating the signal r received by the ith subscriber in the second time slotiA result after being judged;
step three, calculatinghi' denotes a second time slot from the relay node to the ith user channel;
step four, judgingWhether or not all are in RuserIf yes, the fifth step is carried out, and the second time slot is ended; otherwise, turning to the step one, andretransmitting in a broadcast form through the relay node;
step five, respectively arranging the M-1 user nodesMapped by a uniquely decodable encoder, decoded intoAnd ending the second time slot.
3. The relay forwarding method based on unique decodable code according to claim 2, wherein the unique decodable code is specifically:
in a relay system with M nodes, the only decodable word set for the ith user (1 ≦ i ≦ M-1) is assumed to be CiAnd assume that in each user's codeword set, there is | CiL code words, each of which has a length of n, known from the definition of unique decodable code, and in the ith user, any two different code words uiAnd ui', need to satisfy
Wherein, both ends of the formula 3 are n-dimensional vectors, and the vectors are M-ary;
let set E be a set of bitwise sums of all possible codewords of length n for M-1 user nodes, set E being denoted asWhere i 1, 2.., M-1, given the definition of unique codable, it is known that set E containsEach element is an n-dimensional M-system vector;
in the decoding process, due to the unique decodable property of M-1 users, the sum of any M-1 code words can be uniquely mapped into the M-1 code words by knowing, namely, the unique decodable decoding mode is that the M-1 code words are restored by mapping according to the sum vector of the code words.
4. The relay forwarding method based on unique coding according to claim 2, wherein the modulation scheme in the second step of executing the first timeslot is BPSK, and then the modulation scheme is BPSK
si＝2·di-I, (I ═ 1, 2.., M-1) formula 4
Wherein, I is an n-dimensional all-1 vector, i.e., (1, 1., 1).
5. The unique decodable based relay forwarding method of claim 3, wherein said decision is a hard decision or a soft decision.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410421529.0A CN104158628B (en) | 2014-08-25 | 2014-08-25 | Relay transfer method based on unique decodable code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410421529.0A CN104158628B (en) | 2014-08-25 | 2014-08-25 | Relay transfer method based on unique decodable code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104158628A CN104158628A (en) | 2014-11-19 |
| CN104158628B true CN104158628B (en) | 2017-08-11 |
Family
ID=51884046
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410421529.0A Active CN104158628B (en) | 2014-08-25 | 2014-08-25 | Relay transfer method based on unique decodable code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104158628B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109039976A (en) * | 2018-09-25 | 2018-12-18 | 哈尔滨工业大学 | A kind of downlink multi-access cut-in method based on unique decodable code |
| CN109067504A (en) * | 2018-09-25 | 2018-12-21 | 哈尔滨工业大学 | A kind of multiple access up-link access method based on unique decodable code |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101515917A (en) * | 2009-03-25 | 2009-08-26 | 东南大学 | Multi-user wireless communication system based on both-way trunk and method thereof |
| CN102833048A (en) * | 2012-09-19 | 2012-12-19 | 上海交通大学 | Bidirectional relay transmission system and method |
| JP2013009410A (en) * | 2012-08-22 | 2013-01-10 | Fujitsu Ltd | Wireless relay communication method, wireless base station, and wireless relay station |
| CN102983947A (en) * | 2012-12-19 | 2013-03-20 | 哈尔滨工业大学 | Wireless communication method for physical network coding in flat frequency-selective fading channel, based on two-way relay model |
| CN103078705A (en) * | 2012-12-31 | 2013-05-01 | 哈尔滨工业大学 | M-ary quadrature amplitude modulation (MQAM)-mode-based physical-layer network coding wireless communication method |
| CN103152311A (en) * | 2013-03-15 | 2013-06-12 | 哈尔滨工业大学 | Wireless communication method based on orthogonal frequency division multiplexing physical layer network encoding communication system power distribution technology |
-
2014
- 2014-08-25 CN CN201410421529.0A patent/CN104158628B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101515917A (en) * | 2009-03-25 | 2009-08-26 | 东南大学 | Multi-user wireless communication system based on both-way trunk and method thereof |
| JP2013009410A (en) * | 2012-08-22 | 2013-01-10 | Fujitsu Ltd | Wireless relay communication method, wireless base station, and wireless relay station |
| CN102833048A (en) * | 2012-09-19 | 2012-12-19 | 上海交通大学 | Bidirectional relay transmission system and method |
| CN102983947A (en) * | 2012-12-19 | 2013-03-20 | 哈尔滨工业大学 | Wireless communication method for physical network coding in flat frequency-selective fading channel, based on two-way relay model |
| CN103078705A (en) * | 2012-12-31 | 2013-05-01 | 哈尔滨工业大学 | M-ary quadrature amplitude modulation (MQAM)-mode-based physical-layer network coding wireless communication method |
| CN103152311A (en) * | 2013-03-15 | 2013-06-12 | 哈尔滨工业大学 | Wireless communication method based on orthogonal frequency division multiplexing physical layer network encoding communication system power distribution technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104158628A (en) | 2014-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4272663B2 (en) | Communication receiver | |
| RU2486673C1 (en) | Method for uplink transmission of data from user terminal, base station, coordination device and communication network therefor | |
| CN107211033B (en) | Method and device for data transmission | |
| CN101809920A (en) | Rate matching for a wireless communications system | |
| JP5665850B2 (en) | Method and apparatus for data packet relay and data packet decoding | |
| US8000282B2 (en) | Cooperative relaying using dirty paper coding | |
| CN102037671A (en) | Selection of retransmission settings for HARQ in WCDMA and LTE networks | |
| CN101394255B (en) | Two-user collaboration communication method in multi-user wireless network | |
| US20100246708A1 (en) | Radio communication apparatus, radio communication method, and radio communication system | |
| EP2191581A2 (en) | Rate matching to maintain code block resource element boundaries | |
| CN101826935B (en) | Low-density parity check code-based relay cooperative transmission method | |
| KR20120063502A (en) | Wireless communication system, radio relay station apparatus, radio terminal station apparatus, and wireless communication method | |
| US20180063849A1 (en) | Transmission and detection methods for range extension | |
| CN102571274B (en) | Signal transmitting method applicable to prerotation phase of wireless bidirectional relay system | |
| CN111555757A (en) | Non-orthogonal multiple access system downlink power and no-rate code joint optimization method | |
| CN104158628B (en) | Relay transfer method based on unique decodable code | |
| Gudipati et al. | Automatic rate adaptation | |
| CN109039976A (en) | A kind of downlink multi-access cut-in method based on unique decodable code | |
| CN107005347B (en) | Method and apparatus for flexible, selective SSDF relaying | |
| CN105554813B (en) | It is a kind of in data transmission method of the wireless relay system based on Random Maps code | |
| US8310951B2 (en) | Network coding method and system through consideration of channel state difference of receivers | |
| CN112787733B (en) | Bidirectional relay scheme self-adaptive selection method, system, storage medium and terminal | |
| Zeng et al. | Polar coded cooperative differential spatial modulation based on plotkin construction and quasi-uniform puncturing | |
| CN111213346B (en) | Method and computing device for facilitating multi-user detection | |
| US20180336117A1 (en) | Systems and Methods for Transmitting Data Using Encoder Cooperation in the Presence of State Information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |