Method and device for transmitting data

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

obtaining, by a device of the network, a bit sequence, wherein the bit sequence comprises K information bits, and K is a positive integer;

polar coding, by the device, the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, N is greater than or equal to K, and N is an integer power of 2;

block interleaving, by the device, the first encoded sequence, to obtain an interleaved bit sequence;

determining, by the device, a transmission code rate R;

when the transmission code rate R is less than the code rate threshold, outputting, by the device, a second bit sequence, wherein a length of the second bit sequence is M, M is a positive integer smaller than N, wherein the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and wherein R=K/M; and

transmitting, by the device, the second bit sequence.

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

when the transmission code rate R is greater than the code rate threshold, outputting, by the device, a third bit sequence, wherein a length of the third bit sequence is M, M is a positive integer smaller than N, wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence, and wherein R=K/M; and

transmitting, by the device, the third bit sequence.

3. The method according to claim 2 , wherein blocking interleaving the first encoded sequence to obtain the interleaved bit sequence comprises:

dividing, by the device, the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer; and

interleaving, by the device, the S bit groups.

4. The method according to claim 3 , wherein a value of S is 32.

5. The method according to claim 3 , wherein the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing L1 bit groups from the S bit groups starting from the beginning of the interleaved bit sequence; and

removing L2 bits from a remaining bit group of the punctured interleaved bit sequence,

wherein

L

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

)

⌋

,

and L2=N−M−L1*(N/S).

6. The method according to claim 3 , wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing N1 bit groups from the S bit groups starting from the end of the interleaved bit sequence; and

removing N2 bits from a remaining bit group of the shortened interleaved bit sequence,

wherein

N

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

)

⌋

,

and N2=N−M−N1*(N/S).

7. The method according to claim 1 , wherein a value of the code rate threshold is any one of:

0, ¼, ⅓, ⅖, ½, and 1.

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

determining, by the device, a reliability of a polarized channel corresponding to each bit of the second bit sequence;

mapping, by the device, K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

mapping, by the device, one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.

9. The method according to claim 2 , further comprising:

determining, by the device, a reliability of a polarized channel corresponding to each bit of the third bit sequence;

mapping, by the device, K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

mapping, by the device, one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.

10. The method according to claim 1 , wherein polar coding the bit sequence to obtain the first encoded sequence comprises:

encoding, by the device, the bit sequence through an encoding formula, to obtain the first encoded 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 first encoded sequence, u 1 N =(u 1 ,u 2 ,K,u N ) is a binary row vector having a length of N, G N is a coding matrix of N row and N columns, and

G N =F 2 ⊗(log 2 (N))

wherein F 2 ⊗(log 2 (N)) is a Kronecker product of log 2 N matrices F 2 , and the matrix F 2 is:

F

2

=

[

1

0

1

1

]

.

11. A device in a communication system, comprising:

a receiver, a transmitter, a processor and a memory storing program instructions for execution by the processor;

wherein the receiver is configured to obtain a bit sequence, wherein the bit sequence comprises K information bits, and K is a positive integer;

wherein, by executing the program instructions, the processor is configured to:

polar code the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, N is greater than or equal to K, and N is an integer power of 2;

block interleave the first encoded sequence, to obtain an interleaved bit sequence;

determine a transmission code rate R; and

when the transmission code rate R is less than the code rate threshold, output a second bit sequence, wherein a length of the second bit sequence is M, M is a positive integer smaller than N, wherein the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and wherein R=K/M;

and wherein the transmitter is configured to transmit the second bit sequence.

12. The device according to claim 11 , wherein by executing the program instructions, the processor is further configured to:

when the transmission code rate R is greater than or equal to the code rate threshold, output a third bit sequence, wherein a length of the third bit sequence is M, M is a positive integer smaller than N, wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence, and wherein R=K/M; and

wherein the transmitter is further configured to transmit the third bit sequence.

