Method and device for polar code rate matching

1. A method for use in a wireless communication network, comprising:

obtaining, by a communication device, K information bits, wherein K≥1;

generating, by the communication device, a to-be-encoded sequence having a length of N bits, wherein the to-be-encoded sequence comprises the K information bits and L frozen bits, wherein L is larger than or equal to (N−M), N is an integer power of 2, and M is a positive integer and less than N; and wherein L bit positions of the to-be-encoded sequence for placing the L frozen bits are determined according to a rate match manner;

polar encoding, by the communication device, the to-be-encoded sequence, to obtain an encoded sequence;

interleaving, by the communication device, the encoded sequence, to obtain an interleaved sequence;

sequentially storing, by the communication device, the interleaved sequence into a cyclic cache of the communication device; and

sequentially outputting, by the communication device, M bits of the interleaved sequence from the cyclic cache according to the rate matching manner.

2. The method according to claim 1 , wherein the rate matching manner is puncturing, and the (N−M+1) th bit to the N th bit of the interleaved sequence are output from the cyclic cache.

3. The method according to claim 1 , wherein the rate matching manner is shortening, and the first bit to the M th bit of the interleaved sequence are output from the cyclic cache.

4. The method according to claim 1 , wherein polar encoding the to-be-encoded sequence to obtain the encoded sequence comprises:

generating a binary row vector u 1 N =(u 1 , u 2 , K, u N ), wherein the binary row vector corresponds to the to be encoded sequence; and

encoding the binary row vector u 1 N according an encoding formula, to obtain the encoded bit sequence;

wherein the encoding formula is:

x 1 N =u 1 N G N ,

wherein x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded bit sequence, and G N is a polar code generating matrix of N rows and N columns.

5. A device in a wireless communication network, comprising a processor, a cyclic cache, and a memory storing program instructions for execution by the processor; wherein when executed by the processor, the program instructions cause the device to:

obtain K information bits, wherein K≥1;

generate a to-be-encoded sequence having a length of N bits, wherein the to-be-encoded sequence comprises the K information bits and L frozen bits, wherein L is larger than or equal to (N−M), N is an integer power of 2, and M is a positive integer and less than N; and wherein L bit positions of the to-be-encoded sequence for placing the L frozen bits are determined according to a rate match manner;

polar encode the to-be-encoded sequence, to obtain an encoded sequence;

interleave the encoded sequence, to obtain an interleaved sequence;

sequentially store the interleaved sequence into a cyclic cache of the communication device; and

sequentially output M bits of the interleaved sequence from the cyclic cache according to the rate matching manner.

6. The device according to claim 5 , wherein the rate matching manner is puncturing, and the (N−M+1) th bit to the N th bit of the interleaved sequence are output from the cyclic cache.

7. The device according to claim 5 , wherein the rate matching manner is shortening, and the first bit to the M th bit of the interleaved sequence are output from the cyclic cache.

8. The device according to claim 5 , wherein in polar encoding the to-be-encoded sequence to obtain the encoded sequence, by executing the program instructions, the processor is configured to:

generating a binary row vector u 1 N =(u 1 , u 2 , K, u N ), wherein the binary row vector corresponds to the to be encoded sequence; and

encoding the binary row vector u 1 N according an encoding formula, to obtain the encoded bit sequence;

wherein the encoding formula is:

x 1 N =u 1 N G N ,

wherein x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded bit sequence, and G N is a polar code generating matrix of N rows and N columns.

9. A non-transitory computer readable medium storing program codes thereon for execution by a processor in a communication device, wherein the program codes comprise instructions for:

obtaining K information bits, wherein K≥1;

generating a to-be-encoded sequence having a length of N bits, wherein the to-be-encoded sequence comprises the K information bits and L frozen bits, wherein L is larger than or equal to (N−M), N is an integer power of 2, and M is a positive integer and less than N; and wherein L bit positions of the to-be-encoded sequence for placing the L frozen bits are determined according to a rate match manner;

polar encoding the to-be-encoded sequence, to obtain an encoded sequence;

interleaving the encoded sequence, to obtain an interleaved sequence;

sequentially storing the interleaved sequence into a cyclic cache of the communication device; and

sequentially outputting M bits of the interleaved sequence from the cyclic cache according to the rate matching manner.

10. The non-transitory computer readable medium according to claim 9 , wherein the rate matching manner is puncturing, and the (N−M+1) th bit to the N th bit of the interleaved sequence are output from the cyclic cache.

11. The non-transitory computer readable medium according to claim 9 , wherein the rate matching manner is shortening, and the first bit to the M th bit of the interleaved sequence are output from the cyclic cache.

12. The non-transitory computer readable medium according to claim 9 , wherein the instructions for polar encoding the to-be-encoded sequence to obtain the encoded sequence:

generating a binary row vector u 1 N =(u 1 , u 2 , K, u N ), wherein the binary row vector corresponds to the to be encoded sequence; and

encoding the binary row vector u 1 N according an encoding formula, to obtain the encoded bit sequence;

wherein the encoding formula is:

x 1 N =u 1 N G N ,

wherein x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded bit sequence, and G N is a polar code generating matrix of N rows and N columns.