IP Library › Granted Patent US 12,063,679
Granted Patent B2
US 12,063,679 · App. 17/673,491 · Granted Aug 13, 2024

Communication method and apparatus, and storage medium

Inventors: Fei Gao (Shanghai, CN); Xi Zhang (Chengdu, CN); Yongping Zhang (Beijing, CN); Tie Li (Beijing, CN); Meng Hua (Shanghai, CN)
Assignee: Huawei Technologies Co., Ltd.
H04W72/563H04W72/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,063,679
App. No.
17/673,491
Granted
Aug 13, 2024
Kind
B2
Abstract

The disclosure provides example communication methods and apparatuses. One example method includes determining a highest-priority CORESET, so that a terminal device monitors a PDCCH on the highest-priority CORESET. A highest-priority CORESET is determined in M CORESETs belonging to T CORESETs based on one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with the M CORESETs in a time unit, and a PDCCH is monitored on the highest-priority CORESET.

Claims (49)

1. A communication method, comprising:

receiving configuration information, wherein the configuration information is used to indicate one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with T control-resource sets (CORESETs) in a first time unit;

determining, in M CORESETs belonging to the T CORESETs, a highest-priority CORESET based on one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with the M CORESETs in a time unit, wherein the M CORESETs are CORESETs associated with physical downlink control channel Monitoring Occasions (PDCCH MOs) in a PDCCH MO set, wherein the PDCCH MO set comprises L PDCCH MOs, and wherein T and M are positive integers, M is less than or equal to T, and L is an integer greater than 1;

monitoring a PDCCH on the highest-priority CORESET, wherein the PDCCH MO set comprises a first PDCCH MO and a second PDCCH MO, wherein the first PDCCH MO and the second PDCCH MO have an overlapping second time unit in time domain; and

in response to determining that the PDCCH MO set further comprises a third PDCCH MO, and the third PDCCH MO does not have an overlapping second time unit with the first PDCCH MO and the second PDCCH MO in time domain, the PDCCH MO set further comprises a fourth PDCCH MO, wherein the fourth PDCCH MO has an overlapping second time unit with the first PDCCH MO or the second PDCCH MO in time domain, and wherein the third PDCCH MO and the fourth PDCCH MO have an overlapping second time unit in time domain.

2. The method according to claim 1 , wherein

in response to determining that only one of the M CORESETs is associated with a common search space set (CSS), the highest-priority CORESET is a CORESET associated with the CSS in the M CORESETs.

3. The method according to claim 1 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with common search space sets (CSSs), K is a positive integer not greater than M, and K cell identifiers associated with the K CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the K CORESETs.

4. The method according to claim 1 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with only one of the K CORESETs, the highest-priority CORESET is a CORESET associated with the smallest cell identifier in the K CORESETs.

5. The method according to claim 1 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with at least two of the K CORESETs, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the CORESETs associated with the smallest cell identifier in the K CORESETs.

6. The method according to claim 1 , wherein

in response to determining that none of the M CORESETs is associated with a CSS, and M cell identifiers associated with the M CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest UE-specific search space set identifier in the M CORESETs.

7. A communication apparatus, comprising at least one processor; and

one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:

receiving configuration information, wherein the configuration information is used to indicate one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with T control-resource sets (CORESETs) in a first time unit;

determining, in M CORESETs belonging to the T CORESETs, a highest-priority CORESET based on one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with the M CORESETs in a time unit, wherein the M CORESETs are CORESETs associated with physical downlink control channel Monitoring Occasions (PDCCH MOs) in a PDCCH MO set, wherein the PDCCH MO set comprises L PDCCH MOs, and wherein T and M are positive integers, M is less than or equal to T, and L is an integer greater than 1;

monitoring a PDCCH on the highest-priority CORESET, wherein the PDCCH MO set comprises-a first PDCCH MO and a second PDCCH MO, wherein the first PDCCH MO and the second PDCCH MO have an overlapping second time unit in time domain; and

in response to determining that the PDCCH MO set further comprises a third PDCCH MO, and the third PDCCH MO does not have an overlapping second time unit with the first PDCCH MO and the second PDCCH MO in time domain, the PDCCH MO set further comprises a fourth PDCCH MO, wherein the fourth PDCCH MO has an overlapping second time unit with the first PDCCH MO or the second PDCCH MO in time domain, and wherein the third PDCCH MO and the fourth PDCCH MO have an overlapping second time unit in time domain.