13. The device according to claim 12 , wherein in blocking interleaving the first encoded sequence to obtain the interleaved bit sequence, the processor configured to:

divide the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer; and

interleave the S bit groups.

14. The device according to claim 13 , wherein a value of S is 32.

15. The device according to claim 13 , wherein the second bit sequence obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing L1 bit groups from the S bit groups starting from the beginning of the interleaved bit sequence; and

removing L2 bits from a remaining bit group of the punctured interleaved bit sequence;

wherein

L

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

)

⌋

,

and L2=N−M−L1*(N/S).

16. The device according to claim 13 , wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing N1 bit groups from the S bit groups starting from the end of the interleaved bit sequence; and

removing N2 bits from a remaining bit group of the shortened interleaved bit sequence;

wherein

N

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

⁢

)

⌋

,

and N2=N−M−N1*(N/S).

17. The device according to claim 11 , wherein a value of the code rate threshold is any one of the following:

0, ¼, ⅓, ⅖, ½, and 1.

18. The device according to claim 11 , wherein, by executing the program instructions, the processor is further configured to:

determine a reliability of a polarized channel corresponding to each bit of the second bit sequence;

map K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

map one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.

19. The device according to claim 12 , wherein, by executing the program instructions, the processor is further configured to:

determine a reliability of a polarized channel corresponding to each bit of the third bit sequence;

map K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

map one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.

20. 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 a bit sequence, wherein the bit sequence comprises K information bits, and K is a positive integer;

polar coding the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, N is greater than or equal to K, and N is an integer power of 2;

block interleaving the first encoded sequence, to obtain an interleaved bit sequence;

determining a transmission code rate R;

when the transmission code rate R is less than the code rate threshold, outputting a second bit sequence, wherein a length of the second bit sequence is M, M is a positive integer smaller than N, wherein the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and wherein R=K/M; and

transmitting the second bit sequence.

21. The non-transitory computer readable medium according to claim 20 , wherein the program codes further comprise instructions for:

when the transmission code rate R is greater than or equal to the code rate threshold, outputting a third bit sequence, wherein a length of the third bit sequence is M, M is a positive integer smaller than N, wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence, and wherein R=K/M; and

transmitting the third bit sequence.

22. The non-transitory computer readable medium according to claim 21 , wherein the instructions for blocking interleaving the first encoded sequence to obtain the interleaved bit sequence comprise instructions for:

dividing the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer; and

interleaving the S bit groups.

23. The non-transitory computer readable medium according to claim 22 , wherein a value of S is 32.

24. The non-transitory computer readable medium according to claim 22 , wherein the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing L1 bit groups from the S bit groups starting from the beginning of the interleaved bit sequence; and

removing L2 bits from a remaining bit group of the punctured interleaved bit sequence;

wherein

L

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

)

⌋

,

and L2=N−M−L1*(N/S).

25. The non-transitory computer readable medium according to claim 22 , wherein the third bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing N1 bit groups from the S bit groups starting from the end of the interleaved bit sequence; and

removing N2 bits from a remaining bit group of the shortened interleaved bit sequence;

wherein

N

⁢

⁢

1

=

⌊

(

N

-

M

)

(

N

/

S

)

⌋

,

and N2=N−M−N1*(N/S).

26. The non-transitory computer readable medium according to claim 20 , wherein a value of the code rate threshold is any one of:

0, ¼, ⅓, ⅖, ½, and 1.

27. The non-transitory computer readable medium according to claim 20 , wherein the program codes further comprise instructions for:

determining a reliability of a polarized channel corresponding to each bit of the second bit sequence;

mapping K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

mapping one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.

28. The non-transitory computer readable medium according to claim 21 , wherein the program codes further comprise instructions for:

determining a reliability of a polarized channel corresponding to each bit of the third bit sequence;

mapping K information bits into K polarized channels starting from the polarized channel with the highest reliability; and

mapping one or more frozen bits into remaining polarized channels after K information bits are mapped into the polarized channels.