# US 10,374,754 B2 · Polar code rate matching method and apparatus, and wireless communications device

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,374,754 B2
- Document ID: US10374754B2
- Status: Granted
- Kind: B2
- Application number: 15/608,060
- Filed: 2017-05-30
- Published: 2017-09-14
- Granted: 2019-08-06
- Earliest claimed: 2014-11-27
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Hui Shen; Bin Li
- Web page: https://patentgrep.com/patent/US10374754B2

## CPC

- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/13: Linear codes
- H03M 13/27: using interleaving techniques
- H03M 13/2742: {Irregular interleaver wherein the permutation pattern is not obtained by a computation rule, e.g. interleaver based on random generators}
- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H03M 13/6362: {by puncturing}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0068: {by puncturing}
- H04N 19/00: Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

The present disclosure discloses a polar code rate matching method and apparatus and a wireless communications device that includes performing sorting processing on the first sequence Z according to a preset rule to determine a second sequence, wherein the first sequence Z is determined based on a Mersenne twister algorithm according to a code length of a target polar code, and interleaving the target polar code according to a mapping function to generate interleaved output bits, wherein the mapping function is determined according to the first sequence Z and the second sequence. A Mersenne twister algorithm is applied to target polar code rate matching such that a bit sequence obtained from the rate matching can be more even in structure, a frame error rate of a punctured polar code can be reduced, hybrid automatic repeat request (HARQ) performance can be improved, and further, communication reliability can be improved.

## Claims

### Claim 1

An apparatus, comprising:
a memory configured to store instructions; and
a processor coupled to the memory and configured to execute the instructions, which cause the processor to be configured to:
determine a first sequence based on a Mersenne twister algorithm according to a code length of a target polar code and data bits that are to be sent by the apparatus;
perform a sort function on the first sequence based on a preset rule to determine a second sequence;
interleave the target polar code according to a mapping function to generate interleaved output bits, wherein the mapping function is determined according to the first sequence and the second sequenced; and
transmitting the interleaved output bits to a wireless communication device.

### Claim 2 (depends on 1)

The apparatus according to claim 1, wherein the processor is further configured to determine the first sequence according to the following formulas:
Xk+n:=Xk+m⊕(Xkw−r|Xk+1r)A
Vk:=Xk+n⊕(Xk+n>>u)
Hk:=Vk⊕((Vk<<s)&B)
Yk:=Hk⊕((Hk<<t)&C)
Zk:=Yk⊕(Yk>>l)
wherein Z is the first sequence, V, H and Y are intermediate variables, X0, X1 . . . , Xn−1 are n non-zero original integers, the non-zero original integer has w digits, Xkw−r|Xk+1r represents an integer that has w digits and that is formed by sequentially splicing first (w−r) digits of Xk and last r digits of Xk+1,
A
=
(
⁢
1
1
⋱
1
a
w
-
1
a
w
-
2
…
…
a
0
)
,
aw−1, aw−2, . . . a0 are specific parameters used for bit shifting, n, m, w, r u, s, t, and l are specific positive integers, m is less than n, r is less than w, B and C are specific sequences, k is successively 0, 1, . . . , N−1, and N is the code length of the target polar code.

### Claim 3 (depends on 2)

The apparatus according to claim 2, wherein n=624, m=397, w=32, r=31, u=11, s=7, t=15, l=18, B=0x9d2c5680, and C=0xefc60000.

### Claim 4 (depends on 1)

The apparatus according to claim 1, wherein the processor is further configured to perform reversing processing on the interleaved output bits.

### Claim 5 (depends on 1)

The apparatus according to claim 1, wherein the processor is further configured to perform replacement processing on the interleaved output bits according to an information bit set of the polar code.

### Claim 6 (depends on 1)

The apparatus according to claim 1, wherein the processor is further configured to determine, according to a redundancy version (RV) parameter, a sending bit transmitted in hybrid automatic repeat request (HARQ) retransmission.

### Claim 7 (depends on 1)

The apparatus according to claim 1, wherein the processor is further configured to determine, from the interleaved output bits, a sending bit that needs to be transmitted in hybrid automatic repeat request (HARQ) retransmission.

### Claim 8

A wireless communications device, comprising:
a memory configured to store instructions; and
a processor configured to execute the instructions, which causes the processor to be configured to:
determine a first sequence based on a Mersenne twister algorithm according to a code length of a target polar code and data bits;
perform a sort function on the first sequence based on a preset rule to determine a second sequence;
interleave the target polar code according to a mapping function to generate interleaved output bits, wherein the mapping function is determined according to the first sequence and the second sequence; and
transmit the interleaved output bits to another wireless communication device.

### Claim 9 (depends on 8)