8. The communication apparatus according to claim 7 , wherein

in response to determining that only one of the M CORESETs is associated with a common search space set (CSS), the highest-priority CORESET is a CORESET associated with the CSS in the M CORESETs.

9. The communication apparatus according to claim 7 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with common search space sets (CSSs), K is a positive integer not greater than M, and K cell identifiers associated with the K CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the K CORESETs.

10. The communication apparatus according to claim 7 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with only one of the K CORESETs, the highest-priority CORESET is a CORESET associated with the smallest cell identifier in the K CORESETs.

11. The communication apparatus according to claim 7 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with at least two of the K CORESETs, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the CORESETs associated with the smallest cell identifier in the K CORESETs.

12. The communication apparatus according to claim 7 , wherein

in response to determining that none of the M CORESETs is associated with a CSS, and M cell identifiers associated with the M CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest UE-specific search space set identifier in the M CORESETs.

13. The communication apparatus according to claim 7 , wherein the communication apparatus is a terminal device or a chip.

14. A communication apparatus, comprising at least one processor; and

one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:

generating configuration information, wherein the configuration information is used to indicate one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with T control-resource sets (CORESETS) in a first time unit;

sending the configuration information;

determining, in M CORESETs belonging to the T CORESETs, a highest-priority CORESET based on one or more of cell identifiers, quasi co-location properties, search space set types, and search space set identifiers that are associated with the M CORESETs in a time unit, wherein the M CORESETs are CORESETs associated with physical downlink control channel Monitoring Occasions (PDCCH MOs) in a PDCCH MO set, wherein the PDCCH MO set comprises L PDCCH MOs, wherein T and M are positive integers, M is less than or equal to T, and L is an integer greater than 1, and the PDCCH MO set comprises-a first PDCCH MO and a second PDCCH MO, wherein the first PDCCH MO and the second PDCCH MO have an overlapping second time unit in time domain; and

in response to determining that the PDCCH MO set further comprises a third PDCCH MO, and the third PDCCH MO does not have an overlapping second time unit with the first PDCCH MO and the second PDCCH MO in time domain, the PDCCH MO set further comprises a fourth PDCCH MO, wherein the fourth PDCCH MO has an overlapping second time unit with the first PDCCH MO or the second PDCCH MO in time domain, and wherein the third PDCCH MO and the fourth PDCCH MO have an overlapping second time unit in time domain.

15. The communication apparatus according to claim 14 , wherein

in response to determining that only one of the M CORESETs is associated with a common search space set (CSS), the highest-priority CORESET is a CORESET associated with the CSS in the M CORESETs.

16. The communication apparatus according to claim 14 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with common search space sets (CSSs), K is a positive integer not greater than M, and K cell identifiers associated with the K CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the K CORESETs.

17. The communication apparatus according to claim 14 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with only one of the K CORESETs, the highest-priority CORESET is a CORESET associated with the smallest cell identifier in the K CORESETs.

18. The communication apparatus according to claim 14 , wherein

in response to determining that K CORESETs in the M CORESETs are associated with CSSs, K is a positive integer not greater than M, cell identifiers associated with at least two of the K CORESETs are different, and a smallest cell identifier in K cell identifiers associated with the K CORESETs is associated with at least two of the K CORESETs, the highest-priority CORESET is a CORESET associated with a smallest CSS identifier in the CORESETs associated with the smallest cell identifier in the K CORESETs.

19. The communication apparatus according to claim 14 , wherein

in response to determining that none of the M CORESETs is associated with a CSS, and M cell identifiers associated with the M CORESETs are all the same, the highest-priority CORESET is a CORESET associated with a smallest UE-specific search space set identifier in the M CORESETs.

20. The communication apparatus according to claim 14 , wherein the communication apparatus is a network device or a chip.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 26, 2022
From: GAO, FEI; ZHANG, XI; ZHANG, YONGPING; LI, TIE; HUA, MENG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 060629/0937 →
Priority Claims (1)
CN 201910760250.8 · Aug 16, 2019 · national
Continuity (2)
Continuation PCTCN2020096167 · Jun 15, 2020
Related Publication 20220174681A1 · Jun 2, 2022