[go: up one dir, main page]

WO2018149354A1 - Procédé et appareil de codage de code polaire, et dispositif et support de stockage - Google Patents

Procédé et appareil de codage de code polaire, et dispositif et support de stockage Download PDF

Info

Publication number
WO2018149354A1
WO2018149354A1 PCT/CN2018/075719 CN2018075719W WO2018149354A1 WO 2018149354 A1 WO2018149354 A1 WO 2018149354A1 CN 2018075719 W CN2018075719 W CN 2018075719W WO 2018149354 A1 WO2018149354 A1 WO 2018149354A1
Authority
WO
WIPO (PCT)
Prior art keywords
index set
matrix
column index
column
columnindxset
Prior art date
Application number
PCT/CN2018/075719
Other languages
English (en)
Chinese (zh)
Inventor
陈梦竹
许进
徐俊
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018149354A1 publication Critical patent/WO2018149354A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques

Definitions

  • 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.
  • the channel coding service is a separate part of the mobile communication system, which ensures the reliability, accuracy and effectiveness of information transmission.
  • 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.
  • FEC forward error correction
  • 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.
  • 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:
  • codeword bit sequence in the (n, k) block code can be generated by a linear combination of the set of substrates, ie,
  • G is a generator matrix
  • the polarization code has been selected as one of the 5G communication coding methods.
  • the encoding process of the polarization code includes subchannel reliability estimation, subchannel selection, coding, and rate matching.
  • 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.
  • 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:
  • 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.
  • the N ⁇ N matrix G N is one of the following:
  • 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 ⁇
  • 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.
  • 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 .
  • 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 .
  • the ratio p% is one of 5%, 10%, and 20%.
  • 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
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • the ratio q% is one of 5%, 10%, and 20%.
  • 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.
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • the third column index set Set_C determined in the row index set RowIndxSet
  • the fourth column index set Set_D determined in the column index set ColumnIndxSet
  • the third column index set Set_C has at least The element with a ratio of p 1 % is different from the fourth column index set Set_D
  • the fourth column index set Set_D has at least a ratio of elements of p 1 % different from the third column index set Set_C;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • the ratio p 1 % is one of 5%, 10% and 20%.
  • 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.
  • L_E is the number of elements of the fifth column index set Set_E
  • L_F is the number of elements of the sixth column index set Set_F.
  • 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 2 % 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 2 % of elements different from the fifth column index set Set_E;
  • the ratio p 2 % 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:
  • 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.
  • the N ⁇ N matrix G N is one of the following:
  • 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 ⁇
  • 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:
  • 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
  • N is 2
  • 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.
  • 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.
  • 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.
  • FIG. 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.
  • 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.
  • the input bit sequence of length K bits includes but is not limited to:
  • 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.
  • the N ⁇ N matrix G N is one of the following:
  • 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.
  • 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 1 ), and then the binary sequence Reverse order, get the binary number (b 1 , b 2 ,..., 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 1 ), and then the binary sequence Reverse order, get the binary number (b 1 , b 2 ,..., b n ), and represent the obtained binary as a decimal number.
  • This decimal number is i; or,
  • the column index is ⁇ S 1 , S 2 , S 3 , S 4 ⁇ , where the sequence S 1 is the intersection of the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ , the sequence S 2 is the difference between the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ and the sequence S 1 , the sequence S 4 is the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ t 1 , t 1 +1, ..., N-1
  • 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 ⁇
  • 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.
  • 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 .
  • 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%.
  • 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;
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • the ratio q% is one of 5%, 10% and 20%.
  • 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.
  • the third column index set Set_C determined in the row index set RowIndxSet
  • the fourth column index set Set_D determined in the column index set ColumnIndxSet
  • L_C ⁇ L_D the third column index set Set_C is The true subset of the fourth column index set Set_D
  • L_C>L_D the fourth column index set Set_D is a true subset of the third column index set Set_C
  • the set Set_D is the same;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • 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 1 % 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 1 % of elements different from the third column index set Set_C;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • the ratio p 1 % is one of 5%, 10% and 20%.
  • 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.
  • L_E is the number of elements of the fifth column index set Set_E
  • L_F is the number of elements of the sixth column index set Set_F.
  • 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 2 % 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 2 % of elements different from the fifth column index set Set_E;
  • the ratio p 2 % is one of 5%, 10% and 20%.
  • 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.
  • 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%.
  • 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
  • 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.
  • 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.
  • 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 .
  • 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%.
  • 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;
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • the ratio q% is one of 5%, 10% and 20%.
  • 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.
  • the third column index set Set_C determined in the row index set RowIndxSet
  • the fourth column index set Set_D determined in the column index set ColumnIndxSet
  • L_C ⁇ L_D the third column index set Set_C is The true subset of the fourth column index set Set_D
  • L_C>L_D the fourth column index set Set_D is a true subset of the third column index set Set_C
  • the set Set_D is the same;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • 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 1 % 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 1 % of elements different from the third column index set Set_C;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • the ratio p 1 % is one of 5%, 10% and 20%.
  • 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.
  • L_E is the number of elements of the fifth column index set Set_E
  • L_F is the number of elements of the sixth column index set Set_F.
  • 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 2 % 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 2 % of elements different from the fifth column index set Set_E;
  • the ratio p 2 % 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:
  • 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.
  • the input bit sequence of length K bits includes but is not limited to:
  • the check bit sequence is obtained by encoding the information bit sequence and the known bit sequence.
  • 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.
  • the N ⁇ N matrix G N is one of the following:
  • 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 1 ), and then the binary sequence Reverse order, get the binary number (b 1 , b 2 ,..., 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 1 ), and then the binary sequence Reverse order, get the binary number (b 1 , b 2 ,..., b n ), and represent the obtained binary as a decimal number.
  • This decimal number is i; or,
  • the column index is ⁇ S 1 , S 2 , S 3 , S 4 ⁇ , where the sequence S 1 is the intersection of the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ , the sequence S 2 is the difference between the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ and the sequence S 1 , the sequence S 4 is the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ t 1 , t 1 +1, ..., N-1
  • 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 ⁇
  • 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.
  • 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 .
  • 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%.
  • 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;
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • L_A is the number of elements of the first column index set Set_A
  • L_B is the number of elements of the second column index set Set_B.
  • the ratio q% is one of 5%, 10% and 20%.
  • 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.
  • the third column index set Set_C determined in the row index set RowIndxSet
  • the fourth column index set Set_D determined in the column index set ColumnIndxSet
  • L_C ⁇ L_D the third column index set Set_C is The true subset of the fourth column index set Set_D
  • L_C>L_D the fourth column index set Set_D is a true subset of the third column index set Set_C
  • the set Set_D is the same;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • 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 1 % 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 1 % of elements different from the third column index set Set_C;
  • L_C is the number of elements of the third column index set Set_C
  • L_D is the number of elements of the fourth column index set Set_D.
  • the ratio p 1 % is one of 5%, 10% and 20%.
  • 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.
  • 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
  • L_E ⁇ L_F the fifth column index set Set_E is the sixth column a true subset of the index set Set_F
  • L_E>L_F the sixth column index set Set_F is a true subset of the fifth column index set Set_E
  • L_E is the number of elements of the fifth column index set Set_E
  • L_F is the number of elements of the sixth column index set Set_F.
  • 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
  • L_E ⁇ L_F the fifth column index set Set_E has at least a ratio of The p 2 % element is different from the sixth column index set Set_F
  • L_E>L_F the sixth column index set Set_F has at least a ratio of p 2 % of elements different from the fifth column index set Set_E;
  • the ratio p 2 % is one of 5%, 10% and 20%.
  • 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).
  • NR New Radio Access Technology
  • 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).
  • the receiving end may be a UE or a base station, and the base station may be, but not limited to, a gNB.
  • the transmitting end transmits the transmitted bit sequence to the receiving end.
  • 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 256 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 1 ), and then the binary sequence is reversed , get the binary number (b 1 , b 2 ,..., b n ), and represent the obtained binary as a decimal number.
  • This decimal number is i; that is, the 0th column in G 256 is a matrix.
  • Column 0 the first column in G 256 is the matrix Column 128, the second column in G 256 is the matrix Column 64, and so on;
  • 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 256 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 1 ), and then the binary sequence is reversed , get the binary number (b 1 , b 2 ,..., b n ), and represent the obtained binary as a decimal number.
  • This decimal number is i; that is, the 0th column in G 256 is a matrix.
  • Column 255, the first column in G 256 is the matrix Column 127, the second column in G 256 is a matrix Column 191, and so on;
  • 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 256
  • 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 256
  • the column index is ⁇ S 1 , S 2 , S 3 , S 4 ⁇ , where the sequence S 1 is the intersection of the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ , the sequence S 2 is the difference between the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ and the sequence S 1 , the sequence S 4 is the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ t 1 , t 1 +1, ..., N-1
  • 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 256 corresponds to the matrix
  • the column index is ⁇ I 1 , I 2 , I 3 , I 4 ⁇ , where sequence I 2 is the intersection of the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ 0,1,...,t 1 -1 ⁇ , sequence I 1 is the difference between the sequence ⁇ 0, 1, ..., t 1 -1 ⁇ and the sequence I 2 , the sequence I 3 is the sequence ⁇ BRO(k) ⁇ and the sequence ⁇ t 1 , t 1 +1, ..., N-1
  • I 1 [0,1,..,63] ⁇ I 2 ,
  • 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.
  • the generation matrix Gc 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.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

