# US 12,003,254 B2 · Method and apparatus for transmitting data on basis of polar coding 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 12,003,254 B2
- Document ID: US12003254B2
- Status: Granted
- Kind: B2
- Application number: 17/297,705
- Filed: 2019-12-05
- Published: 2022-01-27
- Granted: 2024-06-04
- Earliest claimed: 2018-12-05
- Assignees: LG Electronics Inc.
- Applicants: LG Electronics Inc.
- Inventors: Bonghoe Kim; Kwangseok Noh; Ilmin Kim
- Web page: https://patentgrep.com/patent/US12003254B2

## CPC

- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/13: Linear codes
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0061: {Error detection codes}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 1/1861: {Physical mapping arrangements (for ACK signaling see also H04L5/0053)}
- 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

A method for transmitting data on the basis of polar coding in a wireless communication system, according to the present disclosure may comprise the steps of: transmitting data including a plurality of information blocks, each of which contains a corresponding cyclic redundancy check (CRC); receiving a hybrid automatic repeat request acknowledgement/negative acknowledgement (HARQ ACK/NACK) of the transmitted data; performing learning in order to retransmit the plurality of information blocks; and retransmitting the plurality of information blocks on the basis of the HARQ ACK/NACK, wherein the step of performing learning comprises the steps of: obtaining current state sn; obtaining actions to be applied to current state sn; and selecting, from the actions, an action maximizing expected reward value Qn+1, wherein expected reward value Qn+1 is obtained on the basis of rewards R1, R2, . . . , Rn corresponding to states s1, s2, . . . , sn, and the plurality of information blocks is retransmitted on the basis of the selected action.

## Claims

### Claim 1

A method of transmitting data in a wireless communication system, the method comprising:
dividing an information sequence into a plurality of information blocks, each having a size Nb;
adding a corresponding cyclic redundancy check (CRC) to each of the plurality of information blocks to produce a plurality of CRC added information blocks;
applying channel coding to each of the plurality of CRC added information blocks to produce a plurality of coded information blocks;
performing a first transmission including the plurality of coded information blocks;
receiving a first hybrid automatic repeat request acknowledgement/negative acknowledgement (HARQ ACK/NACK) for the first transmission;
selecting an action from among a set A of actions based on the first HARQ ACK/NACK and machine learning, wherein the actions in the set A are respectively related to transmission schemes; and
performing a second transmission based on the selected action,
wherein the machine learning comprises:
selecting an action Ak for k-th transmission at a state Sk,
wherein the state Sk=(k, Uk−1), where k∈{1, 2, . . . , J}, where J is the maximum number of allowed retransmissions, and Uk−1 is the sum of numbers of all coded bits transmitted up to (k−1)-th transmission;
obtaining a reward Rk+1 and a state Sk+1=(k+1, Uk),
wherein Rk+1 is determined based on Nb*ACKk/Uk, where ACKk is 1 for decoding success for the action Ak, and ACK is 0 for decoding failure for the action Ak; and
updating an expected reward value Q based on i) an expected reward value Q for the state Sk and the action Ak, ii) the reward Rk+1 and iii) α, where α is a learning rate and is a value in a range between 0 and 1.

### Claim 2 (depends on 1)

The method of claim 1, wherein the learning rate α is determined based on a range of channel variation.

### Claim 3 (depends on 1)

The method of claim 1, wherein the actions comprises:
a first action of transmitting all the plurality of information blocks which are not coded;
a second action of transmitting all the plurality of coded information blocks; and
a third action of transmitting coded information blocks for some information blocks among the plurality of information blocks and uncoded information blocks for remaining information blocks among the plurality of information blocks.

### Claim 4

An apparatus for transmitting data based on in a wireless communication system, the apparatus comprising:
a transceiver;
at least one processor; and
at least one memory storing instructions that, when executed, cause the at least one processor to perform operations comprising:
dividing an information sequence into a plurality of information blocks, each having a size Nb;
adding a corresponding cyclic redundancy check (CRC) to each of the plurality of information blocks to produce a plurality of CRC added information blocks;
applying channel coding to each of the plurality of CRC added information blocks to produce a plurality of coded information blocks;
performing a first transmission including the plurality of coded information blocks;
receiving a first hybrid automatic repeat request acknowledgement/negative acknowledgement (HARQ ACK/NACK) for the first transmission;
selecting an action from among a set A of actions based on the first HARQ ACK/NACK and machine learning, wherein the actions in the set A are respectively related to transmission schemes; and
performing a second transmission based on the selected action,
wherein the machine learning comprises:
selecting an action Ak for k-th transmission at a state Sk,
wherein the state Sk=(k, Uk−1), where k∈{1, 2, . . . , J}, where J is the maximum number of allowed retransmissions, and Uk−1 is the sum of numbers of all coded bits transmitted up to (k−1)-th transmission;
obtaining a reward Rk+1 and a state Sk+1=(k+1, Uk),
wherein Rk+1 is determined based on Nb*ACK/Uk, where ACKk is 1 for decoding success for the action Ak, and ACKk is 0 for decoding failure for the action Ak; and
updating an expected reward value Q based on i) an expected reward value Q for the state Sk and the action Ak, ii) the reward Rk+1 and iii) α, where α is a learning rate and is a value in a range between 0 and 1.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein the learning rate α is determined based on a range of channel variation.

### Claim 6 (depends on 4)

The apparatus of claim 4, wherein the actions comprises:
a first action of transmitting all the plurality of information blocks which are not coded;
a second action of transmitting all the plurality of coded information blocks; and
a third action of transmitting coded information blocks for some information blocks among the plurality of information blocks and uncoded information blocks for remaining information blocks among the plurality of information blocks.

### Claim 7 (depends on 1)

The method of claim 1, wherein an action ‘a’ that maximizes an expected reward value Q for the state Sk and the action ‘a’ is selected as Ak with probability 1−ε, where a∈A, and Ak is randomly selected from the set A with probability ε, where ε is related to a degree of exploration and exploitation and is a value in a range between 0 and 1.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
decreasing ε as the machine learning progresses, based on channel coherence time of a channel being stable.

### Claim 9 (depends on 8)

The method of claim 8, wherein decreasing ε as the machine learning progresses comprises:
decreasing ε at a first rate based on the channel having small channel coherence time; and
decreasing ε at a second rate lower than the first rate based on the channel having large channel coherence time.

### Claim 10 (depends on 8)

The method of claim 8, further comprising:
increasing ε based on the channel coherence time of the channel varying.

### Claim 11 (depends on 2)

The method of claim 2, wherein the learning rate α is proportional to 1/Var(|h|), where Var(|h|) is the range of channel variation.

### Claim 12 (depends on 4)

The apparatus of claim 4, wherein an action ‘a’ that maximizes an expected reward value Q for the state Sk and the action ‘a’ is selected as Ak with probability 1−ε, where a∈A, and Ak is randomly selected from the set A with probability ε, where ε is related to a degree of exploration and exploitation and is a value in a range between 0 and 1.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the operations further comprise:
decreasing ε as the machine learning progresses, based on channel coherence time of a channel being stable.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein decreasing ε as the machine learning progresses comprises:
decreasing ε at a first rate based on the channel having small channel coherence time; and
decreasing ε at a second rate lower than the first rate based on the channel having large channel coherence time.

### Claim 15 (depends on 13)

The apparatus of claim 13, wherein the operations further comprise:
increasing ε based on the channel coherence time of the channel varying.

### Claim 16 (depends on 5)

The apparatus of claim 5, wherein the learning rate α is proportional to 1/Var(|h|), where Var(|h|) is the range of channel variation.