WO2018149354A1 - Polar code encoding method and apparatus, and device and storage medium - Google Patents

Abstract

Disclosed are a polar code encoding method and encoding apparatus, and a device. In the technical solution provided in the embodiments of the present invention, a generation matrix Gc is used to encode an input bit sequence with a length of K bits to obtain a codeword bit sequence with a length of C bits, such that the encoding process is greatly simplified, and thus the encoding time is reduced. Also disclosed is a computer-readable storage medium.

Description

Polarization code encoding method, device and device, and storage medium

Cross-reference to related applications

This application is based on a Chinese patent application with an application number of 201710081770.7, an application date of February 15, and an application number of 201710184706.1, and an application date of March 24, 2017, and requires the priority of the Chinese patent application, the Chinese patent The content of the application is incorporated herein by reference.

Technical field

The present invention relates to a next generation mobile communication technology, and more particularly to a polarization code encoding method, an encoding device and device, and a computer readable storage medium.

Background technique

Due to the existence of channel noise, the channel coding service is a separate part of the mobile communication system, which ensures the reliability, accuracy and effectiveness of information transmission. Generally, the process of forward error correction (FEC) encoding is a process of generating a check bit sequence from an information bit sequence, and the information bit sequence and the check bit sequence together form a code word bit sequence.

Linear block codes are a type of commonly used FEC code. A linear block code is a set of fixed length code groups that can be represented as (n, k) block codes. At the time of encoding, the k-bit information bit sequence is encoded into an n-bit codeword bit sequence. Since the 2 ^k codewords of the (n, k) block code form a k-dimensional subspace, the 2 ^k codewords must be generated by k linearly independent substrates, if the k bases are written in the form of a matrix. , there are:

And the codeword bit sequence in the (n, k) block code can be generated by a linear combination of the set of substrates, ie,

Where m is the information bit sequence and C is the encoded code word bit sequence. Here, G is a generator matrix.

The most urgent thing for the fifth generation mobile communication (5G) is to increase the spectrum efficiency and reliability of communication. The polarization code has been selected as one of the 5G communication coding methods. In general, the encoding process of the polarization code includes subchannel reliability estimation, subchannel selection, coding, and rate matching. To this end, this patent proposes a construction method of a polarization code generation matrix, which can effectively reduce the coding complexity while ensuring the efficiency and reliability of the communication spectrum.

Summary of the invention

In order to solve the above technical problem, an embodiment of the present invention provides a method, an encoding apparatus, and a computer readable storage medium for encoding a polarization code, which can greatly simplify the encoding process, thereby reducing coding time.

An embodiment of the present invention provides a method for encoding a polarization code, including:

For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,...,N-1}, R and N are positive integers, and N is a power series of 2, R≤N.

In the above solution, the N×N matrix G _N is one of the following:

among them,

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N; or,

G _N by

Obtained by column interleaving and/or row interleaving, wherein

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N.

In the above solution, the generation matrix G _C is a generation matrix Gc_ _i of the generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} jointly indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

The generation matrix set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, and M and i are greater than or equal to 1. Integer

The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

In the above scheme, when 0 ≤ i < j ≤ M-1 and N_i ≤ N_j;

The generator matrix generating matrix set G G _C _Set the _{C_i} is the row index and the column index set collection RowIndxSet_i ColumnIndxSet_i matrix _G N_i jointly indicating the sub-matrix, said matrix generating a set of generator matrix G G _C _Set the row index set _{C_j} RowIndxSet_j and column index set ColumnIndxSet_j indicate a submatrix of the jointly indicated matrix G _{N_j} , and if C_i < C_j and R_i ≤ R_j, the column generation matrix G _{C_i} is a submatrix of the generation matrix G _{C_j} .

In the above scheme, when 0 ≤ i < j ≤ M-1 and N_i ≤ N_j;

The generator matrix generating matrix set G G _C _Set the _{C_i} is the row index and the column index set collection RowIndxSet_i ColumnIndxSet_i matrix _G N_i jointly indicating the sub-matrix, said matrix generating a set of generator matrix G G _C _Set the row index set _{C_j} The RowIndxSet_j and the column index set ColumnIndxSet_j indicate a submatrix of the jointly indicated matrix G _{N_j} , and if C_i < C_j and R_i ≤ R_j, the column generation matrix G _{C_i} has a ratio of at least p% different from the generation matrix G _{C_j} .

In the above scheme, the ratio p% is one of 5%, 10%, and 20%.

In the above solution, the first column index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A is the second column index set Set_B True subset

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

In the above solution, the first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A has at least a proportion of q% The element is different from the second column index set Set_B;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

In the above scheme, the ratio q% is one of 5%, 10%, and 20%.

In the above solution, the generation matrix G _C is obtained by interleaving the matrix G _N according to the row index set RowIndxSet and the column index set ColumnIndxSet row and column.

In the above solution, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C<L_D, the third column index set Set_C is the first a true subset of the four-column index set Set_D; if L_C>L_D, the fourth column index set Set_D is a true subset of the third column index set Set_C; if L_C=L_D, the third column index set Set_C and the fourth column index set Set_D is the same;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

In the above solution, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C≤L_D, the third column index set Set_C has at least The element with a ratio of p ₁ % is different from the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D has at least a ratio of elements of p ₁ % different from the third column index set Set_C;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

