Method and apparatus for processing data

1. A method for processing data, comprising:

performing code block segmentation on a data block to obtain multiple first blocks, wherein a difference between numbers of bits of any two first blocks block is not more than 1 bit;

determining multiple second blocks according to at least one padding bit and the multiple first blocks, wherein a quantity of bits of each of the multiple second blocks is K, K is a quantity of information bits of a polar code, and a value of each padding bit is a preset value;

adding consecutive N−K fixed bits to each of the multiple second blocks to obtain multiple third blocks, wherein a value of each fixed bit is a preset value, a value of N is 2^n, n is an integer larger than 0, and N−K≧0; and

performing polar encoding according to the multiple third blocks.

2. The method of claim 1 , wherein the performing code block segmentation on a data block to obtain multiple first blocks, comprises:

if a quantity of bits of the data block is larger than K, dividing the data block into C first blocks;

wherein a quantity of bits of each of the C first blocks, K r is as follows:

when 1≦r≦B′ mod C, K r =┌B′/C┐, and when B′ mod C<r≦C, K r =└B′/C┘; or

when 1≦r≦B′ mod C, K r =└B′/C┘, and when B′ mod C<r≦C, K r ┌B′/C┐;

wherein r is a sequential quantity of the first block, 1≦r≦C, the quantity of the first blocks is C=┌B/(K−J)┐, a total quantity of bits of the C first blocks is B′=B+C·J, B is the quantity of bits of the data block, J is a quantity of check bits for performing cyclic redundancy check (CRC) on the first block, and 0≦J≦K.

3. The method of claim 2 , wherein the determining multiple second blocks according to the at least one padding bit and the multiple first blocks comprises:

if a quantity of bits of any one of the first blocks is smaller than K, adding the at least one padding bit to the first block with the quantity of bits smaller than K to form the second block, wherein a quantity of the at least one padding bit of the r th second block is K−K r , K r is the quantity of bits of the r th first block in the multiple first blocks, and 1≦r≦C; and

if a quantity of bits of any one of the first blocks is equal to K, taking the first block with the quantity of bits equal to K as the second block.

4. The method of claim 3 , wherein the adding the at least one padding bit to the first block with the quantity of bits smaller than K to form the second block, comprises:

adding the at least one padding bit in front of the first block with the quantity of bits smaller than K to form the second block.

5. The method of claim 4 , wherein the adding consecutive N−K fixed bits to each of the multiple second blocks to obtain multiple third blocks, comprises:

if the second block has at least one padding bit, adding consecutive N−K fixed bits at a position, that is in front of the at least one padding bit and is adjacent to the at least one padding bit, to obtain the third block; and

if the second block does not have any padding bit, adding consecutive N−K fixed bits at a position, that is in front of the second block and is adjacent to the second block, to obtain the third block.

6. The method of claim 3 , wherein the adding the at least one padding bit to the first block with the quantity of bits smaller than K to form the second block, comprises:

adding the at least one padding bit behind the first block with the quantity of bits smaller than K to form the second block.

7. The method of claim 6 , wherein the adding consecutive N−K fixed bits to each of the multiple second blocks to obtain multiple third blocks, comprises:

if the second block has at least one padding bit, adding consecutive N−K fixed bits at a position that is behind the at least one padding bit and is adjacent to the at least one padding bit to obtain the third block; and

if the second block does not have any padding bit, adding consecutive N−K fixed bits at a position that is behind the second block and is adjacent to the second block to obtain the third block.

8. The method of claim 1 , wherein the performing polar encoding according to the multiple third blocks comprises:

performing interleaved mapping on the multiple third blocks to obtain multiple fourth blocks; and

performing polar encoding on the multiple fourth blocks.

9. The method of claim 8 , wherein the performing interleaved mapping on the multiple third blocks to obtain multiple fourth blocks comprises:

determining the multiple fourth blocks according to a mapping relationship c ri x π =c rx , x=0, 1, . . . , N−1, wherein C r =[c r0 , c r1 , c r2 , c r3 , . . . , c r(N−1) ] denotes the r th third block in the multiple third blocks, C r π [c r0 π , c r1 π , c r2 π , c r3 π , . . . , c r(N−1) π ] denotes the r th fourth block in the multiple fourth blocks, 1≦r≦C, C is a quantity of the multiple third blocks, Π N (i 0 , i 1 , i 2 , . . . , i N−1 ), i x ∈{0, . . . , N−1}, 0≦x≦N−1 is an expression of an interleaved sequence of the interleaved mapping, and any two elements of the interleaved sequence are different from each other.

