CPC H03M 13/13 (2013.01) [H03M 13/09 (2013.01); H04L 1/0013 (2013.01); H04L 1/0057 (2013.01); H04L 1/0068 (2013.01); H04L 1/0071 (2013.01)] | 12 Claims |
1. A rate matching method, comprising:
obtaining a Polar encoded bit sequence, wherein the Polar encoded bit sequence has a code length of N, and N is an integer power of 2, and N is greater than or equal to 32;
dividing the Polar encoded bit sequence into g groups, a length of each group is N/g, wherein g is 32;
block interleaving the g groups to obtain an interleaved bit sequence, wherein the interleaved bit sequence comprises g groups of bits, the g groups are ordered according to a sequence S after the block interleaving, each element in the sequence S indicates a group number after the block interleaving;
rate matching the interleaved bit sequence to obtain a rate matched bit sequence; and
transmitting the rate matched bit sequence;
wherein when a transmission code rate R is greater than a code rate threshold R0, the rate matching the interleaved bit sequence to obtain the rate matched bit sequence comprises: shortening (N-M) bits from end of the interleaved bit sequence to obtain the rate matched bit sequence;
wherein when a transmission code rate R is less than or equal to a code rate threshold R0, the rate matching the interleaved bit sequence to obtain the rate matched bit sequence comprises: puncturing (N-M) bits from beginning of the interleaved bit sequence obtain the rate matched bit sequence;
wherein R=K/M and M is a positive integer smaller than N, K is positive integer, and wherein a value of the R0 is a less than 1/2 and not less than 2/5.
|