The wireless communications device according to claim 8, wherein the instructions further cause the processor to determine the first sequence according to the following formulas:
Xk+n:=Xk+m⊕(Xkw−r|Xk+1r)A
Vk:=Xk+n⊕(Xk+n>>u)
Hk:=Vk⊕((Vk<<s)&B)
Yk:=Hk⊕((Hk<<t)&C)
Zk:=Yk⊕(Yk>>l)
wherein Z is the first sequence, V, H and Y are intermediate variables, X0, X1, . . . , Xn−1 are n non-zero original integers, the non-zero original integer has W digits, Xkw−r|Xk+1r represents an integer that has w digits and that is formed by sequentially splicing first (w−r) digits of Xk and last r digits of Xk+1,
A
=
(
⁢
1
1
⋱
1
a
w
-
1
a
w
-
2
…
…
a
0
)
,
aw−1, aw−2, . . . a0 are specific parameters used for bit shifting, n, m, w, r u, s, t, and l are specific positive integers, m is less than n, r is less than w, B and C are specific sequences, k is successively 0, 1, . . . , N−1, and N is the code length of the target polar code.

### Claim 10 (depends on 9)

The wireless communications device according to claim 9, wherein n=624, m=397, w=32, r=31, u=11, s=7, t=15, l=18, B=0x9d2c5680, and C=0xefc60000.

### Claim 11 (depends on 8)

The wireless communications device according to claim 8, wherein the instructions further cause the processor to perform reverse processing on the interleaved output bits.

### Claim 12 (depends on 8)

The wireless communications device according to claim 8, wherein the instructions further cause the processor to perform replacement processing on the interleaved output bits according to an information bit set of the polar code.

### Claim 13 (depends on 8)

The wireless communications device according to claim 8, wherein the instructions further cause the processor to perform determining, according to a redundancy version (RV) parameter, a sending bit transmitted in hybrid automatic repeat request (HARQ) retransmission.

### Claim 14 (depends on 8)

The wireless communications device according to claim 8, wherein the instructions further cause the processor to determine, from the interleaved output bits, a sending bit that needs to be transmitted in hybrid automatic repeat request (HARQ) retransmission.

### Claim 15

A method implemented by an apparatus, comprising:
determining a first sequence based on a Mersenne twister algorithm according to a code length of a target polar code and data bits;
performing a sort function on the first sequence based on preset rule to determine a second sequence;
interleaving the target polar code according to a mapping function to generate interleaved output bits by the wireless communications device, wherein the mapping function is determined according to the first sequence and the second sequence;
transmitting the interleaved output bits to another wireless communication device.

### Claim 16 (depends on 15)

The method according to claim 15, wherein determining, based on the Mersenne twister algorithm, the first sequence according to the code length of the target polar code comprises determining the first sequence according to the following formulas:
Xk+n:=Xk+m⊕(Xkw−r|Xk+1r)A
Vk:=Xk+n⊕(Xk+n>>u)
Hk:=Vk⊕((Vk<<s)&B)
Yk:=Hk⊕((Hk<<t)&C)
Zk:=Yk⊕(Yk>>l)
wherein Z is the first sequence, V, H and Y are intermediate variables, X0, X1, . . . , Xn−1 are n non-zero original integers, the non-zero original integer has w digits, Xkw−r|Xk+1r represents an integer that has w digits and that is formed by sequentially splicing first (w−r) digits of Xk and last r digits of Xk+1
A
=
(
⁢
1
1
⋱
1
a
w
-
1
a
w
-
2
…
…
a
0
)
,
aw−1, aw−2, . . . a0 are specific parameters used for bit shifting, n, m, w, r u, s, t, and l are specific positive integers, m is less than n, r is less than w, B and C are specific sequences, k is successively 0, 1, . . . , N−1, and N is the code length of the target polar code.

### Claim 17 (depends on 16)

The method according to claim 16, wherein n=624, m=397, w=32, r=31, u=1, s=7, t=15, l=18, B=0x9d2c5680, and C=0xefc60000.

### Claim 18 (depends on 15)

The method according to claim 15, wherein the polar code rate matching method further comprises performing reversing processing on the interleaved output bits.

### Claim 19 (depends on 15)

The method according to claim 15, wherein the polar code rate matching method further comprises performing replacement processing on the interleaved output bits according to an information bit set of the polar code.

### Claim 20 (depends on 15)

The method according to claim 15, wherein the polar code rate matching method further comprises determining, according to a redundancy version (RV) parameter, a start position that is in the interleaved output bits and that is of a sending bit transmitted in hybrid automatic repeat request (HARQ) retransmission.

### Claim 21 (depends on 15)

The method according to claim 15, wherein the polar code rate matching method further comprises determining, from the interleaved output bits, a sending bit that needs to be transmitted in hybrid automatic repeat request (HARQ) retransmission.
