# US 2025/0159549 A1 · Method and apparatus for code rate matching of polar code in wireless communication system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0159549 A1
- Document ID: US20250159549A1
- Status: Published application
- Kind: A1
- Application number: 18/942,172
- Filed: 2024-11-08
- Published: 2025-05-15
- Earliest claimed: 2023-11-10
- Assignees: Samsung Electronics Co., Ltd.; Research & Business Foundation Sungkyunkwan University
- Applicants: Samsung Electronics Co., Ltd.; Research & Business Foundation Sungkyunkwan University
- Inventors: Donghun LEE; Sanghyo KIM; Min JANG; Hyosang JU; Donghwa HAN; Jisang PARK
- Web page: https://patentgrep.com/patent/US20250159549A1

## CPC

- H04W 28/06: Optimizing {the usage of the radio link}, e.g. header compression, information sizing {, discarding information (system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365)}
- H03M 13/13: Linear codes
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/353: {Adaptation to the channel}
- H03M 13/635: {Error control coding in combination with rate matching}
- H03M 13/6362: {by puncturing}
- H04L 1/0007: {by modifying the frame length}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/098: {using single parity bit}
- H03M 13/27: using interleaving techniques
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present disclosure relates to a 5G or a 6G communication system for supporting higher data rates beyond a 4G communication system such as LTE. The disclosure provides a method and an apparatus for selecting bits to be adaptively extra-frozen according to a message length to use a polar code in a wireless communication system.

## Claims

### Claim 1

A method for encoding a channel in a wireless communication system, the method comprising:
determining a length of a mother code based on a length of at least one information bit to be transmitted and a target code rate;
determining, based on the length of the at least one information bit, at least one frozen bit to not transmit information among first bits included in an input source vector corresponding to the mother code;
allocating the at least one information bit to at least one second bit except for the determined at least one frozen bit among the first bits included in the input source vector; and
generating a codeword by encoding, into a predetermined polar code, the input source vector to which the at least one information bit is allocated.

### Claim 2 (depends on 1)

The method of claim 1, wherein the at least one frozen bit is determined by a puncturing operation.

### Claim 3 (depends on 1)

The method of claim 1, wherein the at least one frozen bit is determined by a parameter indicating a state of a channel for transmitting the at least one information bit.

### Claim 4 (depends on 1)

The method of claim 1, wherein the at least one frozen bit is determined considering bit indices in a binary representation indicating a polarization process for bits included in the input source vector corresponding to the mother code, and
wherein the at least one frozen bit includes a bit set to zero in at least one of a bit index (n−1, n−3) or a bit index (n−2, n−3) in case that a number of the bit indices is n.

### Claim 5 (depends on 1)

The method of claim 1, wherein a number of at least one frozen bits is determined based on a first threshold and a second threshold for the length of the at least one information bit to be transmitted,
wherein the number of at least one frozen bit is identified as a maximum value in case that the length of the information bit to be transmitted is shorter than the first threshold, and
wherein the number of at least one frozen bit is identified as a minimum value in case that the length of the information bit to be transmitted is longer than the second threshold.

### Claim 6 (depends on 5)

The method of claim 5, wherein, in case that the length of the bit to be transmitted is longer than or equal to the first threshold and equal to or shorter than the second threshold, the number of at least one frozen bit is reduced to a number corresponding to an increase in the length of the information bit to be transmitted.

### Claim 7 (depends on 1)

The method of claim 1, wherein the at least one frozen bit includes frozen bits determined by a pre-freezing set, an extra-freezing set, and a reliability freezing set.

### Claim 8 (depends on 1)

The method of claim 1, wherein allocating the at least one information bit to the at least one second bit comprises:
allocating the at least one information bit to the at least one second bit in an order of bits having high channel reliability, the bits corresponding to the at least one second bit.

### Claim 9

An apparatus for encoding a channel in a wireless communication system, the apparatus comprising:
a transceiver; and
at least one processor operably coupled to the transceiver, the at least one processor configured to:
determine a length of a mother code, based on a length of at least one information bit to be transmitted and a target code rate;
determine, based on the length of the at least one information bit, at least one frozen bit to not transmit information among first bits included in an input source vector corresponding to the mother code;
allocate the at least one information bit to at least one second bit except for the determined at least one frozen bit among the first bits included in the input source vector; and
generate a codeword by encoding, into a predetermined polar code, the input source vector to which the at least one information bit is allocated.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the at least one frozen bit is determined by a puncturing operation.

### Claim 11 (depends on 9)

The apparatus of claim 9, wherein the at least one frozen bit is determined by a parameter indicating a state of a channel for transmitting the at least one information bit.

### Claim 12 (depends on 9)

The apparatus of claim 9, wherein the at least one frozen bit is determined considering bit indices in a binary representation indicating a polarization process for bits included in the input source vector corresponding to the mother code, and
wherein the at least one frozen bit includes a bit set to zero in at least one of a bit index (n−1, n−3) or a bit index (n−2, n−3) in case that a number of the bit indices is n.

### Claim 13 (depends on 9)

The apparatus of claim 9, wherein a number of at least one frozen bits is determined based on a first threshold and a second threshold for the length of the at least one information bit to be transmitted,
wherein the number of at least one frozen bit is identified as a maximum value in case that the length of the information bit to be transmitted is shorter than the first threshold, and
wherein the number of at least one frozen bit is identified as a minimum value in case that the length of the information bit to be transmitted is longer than the second threshold.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein, in case that the length of the bit to be transmitted is longer than or equal to the first threshold and equal to or shorter than the second threshold, the number of at least one frozen bit is reduced to a number corresponding to an increase in the length of the information bit to be transmitted.

### Claim 15 (depends on 9)

The apparatus of claim 9, wherein the at least one frozen bit includes frozen bits determined by a pre-freezing set, an extra-freezing set, and a reliability freezing set.

### Claim 16 (depends on 9)

The apparatus of claim 9, wherein the at least one processor is configured to:
allocate the at least one information bit to the at least one second bit in an order of bits having high reliability, the bits corresponding to the at least one second bit.