L'invention porte sur un procédé et un appareil de codage de code polaire, et sur un dispositif. Dans la solution technique décrite dans les modes de réalisation de la présente invention, une matrice de génération (Gc) est utilisée de façon à coder une séquence de bits d'entrée présentant une longueur de K bits de manière à obtenir une séquence de bits de mot de code présentant une longueur de C bits, de telle sorte que le processus de codage est grandement simplifié, et par conséquent le temps de codage est réduit. La présente invention porte également sur un support de stockage lisible par ordinateur.
PCT/CN2018/075719 2017-02-15 2018-02-08 Procédé et appareil de codage de code polaire, et dispositif et support de stockage WO2018149354A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201710081770.7 2017-02-15
CN201710081770 2017-02-15
CN201710184706.1A CN108429553B (zh) 2017-02-15 2017-03-24 极化码的编码方法、编码装置及设备
CN201710184706.1 2017-03-24

Publications (1)

Publication Number Publication Date
WO2018149354A1 true WO2018149354A1 (fr) 2018-08-23

Family

ID=63155424

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/075719 WO2018149354A1 (fr) 2017-02-15 2018-02-08 Procédé et appareil de codage de code polaire, et dispositif et support de stockage

Country Status (2)

Country Link
CN (1) CN108429553B (fr)
WO (1) WO2018149354A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111490797B (zh) * 2019-01-29 2022-07-22 华为技术有限公司 编码方法、装置及设备
WO2020206670A1 (fr) * 2019-04-12 2020-10-15 Qualcomm Incorporated Sous-canaux pour communications sans fil de données codées polaires
CN111835474B (zh) * 2019-04-19 2021-07-23 大唐移动通信设备有限公司 一种基于pbch的信号处理方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916220A (zh) * 2014-04-15 2014-07-09 电子科技大学 一种基于极化码的网络编码协作通信方法
US20160079999A1 (en) * 2013-05-31 2016-03-17 Huawei Technologies Co., Ltd. Coding method and coding device
CN106100795A (zh) * 2016-06-17 2016-11-09 哈尔滨工业大学深圳研究生院 一种基于倒位码字Plotkin 构造和信息位重休眠的Polar 码编码协作
CN106253913A (zh) * 2016-07-29 2016-12-21 山东科技大学 极化码的块编码器及其编码方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101455978B1 (ko) * 2007-03-27 2014-11-04 엘지전자 주식회사 Ｌｄｐｃ 부호를 이용한 부호화 방법
CN105680883B (zh) * 2015-12-23 2017-11-14 华中科技大学 一种极化码和多比特奇偶校验码级联的纠错编码方法
CN106230489B (zh) * 2016-07-15 2019-07-16 西安电子科技大学 适用于任意高阶调制的极化码编码调制方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160079999A1 (en) * 2013-05-31 2016-03-17 Huawei Technologies Co., Ltd. Coding method and coding device
CN103916220A (zh) * 2014-04-15 2014-07-09 电子科技大学 一种基于极化码的网络编码协作通信方法
CN106100795A (zh) * 2016-06-17 2016-11-09 哈尔滨工业大学深圳研究生院 一种基于倒位码字Plotkin 构造和信息位重休眠的Polar 码编码协作
CN106253913A (zh) * 2016-07-29 2016-12-21 山东科技大学 极化码的块编码器及其编码方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ERICSSON: "Polar Code Design for Control Channel of NR", 3GPP TSG RAN WG1 AH_NR MEETING, R1-1700112, 20 January 2017 (2017-01-20), XP051207655 *