In the above scheme, the ratio p ₁ % is one of 5%, 10% and 20%.

In the above solution, the generation matrix G _{C_i is obtained} by _interleaving the matrix G _{N_i} according to the row index set RowIndxSet_i and the column index set ColumnIndxSet_i.

In the above solution, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E<L_F, the fifth column index set Set_E is the first a true subset of the six-column index set Set_F; if L_E>L_F, the sixth column index set Set_F is a true subset of the fifth column index set Set_E; if L_E=L_F, the fifth column index set Set_E and the sixth column index set Set_F is the same;

Where L_E is the number of elements of the fifth column index set Set_E, and L_F is the number of elements of the sixth column index set Set_F.

In the above solution, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E≤L_F, the fifth column index set Set_E has at least The element with a ratio of p ₂ % is different from the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F has at least a ratio of p ₂ % of elements different from the fifth column index set Set_E;

In the above scheme, the ratio p ₂ % is one of 5%, 10% and 20%.

An embodiment of the present invention further provides a coding apparatus for a polarization code, including a processing module, configured to:

For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,..., N-1}; wherein R and N are positive integers, and N is a power series of 2, R≤N.

In the above solution, the N×N matrix G _N is one of the following:

among them,

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N; or,

G _N by

Obtained by column interleaving and/or row interleaving, wherein

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N.

In the above solution, the generation matrix G _C is a generation matrix Gc_ _i of the generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} jointly indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

The generation matrix set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, and M and i are greater than or equal to 1. Integer

The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

An embodiment of the present invention further provides an apparatus for implementing a coding method for a polarization code, including at least a memory and a processor for executing executable instructions, where

An executable instruction is stored in the memory;

The processor performs at least the following operations when executing the executable instruction:

For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

The generation matrix G _C is a sub-matrix of the N×N matrix G _N jointly indicated by the row index set RowIndxSet and the column index set ColumnIndxSet; the row index set RowIndxSet has R elements, which is a row index set {0, 1, 2,... , a subset of N-1}, the column index set ColumnIndxSet has C elements, is a subset of the column index set {0, 1, 2, ..., N-1}, R and N are positive integers, and N is 2 The power series, R ≤ N.

In the above solution, the generation matrix G _C is a generation matrix Gc_ _i of the generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set; the generation matrix The set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, M and i are integers greater than or equal to 1; the row index set RowIndxSet_i has The R_i elements are a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which are column index sets {0, 1, 2, ..., N_i-1 a subset of }; where C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

The embodiment of the invention further provides a computer readable storage medium storing computer instructions for performing the foregoing encoding method of a polarization code.

Compared with the prior art, the embodiment of the present invention includes at least: a bit sequence of length K bits, and a codeword bit sequence of length C bits by using a generator matrix G _C , where C ≥ K, and C And K are both non-negative integers; wherein, the generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet; wherein the row index set RowIndxSet has R elements, which is a row A subset of the index set {0, 1, 2, ..., N-1}, the column index set ColumnIndxSet has C elements, is a subset of the column index set {0, 1, 2, ..., N-1}, R And N is a positive integer, and N is a power series of 2, R≤N. In the embodiment of the present invention, a bit sequence of length K bits is encoded by the generation matrix G _C to obtain a codeword bit sequence of length C bits.

Other features and advantages of the invention will be set forth in the description which follows, The objectives and other advantages of the invention may be realized and obtained by means of the structure particularly pointed in the appended claims.

DRAWINGS

The drawings described herein are intended to provide a further understanding of the invention, and are intended to be a part of the invention. In the drawing:

1 is a flowchart of implementing an encoding method of a polarization code according to an embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a coding apparatus of a polarization code according to an embodiment of the present invention.

detailed description

The embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that, in the case of no conflict, the features in the embodiments and the embodiments in the present application may be arbitrarily combined with each other.

The most urgent of the fifth generation mobile communication (5G) is to increase the spectral efficiency and reliability of the communication. For this reason, an embodiment of the present invention provides a method for encoding a polarization code.

FIG. 1 is a flowchart of implementing a method for encoding a polarization code according to an embodiment of the present invention. As shown in FIG.

Step 100: Encoding an input bit sequence of length K bits by using a generator matrix G _{C to} obtain a codeword bit sequence of length C bits, where C ≥ K, and C and K are non-negative integers;

The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,...,N-1}, R and N are positive integers, and N is a power series of 2, R≤N.

As an embodiment, the input bit sequence of length K bits includes but is not limited to:

Information bit sequence; or,

Information bit sequence and known bit sequence; or,

Information bit sequence and check bit sequence; or,

Information bit sequence, known bit sequence and check bit sequence.

As an embodiment, when a bit sequence of length K bits includes a check bit sequence, the check bit sequence is obtained by encoding the information bit sequence and the known bit sequence; or the check bit sequence is passed by the information bit sequence The code is obtained. The coding mode includes one or any combination of the following: parity coding, cyclic redundancy check coding, BCH coding, Hamming code coding, convolutional coding, generator matrix coding, Turbo coding, low density parity check coding, De Muller code, hash code;

The same encoding method is executed one or more times.

As an embodiment, the N×N matrix G _N is one of the following:

among them,

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N; or,

G _N by

Obtained by column interleaving and/or row interleaving, wherein

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N.

It should be noted that G _N can be

Obtained by column interleaving and row interleaving; or, G _N can be

