IP Library › Granted Patent US 12,301,370
Granted Patent B2
US 12,301,370 · App. 17/626,723 · Granted May 13, 2025

Method of determining hybrid automatic repeat request acknowledgement codebook, terminal and network device

Inventor: Xuejuan Gao (Beijing, CN)
Assignee: DATANG MOBILE COMMUNICATIONS EQUIPMENT CO., LTD.
H04L1/1887H04L5/0055H04W72/0446
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,301,370
App. No.
17/626,723
Granted
May 13, 2025
Kind
B2
Abstract

A method of determining a Hybrid Automatic Repeat reQuest acknowledgement codebook, a terminal, and a network device are provided. The method includes: determine a HARQ-ACK codebook in a first slot according to a target offset set, when a HARQ-ACK is received in the first slot; wherein the HARQ-ACK is a HARQ-ACK, transmitted in a second slot, for a PDSCH or a SPS PDSCH release, the target offset set W=K1+TA_offset, K1 is a timing value set indicating an interval between a slot of the PDSCH or the SPS PDSCH release and a corresponding slot of the HARQ-ACK, TA_offset is a value related to a TA configured by a signaling or calculated in a predetermined manner, and n_U=n+k+TA_offset, k is one value in the K1, n_U is an index of the first slot, n is an index of the second slot.

Claims (97)

1. A method of determining a Hybrid Automatic Repeat reQuest acknowledgement codebook, performed by a terminal, the method comprising:

determining a Hybrid Automatic Repeat reQuest (HARQ)-acknowledgement (ACK) codebook in a first slot according to a target offset set, when a HARQ-ACK is transmitted in the first slot;

wherein the HARQ-ACK is a HARQ-ACK for a Physical Downlink Shared Channel (PDSCH) transmitted in a second slot or a Semi-Persistently Scheduled (SPS) PDSCH release transmitted in a second slot, the target offset set W=K1+TA offset, K1 is a set of timing values indicating an interval between a slot of the PDSCH or the SPS PDSCH release and a slot of a corresponding HARQ-ACK, TA_offset is a value related to a Timing Advance TA configured by a signaling or calculated in a predetermined manner, and n U=n+k+TA_offset, k is one of values in the set of K1, n_U is an index of the first slot, n is an index of the second slot.

2. The method according to claim 1 , wherein,

determining the HARQ-ACK codebook in the first slot according to the target offset set comprises:

determining a candidate PDSCH opportunity set corresponding to each carrier according to the target offset set when the HARQ-ACK codebook is a semi-static HARQ-ACK codebook, wherein the candidate PDSCH opportunity set is a set of candidate PDSCH opportunities that need to feed back HARQ-ACK in one slot;

obtaining the HARQ-ACK codebook in the first slot according to the candidate PDSCH opportunity set corresponding to each carrier; and/or,

determining the HARQ-ACK codebook in the first slot according to the target offset set comprises:

when the HARQ-ACK codebook is a dynamic HARQ-ACK codebook, determining a PDCCH detection opportunity set corresponding to each carrier according to the target offset set and a K0 set, wherein, K0 represents a set of timing values for an interval between a slot of a PDCCH transmission and a slot of a PDSCH transmission scheduled by the PDCCH;

detecting a PDCCH in an entirety set of the PDCCH detection opportunity set corresponding to each carrier, and determining an HARQ-ACK codebook in the first slot according to a Downlink Allocation Index (DAI) value in the detected PDCCH.

3. The method according to claim 2 , wherein, when the HARQ-ACK codebook is the semi-static HARQ-ACK codebook, determining the candidate PDSCH opportunity set corresponding to each carrier according to the target offset set comprises at least one of the following first and second manners:

the first manner comprises:

obtaining each downlink slot corresponding to the first slot according to n_U-w i ;

obtaining the candidate PDSCH opportunity set corresponding to each carrier according to the each downlink slot;

wherein w i belongs to W, i=0, 1, . . . , T−1, T is a quantity of elements in W, or w i -k i +TA_offset, k i belongs to K1, i=0, 1, . . . , T−1, T is a quantity of elements in K1;

the second manner comprises:

obtaining each group of downlink slots corresponding to the first slot according to n_U-w i -S, wherein each group of downlink slots comprises at least one downlink slot;

obtaining the candidate PDSCH opportunity set corresponding to each carrier according to the each group of downlink slots; wherein S=0, 1, . . . , Krept- 1 , Krept is a quantity of repetition transmissions of PDSCH, and Krept=1 when repetition transmission is not configured;

w i belongs to W, i=0, 1, . . . , T−1, T is a quantity of elements in W, or

