Communciation method using polar code, and wireless device

1. A method for coding information, comprising:

obtaining, by a communication device, one or more to-be-coded information bits;

coding, by the communication device, the to-be-coded information bits in a polar coding process, to obtain a polar-coded bit sequence of N′ bits, wherein N′ is an integer power of 2, and N′ is greater than to a target code length M;

obtaining, by the communication device, based on a puncturing/shortening proportion P′ and a prestored sequence S′, a sequence S that has a length equal to the target code length M, wherein the sequence S′ comprises N′ channel indexes sorted by channel reliability or channel capacity, and a sorting order of channel indexes in the sequence S is relatively the same as a sorting order of channel indexes in the sequence S′; and

outputting, by the communication device, a rate matched bit sequence by rate matching the polar-coded bit sequence, wherein the rate matched bit sequence comprises M bits from the polar-coded bit sequence, and the M bits from the polar-coded bit sequence correspond to M channel indexes in the sequence S;

wherein when the quantities N′ and M satisfy:

N′× ¾< M <β×( N′× ¾), where β>1

subchannels corresponding to channel indexes that are less than N′/4 in the prestored channel index sequence S′ are frozen.

2. The method according to claim 1 , wherein β=(1+ 1/16), β=(1+⅛) or β=(1+ 3/16).

3. The method according to claim 1 , wherein the sequence S is obtained, after N′ x P′ channels are removed from N′ channels corresponding to the sequence S′, by adjusting indexes of remaining N′×(1−P′) channels based on a preset adjustment sequence, and the sequence S comprises some or all of the indexes of the remaining N′×(1−P′) channels.

4. The method according to claim 3 , wherein the adjustment sequence is an all-zero sequence.

5. The method according to claim 1 , wherein the sequence S′ is one of a plurality of sequences, and each of the plurality of sequences corresponds to one puncturing/shortening proportion.

6. The method according to claim 1 , wherein the polar coding process is represented by the following formula:

x 1 N′ =u 1 N′ G N′

wherein x 1 N′ is the polar-coded bit sequence, u 1 N′ G N′ an N-bit binary row vector comprising the to-be-coded bits, and G N′ is a generator matrix of N′ rows×N′ columns.

7. A communication apparatus, comprising:

a memory and a processor;

wherein the memory is configured to prestore a channel index sequence S′, and the processor is configured to:

obtain one or more to-be-coded information bits;

code the to-be-coded information bits in a polar coding process, to obtain a polar-coded bit sequence of N′ bits, wherein N′ is an integer power of 2, and N′ is greater than a target code length M;

obtain, based on a puncturing/shortening proportion P′ and the prestored sequence S′, a sequence S that has a length equal to the target code length M, wherein the sequence S′ comprises N′ channel indexes sorted by channel reliability or channel capacity, and sorting of channel indexes in the sequence S is relatively the same as sorting of channel indexes in the sequence S′; and

output a rate matched bit sequence by rate matching the polar-coded bit sequence, wherein the rate matched bit sequence comprises M bits from the polar-coded bit sequence, and the M bits from the polar-coded bit sequence correspond to M channel indexes in the sequence S;

wherein when the quantities N′ and M satisfy:

N′× ¾< M <β×( N′× ¾), where β>1

subchannels corresponding to channel indexes that are less than N′/4 in the prestored channel index sequence S′ are frozen.

8. The apparatus according to claim 7 , wherein β=(1+ 1/16), β=(1+⅛) or β=(1+ 3/16).

9. The apparatus according to claim 7 , wherein the sequence S is obtained, after N′×P′ channels are removed from N′ channels corresponding to the sequence S′, by adjusting indexes of remaining N′×(1−P′) channels based on a preset adjustment sequence, and the sequence S comprises some or all of the indexes of the remaining N′×(1−P′) channels.

10. The apparatus according to claim 9 , wherein the adjustment sequence is an all-zero sequence.

11. The apparatus according to claim 7 , wherein the sequence S′ is one of a plurality of sequences, and each of the plurality of sequences corresponds to one puncturing/shortening proportion.

12. The apparatus according to claim 7 , wherein the polar coding process is represented by the following formula:

x 1 N′ =u 1 N′ G N′

wherein x 1 N′ is the polar-coded bit sequence, u 1 N′ is an N′-bit binary row vector comprising the to-be-coded bits, and G N′ is a generator matrix of N′ rows×N′ columns.

13. An apparatus, comprising one or more integrated circuits forming an interface and an encoder, wherein the encoder is configured to:

obtain one or more to-be-coded information bits;

encode the to-be-coded information bits in a polar coding process, to obtain a polar-coded bit sequence of N′ bits, wherein N′ is an integer power of 2, and N′ is greater than a target code length M;

obtain, based on a puncturing/shortening proportion P and a prestored sequence S′, a sequence S that has a length equal to the target code length M, wherein the sequence S′ comprises N′ channel indexes sorted by channel reliability or channel capacity, and sorting of channel indexes in the sequence S is relatively the same as sorting of channel indexes in the sequence S′; and

output a rate matched bit sequence by rate matching the polar-coded bit sequence, wherein the rate matched bit sequence comprises M bits from the polar-coded bit sequence, and the M bits from the polar-coded bit sequence correspond to M channel indexes in the sequence S;

wherein when the quantities N′ and M satisfy:

N′× ¾< M <β×( N′× ¾), where β>1

subchannels corresponding to channel indexes that are less than N′/4 in the prestored channel index sequence S′ are frozen.

14. The apparatus according to claim 13 , wherein β=(1+ 1/16), β=(1+⅛) or β=(1+ 3/16).

15. The apparatus according to claim 13 , wherein the sequence S is obtained, after N′×P′ channels are removed from N′ channels corresponding to the sequence S′, by adjusting indexes of remaining N′×(1−P′) channels based on a preset adjustment sequence, and the sequence S comprises some or all of the indexes of the remaining N′×(1−P′) channels.

16. The apparatus according to claim 15 , wherein the adjustment sequence is an all-zero sequence.

17. The apparatus according to claim 13 , wherein the sequence S′ is one of a plurality of sequences, and each of the plurality of sequences corresponds to one puncturing/shortening proportion.

18. The apparatus according to claim 13 , wherein the polar coding process is represented by the following formula:

x 1 N′ =u 1 N′ G N′

wherein x 1 N′ is the polar-coded bit sequence, u 1 N′ is an N-bit binary row vector comprising the to-be-coded bits, and G N′ is a generator matrix of N′ rows×N′ columns.