Obtained by column interleaving; or, G _N can be

Obtained through line interleaving.

As an embodiment, the column interleaving includes one or any combination of the following:

The jth column in the matrix G _N is the matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., N-1}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence Reverse order, get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; or,

The (Cj-1)th column in the matrix G _N is the matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., N-1}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence Reverse order, get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; or,

Columns in the matrix G _N corresponding to the matrix

The column index is {Q ₁ , Q ₂ , Q ₃ }, where Q ₁ = {0, 1, ..., N ₁ -1}, Q ₂ = {N ₂ , N ₃ , N ₂ +1, N ₃ + 1,...,N ₄ ,N ₅ }, Q ₃ is the remaining index, where N/8≤N ₁ ≤N ₂ ≤N/3, N ₂ ≤N ₄ ≤N ₃ ≤2N/3, N ₃ ≤N ₅ ≤ N-1, wherein N ₁ , N ₂ , N ₃ , N ₄ and N ₅ are all positive integers, and the set between the sequence Q ₁ , the sequence Q ₂ and the sequence Q ₃ is an empty set; or,

Columns in the matrix G _N corresponding to the matrix

The column index is {S ₁ , S ₂ , S ₃ , S ₄ }, where the sequence S ₁ is the intersection of the sequence {BRO(k)} and the sequence {0, 1, ..., t ₁ -1}, the sequence S ₂ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence S ₁ , the sequence S ₄ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence S ₃ is the rest of the index values, and k = t ₂ , t ₂ +1, ..., N-1, BRO is the bit reverse order permutation operation, N / 8 ≤ t ₁ ≤ 3N / 8, 0 ≤ t ₂ ≤ N-1, t ₁ and t _{2 are} non-negative integers, and the intersection between any of the sequence S ₁ , the sequence S ₂ , the sequence S ₃ , and the sequence S ₄ is an empty set; or

Columns in the matrix G _N corresponding to the matrix

The column index is {I ₁ , I ₂ , I ₃ , I ₄ }, where sequence I ₂ is the intersection of the sequence {BRO(k)} and the sequence {0,1,...,t ₁ -1}, sequence I ₁ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence I ₂ , the sequence I ₃ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence I ₄ is the remaining index value, and k = t ₂ , t ₂ +1, ..., N-1, BRO is the bit reverse order permutation operation, N / 8 ≤ t ₁ ≤ 3N / 8, 0 ≤ t ₂ ≤ N-1, t ₁ and t _{2 are} non-negative integers, and the intersection between any of sequence I ₁ , sequence I ₂ , sequence I ₃ , and sequence I ₄ is an empty set; or

When G _N is

Obtained by column interleaving and row interleaving, the jth column in the matrix G _N is the matrix

In the ith column, the mth of the matrix G _N behaves the matrix

Line n, where i = π ₁ (j), n = π ₂ (m), π ₁ and π ₂ are the same sequence; or,

When G _N is

Obtained by column interleaving and row interleaving, the jth column in the matrix G _N is the matrix

In the ith column, the mth of the matrix G _N behaves the matrix

The nth row, where i=π ₁ (j), n=π ₂ (m), the order of the elements in π ₁ is at least a. The order of the elements in π ₂ is different, wherein a% is 5%, 10 One of % and 20%.

As an embodiment, the generation matrix G _C is a generation matrix Gc_ _i of the generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the matrix G _{N_i} of the N_i×N_i indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

The generation matrix set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, and M and i are greater than or equal to 1. Integer

The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} Is a submatrix of the generator matrix G _{C_j} .

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} At least a ratio of p% is different from the generator matrix G _{C_j} ; wherein the ratio p% can be one of 5%, 10% and 20%.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A is a true subset of the second column index set Set_B;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A has at least a ratio of q% elements and a second column index Set Set_B is different;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment, the ratio q% is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _C is obtained by interleaving the matrix G _N according to a row index set RowIndxSet and a column index set ColumnIndxSet row and column.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C<L_D, the third column index set Set_C is The true subset of the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D is a true subset of the third column index set Set_C; if L_C=L_D, the third column index set Set_C and the fourth column index The set Set_D is the same;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C≤L_D, the third column index set Set_C is at least An element having a ratio of p ₁ % is different from the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D has at least a ratio of p ₁ % of elements different from the third column index set Set_C;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, the ratio p ₁ % is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _{C_i is obtained} by _interleaving the matrix G _{N_i} according to the row index set RowIndxSet_i and the column index set ColumnIndxSet_i.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E<L_F, the fifth column index set Set_E is The true subset of the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F is a true subset of the fifth column index set Set_E; if L_E=L_F, the fifth column index set Set_E and the sixth column index The set Set_F is the same;

Where L_E is the number of elements of the fifth column index set Set_E, and L_F is the number of elements of the sixth column index set Set_F.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E≤L_F, the fifth column index set Set_E is at least The element having a ratio of p ₂ % is different from the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F has at least a ratio of p ₂ % of elements different from the fifth column index set Set_E;

As an embodiment, the ratio p ₂ % is one of 5%, 10% and 20%.

For example:

The column index set/row index set is a set of column numbers/row numbers, and the column index set/row index set is used to indicate which columns/rows of the generation matrix are selected. For example, when the column index set/row index set is [1, 2, ..., 158], the first, 2, ..., 158 columns/rows of the generated matrix are selected. There are a plurality of column index sets, and bit sequences of different lengths correspond to different column index sets. That is, when the column index set is [1, 2, ..., 158] and the row index set is [1, 2, ..., 100], G _C is the matrix index and the row index set indicated by the matrix G _N matrix 1, 2, ..., 158 columns and 1st, 2nd, ..., 100 rows.

If the R_A×C_A generation matrix G _C _A is obtained from the N×N matrix G _N according to the row index set RowIndxSet_A and the column index set ColumnIndxSet_A, the R_B×C_B generation matrix G _C _B is from the row index set RowIndxSet_B and the column index set ColumnIndxSet_B from N ×N matrix G _{N is} obtained, and C_A<C_B, then,

The column index set ColumnIndxSet_A is a true subset of the column index set ColumnIndxSet_B means: the element larger than C_A in ColumnIndxSet_B is deleted, and the obtained set is consistent with the column index set ColumnIndxSet_A;

The column index set ColumnIndxSet_A has at least a ratio of q% elements different from the column index set ColumnIndxSet_B means that the elements larger than C_A in ColumnIndxSet_B are deleted, and the resulting set arrangement order is inconsistent with the column index set ColumnIndxSet_A at least q%.

In the embodiment of the present invention, according to the characteristics of the polarization code encoding matrix and each bit sequence, a generation matrix having a large applicable range is obtained, and the generation matrix effectively increases the spectrum efficiency and reliability of the communication, and effectively reduces the spectrum. Coding complexity.

The embodiment of the present invention further provides a computer readable storage medium storing computer executable instructions for performing the foregoing method for encoding a polarization code according to an embodiment of the present invention.

An embodiment of the present invention further provides an apparatus for implementing a coding method of a polarization code, including at least a memory and a processor for executing executable instructions, where

Executing instructions stored in the memory; or generating a matrix G _C and executable instructions; or generating a set of matrices and executable instructions; wherein the processor, when executing the executable instructions, performs at least the following operations: a length of K An input bit sequence of bits, encoded by a generator matrix G _{C to} obtain a codeword bit sequence of length C bits, wherein C ≥ K, and C and K are non-negative integers;

The generation matrix G _C is a sub-matrix of the N×N matrix G _N jointly indicated by the row index set RowIndxSet and the column index set ColumnIndxSet; the row index set RowIndxSet has R elements, which is a row index set {0, 1, 2,... , a subset of N-1}, the column index set ColumnIndxSet has C elements, is a subset of the column index set {0, 1, 2, ..., N-1}; where R and N are positive integers, and N Is a power series of 2, R ≤ N.

As an implementation manner, the generation matrix G _C is a generation matrix Gc_ _i of a generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set; the generation matrix The set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, M and i are integers greater than or equal to 1; the row index set RowIndxSet_i has The R_i elements are a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which are column index sets {0, 1, 2, ..., N_i-1 a subset of }; where C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} Is a submatrix of the generator matrix G _{C_j} .

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} At least a ratio of p% is different from the generator matrix G _{C_j} ; wherein the ratio p% can be one of 5%, 10% and 20%.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A is a true subset of the second column index set Set_B;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A has at least a ratio of q% elements and a second column index Set Set_B is different;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment, the ratio q% is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _C is obtained by interleaving the matrix G _N according to a row index set RowIndxSet and a column index set ColumnIndxSet row and column.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C<L_D, the third column index set Set_C is The true subset of the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D is a true subset of the third column index set Set_C; if L_C=L_D, the third column index set Set_C and the fourth column index The set Set_D is the same;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C≤L_D, the third column index set Set_C is at least An element having a ratio of p ₁ % is different from the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D has at least a ratio of p ₁ % of elements different from the third column index set Set_C;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, the ratio p ₁ % is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _{C_i is obtained} by _interleaving the matrix G _{N_i} according to the row index set RowIndxSet_i and the column index set ColumnIndxSet_i.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E<L_F, the fifth column index set Set_E is The true subset of the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F is a true subset of the fifth column index set Set_E; if L_E=L_F, the fifth column index set Set_E and the sixth column index The set Set_F is the same;

Where L_E is the number of elements of the fifth column index set Set_E, and L_F is the number of elements of the sixth column index set Set_F.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E≤L_F, the fifth column index set Set_E is at least An element having a ratio of p ₂ % is different from the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F has at least a ratio of p ₂ % of elements different from the fifth column index set Set_E;

As an embodiment, the ratio p ₂ % is one of 5%, 10% and 20%.

FIG. 2 is a schematic structural diagram of a device for encoding a polarization code according to an embodiment of the present invention. As shown in FIG. 2, the method further includes: a processing module configured to:

For an input bit sequence of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers; wherein the generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,..., N-1}; wherein R and N are positive integers, and N is a power series of 2, R≤N.

As an embodiment, the input bit sequence of length K bits includes but is not limited to:

Information bit sequence; or,

Information bit sequence and known bit sequence; or,

Information bit sequence and check bit sequence; or,

Information bit sequence, known bit sequence and check bit sequence.

As an embodiment, when the input bit sequence of length K bits includes a check bit sequence, the check bit sequence is obtained by encoding the information bit sequence and the known bit sequence. Alternatively, the check bit sequence is encoded by a sequence of information bits.

