IP Library › Granted Patent US 12,471,105
Granted Patent B2
US 12,471,105 · App. 17/927,512 · Granted Nov 11, 2025

Methods and apparatus for sending and receiving physical downlink control channel, and electronic device

Inventor: Qin Mu (Beijing, CN)
Assignee: Beijing Xiaomi Mobile Software Co., Ltd.
H04W72/23H04L1/08
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,471,105
App. No.
17/927,512
Granted
Nov 11, 2025
Kind
B2
Abstract

A method for sending and receiving a physical downlink control channel (PDCCH). The method for sending a PDCCH includes: determining, from a candidate search space set for the physical downlink control channel (PDCCH) multiple repetition transmissions, a search space for sending a PDCCH, the candidate search space set for the PDCCH multiple repetition transmissions includes all search spaces or at least one search space in a time unit; and sending the PDCCH based on the determined search space.

Claims (68)

1 . A method for sending a physical downlink control channel, comprising:

determining, from a candidate search space set for the physical downlink control channel (PDCCH) multiple repetition transmissions, a search space for sending the PDCCH, wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises all search spaces or at least one search space in one time unit; and

sending the PDCCH based on the determined search space;

wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises two or more search spaces; at least two search spaces of the two or more search spaces correspond to different first configuration parameters; and

the two or more search spaces correspond to the same searchSpaceId, or some or all of the two or more search spaces correspond to different searchSpaceIds respectively; and

the first configuration parameter at least comprises candidate transmission locations of the PDCCH corresponding to each aggregation level in the aggregation level set.

2 . The method according to claim 1 , wherein determining, from the candidate search space set for the PDCCH multiple repetition transmissions, the search space for sending the PDCCH comprises:

determining, based on a repetition number of the PDCCH, the search space for sending the PDCCH.

3 . The method according to claim 2 , wherein determining, based on the repetition number of the PDCCH, the search space for sending the PDCCH comprises:

determining, based on the repetition number of the PDCCH and a first mapping relationship, the search space for sending the PDCCH,

wherein the first mapping relationship at least comprises a search space corresponding to each candidate repetition number.

4 . The method according to claim 2 , wherein

sets of search space corresponding to a candidate repetition number of each PDCCH are not exactly the same or completely different.

5 . The method according to claim 1 , the method further comprises:

sending indication information, wherein the indication information is configured to indicate at least one candidate repetition number of the PDCCH.

6 . The method according to claim 1 , wherein the first configuration parameter further comprises

an aggregation level set.

7 . The method according to claim 6 , wherein the method further comprises:

sending first configuration information, wherein the first configuration information is configured to indicate to a receiver a searchSpaceId corresponding to a search space for sending the PDCCH.

8 . The method according to claim 1 , wherein the method further comprises:

determining, based on a repetition number of the PDCCH and a second mapping relationship, a second configuration parameter corresponding to the search space for sending the PDCCH,

wherein the second mapping relationship is a correspondence relationship between each the repetition number and the second configuration parameter, and the second configuration parameter comprises at least one of:

an aggregation level set, or

candidate transmission locations of the PDCCH corresponding to each aggregation level in the aggregation level set;

wherein sending the PDCCH based on the determined search space comprises:

sending the PDCCH in the determined search space based on the determined second configuration parameter.

9 . The method according to claim 2 , wherein

sets of a candidate repetition number of the PDCCH corresponding to each candidate search space are not exactly the same or completely different.

10 . A method for receiving a physical downlink control channel, comprising:

determining a candidate search space set for the PDCCH multiple repetition transmissions; and

blind decoding the PDCCH based on a determined candidate search space set for the PDCCH multiple repetition transmissions, wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises all search spaces or at least one search space in one time unit;

wherein blind decoding the PDCCH based on the determined candidate search space set for the PDCCH multiple repetition transmissions comprises:

blind decoding, based on a first configuration parameter corresponding to at least one candidate search space in the determined candidate search space set for the PDCCH multiple repetition transmissions, the PDCCH in the at least one candidate search space;

wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises two or more search spaces; at least two search spaces of the two or more search spaces correspond to different first configuration parameters; and the two or more search spaces correspond to the same searchSpaceId, or some or all of the two or more search spaces correspond to different searchSpaceIds respectively; and

the first configuration parameter at least comprises candidate transmission locations of the PDCCH corresponding to each aggregation level in the aggregation level set.

11 . The method according to claim 10 , wherein determining the candidate search space set for the PDCCH multiple repetition transmissions comprises:

determining a candidate repetition number of at least one PDCCH; and

determining, based on the candidate repetition number of the PDCCH, the candidate search space set for sending the PDCCH.

12 . The method according to claim 11 , wherein the determining, based on the candidate repetition number of the PDCCH, the candidate search space set for sending the PDCCH comprises:

determining, based on the candidate repetition number of the PDCCH and a first mapping relationship, the candidate search space set for sending the PDCCH, wherein the first mapping relationship at least comprises a search space corresponding to each candidate repetition number.

13 . The method according to claim 11 , wherein

sets of search space corresponding to the candidate repetition number of each PDCCH are not exactly the same or completely different.

14 . The method according to claim 10 , wherein the method comprises:

receiving indication information of PDCCH repetition number sent by a base station, wherein the indication information is configured to indicate at least one candidate repetition number of the PDCCH.

15 . The method according to claim 10 ,

wherein the first configuration parameter further comprises

an aggregation level set.

16 . The method according to claim 10 , wherein determining the candidate search space set for the PDCCH multiple repetition transmissions; and blind decoding the PDCCH based on the determined candidate search space set for the PDCCH multiple repetition transmissions comprises:

determining first configuration information, wherein the first configuration information is configured to indicate a searchSpaceId corresponding to a search space for sending the PDCCH; and

