# US 2023/0412347 A1 · Method for generating semi-static harq-ack codebook, and terminal

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

- Number: US 2023/0412347 A1
- Document ID: US20230412347A1
- Status: Published application
- Kind: A1
- Application number: 18/460,868
- Filed: 2023-09-05
- Published: 2023-12-21
- Earliest claimed: 2021-03-10
- Assignees: Vivo Mobile Communication Co., Ltd.
- Applicants: Vivo Mobile Communication Co., Ltd.
- Inventors: Na LI
- Web page: https://patentgrep.com/patent/US20230412347A1

## CPC

- H04L 1/1854: {Scheduling and prioritising arrangements}
- H04L 5/0055: {Physical resource allocation for ACK/NACK (for physical mapping arrangements in ARQ protocols H04L1/1861)}
- H04L 1/1614: {using bitmaps}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 1/1861: {Physical mapping arrangements (for ACK signaling see also H04L5/0053)}
- H04L 1/1896: {ARQ related signaling}
- H04L 1/1664: {the supervisory signal being transmitted together with payload signals; piggybacking}
- H04L 1/1893: {Physical mapping arrangements (physical resource mapping in general H04L5/00)}
- H04L 2001/0093: {Point-to-multipoint}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and terminal for generating a semi-static HARQ-ACK codebook is disclosed, where the generation method includes: determining, based on at least one of K1 sets corresponding to a first PDSCH and a second PDSCH, a K1 set associated with an active UL BWP; determining, for each K1,k value in the K1 set associated with the active UL BWP, based on at least one of TDRA tables corresponding to the first PDSCH and the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to each K1,k value; and determining, based on the candidate PDSCH reception occasion, the semi-static HARQ-ACK codebook.

## Claims

### Claim 1

A method for generating a semi-static hybrid automatic repeat request acknowledgment (HARQ-ACK) codebook, performed by a terminal and comprising:
determining, based on at least one of a K1 set corresponding to a first physical downlink shared channel (PDSCH) and a K1 set corresponding to a second PDSCH, a K1 set associated with an active uplink bandwidth part (UL BWP);
determining, for each K1,k value in the K1 set associated with the active UL BWP, based on at least one of a time domain resource assignment (TDRA) table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value, wherein k=0, . . . , M−1, and M is a quantity of elements in the K1 set associated with the active UL BWP; and
determining the semi-static HARQ-ACK codebook based on the candidate PDSCH reception occasion.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the determining, based on at least one of a TDRA table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to an intersection set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH, determining, based on a union set of a row index of the TDRA table corresponding to the first PDSCH and a row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value does not belong to the intersection set, determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 3 (depends on 2)

The method according to claim 2, wherein in a case that the K1,k value does not belong to the intersection set, the determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to the K1 set corresponding to the first PDSCH, determining, based on the row index of the TDRA table corresponding to the first PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value belongs to the K1 set corresponding to the second PDSCH, determining, based on the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the first PDSCH and the second PDSCH correspond to different DCI formats.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the determining, based on at least one of a K1 set corresponding to a first PDSCH and a K1 set corresponding to a second PDSCH, a K1 set associated with an active UL BWP comprises one of the following:
using a union set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP;
using the K1 set corresponding to the first PDSCH as the K1 set associated with the active UL BWP; or
using the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the first PDSCH is a unicast PDSCH, and the second PDSCH is a multicast PDSCH.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the first PDSCH and the second PDSCH correspond to different TDRA tables and/or K1 sets.

### Claim 8

A terminal, comprising a processor, a memory, and an instruction stored in the memory and capable of running on the processor, wherein the instruction, when executed by the processor, implements:
determining, based on at least one of a K1 set corresponding to a first physical downlink shared channel (PDSCH) and a K1 set corresponding to a second PDSCH, a K1 set associated with an active uplink bandwidth part (UL BWP);
determining, for each K1,k value in the K1 set associated with the active UL BWP, based on at least one of a time domain resource assignment (TDRA) table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value, wherein k=0, . . . , M−1, and M is a quantity of elements in the K1 set associated with the active UL BWP; and
determining the semi-static HARQ-ACK codebook based on the candidate PDSCH reception occasion.

