Channel encoding and decoding method and apparatus

Patent metadata

Field	Value
Publication number	US-2016013887-A1
Application number	US-201514865811-A
Country	US
Kind code	A1
Filing date	Sep 25, 2015
Priority date	Mar 27, 2013
Publication date	Jan 14, 2016
Grant date	—

Abstract

Embodiments of the present invention provide a channel encoding and decoding method and apparatus, where a channel encoding method includes: acquiring, by an encoder, an information bit index set; generating, by the encoder, a second bit vector according to a to-be-encoded first information bit and the information bit index set; and performing, by the encoder, Polar code encoding on the second bit vector to generate an encoded first code word. In technical solutions of the present invention, an encoder first acquires an information bit index set, generates a second bit vector according to a to-be-encoded first information bit and the information bit index set, and then performs Polar code encoding on the second bit vector to generate an encoded first code word.

First claim

What is claimed is:

1 . A channel encoding method, comprising:
acquiring, by an encoder, an information bit index set; generating, by the encoder, a bit vector according to a to-be-encoded information bit and the information bit index set; and performing, by the encoder, Polar code encoding on the bit vector to generate an encoded first code word.

2 . The channel encoding method according to claim 1 , wherein the generating, by the encoder, the bit vector according to the to-be-encoded information bit and the information bit index set comprises:
generating, by the encoder, a submatrix according to elements in a first matrix and respectively corresponding to a row index and a column index, wherein the row index and the column index belong to the information bit index set, wherein the first matrix is B N F ⊕n B N or F ⊕n , B N is transposed matrix, and F ⊕n indicates an n th Kronecker product of F, wherein F is

[

1

0

1

1

]

;

and
performing, by the encoder using the submatrix, linear transformation on the to-be-encoded information bit to generate the bit vector.

3 . The channel encoding method according to claim 2 , wherein the performing, by the encoder by using the submatrix, the linear transformation on the to-be-encoded information bit to generate the bit vector comprises:
obtaining the bit vector u B by using the following formula:
u B =u A ×G AA ,
wherein u A is the information bit, and G AA is the submatrix.

4 . The channel encoding method according to claim 2 , wherein the performing, by the encoder by using the submatrix, the linear transformation on the to-be-encoded information bit to generate the bit vector comprises:
obtaining the second bit vector u B by using the following formula:
u B =u A ×mod(inv( G AA ),2),

wherein u A is the information bit, G AA is the submatrix, inv(G AA ) indicates that an inverse operation is performed on G AA , and mod(inv(G AA ),2) indicates that a modulo 2 operation is performed on G AA on which the inverse operation has been performed.

5 . The channel encoding method according to claim 2 , wherein the performing, by the encoder, the Polar code encoding on the bit vector to generate the encoded first code word comprises:
generating, by the encoder, a second matrix according to F ⊕n ; and performing, by the encoder by using a frozen bit and the second matrix, the Polar encoding on the bit vector to obtain the encoded first code word.

6 . The channel encoding method according to claim 5 , wherein the generating, by the encoder, the second matrix according to F ⊕n comprises:
obtaining the second matrix G N by using the following formula:
G N. =B N F ⊕n .

7 . The channel encoding method according to claim 5 , wherein the generating, by the encoder, the second matrix according to F ⊕n comprises:
obtaining the second matrix G N by using the following formula:
G N. =F ⊕n .

8 . The channel encoding method according to claim 5 , wherein the performing, by the encoder by using the frozen bit and the second matrix, the Polar encoding on the bit vector to obtain the encoded first code word comprises:
obtaining the encoded first code word X 1 N by using the following formula:
X 1 N =u B G N. ( A )⊕ u A C G N. ( A C ),

wherein u B is the bit vector, u A C is the frozen bit, A is the information bit index set, A C is a frozen bit index set, G N. (A) comprises a row corresponding to an index of A that is in the second matrix G N , N (A C ) comprises a row corresponding to an index of A C that is in G N , and ⊕ is a modulo 2 addition operation.

9 . The channel encoding method according to claim 1 , wherein the acquiring, by the encoder, the information bit index set comprises:
determining, by the encoder, the information bit index set according to the Frozen bit index set.

10 . The channel encoding method according to claim 1 , wherein the generating, by the encoder, the bit vector according to the to-be-encoded information bit and the information bit index set comprises:
performing, by the encoder, the Polar code encoding on the to-be-encoded information bit to generate an encoded second code word; and extracting, by the encoder from the encoded second code word, a bit corresponding to a sequence number of the information bit index set, and using the bit as the bit vector.

11 . A channel decoding method, comprising:
acquiring, by a decoder, an information bit index set; performing, by the decoder, Polar code decoding on a received to-be-decoded vector to generate a bit vector; and generating, by the decoder, a decoded information bit according to the bit vector and the information bit index set.

12 . The channel decoding method according to claim 11 , wherein the generating, by the decoder, the decoded information bit according to the bit vector and the information bit index set comprises:
generating, by the decoder, a submatrix according to elements that are in a first matrix and respectively corresponding to a row index and a column index, wherein the row index and the column index belong to the information bit index set, wherein the first matrix is B N F ⊕n B N or F ⊕n , B N is a transposed matrix, and F ⊕n indicates an n th Kronecker product of F, wherein F is

[

1

0

1

1

]

;

and
performing, by the decoder using the submatrix, linear transformation on the bit vector to generate the decoded information bit.

13 . The channel decoding method according to claim 12 , wherein the performing, by the decoder using the submatrix, the linear transformation on the bit vector to generate the decoded information bit comprises:
obtaining the information bit u A by using the following formula:
u A =u B ×G AA ,
wherein u B is the bit vector, and G AA is the submatrix.

14 . The channel decoding method according to claim 12 , wherein if the first matrix is F ⊕n , before the performing, by the decoder using the submatrix, the linear transformation on the bit vector to generate the decoded information bit, the method further comprises:
performing, by the decoder, bit inversion processing on the bit vector; and correspondingly, the performing, by the decoder using the submatrix, the linear transformation on the bit vector to generate the decoded information bit comprises: performing, by the decoder according to the submatrix, the linear transformation on the bit vector on which the bit inversion processing ha

Assignees

• Huawei Tech Co Ltd

Inventors

• Shen Hui
• Li Bin

Classifications

• H04L1/0057

  Block codes (H04L1/0061, H04L1/0064 take precedence) · CPC title

• H04L1/0045

  Arrangements at the receiver end · CPC title

• H04L1/0041 Primary

  Arrangements at the transmitter end · CPC title

• H04L1/0058

  Block-coded modulation · CPC title

• H03M13/13

  Linear codes · CPC title