The coding mode includes but is not limited to one or any combination of the following: parity coding, cyclic redundancy check coding, BCH coding, Hamming code coding, convolutional coding, generator matrix coding, Turbo coding, low density parity check Coding, Reed Muller encoding, hash encoding;

The same encoding method is executed one or more times.

As an embodiment, the N×N matrix G _N is one of the following:

among them,

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N; or,

G _N by

Obtained by column interleaving and/or row interleaving, wherein

Representing n times Kronecker product operations on matrix F ₂ , and

n=log ₂ N.

As an embodiment, the column interleaving includes one or any combination of the following:

The jth column in the matrix G _N is the matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., N-1}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence Reverse order, get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; or,

The (Cj-1)th column in the matrix G _N is the matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., N-1}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence Reverse order, get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; or,

Columns in the matrix G _N corresponding to the matrix

The column index is {Q ₁ , Q ₂ , Q ₃ }, where Q ₁ = {0, 1, ..., N ₁ -1}, Q ₂ = {N ₂ , N ₃ , N ₂ +1, N ₃ + 1,...,N ₄ ,N ₅ }, Q ₃ is the remaining index, where N/8≤N ₁ ≤N ₂ ≤N/3, N ₂ ≤N ₄ ≤N ₃ ≤2N/3, N ₃ ≤N ₅ ≤ N-1, wherein N ₁ , N ₂ , N ₃ , N ₄ and N ₅ are all positive integers, and the set between the sequence Q ₁ , the sequence Q ₂ and the sequence Q ₃ is an empty set; or,

Columns in the matrix G _N corresponding to the matrix

The column index is {S ₁ , S ₂ , S ₃ , S ₄ }, where the sequence S ₁ is the intersection of the sequence {BRO(k)} and the sequence {0, 1, ..., t ₁ -1}, the sequence S ₂ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence S ₁ , the sequence S ₄ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence S ₃ is the rest of the index values, and k = t ₂ , t ₂ +1, ..., N-1, BRO is the bit reverse order permutation operation, N / 8 ≤ t ₁ ≤ 3N / 8, 0 ≤ t ₂ ≤ N-1, t ₁ and t _{2 are} non-negative integers, and the intersection between any of the sequence S ₁ , the sequence S ₂ , the sequence S ₃ , and the sequence S ₄ is an empty set; or

Columns in the matrix G _N corresponding to the matrix

The column index is {I ₁ , I ₂ , I ₃ , I ₄ }, where sequence I ₂ is the intersection of the sequence {BRO(k)} and the sequence {0,1,...,t ₁ -1}, sequence I ₁ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence I ₂ , the sequence I ₃ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence I ₄ is the remaining index value, and k = t ₂ , t ₂ +1, ..., N-1, BRO is the bit reverse order permutation operation, N / 8 ≤ t ₁ ≤ 3N / 8, 0 ≤ t ₂ ≤ N-1, t ₁ and t _{2 are} non-negative integers, and the intersection between any of sequence I ₁ , sequence I ₂ , sequence I ₃ , and sequence I ₄ is an empty set; or

When G _N is

Obtained by column interleaving and row interleaving, the jth column in the matrix G _N is the matrix

In the ith column, the mth of the matrix G _N behaves the matrix

Line n, where i = π ₁ (j), n = π ₂ (m), π ₁ and π ₂ are the same sequence; or,

When G _N is

Obtained by column interleaving and row interleaving, the jth column in the matrix G _N is the matrix

In the ith column, the mth of the matrix G _N behaves the matrix

The nth row, where i=π ₁ (j), n=π ₂ (m), the order of the elements in π ₁ is at least a. The order of the elements in π ₂ is different, wherein a% is 5%, 10 One of % and 20%.

As an embodiment, the generation matrix G _C is a generation matrix Gc_ _i of the generation matrix set G _C _Set;

The generation matrix G _{C_i} is a sub-matrix of the matrix G _{N_i} of the N_i×N_i indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

The generation matrix set G _C _Set includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, and M and i are greater than or equal to 1. Integer

The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} Is a submatrix of the generator matrix G _{C_j} .

When 0≤i <j≤M-1 and N_i≤N_j, the generating matrix set G G _C _Set generation matrix is a matrix of _{C_i G} N_i set submatrix row index and the column index set ColumnIndxSet_i RowIndxSet_i joint indication of the generating a set of said matrix generator matrix G G _C _Set the _{C_J} is the row index and column index set RowIndxSet_j joint indication instruction set ColumnIndxSet_j submatrix matrix _G N_j if C_i <C_j and R_i≤R_j, if the column generation matrix G _{C_i} At least a ratio of p% is different from the generator matrix G _{C_j} ; wherein the ratio p% can be one of 5%, 10% and 20%.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A is a true subset of the second column index set Set_B;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment,

The first index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A<L_B, the first column index set Set_A has at least a ratio of q% elements and a second column index Set Set_B is different;

Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.

As an embodiment, the ratio q% is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _C is obtained by interleaving the matrix G _N according to a row index set RowIndxSet and a column index set ColumnIndxSet row and column.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C<L_D, the third column index set Set_C is The true subset of the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D is a true subset of the third column index set Set_C; if L_C=L_D, the third column index set Set_C and the fourth column index The set Set_D is the same;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C≤L_D, the third column index set Set_C is at least An element having a ratio of p ₁ % is different from the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D has at least a ratio of p ₁ % of elements different from the third column index set Set_C;

Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.

