Data processing method, apparatus, and device

1. A method, applied to a first communication device, wherein the method comprises:

obtaining X information bit blocks, wherein each information bit block comprises K information bits, each information bit block is divided into Q information bit subblocks, and each information bit subblock is a binary sequence whose length is K/Q;

placing the Q information bit subblocks of each information bit block into Q first to-be-encoded blocks in M first to-be-encoded blocks according to a first order, wherein the first order is that each q th information bit subblock of each information bit block is located at ((q−1)*K/Q+1) th to (q*K/Q) th reliable positions of the M first to-be-encoded blocks, q meets 1≤q≤Q, and M meets M=X+Q−1;

separately performing polar code encoding on the M first to-be-encoded blocks to obtain M first code blocks;

sending the M first code blocks to a second communication device;

when retransmission is required after sending the M first code blocks, placing the Q information bit subblocks of each information bit block into Q second to-be-encoded blocks in M second to-be-encoded blocks according to a second order, wherein the second order and the first order meet a mapping relationship;

separately performing polar code encoding on the M second to-be-encoded blocks to obtain M second code blocks; and

sending the M second code blocks to the second communication device.

2. The method according to claim 1 , wherein the second order is that each q th information bit subblock of each information bit block is located at ((Q−q)*K/Q+1) th to ((Q−q+1)*K/Q) th reliable positions of the M second to-be-encoded blocks.

3. The method according to claim 1 , wherein the first order and the second order meet the following mapping relationship:

[ A 1 ,A 2 , . . . ,A 2 P ]=[0,0, . . . ,0, a 1 ,a 2 , . . . ,a Q ]F ⊗(J+P) , wherein

each a q is an information bit subblock in Q information bit subblocks of an information bit block, each A t is an information bit subblock corresponding to a mapped information bit subblock, F is a generator matrix of a polar code, J is a positive integer and meets K/Q=2 J , P is a positive integer and meets 2 P−1 ≤Q≤2 P , and t meets 1≤t≤2 P .

4. The method according to claim 1 , further comprising:

when retransmission is required after sending the M second code blocks, placing the Q information bit subblocks of each information bit block into Q third to-be-encoded blocks in M third to-be-encoded blocks according to another second order, wherein the another second order used in the third to-be-encoded blocks is different from the second order used in the second to-be-encoded blocks;

separately performing polar code encoding on the M third to-be-encoded blocks to obtain M third code blocks; and

sending the M third code blocks to the second communication device.

5. The method according to claim 4 , further comprising:

when retransmission is required after sending the M second code blocks, mapping the Q information bit subblocks of each information bit block from a binary field to 2 w number system field to obtain the M mapped information bit blocks [ā 1 , ā 2 , . . . , ā Q ], wherein each ā q is a information bit subblock in the a mapped information bit block, each ā q is a sequence whose length is K/wQ, and w is a positive integer greater than 1;

converting Q information bit subblocks of each mapped information bit block, wherein Q information bit subblocks of the each mapped information bit block and the converted corresponding Q information bit subblocks meet the following relationship:

[ Ā n,1 ,Ā n,2 , . . . ,Ā n,Q ]=[ā 1 ,ā 2 , . . . ,ā Q ]*H n , wherein

each Ā n,q is a corresponding information bit subblock after a corresponding ā q is converted, H n is a universal decoding matrix (UDM) of K/w×K/w in the 2 w number system field, and n indicates an n th times of transmission;

performing reverse mapping on [Ā n,1 , Ā n,2 , . . . , Ā n,Q ] to obtain a corresponding information bit block [Ā n,1 , Ā n,2 , . . . , Ā n,Q ] after [Ā n,1 , Ā n,2 , . . . , Ā n,Q ] is reversely mapped, wherein each A n,Q is a binary sequence whose length is K/Q;

placing Q information bit subblocks of each reversely-mapped information bit block into M n th to-be-encoded blocks according to the first order, wherein n meets n∈[1, 2, . . . , N], N is a total quantity of times of transmission performed by the first communication device, and N is a positive integer greater than 3;

separately performing polar code encoding on the M n th to-be-encoded blocks to obtain M n th code blocks; and

sending the M n th code blocks to the second communication device.

6. The method according to claim 1 , wherein each of the M first code blocks and the M second code blocks carries at least one information bit subblock and at most Q information bit subblocks.

7. The method according to claim 6 , wherein the M first code blocks are sequentially arranged based on identifiers of the respective first code blocks, the M second code blocks are sequentially arranged based on identifiers of the respective second code blocks, a first position code block in the M first code blocks carries one information bit subblock, and a first position code block in the M second code blocks carries one information bit subblock;