blind decoding the PDCCH in the candidate search space set for the PDCCH multiple repetition transmissions corresponding to the searchSpaceId indicated by the first configuration information.

17 . The method according to claim 10 , wherein the blind decoding the PDCCH based on the determined candidate search space set for the PDCCH multiple repetition transmissions comprises:

determining, based on a candidate repetition number of at least one of PDCCH and the second mapping relationship, a second configuration parameter corresponding to the candidate repetition number of the at least one PDCCH, wherein the second mapping relationship is a correspondence relationship between each repetition number and each second configuration parameter; and

blind decoding, based on the second configuration parameter corresponding to the at least one candidate repetition number, the PDCCH in a search space corresponding to the at least one candidate repetition number,

wherein the second configuration parameter comprises at least one of:

an aggregation level set, or

candidate transmission locations of the PDCCH corresponding to each aggregation level in the aggregation level set.

18 . An electronic device, wherein the electronic device comprises a memory and a processor;

a memory, on which a computer program is stored;

the processor is configured to implement the method according to claim 10 when executing the computer program.

19 . The method according to claim 11 , wherein

sets of the candidate repetition number of the PDCCH corresponding to each candidate search space are not exactly the same or completely different.

20 . An electronic device comprising:

a memory, on which a computer program is stored;

a processor that executes the computer program, wherein the computer program causes the processor to:

determine, from a candidate search space set for the physical downlink control channel (PDCCH) multiple repetition transmissions, a search space for sending the PDCCH, wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises all search spaces or at least one search space in one time unit; and

send the PDCCH based on the determined search space;

wherein the candidate search space set for the PDCCH multiple repetition transmissions comprises two or more search spaces; at least two search spaces of the two or more search spaces correspond to different first configuration parameters; and the two or more search spaces correspond to the same searchSpaceId, or some or all of the two or more search spaces correspond to different searchSpaceIds respectively; and

the first configuration parameter at least comprises candidate transmission locations of the PDCCH corresponding to each aggregation level in the aggregation level set.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 23, 2022
From: MU, QIN
To: BEIJING XIAOMI MOBILE SOFTWARE CO. LTD.
Reel/Frame 061867/0814 →
Continuity (1)
Related Publication 20230247640A1 · Aug 3, 2023
References Cited (47)
US 20110105162A1 · Kim et al. · 2011 [cited by applicant]
US 20140177582A1 · Wu et al. · 2014 [cited by applicant]
US 20160249331A1 · Park · 2016 [cited by examiner]
US 20180376498A1 · Bhattad · 2018 [cited by examiner]
US 20190037540A1 · Seo et al. · 2019 [cited by applicant]
US 20190182807A1 · Panteleev et al. · 2019 [cited by applicant]
US 20190297607A1 · Kim · 2019 [cited by examiner]
US 20200022144A1 · Papasakellariou · 2020 [cited by examiner]
US 20200204294A1 · Ma · 2020 [cited by examiner]
US 20200351129A1 · Kwak · 2020 [cited by examiner]
US 20200404635A1 · Bendlin · 2020 [cited by examiner]
US 20200412515A1 · Xu · 2020 [cited by examiner]
US 20210136689A1 · Kim · 2021 [cited by examiner]
US 20210160827A1 · Kim · 2021 [cited by examiner]
US 20210195600A1 · Khoshnevisan · 2021 [cited by examiner]
US 20210282123A1 · Wong · 2021 [cited by examiner]
US 20210314866A1 · Lee · 2021 [cited by examiner]
US 20210321446A1 · Lee · 2021 [cited by examiner]
US 20210329647A1 · Park · 2021 [cited by examiner]
US 20220053468A1 · Chen · 2022 [cited by examiner]
US 20220240111A1 · Jang · 2022 [cited by examiner]
US 20230362892A1 · Khoshnevisan · 2023 [cited by examiner]
CN 102255688A · 2011 [cited by applicant]
CN 104285490A · 2015 [cited by applicant]
CN 104811409A · 2015 [cited by applicant]
CN 105871527A · 2016 [cited by applicant]
CN 107690762A · 2018 [cited by applicant]
CN 109041243A · 2018 [cited by applicant]
CN 109286983A · 2019 [cited by applicant]
CN 109391361A · 2019 [cited by applicant]
CN 110166197A · 2019 [cited by applicant]
CN 113169841A · 2021 [cited by examiner]
CN 115280870A · 2022 [cited by examiner]
CN 113676301B · 2023 [cited by examiner]
EP 3681089A1 · 2020 [cited by examiner]
EP 3420661B1 · 2021 [cited by examiner]
EP 3735752B1 · 2023 [cited by examiner]
KR 20210059700A · 2021 [cited by examiner]
WO 2013099268A1 · 2013 [cited by applicant]
WO WO2020098685A1 · 2020 [cited by examiner]
WO WO2020166045A1 · 2020 [cited by examiner]
WO WO2020211096A1 · 2020 [cited by examiner]
WO WO2021081949A1 · 2021 [cited by examiner]
WO WO2021159451A1 · 2021 [cited by examiner]
Interdigital: “NB-PDCCH for NB-IoT”, 3GPP TSG RAN WG1 NB-IoT Ad-Hoc Meeting, RI-161915, Mar. 16, 2016 (Mar. 16, 2016). [cited by applicant]
Intel Corporation, “NR PDCCH: Search Spaces and monitoring behavior”,3GPP TSG RAN WG1 NR Adhoc #2,R1-1710544,Qingdao, P.R. China, Jun. 20-23, 2017. [cited by applicant]
Analysis of NB IoT Channel NB-PDCCH and Resource Scheduling Principles. [cited by applicant]