Method for encoding information bit sequence in communication network
Embodiments of this application provide a method for encoding data in a wireless communication network. A communication device obtains an information bit sequence of a bit length K and a code length M. When M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, the device divides the information bit sequence into p subsequences that are of an equal length K 1 . Then the device encodes each of the p subsequence to obtain p encoded subsequences. The device rate-matches each of the p encoded subsequences to obtain p rate matched subsequences, concatenates the p rate matched subsequences to obtain the output sequence of the code length M, then outputs the output sequence.
1. A method for processing information bit sequences, performed by a device in a wireless communication network, comprising:
obtaining an information bit sequence of a bit length K, and obtaining a code length M, wherein the code length M is a length of an output sequence resulting from the information bit sequence, wherein K and M are positive integers;
when M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, dividing the information bit sequence into p subsequences that are of an equal length K 1 , wherein p is an integer greater than 1, and wherein the second threshold is a value in a range of [300, 360];
polar encoding each of the p subsequences to obtain p encoded subsequences;
rate matching each of the p encoded subsequences to obtain p rate matched subsequences;
concatenating the p rate matched subsequences, to obtain the output sequence, wherein the output sequence has a length of M; and
transmitting the output sequence;
wherein polar encoding each of the p subsequences to obtain p encoded subsequences comprises:
for each subsequence, generating a binary row vector u 1 N , wherein N≥K 1 , u 1 N =(u 1 , u 2 , . . . , u N ), and K 1 bit-positions of the binary row vector u 1 N are occupied by K 1 bits of the subsequence; and
encoding the binary row vector u 1 N according to an encoding formula, to obtain the encoded subsequence;
wherein the encoding formula is:
x 1 N =u 1 N G N ,
where x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded subsequence, and G N is a polar code generating matrix of N rows and N columns.
2. The method according to claim 1 , wherein p=2.
3. The method according to claim 1 , wherein the second threshold is 360.
4. The method according to claim 1 , wherein
the first threshold is a constant; or
the first threshold is determined based on at least one of: a code rate R or the bit length of the information bit sequence K.
5. The method according to claim 1 , wherein rate matching each of the p encoded subsequences to obtain p rate matched subsequences comprises:
if a total length of the encoded subsequences is greater than M, puncturing or shortening at least one of the encoded subsequences, to obtain p rate matched subsequences whose total length is M.
6. A device in a wireless communication network, comprising:
a processor 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 an information bit sequence of a bit length K, and obtain a code length M, wherein the code length M is a length of an output sequence resulting from the information bit sequence, wherein K and M are positive integers;
when M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, divide the information bit sequence into p subsequences that are of an equal length K 1 , wherein p is an integer greater than 1, and wherein the second threshold is a value in a range of [300, 360];
polar encode each of the p subsequences to obtain p encoded subsequences;
rate match each of the p encoded subsequences to obtain p rate matched subsequences;
concatenate the p rate matched subsequences, to obtain the output sequence, wherein the output sequence has a length of M; and
transmit the output sequence;
wherein in polar encoding each of the p subsequences, by executing the program instructions, the processor is configured to:
for each subsequence, generate a binary row vector u 1 N , wherein N≥K 1 , u 1 N =(u 1 , u 2 , . . . , u N ), and K 1 bit-positions of the binary row vector u 1 N are occupied by K 1 bits of the subsequence; and
encode the binary row vector u 1 N according to an encoding formula, to obtain the encoded subsequence;
wherein the encoding formula is:
x 1 N =u 1 N G N ,
where x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded subsequence, and G N is a polar code generating matrix of N rows and N columns.
7. The device according to claim 6 , wherein p=2.
8. The device according to claim 6 , wherein the second threshold is 360.
9. The device according to claim 6 , wherein
the first threshold is a constant, or
the first threshold is determined based on at least one of a code rate R or the bit length of the information bit sequence K.
10. The device according to claim 6 , wherein the device is a base station or a user terminal.
11. 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 an information bit sequence of a bit length K, and obtaining a code length M, wherein the code length M is a length of an output sequence resulting from the information bit sequence, wherein K and M are positive integers;
when M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, dividing the information bit sequence into p subsequences that are of an equal length K 1 , wherein p is an integer greater than 1, wherein the second threshold is a value in a range of [300, 360];
polar encoding each of the p subsequences to obtain p encoded subsequences;
rate matching each of the p encoded subsequences to obtain p rate matched subsequences;
concatenating the p rate matched subsequences, to obtain the output sequence; and
transmitting the output sequence, wherein the output sequence has a length of M;
wherein the instructions for polar encoding each of the p subsequences to obtain p encoded subsequences comprise:
for each subsequence, generating a binary row vector u 1 N , wherein N≥K 1 , u 1 N =(u 1 , u 2 , . . . , u N ), and K 1 bit-positions of the binary row vector u 1 N are occupied by K 1 bits of the subsequence; and
encoding the binary row vector u 1 N according to an encoding formula, to obtain the encoded subsequence;
wherein the encoding formula is:
x 1 N =u 1 N G N ,
where x 1 N =(x 1 , x 2 , . . . , x N ) is the encoded subsequence, and G N is a polar code generating matrix of N rows and N columns.
12. The non-transitory computer readable medium according to claim 11 , wherein p=2.
13. The non-transitory computer readable medium according to claim 11 , wherein the second threshold is 360.
14. The non-transitory computer readable medium according to claim 11 , wherein
the first threshold is a constant; or
the first threshold is determined based on at least one of: a code rate R or the bit length of the information bit sequence K.