US 12,388,469 B2
Rate matching method and apparatus for polar code
Mengzhu Chen, Guangdong (CN); Jin Xu, Guangdong (CN); and Jun Xu, Guangdong (CN)
Assigned to ZTE Corporation, Shenzhen (CN)
Filed by ZTE Corporation, Guangdong (CN)
Filed on Apr. 8, 2024, as Appl. No. 18/629,536.
Application 18/629,536 is a continuation of application No. 17/664,491, filed on May 23, 2022, granted, now 11,955,992.
Application 17/664,491 is a continuation of application No. 16/505,688, filed on Jul. 8, 2019, granted, now 11,342,945, issued on May 24, 2022.
Application 16/505,688 is a continuation of application No. PCT/CN2018/071956, filed on Jan. 9, 2018.
Claims priority of application No. 201710014289.6 (CN), filed on Jan. 9, 2017; and application No. 201710056532.0 (CN), filed on Jan. 25, 2017.
Prior Publication US 2024/0259035 A1, Aug. 1, 2024
Int. Cl. H03M 13/00 (2006.01); H03M 13/13 (2006.01); H03M 13/27 (2006.01)
CPC H03M 13/635 (2013.01) [H03M 13/13 (2013.01); H03M 13/2792 (2013.01)] 6 Claims
OG exemplary drawing
 
1. A rate matching method for a Polar code, comprising:
generating a bit sequence of N bits from K information bits and (N−K) frozen bits, and encoding the bit sequence of N bits by means of a Polar code encoder with a generator matrix of size N×N to generate an initial bit sequence {S0, S1, . . . , SN−1} of N bits, wherein K and N are both positive integers and K is less than or equal to N;
selecting bits from the initial bit sequence {S0, S1, . . . , SN−1} in a non-repeated manner and writing the bits into a circular buffer; and
generating a bit sequence of a specified length for transmission from the bits in the circular buffer based on a predefined starting position in the circular buffer,
wherein the writing the bits into the circular buffer comprises writing the bits into the circular buffer based on a predefined rule, wherein the predefined rule is determined by a one-to-one mapping interleaving function f(n) generated according to a data characteristic of the Polar code, wherein n=0, 1, . . . , N−1, f(n)=0, 1, . . . , N−1, n is a bit position index in the initial bit sequence, and f(n) is a position index in the circular buffer, and
wherein, in response to a code rate that is less than or equal to a predefined threshold, a position of P0=N−M in the circular buffer is taken as the predefined starting position, wherein P0 represents a position index of the bit sequence in the circular buffer, M is a length of the bit sequence to be transmitted, and N is a length of the initial bit sequence.