As an embodiment, the ratio p ₁ % is one of 5%, 10% and 20%.

As an embodiment, the generation matrix G _{C_i is obtained} by _interleaving the matrix G _{N_i} according to the row index set RowIndxSet_i and the column index set ColumnIndxSet_i.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the column index set ColumnIndxSet_j sixth column index set Set_F, if L_E<L_F, the fifth column index set Set_E is the sixth column a true subset of the index set Set_F; if L_E>L_F, the sixth column index set Set_F is a true subset of the fifth column index set Set_E; if L_E=L_F, the fifth column index set Set_E is the same as the sixth column index set Set_F ;

Where L_E is the number of elements of the fifth column index set Set_E, and L_F is the number of elements of the sixth column index set Set_F.

As an embodiment, for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the column index set ColumnIndxSet_j sixth column index set Set_F, if L_E≤L_F, the fifth column index set Set_E has at least a ratio of The p ₂ % element is different from the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F has at least a ratio of p ₂ % of elements different from the fifth column index set Set_E;

As an embodiment, the ratio p ₂ % is one of 5%, 10% and 20%.

The method of the embodiment of the present invention is described in detail below with reference to specific embodiments.

The technical solutions provided by the embodiments of the present invention may be, but are not limited to, used in New Radio Access Technology (NR).

In the embodiment of the present invention, the transmitting end may be a base station, and the base station may be, but not limited to, a g-Node B (gNB, g Node B); the transmitting end may also be a user equipment (UE, User Equipment). In this embodiment of the present invention, the receiving end may be a UE or a base station, and the base station may be, but not limited to, a gNB.

In a first embodiment, an encoding method for a bit sequence of length K = 50 bits includes:

First, a matrix of N = 256 rows, N = 256 columns

Get the matrix G ₂₅₆ directly, ie

Then, from the G _N matrix of N=256 rows and N=256 columns, 50 rows are selected according to the row index set ColumnIndxSet to form a sub-matrix of 50 rows and 256 columns, and then 128 rows are selected according to the column index set ColumnIndxSet to form 50 rows and 128 columns. The generator matrix G _C is multiplied by the generator matrix G _C with a bit sequence of length K=50 bits to obtain a coded codeword sequence of length 128 bits.

Then, in the first embodiment, assuming that the transmission bit sequence length is M=100 bits, a bit sequence of M=100 bits is selected from the coded codeword sequence as a transmission bit sequence; if the transmission bit sequence length is M=160 The bit is selected from the coded codeword sequence (MN) = 160 - 128 = 32 bits added to the previous or subsequent position of the encoded codeword sequence to obtain a bit sequence of length M = 160 bits as a transmission bit sequence.

Finally, the transmitting end transmits the transmitted bit sequence to the receiving end.

The second embodiment is an encoding method for a bit sequence of length K = 50 bits.

The second embodiment is different from the first embodiment in that the matrix G _{256 is} composed of a matrix

Column interleaving, that is, the jth column in the matrix G ₂₅₆ is a matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., 255}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence is reversed , get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; that is, the 0th column in G ₂₅₆ is a matrix.

Column 0, the first column in G ₂₅₆ is the matrix

Column 128, the second column in G ₂₅₆ is the matrix

Column 64, and so on;

The third embodiment is a coding method for a bit sequence of length K = 50 bits.

The third embodiment is different from the first embodiment in that the matrix G _{256 is} composed of a matrix

Column interleaving, that is, the (Cj-1) column in the matrix G ₂₅₆ is a matrix

The ith column, where for each sequence number j ∈ {0, 1, ..., 255}, j is expressed in binary as (b _n , b _n-1 , ..., b ₁ ), and then the binary sequence is reversed , get the binary number (b ₁ , b ₂ ,..., b _n ), and represent the obtained binary as a decimal number. This decimal number is i; that is, the 0th column in G ₂₅₆ is a matrix.

Column 255, the first column in G ₂₅₆ is the matrix

Column 127, the second column in G ₂₅₆ is a matrix

Column 191, and so on;

The fourth embodiment is a coding method for a bit sequence of length K = 50 bits.

The fourth embodiment is different from the first embodiment in that the matrix G _{256 is} composed of a matrix

Column interleaving, that is, the corresponding matrix of columns in G ₂₅₆

The column index is {Q ₁ , Q ₂ , Q ₃ }, where Q ₁ = {0, 1, ..., N ₁ -1}, Q ₂ = {N ₂ , N ₃ , N ₂ +1, N ₃ + 1,...,N ₄ ,N ₅ }, Q ₃ is the remaining index, assuming N ₁ =64, N ₂ =65, N ₃ =128, N4=127, when N5=191, Q ₁ ={0,1, ..., 63}, Q ₂ = {64, 128, 65, 129, ..., 127, 191}, Q ₃ = {192, ..., 255}.

The fifth embodiment is a coding method for a bit sequence of length K = 50 bits.

The fifth embodiment is different from the first embodiment in that the matrix G _{256 is} composed of a matrix

Column interleaving, that is, the corresponding matrix of columns in G ₂₅₆

The column index is {S ₁ , S ₂ , S ₃ , S ₄ }, where the sequence S ₁ is the intersection of the sequence {BRO(k)} and the sequence {0, 1, ..., t ₁ -1}, the sequence S ₂ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence S ₁ , the sequence S ₄ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence S ₃ is the remaining index values, assuming t ₁ =64, t ₂ =56, then:

S ₁ ={20,1244,28,8,40,24,16,48,32},

S2=[0,1,..,63]\S ₁ ,

S4={147,83,211,51,179,115,243,139,75,203,171,107,235,155,91,219,59,187,123,251,135,71,199,167,103,231,151,87,215,55,183,119,247,143,79,207,175,111,239,159,95,223,63,191,127, 255}, S3=[64,65,..,255]\S4.

The sixth embodiment is a coding method for a bit sequence of length K = 50 bits.

The sixth embodiment is different from the first embodiment in that the matrix G _{256 is} composed of a matrix

Column interleaving, that is, the column in G ₂₅₆ corresponds to the matrix

The column index is {I ₁ , I ₂ , I ₃ , I ₄ }, where sequence I ₂ is the intersection of the sequence {BRO(k)} and the sequence {0,1,...,t ₁ -1}, sequence I ₁ is the difference between the sequence {0, 1, ..., t ₁ -1} and the sequence I ₂ , the sequence I ₃ is the sequence {BRO(k)} and the sequence {t ₁ , t ₁ +1, ..., N-1 The intersection of }, the sequence I ₄ is the remaining index values, assuming t ₁ =64, t ₂ =56, then:

I ₂ ={20,1244,28,8,40,24,16,48,32},

I ₁ =[0,1,..,63]\I ₂ ,

_{I 3 = {147,83,211,51,179,115,243,139,75,203,171,107,235,155,91,219,59,187,123,251,135,71,199,167,103,231,151,87,215,55,183,119,247,143,79,207,175,111,239,159,95,223,63,191,127,255}, I} 4 = [64,65, .., 255] \ I 3.

The above is only a preferred embodiment of the present invention and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Industrial applicability

In the embodiment of the present invention, the bit sequence of length K bits is encoded by the generation matrix Gc to obtain a codeword bit sequence of length C bits, which greatly simplifies the coding process, thereby reducing the coding time. According to the characteristics of the polarization code coding matrix and each bit sequence, a generation matrix with a large applicable range is obtained, and the generation matrix effectively increases the spectrum efficiency and reliability of the communication, and effectively reduces the coding complexity.

Claims (23)

1. A method for encoding a polarization code, the method comprising:

   For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

   The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

   The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,...,N-1}, R and N are positive integers, and N is a power series of 2, R≤N.
2. The encoding method according to claim 1, wherein said N x N matrix G _N is one of:

   

   among them,

   

   Representing n times Kronecker product operations on matrix F ₂ , and

   

   n=log ₂ N; or,

   G _N by

   

   Obtained by column interleaving and/or row interleaving, wherein

   

   Representing n times Kronecker product operations on matrix F ₂ , and

   

   n=log ₂ N.
3. The encoding method according to claim 1, wherein the generator matrix to generate a matrix set G _C G _{C_} Set generator matrix Gc _{_i;}

   The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} jointly indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

   The generation matrix set G _{C_Set} includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} , , . . . , G _{C_M-1} }, where M and i are greater than or equal to 1. Integer

   The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.
4. The encoding method according to claim 3, wherein when 0 ≤ i < j ≤ M-1 and N_i ≤ N_j;

   The generator matrix set G _{C_} Set generator matrix G _{C_i} is the row index and the column index set RowIndxSet_i set submatrix of matrix _G N_i ColumnIndxSet_i joint indicated, the generator matrix G _{C_} Set set generator matrix _G C_j row index set RowIndxSet_j and column index set ColumnIndxSet_j indicate a submatrix of the jointly indicated matrix G _{N_j} , and if C_i < C_j and R_i ≤ R_j, the column generation matrix G _{C_i} is a submatrix of the generation matrix G _{C_j} .
5. The encoding method according to claim 3, wherein when 0 ≤ i < j ≤ M-1 and N_i ≤ N_j;

   The generator matrix set G _{C_} Set generator matrix G _{C_i} is the row index and the column index set RowIndxSet_i set submatrix of matrix _G N_i ColumnIndxSet_i joint indicated, the generator matrix G _{C_} Set set generator matrix _G C_j row index set The RowIndxSet_j and the column index set ColumnIndxSet_j indicate a submatrix of the jointly indicated matrix G _{N_j} , and if C_i < C_j and R_i ≤ R_j, the column generation matrix G _{C_i} has a ratio of at least p% different from the generation matrix G _{C_j} .
6. The encoding method according to claim 5, wherein said ratio p% is one of 5%, 10%, and 20%.
7. The encoding method according to claim 1 or 3, wherein the first column index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A < L_B, the first column The index set Set_A is a true subset of the second column index set Set_B;

   Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.
8. The encoding method according to claim 1 or 3, wherein the first column index set Set_A determined in the column index set ColumnIndxSet or ColumnIndxSet_i and the determined second column index set Set_B, if L_A < L_B, the first column The index set Set_A has at least a ratio of q% of elements different from the second column index set Set_B;

   Where L_A is the number of elements of the first column index set Set_A, and L_B is the number of elements of the second column index set Set_B.