10. An apparatus for processing data, comprising:

a first obtaining unit, configured to perform code block segmentation on a data block to obtain multiple first blocks, wherein a difference between numbers of bits of any two first blocks in the multiple first blocks is not more than 1 bit;

a determining unit, configured to determine multiple second blocks according to at least one padding bit and the multiple first blocks, wherein a quantity of bits of each of the multiple second blocks is K, K is a quantity of information bits of a polar code, and a value of each padding bit is a preset value;

a second obtaining unit, configured to add consecutive N−K fixed bits to each of the multiple second blocks to obtain multiple third blocks, wherein a value of the fixed bit is a preset value, a value of N is 2^n, n is an integer larger than 0, and N−K≧0; and

an encoding unit, configured to perform polar encoding according to the third blocks.

11. The apparatus of claim 10 , wherein the first obtaining unit is specifically configured to divide, if a quantity of bits of the data block is larger than K, the data block into C first blocks;

and a quantity of bits of each of the C first blocks, K r , is as follows:

when 1≦r≦B′ mod C, K r =┌B′/C┐, and when B′ mod C<r≦C, K r └B′/C┘; or

when 1≦r≦B′ mod C, K r =└B′/C┘, and when B′ mod C<r≦C, K r =┌B′/C┐;

wherein r is a sequential quantity of the first block, 1≦r≦C, the quantity of the first blocks is C=┌B/(K−J)┐, a total quantity of bits of the C first blocks is B′=B+C·J, is the quantity of bits of the data block, J is a quantity of check bits which needs to be added for performing cyclic redundancy check (CRC) on the first block, and 0≦J≦K.

12. The apparatus of claim 11 , wherein

the determining unit is configured to add, if a quantity of bits of any one of the first blocks is smaller than K, the at least one padding bit to the first block with the quantity of bits smaller than K to form the second block, wherein a quantity of the at least one padding bit of the r th second blocks is K−K r , K r is the quantity of bits of the r th first block in the multiple first blocks, and 1≦r≦C; and

the determining unit is further configured to take, if a quantity of bits of any one of the first blocks is equal to K, the first blocks with the quantity of bits equal to K as the second block.

13. The apparatus of claim 12 , wherein the determining unit is specifically configured to add the at least one padding bit in front of the first block with the quantity of bits smaller than K to form the second block.

14. The apparatus of claim 13 , wherein

the second obtaining unit is configured to add, if the second block has at least one padding bit, consecutive N−K fixed bits at a position, that is in front of the at least one padding bit and is adjacent to the at least one padding bit, to obtain the third block; and

the second obtaining unit is further configured to add, if the second block does not have any padding bit, consecutive N−K fixed bits at a position, that is in front of the second block and is adjacent to the second block, to obtain the third block.

15. The apparatus of claim 12 , wherein the determining unit is specifically configured to add the at least one padding bit behind the first block with the quantity of bits smaller than K to form the second block.

16. The apparatus of claim 15 , wherein

the second obtaining unit is configured to add, if the second block has at least one padding bit, consecutive N−K fixed bits at a position that is behind the at least one padding bit and is adjacent to the at least one padding bit to obtain the third block; and

the second obtaining unit is further configured to add, if the second block does not have any padding bit, consecutive N−K fixed bits at a position that is behind the second block and is adjacent to the second block to obtain the third block.

17. The apparatus of claim 10 , wherein

the encoding unit is configured to perform interleaved mapping on the multiple third blocks to obtain multiple fourth blocks; and

the encoding unit is further configured to perform polar encoding on the multiple fourth blocks.

18. The apparatus of claim 17 , wherein the encoding unit is specifically configured to

determine the multiple fourth blocks according to a mapping relationship c ri x π =c rx , x=0, 1, . . . , N−1, wherein C r =[c r0 , c r1 , c r2 , c r3 , . . . , c r(N−1) ] denotes the r th third block in the multiple third blocks, C r π [c r0 π , c r1 π , c r2 π , c r3 π , . . . , c r(N−1) π ] denotes the r th fourth block in the multiple fourth blocks, 1≦r≦C, C is a quantity of the multiple third blocks, Π N =(i 0 , i 1 , i 2 , . . . , i N−1 ), i x ∈{0, . . . , N−1}, 0≦x≦N−1 is an expression of an interleaved sequence of the interleaved mapping, and any two elements of the interleaved sequence are different from each other.