Back to results
US 12,739,053 B2Granted
Method, communication device, processing device, and storage medium for performing channel encoding, and method and communication device for performing channel decoding
AssigneeLG Electronics Inc.
InventorBonghoe Kim
Life of this patent
Estimating the term…
Abstract
A communication device: performs LBRM for storing, in a circular buffer having the length N_IR, N_IR coded bits from among coded bits obtained by performing encoding on the basis of a polar code; performs rate matching on coded bits stored in the circular buffer; and transmits the rate-matched coded bits to another communication device. The communication device stores, in the circular buffer, last N_IR bits from among the coded bits if a code rate is less than or equal to a predetermined value, and, if not, stores first N_IR bits in the circular buffer.
Claims10
A method performed by a communication device, the method comprising:
- generating coded bits d_0, d_1, d_2, . . . , d_(N−1) by encoding an information block of length K based on a polar code of length N;
- performing limited buffer rate matching (LBRM) to store NIR coded bits among the coded bits d_0, d_1, d_2, . . . , d_(N−1) into a circular buffer of length NIR, where N is greater than NIR;
- performing rate matching on the NIR coded bits stored in the circular buffer to generate a rate matching output sequence of length E;
- and
- transmitting the rate matching output sequence of length E,
- wherein performing the rate matching on the NIR coded bits stored in the circular buffer comprises:
- performing puncturing to exclude first (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being smaller than or equal to R and E being smaller than NIR,
- performing the rate matching comprises performing shortening to exclude last (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being greater than R and E being smaller than NIR, and
- obtaining E coded bits by i) obtaining the NIR coded bits starting from a first coded bit among the NIR coded bits stored in the circular buffer and ii) cyclically repeating (E−NIR) coded bits starting from the first coded bit among the NIR coded bits stored in the circular buffer, based on E being equal to greater than NIR.
6 more elements
A communication device comprising:
- at least one transceiver;
- at least one processor;
- and
- at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations comprising:
- generating coded bits d_0, d_1, d_2, . . . , d_(N−1) by encoding an information block of length K based on a polar code of length N;
- performing limited buffer rate matching (LBRM) to store NIR coded bits among the coded bits d_0, d_1, d_2, . . . , d_(N−1) into a circular buffer of length NIR, where N is greater than NIR;
- performing rate matching on the NIR coded bits stored in the circular buffer to generate a rate matching output sequence of length E;
- and
- transmitting the rate matching output sequence of length E,
- wherein performing the rate matching on the NIR coded bits stored in the circular buffer comprises:
- performing puncturing to exclude first (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being smaller than or equal to R and E being smaller than NIR,
- performing the rate matching comprises performing shortening to exclude last (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being greater than R and E being smaller than NIR, and
- obtaining E coded bits by i) obtaining the NIR coded bits starting from a first coded bit among the NIR coded bits stored in the circular buffer and ii) cyclically repeating (E−NIR) coded bits starting from the first coded bit among the NIR coded bits stored in the circular buffer, based on E being equal to greater than NIR.
10 more elements
A communication device comprising:
- at least one transceiver;
- at least one processor;
- and
- at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations comprising:
- receiving a rate matching output sequence of length E from another communication device;
- determining NIR coded bits based on the rate matching output sequence of length E, where NIR is a length of a circular buffer of the other communication device;
- determining coded bits d_0, d_1, d_2, . . . , d_(N−1) based on limited buffer rate matching (LBRM) and the NIR coded bits;
- and
- decoding the coded bits d_0, d_1, d_2, . . . , d_(N−1) based on a polar code of length N to determine an information block of length K,
- wherein the rate-matched sequence of length E is obtained by performing rate matching on the NIR coded bits stored in the circular buffer, and performing the rate matching on the NIR coded bits stored in the circular buffer comprises:
- performing puncturing to exclude first (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being smaller than or equal to R and E being smaller than NIR,
- performing the rate matching comprises performing shortening to exclude last (NIR−E) coded bits among the NIR coded bits stored in the circular buffer to generate the rate matching output sequence of length E, based on K/E being greater than R and E being smaller than NIR, and
- obtaining E coded bits by i) obtaining the NIR coded bits starting from a first coded bit among the NIR coded bits stored in the circular buffer and ii) cyclically repeating (E−NIR) coded bits starting from the first coded bit among the NIR coded bits stored in the circular buffer, based on E being equal to greater than NIR.
10 more elements
Dependencies are inferred from the claim text.