9. The encoding method according to claim 8, wherein the ratio q% is one of 5%, 10%, and 20%.
10. The encoding method according to claim 1, wherein said generation matrix G _C is interleaved by said matrix G _N in accordance with a row index set RowIndxSet and a column index set ColumnIndxSet row and column.
11. The encoding method according to claim 1 or 10, wherein for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C < L_D The third column index set Set_C is a true subset of the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D is a true subset of the third column index set Set_C; if L_C=L_D, then the third The column index set Set_C is the same as the fourth column index set Set_D;

    Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.
12. The encoding method according to claim 1 or 10, wherein for the third column index set Set_C determined in the row index set RowIndxSet, and the fourth column index set Set_D determined in the column index set ColumnIndxSet, if L_C ≤ L_D , the third column index set Set_C has at least a ratio of p ₁ % of elements different from the fourth column index set Set_D; if L_C>L_D, the fourth column index set Set_D has at least a ratio of p ₁ % of elements and the third Column index set Set_C is different;

    Where L_C is the number of elements of the third column index set Set_C, and L_D is the number of elements of the fourth column index set Set_D.
13. The encoding method according to claim 12, wherein said ratio p ₁ is _one of 5%, 10% and 20%.
14. The encoding method according to claim 3, wherein the generation matrix G _{C_i is obtained} by _interleaving the matrix G _{N_i} according to a row index set RowIndxSet_i and a column index set ColumnIndxSet_i.
15. The encoding method according to claim 3 or 14, wherein for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E < L_F The fifth column index set Set_E is a true subset of the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F is a true subset of the fifth column index set Set_E; if L_E=L_F, then the fifth The column index set Set_E is the same as the sixth column index set Set_F;

    Where L_E is the number of elements of the fifth column index set Set_E, and L_F is the number of elements of the sixth column index set Set_F.
16. The encoding method according to claim 3 or 14, wherein for the fifth column index set Set_E determined in the row index set RowIndxSet_i, and the sixth column index set Set_F determined in the column index set ColumnIndxSet_j, if L_E ≤ L_F , the fifth column index set Set_E has at least a ratio of p ₂ % of elements different from the sixth column index set Set_F; if L_E>L_F, the sixth column index set Set_F has at least a proportion of p ₂ % of elements and fifth The column index set Set_E is different.
17. The encoding method according to claim 16, wherein the ratio p ₂ % is one of 5%, 10%, and 20%.
18. A coding device for a polarization code, comprising a processing module, configured to:

    For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

    The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet;

    The row index set RowIndxSet has R elements, is a subset of the row index set {0, 1, 2, ..., N-1}, and the column index set ColumnIndxSet has C elements, which is a column index set {0, 1, A subset of 2,..., N-1}; wherein R and N are positive integers, and N is a power series of 2, R≤N.
19. The encoding apparatus according to claim 18, wherein said N × N matrix G _N is one of:

    

    among them,

    

    Representing n times Kronecker product operations on matrix F ₂ , and

    

    n=log ₂ N; or,

    G _N by

    

    Obtained by column interleaving and/or row interleaving, wherein

    

    Representing n times Kronecker product operations on matrix F ₂ , and

    

    n=log ₂ N.
20. The encoding apparatus according to claim 18, wherein the generator matrix to generate a matrix set G _C G _{C_} Set generator matrix Gc _{_i;}

    The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} jointly indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set;

    The generation matrix set G _{C_Set} includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} , , . . . , G _{C_M-1} }, where M and i are greater than or equal to 1. Integer

    The row index set RowIndxSet_i has R_i elements, which is a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which is a column index set {0, 1, A subset of 2,..., N_i-1}; wherein C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.
21. An apparatus for implementing an encoding method of a polarization code, comprising at least a memory and a processor for executing executable instructions, wherein

    An executable instruction is stored in the memory;

    The processor performs at least the following operations when executing the executable instruction:

    For a sequence of input bits of length K bits, a codeword bit sequence of length C bits is obtained by using a generator matrix G _C , wherein C ≥ K, and C and K are non-negative integers;

    The generation matrix G _C is a sub-matrix of the N×N matrix G _N indicated by the row index set RowIndxSet and the column index set ColumnIndxSet; the row index set RowIndxSet has R elements, is a row index set {0, 1, 2 , ..., a subset of N-1}, the column index set ColumnIndxSet has C elements, is a subset of the column index set {0, 1, 2, ..., N-1}, R and N are positive integers, and N Is a power series of 2, R ≤ N.
22. The apparatus according to claim 21, wherein the generator matrix to generate a matrix set G _C G _{C_} Set generator matrix Gc _{_i;}

    The generation matrix G _{C_i} is a sub-matrix of the N_i×N_i matrix G _{N_i} indicated by the row index set RowIndxSet_i in the row index set and the column index set ColumnIndxSet_i in the column index set; the generation matrix The set G _{C_Set} includes M generation matrices, denoted as {G _{C_0} , G _{C_1} , . . . , G _{C_i} ,, . . . , G _{C_M-1} }, M and i are integers greater than or equal to 1; the row index set RowIndxSet_i has The R_i elements are a subset of the row index set {0, 1, 2, ..., N_i-1}, and the column index set ColumnIndxSet_i has C_i elements, which are column index sets {0, 1, 2, ..., N_i-1 a subset of }; where C_i, R_i, and N_i are positive integers, and N_i is a power series of 2, R_i ≤ N_i.
23. A computer readable storage medium storing computer executable instructions for performing the encoding method of the polarization code according to any one of claims 1 to 17.

Images