Encoding and modulation method, demodulation and decoding method, and apparatus

1 . An encoding and modulation method, wherein the method comprises:

obtaining a first bit sequence, wherein the first bit sequence comprises K information bits, and K is an integer greater than 1;

mapping the K information bits to m sub-blocks;

performing first polar code encoding on the m sub-blocks to obtain a second bit sequence, wherein a quantity of information bits of the K information bits comprised in a first sub-block of the m sub-blocks is obtained based on a value of K and a code rate R of the first bit sequence, m is a modulation order of the first bit sequence, m is an integer equal to or greater than 1, a length of the second bit sequence is N, and N is an integer greater than 1;

performing modulation based on the second bit sequence to obtain a symbol sequence; and

outputting the symbol sequence.

2 . The method according to claim 1 , wherein the performing first polar code encoding comprises:

performing second polar code encoding on each of the m sub-blocks to obtain m sub-polar codes; and

obtaining the second bit sequence based on the m sub-polar codes.

3 . The method according to claim 1 , wherein positions of the information bits in the first sub-block are determined based on a reliability sequence having a same length as the first sub-block.

4 . The method according to claim 1 , wherein the quantity of information bits comprised in the first sub-block is less than or equal to a quantity of non-punctured of the K information bits or non-shortened information bits of the K information bits.

5 . The method according to claim 1 , wherein a quantity u j of information bits of the K information bits comprised in a j sub-block of the m sub-blocks meets the following formula:

u

j

=