### Claim 9 (depends on 8)

The terminal according to claim 8, wherein the determining, based on at least one of a TDRA table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to an intersection set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH, determining, based on a union set of a row index of the TDRA table corresponding to the first PDSCH and a row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value does not belong to the intersection set, determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 10 (depends on 9)

The terminal according to claim 9, wherein in a case that the K1,k value does not belong to the intersection set, the determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to the K1 set corresponding to the first PDSCH, determining, based on the row index of the TDRA table corresponding to the first PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value belongs to the K1 set corresponding to the second PDSCH, determining, based on the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 11 (depends on 8)

The terminal according to claim 8, wherein the first PDSCH and the second PDSCH correspond to different DCI formats.

### Claim 12 (depends on 8)

The terminal according to claim 8, wherein the determining, based on at least one of a K1 set corresponding to a first PDSCH and a K1 set corresponding to a second PDSCH, a K1 set associated with an active UL BWP comprises one of the following:
using a union set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP;
using the K1 set corresponding to the first PDSCH as the K1 set associated with the active UL BWP; or
using the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP.

### Claim 13 (depends on 8)

The terminal according to claim 8, wherein the first PDSCH is a unicast PDSCH, and the second PDSCH is a multicast PDSCH.

### Claim 14 (depends on 8)

The terminal according to claim 8, wherein the first PDSCH and the second PDSCH correspond to different TDRA tables and/or K1 sets.

### Claim 15

A non-transitory readable storage medium, wherein the readable storage medium stores instructions, and the instructions, when executed by a processor, implement:
determining, based on at least one of a K1 set corresponding to a first physical downlink shared channel (PDSCH) and a K1 set corresponding to a second PDSCH, a K1 set associated with an active uplink bandwidth part (UL BWP);
determining, for each K1,k value in the K1 set associated with the active UL BWP, based on at least one of a time domain resource assignment (TDRA) table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value, wherein k=0, . . . , M−1, and M is a quantity of elements in the K1 set associated with the active UL BWP; and
determining the semi-static HARQ-ACK codebook based on the candidate PDSCH reception occasion.

### Claim 16 (depends on 15)

The storage medium according to claim 15, wherein the determining, based on at least one of a TDRA table corresponding to the first PDSCH and a TDRA table corresponding to the second PDSCH, a candidate PDSCH reception occasion in a slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to an intersection set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH, determining, based on a union set of a row index of the TDRA table corresponding to the first PDSCH and a row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value does not belong to the intersection set, determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 17 (depends on 16)

The storage medium according to claim 16, wherein in a case that the K1,k value does not belong to the intersection set, the determining, based on the row index of the TDRA table corresponding to the first PDSCH or the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value comprises at least one of the following:
in a case that the K1,k value belongs to the K1 set corresponding to the first PDSCH, determining, based on the row index of the TDRA table corresponding to the first PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value; or
in a case that the K1,k value belongs to the K1 set corresponding to the second PDSCH, determining, based on the row index of the TDRA table corresponding to the second PDSCH, the candidate PDSCH reception occasion in the slot corresponding to the K1,k value.

### Claim 18 (depends on 15)

The storage medium according to claim 15, wherein the first PDSCH and the second PDSCH correspond to different DCI formats.

### Claim 19 (depends on 15)

The storage medium according to claim 15, wherein the determining, based on at least one of a K1 set corresponding to a first PDSCH and a K1 set corresponding to a second PDSCH, a K1 set associated with an active UL BWP comprises one of the following:
using a union set of the K1 set corresponding to the first PDSCH and the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP;
using the K1 set corresponding to the first PDSCH as the K1 set associated with the active UL BWP; or
using the K1 set corresponding to the second PDSCH as the K1 set associated with the active UL BWP.

### Claim 20 (depends on 15)

The storage medium according to claim 15, wherein the first PDSCH is a unicast PDSCH, and the second PDSCH is a multicast PDSCH.