Also Published As

Publication number Publication date
CN108429553B (zh) 2022-11-29
CN108429553A (zh) 2018-08-21

Similar Documents

Publication Publication Date Title
KR101270815B1 (ko) 다양한 클래스의 코드들을 인코딩 및 디코딩하는 애플리케이션을 갖는 인-플레이스 변환
KR101330132B1 (ko) 랩터 코드의 디코딩
US20170033892A1 (en) Methods and apparatus employing fec codes with permanent inactivation of symbols for encoding and decoding processes
US12388469B2 (en) Rate matching method and apparatus for polar code
US8468430B2 (en) Product code decoding method and device
US20210409039A1 (en) Data processing method and device
US8707128B2 (en) Method and apparatus for channel encoding and decoding in a broadcasting/communication system using low density parity-check codes
CN108282265B (zh) 纠错编码方法、装置、设备及计算机可读存储介质
US20190173496A1 (en) Coding and Decoding of Polar Codes Extended to Lengths which are not Powers of Two
US20200153457A1 (en) Generalized low-density parity check codes (gldpc)
WO2018149354A1 (fr) Procédé et appareil de codage de code polaire, et dispositif et support de stockage
US11316534B2 (en) Encoding method and device, decoding method and device, and storage medium
CN113360264A (zh) 一种纠删处理系统、方法及分布式存储系统
CN115940966A (zh) 一种基于分块压缩运算方法的5g nr qc-ldpc编码电路
US9379847B2 (en) Method and apparatus for transmitting and receiving in a communication/broadcasting system
KR20100042589A (ko) 이진 데이터의 오류 정정 및 오류 검출 방법
CN101764620B (zh) 用于使用信道代码解码的装置和方法
CN108206722A (zh) 高码率数据发送方法和装置
US8566684B1 (en) Decoding and optimized implementation of SECDED codes over GF(q)
WO2018149304A1 (fr) Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique
Yu et al. Product-Matrix Construction of Minimum Storage Rack-aware Regenerating Codes
Anisimov et al. Robust prefix encoding using lower (2, 3) number representation
Tan et al. A practical and optimal symmetric Slepian-Wolf compression strategy using syndrome formers and inverse syndrome formers
US20190319638A1 (en) Method for generating encoded data that is encoded based on low-density parity-check codes, and method for decoding the encoded data
Das Blockwise solid burst error correcting codes

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18754392

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18754392

Country of ref document: EP

Kind code of ref document: A1