{

⌈

K

×

R

j

⌉

,

j

=

m

,

m

-

1

,

…

,

2

K

-

∑

i

=

2

i

=

m

⁢

u

i

,

j

=

1

,

wherein

R j represents a code rate allocation function of the j th sub-block, R j is determined based on the code rate R, and R 1 +R 2 + . . . +R m =1.

6 . The method according to claim 5 , wherein the code rate allocation function R 1 of the j th sub-block meets the following formula:

R j =p n ×R n +p n-1 ×R n-1 + . . . +p 1 ×R 1 +p 0 ×R 0 , wherein

n is an integer, R n represents R raised to the power of n, and p n is a constant.

7 . The method according to claim 5 , wherein in response to m=2, the code rate allocation function R of the j sub-block meets the following formula:

R j =p n ×R n +p n-1 ×R n-1 + . . . +p 1 ×R 1 +p 0 ×R 0 , wherein

n is an integer, R n represents R raised to the power of n, and p n is a constant.

8 . The method according to claim 6 , wherein in response to m=2, a code rate allocation function of a 2 nd sub-block of the m sub-blocks meets the following formula:

in response to n=3, R 2 =p 3 ×R 3 +p 2 ×R 2 ×R 1 +p 0 ×R 0 , wherein

p 3 =0.6855, p 2 =−0.9543, p 1 =−0.2042, and p 0 1.011; or p 3 =0.8462, p 2 =−1.704, p 1 =0.4165, and p 0 =0.9453;

in response to n=4, R 2 =p 4 ×R 4 +p 3 ×R 3 +p 2 ×R 2 +p 1 ×R 1 +p 0 ×R 0 , wherein

p 4 =−0.8099, p 3 =2.305, p 2 =−0.2048, p 1 =0.0796, and p 0 =0.989; or p 4 =0.817, p 3 =−0.7891, p 2 =−0.5997, p 1 =0.1299, and p 0 =0.9679;

in response to n=2, R 2 =p 2 ×R 2 +p 1 ×R 1 +p 0 ×R 0 , wherein

p 2 =0.07398, p 1 =−0.6434, and p 0 =1.06; or p 2 =−0.4346, p 1 =−0.1256, and p 0 =1.005; and

in response to n=1, R 2 =p 1 ×R 1 +p 0 ×R 0 , wherein

p 1 =−0.5697, and p 0 =1.046; or p 1 =−0.5602, and p 0 =1.086.

9 . A demodulation and decoding method, wherein the method comprises:

obtaining a symbol sequence, wherein the symbol sequence is obtained by performing modulation based on a second bit sequence, a length of the second bit sequence is N, N is an integer greater than 1, the second bit sequence is a bit sequence obtained by mapping K information bits comprised in a first bit sequence to m sub-blocks;

performing first polar code encoding on the m sub-blocks, a quantity of information bits of the K information bits comprised in a first sub-block of the m sub-blocks is obtained based on K and a code rate R of the first bit sequence, m is a modulation order of the first bit sequence, and m is an integer equal to or greater than 1; and

demodulating and decoding the symbol sequence to obtain the K information bits.

10 . The method according to claim 9 , wherein the second bit sequence is further obtained based on m sub-polar codes that are obtained by mapping the K information bits to the m sub-blocks and performing second polar code encoding on each of the m sub-blocks.

11 . The method according to claim 9 , wherein a position of each information bit of the information bits in the first sub-block is determined based on a reliability sequence having a same length as the first sub-block.

12 . The method according to any one of claim 9 , wherein the quantity of information bits comprised in the first sub-block is less than or equal to a quantity of non-punctured or non-shortened information bits.

13 . The method according to any one of claim 9 , wherein a quantity u J of information bits comprised in a j th sub-block of the m sub-blocks meets the following formula:

u

j

=

{

⌈

K

×

R

j

⌉

,

j

=

m

,

m

-

1

,

…

,

2

K

-

∑

i

=

2

i

=

m

⁢

u

i

,

j

=

1

,

wherein

R j represents a code rate allocation function of the j th sub-block, R j is determined based on the code rate R, and R 1 +R 2 + . . . +R m =1.

14 . The method according to claim 13 , wherein the code rate allocation function R j of the j th sub-block meets the following formula:

R j =p n ×R n +p n-1 ×R n-1 + . . . +p 1 ×R 1 +p 0 ×R 0 , wherein

n is an integer, R n represents R raised to the power of n, and p n is a constant.

15 . The method according to claim 13 , wherein in response to m=2, the code rate allocation function R j of the j th sub-block meets the following formula:

R j =p n ×R n +p n-1 ×R n-1 + . . . +p 1 ×R 1 +p 0 ×R 0 , wherein

n is an integer, R n represents R raised to the power of n, and p n is a constant.

16 . The method according to claim 14 , wherein in response to m=2, a code rate allocation function of a 2 nd sub-block of the m sub-blocks meets the following formula:

in response to n=3, R 2 =p 3 ×R 3 +p 2 ×R 2 +p 1 ×R 1 +p 0 ×R 0 , wherein

p 3 =0.6855, p 2 =−0.9543, p 1 =−0.2042, and p 0 1.011; or p 3 =0.8462, p 2 =−1.704, p 1 =0.4165, and p 0 =0.9453;

in response to n=4, R 2 =p 4 ×R 4 +p 3 ×R 3 +p 2 ×R 2 +p 1 ×R 1 +p 0 ×R 0 , wherein

p 4 =−0.8099, p 3 =2.305, p 2 =−0.2048, p 1 =0.0796, and p 0 =0.989; or p 4 =0.817, p 3 =−0.7891, p 2 =−0.5997, p 1 =0.1299, and p 0 =0.9679;

in response to n=2, R 2 =p 2 ×R 2 +p 1 ×R 1 +p 0 ×R 0 , wherein

p 2 =0.07398, p 1 =−0.6434, and p 0 =1.06; or p 2 =−0.4346, p 1 =−0.1256, and p 0 =1.005; and

in response to n=1, R 2 =p 1 ×R 1 +p 0 ×R 0 , wherein

p 1 =−0.5697, and p 0 =1.046; or p 1 =−0.5602, and p 0 =1.086.

17 . A communication apparatus, comprising:

a processor; and

a memory configured to store instructions for causing the processor to implement the method according to claim 1 .

18 . The communication apparatus according to claim 17 , wherein the processor is further configured to execute the instructions for performing first polar code encoding by:

performing second polar code encoding on each of the m sub-blocks to obtain m sub-polar codes; and

obtaining the second bit sequence based on the m sub-polar codes.

19 . The communication apparatus according to claim 17 , wherein positions of the information bits in the first sub-block are determined based on a reliability sequence having a same length as the first sub-block.

20 . The communication apparatus according to claim 17 , wherein the quantity of information bits comprised in the first sub-block is less than or equal to a quantity of non-punctured of the K information bits or non-shortened information bits of the K information bits.