Channel interleaving method and apparatus
First Claim
1. A channel interleaving method of a polar (Polar) code, the method being performed by a receive end device, wherein the receive end device comprising a processing apparatus configured to perform the method, and the method comprising:
 determining an M__{r}row and M__{c}column matrix used for interleaving, whereincolumn sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{c}, . . . , M__{c}−
1], wherein i_{c }is greater than or equal to 0, and is less than or equal to M__{c}−
1; and
row sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{r}, . . . , M__{r}−
1], wherein i_{r }is greater than or equal to 0, and is less than or equal to M__{r}−
1;
writing tobeinterleaved bits into the matrix; and
permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the tobeinterleaved bits are written, whereinthe permutation patterns of the column sequence numbers are represented by;
[P_{c}(0), P_{c}(1), . . . , P_{c}(i_{c}), . . . , P_{c}(M__{c}−
1)], wherein P_{c}(i_{c}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse))based mapping on column sequence number i_{c}; and
the permutation patterns of the row sequence numbers are represented by;
[P_{r}(0), P_{r}(1), . . . , P_{r}(i_{r}), . . . , P_{r}(M__{r}−
1)], wherein P_{r}(i_{r}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)—
based mapping on row sequence number i_{r}; and
reading interleaved bits from the permutated matrix.
2 Assignments
0 Petitions
Accused Products
Abstract
The present invention provides channel interleaving method of a polar (Polar) code. The method includes: determining an M__{r}row and M__{c}column matrix used for interleaving, and permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the tobeinterleaved bits are written. The permutation patterns of the column sequence numbers are represented by: [P_{c}(0), P_{c}(1), . . . , P_{c}(i_{c}), . . . , P_{c}(M__{c}−1)]. P_{c}(i_{c}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)based mapping on the column sequence number i_{c}. The permutation patterns of the row sequence numbers are represented by: [P_{r}(0), P_{r}(1), . . . , P_{r}(i_{r}), . . . , P_{r}(M__{r}−1)]. P_{r}(i_{r}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)based mapping on the row sequence number i_{r}; and reading interleaved bits from the permutated matrix.
10 Citations
18 Claims

1. A channel interleaving method of a polar (Polar) code, the method being performed by a receive end device, wherein the receive end device comprising a processing apparatus configured to perform the method, and the method comprising:

determining an M__{r}row and M__{c}column matrix used for interleaving, wherein column sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{c}, . . . , M__{c}−
1], wherein i_{c }is greater than or equal to 0, and is less than or equal to M__{c}−
1; androw sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{r}, . . . , M__{r}−
1], wherein i_{r }is greater than or equal to 0, and is less than or equal to M__{r}−
1;writing tobeinterleaved bits into the matrix; and permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the tobeinterleaved bits are written, wherein the permutation patterns of the column sequence numbers are represented by;
[P_{c}(0), P_{c}(1), . . . , P_{c}(i_{c}), . . . , P_{c}(M__{c}−
1)], wherein P_{c}(i_{c}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse))based mapping on column sequence number i_{c}; andthe permutation patterns of the row sequence numbers are represented by;
[P_{r}(0), P_{r}(1), . . . , P_{r}(i_{r}), . . . , P_{r}(M__{r}−
1)], wherein P_{r}(i_{r}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)—
based mapping on row sequence number i_{r}; and
reading interleaved bits from the permutated matrix.  View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 18)


10. A communications apparatus, comprising a processor configured to execute program modules including:

a determining module, configured to determine an M__{r}row and M__{c}column matrix used for interleaving, wherein column sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{c}, . . . , M__{c}−
1], wherein i_{c }is greater than or equal to 0, and is less than or equal to M__{c}−
1; androw sequence numbers of the matrix are represented by;
[0, 1, . . . , i_{r}, . . . , M__{r}−
1], wherein it is greater than or equal to 0, and is less than or equal to M__{r}−
1;a writing module, configured to write tobeinterleaved bits into the matrix; a permutation module, configured to permutate, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the tobeinterleaved bits are written, wherein the permutation patterns of the column sequence numbers are represented by;
[P_{c}(0), P_{c}(1), . . . , P_{c}(i_{c}), . . . , P_{c}(M__{c}−
1)], wherein P_{c}(i_{c}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)based mapping on column sequence number i_{c}; andthe permutation patterns of the row sequence numbers are represented by;
[P_{r}(0), P_{r}(1), . . . , P_{r}(i_{r}), . . . , P_{r}(M__{r}−
1)], wherein P_{r}(i_{r}) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)based mapping on row sequence number i_{r}; anda reading module, configured to read interleaved bits from the permutated matrix.  View Dependent Claims (11, 12, 13, 14, 15, 16, 17)

1 Specification