wherein in the M first code blocks, quantities of information bit blocks carried in the first position code block to a Q th position code block in the M first code blocks successively increase by one based on an arrangement order of the M first code blocks, and the Q th position code block in the M first code blocks carries Q information bit subblocks;

wherein in the M second code blocks, quantities of information bit blocks carried in the first position code block to a Q th position code block in the M second code blocks successively increase by one based on an arrangement order of the M second code blocks, and the Q th position code block in the M second code blocks carries Q information bit subblocks;

wherein in the M first code blocks and the M second code blocks, quantities of information bit subblocks carried in a (Q+1) th code block to an M th code block successively decrease by one based on the arrangement order of the respective code blocks; and

wherein in the M first code blocks and the M second code blocks, the M th code block carries one information bit subblock.

8. The method according to claim 7 , wherein Q is a quantization order of a code rate R, and Q is a positive integer; a code rate of an i th code block is r i =i×R/Q, wherein i meets 1≤i≤Q; and a code rate of a j th code block is r j =(M−j+1)×R/Q, and wherein j meets Q+1≤j≤M.

9. A method, applied to a second communication device, wherein the method comprises:

receiving M first code blocks initially transmitted by a first communication device, wherein the M first code blocks are obtained through polar code encoding on M first to-be-encoded blocks, the M first to-be-encoded blocks carry X information bit blocks, each information bit block is divided into Q information bit subblocks, the Q information bit subblocks of each information bit block are placed into Q first to-be-encoded blocks in the M first to-be-encoded blocks according to a first order, the first order is that each q th information bit subblock of each information bit block is located at ((q−1)*K/Q+1) th to (q*K/Q) th reliable positions of the M first to-be-encoded blocks, q meets 1≤q≤Q, and M meets M=X+Q−1;

receiving M second code blocks retransmitted by the first communication device, wherein the M second code blocks are obtained through polar code encoding on M second to-be-encoded blocks, the Q information bit subblocks of each information bit block are placed into Q second to-be-encoded blocks in the M second to-be-encoded blocks according to a second order, and the second order and the first order meet a mapping relationship; and

combining and decoding the M first code blocks and the M second code blocks to obtain decoded data.

10. The method according to claim 9 , wherein the second order is that each q th information bit subblock of each information bit block is located at ((Q−q)*K/Q+1) th to ((Q−q+1)*K/Q) th reliable positions of the M second to-be-encoded blocks.

11. The method according to claim 9 , wherein the first order and the second order meet the following mapping relationship:

[ A 1 ,A 2 , . . . ,A 2 P ]=[0,0, . . . ,0, a 1 ,a 2 , . . . ,a Q ]F ⊗(J+P) , wherein

each a q is a information bit subblock in Q information bit subblocks of an information bit block, each A t is an information bit subblock corresponding to a mapped information bit subblock, F is a generator matrix of a polar code, J is a positive integer and meets K/Q=2 J , P is a positive integer and meets 2 P−1 ≤Q≤2 P , and t meets 1≤t≤2 P .

12. The method according to claim 9 , wherein combining and decoding the M first code blocks and the M second code blocks to obtain the decoded data comprises:

in response to a sum of channel capacities of two times of transmission performed by the first communication device being greater than or equal to a code rate R, obtaining, through decoding, k 1 information bit subblocks [a 1 , a 2 , . . . , a k 1 ] comprised in each information bit block carried in the M first to-be-encoded blocks, wherein k 1 meets 1≤k 1 ≤Q;

obtaining, through decoding, k 2 information bit subblocks [a Q , a Q−1 , . . . a Q−k 2 +1 ] comprised in each information bit block carried in the M second to-be-encoded blocks, wherein k 2 meets 1≤k 2 ≤Q and k 1 +k 2 ≥Q; and

obtaining Q information bit subblocks [a 1 , a 2 , . . . , a Q ] comprised in each information bit block.

13. The method according to claim 12 , further comprising:

receiving M third code blocks retransmitted by the first communication device, wherein the M third code blocks are obtained through polar code encoding on M third to-be-encoded blocks, the Q information bit subblocks of each information bit block are placed into Q third to-be-encoded blocks in the M third to-be-encoded blocks according to a second order, and the second order used in the third to-be-encoded blocks is different from the second order used in the second to-be-encoded blocks;

in response to a sum of channel capacities of two times of transmission performed by the first communication device being less than the code rate R, and a sum of channel capacities of three times of transmission performed by the first communication device being greater than or equal to the code rate R, obtaining, through decoding, k 1 information bit subblocks [a 1 , a 2 , . . . , a k i ] comprised in each information bit block carried in the M first to-be-encoded blocks and k 2 information bit subblocks [a Q , a Q−1 , . . . , a Q−k 2 +1 ] comprised in each information bit block carried in the M second to-be-encoded blocks, wherein k 1 and k 2 meet k 1 +k 2 <Q;