w i -k i +TA_offset, k i belongs to K1, i=0, 1, . . . , T−1, T is a quantity of elements in K1.

4. The method according claim 3 , wherein,

in the first manner, obtaining the candidate PDSCH opportunity set corresponding to each carrier according to each downlink slot comprises:

determining the each downlink slot as a candidate PDSCH opportunity; or,

determining whether each downlink slot comprises a valid Start and Length Indicator Value (SLIV) as a PDSCH time-domain transmission position, and taking each downlink slot comprising a valid SLIV as the candidate PDSCH opportunity; or,

determining the each downlink slot as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining, for the each downlink slot, at least one SLIV group according to an overlapping rule of SLIVs in a slot, and taking each SLIV group as a candidate PDSCH opportunity, if receiving more than one PDSCH in one slot is supported; or,

determining whether the each downlink slot comprises a valid SLIV as PDSCH time-domain transmission position, and taking each downlink slot comprising a valid SLIV as one candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining, for each downlink slot comprising a valid SLIV, at least one SLIV group according to an overlapping rule of valid SLIVs in one slot, and taking each SLIV group as a candidate PDSCH opportunity, if receiving more than one PDSCH in one slot is supported;

in the second manner, obtaining the candidate PDSCH opportunity set corresponding to each carrier according to each group of downlink slots comprises:

determining, for each group of downlink slots, whether one SLIV in the SLIV set is valid in each downlink slot in the each group of downlink slots, and when a valid SLIV is comprised in the SLIV set, determining the each group of downlink slots as one candidate PDSCH opportunity; or,

determining, for each group of downlink slots, whether one SLIV in the SLIV set is valid in each downlink slot in the each group of downlink slots; and when a valid SLIV is comprised in the SLIV set, determining the each group of downlink slots as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining at least one SLIV group according to a SLIV overlapping rule of valid SLIVs and taking each SLIV group as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is supported.

5. The method according claim 4 , wherein,

in the first manner, determining whether the SLIV is valid comprises:

determining that the SLIV is an invalid SLIV if a time-domain symbol corresponding to the SLIV overlaps with at least one uplink symbol in a corresponding downlink slot; otherwise, determining that the SLIV is a valid SLIV;

in the second manner, determining whether the SLIV is valid comprises:

determining that the SLIV is an invalid SLIV if a time-domain symbol corresponding to the SLIV overlaps with at least one uplink symbol in any downlink slot of a corresponding group of downlink slots; otherwise, determining the SLIV as a valid SLIV.

6. The method according claim 2 , wherein when the HARQ-ACK codebook is the dynamic HARQ-ACK codebook, determining the PDCCH detection opportunity set corresponding to each carrier according to the target offset set and the K0 set comprises:

when a quantity Krept of repetition transmissions of PDSCH is configured, determining the PDCCH detection opportunity set corresponding to each carrier according to the target offset set, the K0 set, and the quantity of repetition transmissions.

7. The method according to claim 1 , wherein an index of an uplink slot is numbered in a manner of being a TA time ahead of an index of a downlink slot, wherein TA=TA_offset, or TA is greater than TA_offset;

or, an index of an uplink slot is numbered in a manner that an uplink slot is aligned with a downlink slot.

8. A non-transitory computer-readable storage medium, comprising a computer program stored on the computer-readable storage medium, wherein, when the computer program is executed by the processor, the processor implements steps of the method of determining the Hybrid Automatic Repeat reQuest acknowledgement codebook according to claim 1 .

9. A method of determining a Hybrid Automatic Repeat reQuest acknowledgement codebook, performed by a network device, the method comprising:

determining a Hybrid Automatic Repeat reQuest (HARQ)-acknowledgement (ACK) codebook in a first slot according to a target offset set, when a HARQ-ACK is received in the first slot;

wherein the HARQ-ACK is a HARQ-ACK, transmitted in a second slot, for a Physical Downlink Shared Channel (PDSCH) or a Semi-Persistently Scheduled (SPS) PDSCH release, the target offset set W=K1+TA_offset, K1 is a set of timing values indicating an interval between a slot of the PDSCH or the SPS PDSCH release and a slot of the corresponding HARQ-ACK, TA_offset is a value related to a Timing Advance TA configured by a signaling or calculated in a predetermined manner, and n_U=n+k+TA_offset, k is one of values in the set of K1, n U is an index of the first slot, n is an index of the second slot.

10. The method according to claim 9 , wherein,

determining the HARQ-ACK codebook in the first slot according to the target offset set comprises:

determining a candidate PDSCH opportunity set corresponding to each carrier according to the target offset set when the HARQ-ACK codebook is a semi-static HARQ-ACK codebook, wherein the candidate PDSCH opportunity set is a set of candidate PDSCH opportunities that need to feed back a HARQ-ACK in one slot;

obtaining the HARQ-ACK codebook in the first slot according to the candidate PDSCH opportunity set corresponding to each carrier; and/or,

determining the HARQ-ACK codebook in the first slot according to the target offset set comprises:

when the HARQ-ACK codebook is a dynamic HARQ-ACK codebook, determining a PDCCH detection opportunity set corresponding to each carrier according to the target offset set and a K0 set, wherein, K0 represents a set of timing values for an interval between a slot of a PDCCH and a slot of a PDSCH scheduled by the PDCCH;

transmitting a PDCCH in at least one PDCCH detection opportunity in an entirety set of the PDCCH detection opportunity set corresponding to each carrier, and determining an HARQ-ACK codebook in the first slot according to a Downlink Allocation Index (DAI) value in the transmitted PDCCH.

11. The method according to claim 10 , wherein when the HARQ-ACK codebook is the semi-static HARQ-ACK codebook, determining the candidate PDSCH opportunity set corresponding to each carrier according to the target offset set comprises at least one of the following first and second manners:

the first manner comprises:

obtaining each downlink slot corresponding to the first slot according to n_U-w i ,

obtaining the candidate PDSCH opportunity set corresponding to each carrier according to the each downlink slot;

wherein w i belongs to W, i=0, 1, . . . , T−1, T is a quantity of elements in W, or w i =k+TA_offset, k i belongs to K1, i=0, 1, T−1, T is a quantity of elements in K1;

the second manner comprises:

obtaining each group of downlink slots corresponding to the first slot according to n_U-w i -S, wherein each group of downlink slots comprises at least one downlink slot;

obtaining the candidate PDSCH opportunity set corresponding to each carrier according to the each group of downlink slots; wherein S=0, 1, . . . , Krept-1, Krept is a quantity of repetition transmissions of PDSCH, and Krept=1 when no repetition transmission is configured;

w i belongs to W, i=0, 1, . . . , T−1, T is a quantity of elements in W, or

w i -k i +TA_offset, k i belongs to K1, i=0, 1, . . . , T−1, T is a quantity of elements in K1.

12. The method according claim 11 , wherein,

in the first manner, obtaining the candidate PDSCH opportunity set corresponding to each carrier according to each downlink slot comprises:

determining the each downlink slot as a candidate PDSCH opportunity; or,

determining whether each downlink slot comprises a valid Start and Length Indicator Value (SLIV) as a PDSCH time-domain transmission position, and taking each downlink slot comprising a valid SLIV as the candidate PDSCH opportunity; or,

determining the each downlink slot as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining, for the each downlink slot, at least one SLIV group according to an overlapping rule of SLIVs in a slot and taking each SLIV group as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is supported; or,

determining whether the each downlink slot comprises a valid SLIV as a PDSCH time-domain transmission position, and taking each downlink slot comprising a valid SLIV as one candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining, for each downlink slot comprising a valid SLIV, at least one SLIV group according to an overlapping rule of valid SLIVs in one slot and taking each SLIV group as a candidate PDSCH opportunity, if receiving more than one PDSCH in one slot is supported;

in the second manner, obtaining the candidate PDSCH opportunity set corresponding to each carrier according to each group of downlink slots comprises:

determining, for each group of downlink slots, whether one SLIV in the SLIV set is valid in each downlink slot in the each group of downlink slots, and when a valid SLIV is comprised in the SLIV set, determining the each group of downlink slots as one candidate PDSCH opportunity; or,

determining, for each group of downlink slots, whether one SLIV in the SLIV set is valid in each downlink slot in the each group of downlink slots; and when a valid SLIV is comprised in the SLIV set, and determining the each group of downlink slots as a candidate PDSCH opportunity if receiving more than one PDSCH in one slot is not supported, or determining at least one SLIV group according to an overlapping rule of valid SLIVs, and taking each SLIV group as a candidate PDSCH opportunity, if receiving more than one PDSCH in one slot is supported.

13. The method according claim 12 , wherein,

in the first manner, determining whether the SLIV is valid comprises:

determining that the SLIV is an invalid SLIV if a time-domain symbol corresponding to the SLIV overlaps with at least one uplink symbol in a corresponding downlink slot; otherwise, determining that the SLIV is a valid SLIV;

in the second manner, determining whether the SLIV is valid comprises:

determining that the SLIV is an invalid SLIV if a time-domain symbol corresponding to the SLIV overlaps with at least one uplink symbol in any downlink slot of a corresponding group of downlink slots; otherwise, determining the SLIV as a valid SLIV.

14. The method according to claim 10 , wherein, when the HARQ-ACK codebook is the dynamic HARQ-ACK codebook, determining the PDCCH detection opportunity set corresponding to each carrier according to the target offset set and the K0 set comprises:

when a quantity Krept of repetition transmissions of PDSCH is configured, determining the PDCCH detection opportunity set corresponding to each carrier according to the target offset set, the K0 set, and the quantity of repetition transmissions.

15. The method according to claim 9 , wherein an index of an uplink slot is numbered in a manner of being a TA time ahead of an index of a downlink slot, wherein TA-TA_offset, or TA is greater than TA_offset;

or, an index of an uplink slot is numbered in a manner that an uplink slot is aligned with a downlink slot.

16. A network device, comprising a transceiver, a storage, a processor, and a program stored on the storage and executable on the processor, wherein when the processor executes the program, the processor implements steps of the method of determining a Hybrid Automatic Repeat reQuest acknowledgement codebook according to claim 9 .

17. The network device according to claim 16 , wherein,

determining the HARQ-ACK codebook in the first slot according to the target offset set performed by the processor comprises:

determining a candidate PDSCH opportunity set corresponding to each carrier according to the target offset set when the HARQ-ACK codebook is a semi-static HARQ-ACK codebook, wherein the candidate PDSCH opportunity set is a set of candidate PDSCH opportunities that need to feed back a HARQ-ACK in one slot;

obtaining the HARQ-ACK codebook in the first slot according to the candidate PDSCH opportunity set corresponding to each carrier; and/or,

determining the HARQ-ACK codebook in the first slot according to the target offset set performed by the processor comprises:

when the HARQ-ACK codebook is a dynamic HARQ-ACK codebook, determining a PDCCH detection opportunity set corresponding to each carrier according to the target offset set and a K0 set, wherein, K0 represents a set of timing values for an interval between a slot of a PDCCH and a slot of a PDSCH scheduled by the PDCCH;

detecting a PDCCH in an entirety set of the PDCCH detection opportunity set corresponding to each carrier, and determining an HARQ-ACK codebook in the first slot according to a Downlink Allocation Index (DAI) value in the detected PDCCH.

18. A non-transitory computer-readable storage medium, comprising:

a computer program stored on the computer-readable storage medium, wherein, when the computer program is executed by a processor, the processor implements the method of determining the Hybrid Automatic Repeat reQuest acknowledgement codebook according to claim 9 .

19. A terminal, comprising a transceiver, a storage, a processor and a program stored on the storage and executable on the processor, wherein when the processor executes the program, the processor implements following:

determining a Hybrid Automatic Repeat reQuest (HARQ)-acknowledgement (ACK) codebook in a first slot according to a target offset set, when a HARQ-ACK is transmitted in the first slot;

wherein the HARQ-ACK is a HARQ-ACK, transmitted in a second slot, for a Physical Downlink Shared Channel (PDSCH) or a Semi-Persistently Scheduled (SPS) PDSCH release, the target offset set W=K1+TA offset, K1 is a set of timing values indicating an interval between a slot of the PDSCH or the SPS PDSCH release and a slot of the corresponding HARQ-ACK, TA offset is a value related to a Timing Advance TA configured by a signaling or calculated in a predetermined manner, and n_U=n+k+TA_offset, k is one of values in the set of K1, n U is an index of the first slot, n is an index of the second slot.

20. The terminal according to claim 19 , wherein,

determining the HARQ-ACK codebook in the first slot according to the target offset set performed by the processor comprises:

determining a candidate PDSCH opportunity set corresponding to each carrier according to the target offset set when the HARQ-ACK codebook is a semi-static HARQ-ACK codebook, wherein the candidate PDSCH opportunity set is a set of candidate PDSCH opportunities that need to feed back a HARQ-ACK in one slot;

obtaining the HARQ-ACK codebook in the first slot according to the candidate PDSCH opportunity set corresponding to each carrier; and/or,

determining the HARQ-ACK codebook in the first slot according to the target offset set performed by the processor comprises:

when the HARQ-ACK codebook is a dynamic HARQ-ACK codebook, determining a PDCCH detection opportunity set corresponding to each carrier according to the target offset set and a K0 set, wherein, K0 represents a set of timing values for an interval between a slot of a PDCCH and a slot of a PDSCH scheduled by the PDCCH;