obtaining, through decoding, k 3 information bit subblocks [A 1 , A 2 , . . . , A k 3 ] comprised in information bit block carried in the M third to-be-encoded blocks, wherein k 3 meets 1≤k 3 ≤Q, and k 1 , k 2 , and k 3 meet k 1 +k 2 +k 3 ≥Q;

obtaining, according to the mapping relationship between the first order and the second order, k 3 information bit subblocks [a k 1 +1 , a k 1 +1 , . . . , a Q−k 2 ] corresponding to each k 3 information bit subblocks before mapping; and

obtaining Q information bit subblocks [a 1 , a 2 , . . . , a Q ] comprised in each information bit block.

14. The method according to claim 9 , wherein each of the M first code blocks and the M second code blocks carries at least one information bit subblock and at most Q information bit subblocks.

15. An apparatus, comprising:

one or more processors; and

a non-transitory memory storing a software program including instructions that, when executed by the one or more processors, cause the apparatus to:

obtain X information bit blocks, wherein each information bit block comprises K information bits, each information bit block is divided into Q information bit subblocks, and each information bit subblock is a binary sequence whose length is K/Q;

place the Q information bit subblocks of each information bit block into Q first to-be-encoded blocks in M first to-be-encoded blocks according to a first order, wherein the first order is that each q th information bit subblock of each information bit block is located at ((q−1)*K/Q+1) th to (q*K/Q) th reliable positions of the M first to-be-encoded blocks, q meets 1≤q≤Q, and M meets M=X+Q−1;

separately perform polar code encoding on the M first to-be-encoded blocks to obtain M first code blocks;

send the M first code blocks to a second communication device;

when retransmission is required, place the Q information bit subblocks of each information bit block into Q second to-be-encoded blocks in M second to-be-encoded blocks according to a second order, wherein the second order and the first order meet a mapping relationship;

separately perform polar code encoding on the M second to-be-encoded blocks to obtain M second code blocks; and

send the M second code blocks to the second communication device.

16. The apparatus according to claim 15 , wherein the second order is that each q th information bit subblock of each information bit block is located at ((Q−q)*K/Q+1) th to ((Q−q+1)*K/Q) th reliable positions of the M second to-be-encoded blocks.

17. The apparatus according to claim 15 , wherein the first order and the second order meet the following mapping relationship:

[ A 1 ,A 2 , . . . ,A 2 P ]=[0,0, . . . ,0, a 1 ,a 2 , . . . ,a Q ]F ⊗(J+P) , where

each a q is an information bit subblock in Q information bit subblocks of any information bit block, each A t is an information bit subblock corresponding to any mapped information bit subblock, F is a generator matrix of a polar code, J is a positive integer and meets K/Q=2 J , P is a positive integer and meets 2 P−1 ≤Q≤2 P , and t meets 1≤t≤2 P .

18. The apparatus according to claim 15 , wherein when the instructions are executed by the one or more processors, the instructions further cause the apparatus to:

when retransmission is required after sending the M second code blocks, place the Q information bit subblocks of each information bit block into Q third to-be-encoded blocks in M third to-be-encoded blocks according to a second order, wherein the second order used in the third to-be-encoded blocks is different from the second order used in the second to-be-encoded blocks;

separately perform polar code encoding on the M third to-be-encoded blocks to obtain M third code blocks; and

send the M third code blocks to the second communication device.

19. The apparatus according to claim 15 , wherein each of the M first code blocks and the M second code blocks carries at least one information bit subblock and at most Q information bit subblocks.

20. The apparatus according to claim 19 , wherein the M first code blocks are sequentially arranged based on identifiers of the respective first code blocks, the M second code blocks are sequentially arranged based on identifiers of the respective second code blocks, a first position code block in the M first code blocks carries one information bit subblock, and a first position code block in the M second code blocks carries one information bit subblock;

wherein in the M first code blocks, quantities of information bit blocks carried in the first position code block to a Q th position code block in the M first code blocks successively increase by one based on an arrangement order of the M first code blocks, and the Q th position code block in the M first code blocks carries Q information bit subblocks;

wherein in the M second code blocks, quantities of information bit blocks carried in the first position code block to a Q th position code block in the M second code blocks successively increase by one based on an arrangement order of the M second code blocks, and the Q th position code block in the M second code blocks carries Q information bit subblocks;

wherein in the M first code blocks and the M second code blocks, quantities of information bit subblocks carried in a (Q+1) th code block to an M th code block successively decrease by one based on the arrangement order of the respective code blocks; and

wherein in the M first code blocks and the M second code blocks, the M th code block carries one information bit subblock.