detecting a PDCCH in an entirety set of the PDCCH detection opportunity set corresponding to each carrier, and determining an HARQ-ACK codebook in the first slot according to a Downlink Allocation Index (DAI) value in the detected PDCCH.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 22, 2025
From: GAO, XUEJUAN
To: DATANG MOBILE COMMUNICATIONS EQUIPMENT CO., LTD.
Reel/Frame 069971/0308 →
Priority Claims (1)
CN 201910631019.9 · Jul 12, 2019 · national
Continuity (1)
Related Publication 20220255682A1 · Aug 11, 2022
References Cited (43)
US 20180019843A1 · Papasakellariou · 2018 [cited by applicant]
US 20180263021A1 · He et al. · 2018 [cited by applicant]
US 20190037586A1 · Park et al. · 2019 [cited by applicant]
US 20190045460A1 · Muruganathan et al. · 2019 [cited by applicant]
US 20190132838A1 · Yi · 2019 [cited by examiner]
US 20190313386A1 · Hwang · 2019 [cited by examiner]
US 20190363832A1 · Yang · 2019 [cited by examiner]
US 20190364557A1 · Harada et al. · 2019 [cited by applicant]
US 20200092068A1 · Yang · 2020 [cited by examiner]
US 20200252895A1 · Yi · 2020 [cited by examiner]
US 20200267597A1 · Huang · 2020 [cited by examiner]
US 20200328848A1 · He · 2020 [cited by examiner]
US 20210084622A1 · Choi · 2021 [cited by examiner]
US 20210105761A1 · Cheng · 2021 [cited by examiner]
US 20210314889A1 · Rico Alvarino · 2021 [cited by examiner]
US 20210314892A1 · Rico Alvarino · 2021 [cited by examiner]
CN 107925532A · 2018 [cited by applicant]
CN 109075914A · 2018 [cited by applicant]
CN 109923894A · 2019 [cited by applicant]
CN 109952716A · 2019 [cited by applicant]
EP 3468081 · 2019 [cited by applicant]
TW 202023221A · 2020 [cited by examiner]
WO 2017164626A2 · 2017 [cited by applicant]
WO WO2019160364A1 · 2019 [cited by examiner]
WO WO2019160387A1 · 2019 [cited by examiner]
WO WO2019219072A1 · 2019 [cited by examiner]
WO WO2020031155A1 · 2020 [cited by examiner]
WO WO2020091669A1 · 2020 [cited by examiner]
WO WO2020223195A1 · 2020 [cited by examiner]
WO WO2020257692A1 · 2020 [cited by examiner]
WO WO2021033094A1 · 2021 [cited by examiner]
WO WO2021164579A1 · 2021 [cited by examiner]
3GPP TSG RAN WG1 #96bis R1-1904408; Xi'an, China, Apr. 8-12, 2019 Samsung, HARQ enhancements for NR-U (Year: 2019). [cited by examiner]
International Preliminary Report on Patentability issued for PCT/CN2020/100853 dated Jan. 31, 2022, and Its English Translation provided by WIPO. [cited by applicant]
International Search Report issued for PCT/CN2020/100853 dated Sep. 27, 2020, and its English translation provided by WIPO. [cited by applicant]
Written Opinion for PCT/CN2020/100853 dated Sep. 27, 2020, and its English translation provided by WIPO. [cited by applicant]
“HARQ Enhancements for NR-U” 3GPP TSG RAN WG1 #96bis R1-1904408, Xi'an, China, Apr. 8-12, 2019, Agenda Item: 7.2.2.2.3, Source: Samsung , entire document. [cited by applicant]
First Office Action for Chinese Patent Application 201910631019.9 issued on Jun. 21, 2021, and its English Translation. [cited by applicant]
“Remaining aspects of HARQ management” 3GPP TSG RAN WG1 Meeting 90bis R1-1718621, Prague, Czech, Oct. 9-13, 2017, entire document. [cited by applicant]
Second Office Action for Chinese Patent Application 201910631019.9 issued on Jan. 18, 2022, and its English Translation. [cited by applicant]
Notice of Allowance for Chinese Patent Application 201910631019.9 issued on Mar. 11, 2022, and its English Translation. [cited by applicant]
Extended European Search Report for European Patent Application 20841573.7, issued on Aug. 4, 2022 by the European Patent Office. [cited by applicant]
“Corrections on CA operation,” 3GPP TSG RAN WG1 Meeting #93, R1-1806740, Busan, Korea, May 21-25, 2018, Agenda item: 7.1.3.4.2, Source: Samsung, all pages. [cited by applicant]