CN111148259B - Communication method and device - Google Patents

Communication method and device Download PDF

Info

Publication number
CN111148259B
CN111148259B CN201811303215.5A CN201811303215A CN111148259B CN 111148259 B CN111148259 B CN 111148259B CN 201811303215 A CN201811303215 A CN 201811303215A CN 111148259 B CN111148259 B CN 111148259B
Authority
CN
China
Prior art keywords
pdcch
search space
cell
resource location
equal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811303215.5A
Other languages
Chinese (zh)
Other versions
CN111148259A (en
Inventor
肖洁华
贾瓦德·阿布多利
唐臻飞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201811303215.5A priority Critical patent/CN111148259B/en
Priority to PCT/CN2019/113768 priority patent/WO2020088423A1/en
Publication of CN111148259A publication Critical patent/CN111148259A/en
Application granted granted Critical
Publication of CN111148259B publication Critical patent/CN111148259B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/535Allocation or scheduling criteria for wireless resources based on resource usage policies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/23Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A communication method and device, the method includes: the method comprises the steps of determining a first search space in the active BWP of a first cell aiming at a second search space in the active BWP of a second cell, determining a resource position of a first PDCCH according to the first search space, wherein the resource position of the first PDCCH is located in resources of the second cell, and finally detecting the first PDCCH in the resource position of the first PDCCH. By adopting the method and the device, the first cell can be used for activating the first search space in the BWP and determining the first PDCCH.

Description

Communication method and device
Technical Field
The present application relates to the field of communications technologies, and in particular, to a communication method and apparatus.
Background
In a wireless communication system, communication between a network device and a terminal device is performed in a cell serving unit, and how to send or monitor a physical downlink control channel in different cells is a problem that needs to be solved currently.
Disclosure of Invention
The embodiment of the application provides a communication method and device, which are used for receiving and scheduling a first PDCCH of a first cell in resources of a second cell.
In a first aspect, a communication method is provided, where the method is applicable to a terminal device, and includes: determining a first search space of an active bandwidth part BWP of a first cell; determining a resource position of a first Physical Downlink Control Channel (PDCCH) according to the first search space, wherein the first PDCCH is used for sending control information of the first cell, and the resource position of the first PDCCH is located in a resource of a second cell; detecting the first PDCCH in a resource location of the first PDCCH.
As can be seen from the above, in the embodiment of the present application, the resource location of the PDCCH of the first cell may be calculated by using the first search space configured in the first cell activated BWP, so that the resource location of the PDCCH of the first cell may be prevented from being calculated by using the search space configured in the first cell deactivated BWP. In one possible design, the determining the first search space for active BWP for the first cell includes: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In this embodiment, the second cell may be a scheduling cell, and the first cell may be a scheduled cell, and in this embodiment, the correspondence between the second search space in the scheduling cell and the first search space in the scheduled cell may be flexibly set, and when BWP is activated, cross-carrier scheduling may also be implemented.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In the embodiment of the present application, the number of PDDCH candidates included in the N first search spaces may be the same or different, and compared with a scheme in which the number of PDCCH candidates included in the N first search spaces must be the same, the flexibility of configuration may be improved.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In the embodiment of the present application, no matter what the number of the first search space and the second search space is, the corresponding relationship between j and i mod N can be established through the corresponding relationship between j and i mod N, so that the configuration of the search space is more flexible.
In one possible design, the method further includes: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces. In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes more than or equal to one candidate;
for the first
Figure BDA0001852914340000021
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure BDA0001852914340000022
Resource location of each PDCCH candidate:
Figure BDA0001852914340000023
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000024
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000025
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000026
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000027
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000028
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCEpRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000029
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first
Figure BDA00018529143400000210
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure BDA00018529143400000211
Resource location of each PDCCH candidate:
Figure BDA00018529143400000212
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space;
n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400000213
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA00018529143400000214
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400000215
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure BDA00018529143400000216
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400000217
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400000218
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the method further includes: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes one or more candidate PDCCHs;
for the first
Figure BDA0001852914340000031
Determining a resource location of a second PDCCH according to the second search space, including: determining the second according to
Figure BDA0001852914340000032
Resource location of each PDCCH candidate:
Figure BDA0001852914340000033
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000034
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000035
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000036
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000037
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000038
Represented in said second search space smThe sequence number of the medium candidate PDCCH;said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000039
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a second aspect, a communication method is provided, which is applicable to a network device, and includes: determining a first search space of an active bandwidth part BWP of a first cell; determining a resource position of a first Physical Downlink Control Channel (PDCCH) according to the first search space, wherein the first PDCCH is used for sending control information of the first cell, and the resource position of the first PDCCH is located in a resource of a second cell; transmitting the first PDCCH in a resource location of the first PDCCH.
In one possible design, the determining the first search space for active BWP for the first cell includes: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N; wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In one possible design, the method further includes: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000041
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure BDA0001852914340000042
Resource location of each PDCCH candidate:
Figure BDA0001852914340000043
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000044
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000045
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000046
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000047
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000048
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000049
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA00018529143400000410
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure BDA00018529143400000411
Resource location of each PDCCH candidate:
Figure BDA00018529143400000412
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space; n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400000413
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA00018529143400000414
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400000415
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure BDA00018529143400000416
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400000417
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400000418
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the method further includes: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes more than or equal to one candidate PDCCH;
for the first of the candidate PDCCHs
Figure BDA00018529143400000419
Determining a resource location of a second PDCCH according to the second search space, including: determining the second according to
Figure BDA0001852914340000051
Resource location of each PDCCH candidate:
Figure BDA0001852914340000052
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000053
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000054
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000055
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000056
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000057
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000058
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a third aspect, an embodiment of the present application provides an apparatus, where the apparatus may be a terminal device, or an apparatus in a terminal device, and the apparatus may include a processing module and a receiving module, where the modules may perform corresponding functions performed by the terminal device in any of the design examples of the first aspect, specifically:
a processing module, configured to determine a first search space of an active bandwidth portion BWP of a first cell, and determine a resource location of a first physical downlink control channel PDCCH according to the first search space, where the first PDCCH is used to send control information of the first cell, and the resource location of the first PDCCH is located in a resource of a second cell;
a receiving module, configured to receive the first PDCCH in a resource location of the first PDCCH.
In one possible design, the processing module, when determining the first search space for active BWP for the first cell, is specifically configured to: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In one possible design, the processing module is further to: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes more than or equal to one candidate;
for the first in the first search space
Figure BDA0001852914340000059
The processing module, when determining the resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA0001852914340000061
Resource location of each PDCCH candidate:
Figure BDA0001852914340000062
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000063
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000064
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000065
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000066
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000067
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000068
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes the number of one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000069
The processing module, when determining the resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA00018529143400000610
Resource location of each PDCCH candidate:
Figure BDA00018529143400000611
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space; n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400000612
Represents a time domain resource location of the first PDCCH, wherein
Figure BDA00018529143400000613
Can also be abbreviated as
Figure BDA00018529143400000614
The above-mentioned
Figure BDA00018529143400000615
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400000616
A starting position parameter of a frequency domain resource position of the first PDCCH, wherein
Figure BDA00018529143400000617
Can also be abbreviated as
Figure BDA00018529143400000618
The above-mentioned
Figure BDA00018529143400000619
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400000620
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400000621
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the processing module is further to: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes one or more candidate PDCCHs;
for the first of the candidate PDCCHs
Figure BDA00018529143400000622
The processing module, when determining the resource location of the second PDCCH according to the second search space, includes: determining the second according to
Figure BDA00018529143400000623
Resource location of each PDCCH candidate:
Figure BDA0001852914340000071
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000072
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000073
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000074
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000075
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000076
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000077
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a fourth aspect, an embodiment of the present application provides an apparatus, which may be a network device, or an apparatus in a network device, where the apparatus may include a processing module and a sending module, where the modules may perform corresponding functions performed by the network device in any design example of the second aspect, specifically:
a processing module, configured to determine a first search space of an active bandwidth portion BWP of a first cell, and determine a resource location of a first physical downlink control channel PDCCH according to the first search space, where the first PDCCH is used to send control information of the first cell, and the resource location of the first PDCCH is located in a resource of a second cell;
a sending module, configured to send the first PDCCH in a resource location of the first PDCCH.
In one possible design, the processing module, when determining the first search space for active BWP for the first cell, is specifically configured to: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In one possible design, the processing module is further to: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000078
The processing module, when determining the resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA0001852914340000081
Resource location of each PDCCH candidate:
Figure BDA0001852914340000082
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000083
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000084
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000085
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000086
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000087
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000088
Indicates all scheduled by the second cell when the aggregation level is LIn active BWP of the first cell, with the second search space smCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes the number of one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000089
The processing module, when determining the resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA00018529143400000810
Resource location of each PDCCH candidate:
Figure BDA00018529143400000811
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space; n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400000812
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA00018529143400000813
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400000814
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure BDA00018529143400000815
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400000816
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400000817
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the processing module is further to: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes one or more candidate PDCCHs;
for the first of the candidate PDCCHs
Figure BDA00018529143400000818
The processing module, when determining the resource location of the second PDCCH according to the second search space, includes: determining the second according to
Figure BDA00018529143400000819
Resource location of each PDCCH candidate:
Figure BDA0001852914340000091
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000092
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000093
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000094
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000095
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000096
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000097
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, aIncluding a maximum of the number of candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a fifth aspect, an embodiment of the present application provides a communication apparatus, where the communication apparatus includes a processor, and is configured to implement the function of the terminal device in the method described in the first aspect. The communication device may also include a memory for storing program instructions and data. The memory is coupled to the processor, and the processor may call and execute the program instructions stored in the memory, so as to implement the functions of the terminal device in the method described in the first aspect. The communication device may further comprise a communication interface for the communication device to communicate with other devices. Illustratively, the other device is a network device. In one possible arrangement, the communication device comprises:
a memory for storing program instructions;
the apparatus includes a processor configured to determine a first search space of an active bandwidth portion BWP of a first cell, and determine a resource location of a first physical downlink control channel PDCCH according to the first search space, where the first PDCCH is used to send control information of the first cell, and the resource location of the first PDCCH is located in a resource of a second cell.
A communication interface to receive the first PDCCH in a resource location of the first PDCCH, the communication interface to communicate with other devices. Illustratively, the communication interface may be a transceiver.
In one possible design, the processor, when determining the first search space for active BWP for the first cell, is specifically configured to: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In one possible design, the processor is further to: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000101
The processor, when determining a resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA0001852914340000102
Resource location of each PDCCH candidate:
Figure BDA0001852914340000103
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000104
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000105
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000106
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000107
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000108
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000109
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA00018529143400001010
The processor, when determining a resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA00018529143400001011
Resource location of each PDCCH candidate:
Figure BDA00018529143400001012
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space; n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400001013
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA00018529143400001014
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400001015
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure BDA00018529143400001016
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400001017
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400001018
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the processor is further to: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes one or more candidate PDCCHs;
for the first of the candidate PDCCHs
Figure BDA0001852914340000111
The processor, when determining a resource location of a second PDCCH according to the second search space, includes: determining the second according to
Figure BDA0001852914340000112
Resource location of each PDCCH candidate:
Figure BDA0001852914340000113
wherein L represents the secondThe aggregation level of two PDCCHs, wherein L is an integer which is greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000114
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000115
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000116
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000117
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000118
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000119
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a sixth aspect, an embodiment of the present application provides a communication apparatus, where the communication apparatus includes a processor, and is configured to implement the function of the network device in the method described in the second aspect. The communication device may also include a memory for storing program instructions and data. The memory is coupled to the processor, and the processor can call and execute the program instructions stored in the memory, so as to implement the functions of the network device in the method described in the second aspect. The communication device may further comprise a communication interface for the communication device to communicate with other devices. Illustratively, the other device is a terminal device. In one possible arrangement, the communication device comprises:
a memory for storing program instructions;
the apparatus includes a processor configured to determine a first search space of an active bandwidth portion BWP of a first cell, and determine a resource location of a first physical downlink control channel PDCCH according to the first search space, where the first PDCCH is used to send control information of the first cell, and the resource location of the first PDCCH is located in a resource of a second cell.
A communication interface to transmit the first PDCCH in a resource location of the first PDCCH, the communication interface to communicate with the apparatus and other apparatuses. Illustratively, the communication interface may be a transceiver.
In one possible design, the processor, when determining the first search space for active BWP for the first cell, is specifically configured to: determining a second search space for active BWP of the second cell; and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
In one possible design, the number of the first search spaces is one, and the first search spaces correspond to all second search spaces of the second cell.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, M and N are positive integers greater than or equal to 1, M is smaller than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
In one possible design, the number of the first search spaces is N, the number of the second search spaces is M, N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ i mod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
In one possible design, the processor is further to: sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces; and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA0001852914340000121
The processor, when determining a resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA0001852914340000122
Resource location of each PDCCH candidate:
Figure BDA0001852914340000123
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000124
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA0001852914340000125
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000126
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000127
Is based on said second search space smDetermining; s isnRepresenting the first search space; n isCIA carrier indicator field, CIF, representing the first cell; the above-mentioned
Figure BDA0001852914340000128
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCEpRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000129
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the resource location of the first PDCCH includes a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space includes one or more candidate PDCCHs;
for the first in the first search space
Figure BDA00018529143400001210
The processor, when determining a resource location of the first PDCCH according to the first search space, includes: determining the second according to
Figure BDA00018529143400001211
Resource location of each PDCCH candidate:
Figure BDA00018529143400001212
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0; s isnRepresenting the first search space; the p represents a set of control resources associated with the second search space; n isCIA carrier indicator field, CIF, representing the first cell; the mu represents a parameter set corresponding to the BWP where the first search space is located; the above-mentioned
Figure BDA00018529143400001213
Represents a time domain resource location of the first PDCCH; the above-mentioned
Figure BDA00018529143400001214
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA00018529143400001215
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure BDA00018529143400001216
Is based on said first search space snDetermining; the above-mentioned
Figure BDA00018529143400001217
Representing the first search space snThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA00018529143400001218
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs; the value of i is greater than or equal to 0 and less than or equal to L-1.
In one possible design, the processor is further to: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
In one possible design, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and the second search space includes one or more candidate PDCCHs;
for the first of the candidate PDCCHs
Figure BDA0001852914340000131
The processor, when determining a resource location of a second PDCCH according to the second search space, includes: determining the second according to
Figure BDA0001852914340000132
Resource location of each PDCCH candidate:
Figure BDA0001852914340000133
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0; s ismRepresenting the second search space; the p represents a set of control resources associated with the second search space; the mu represents a parameter set corresponding to the BWP where the second search space is located; the above-mentioned
Figure BDA0001852914340000134
Represents a time domain resource location of the second PDCCH; the above-mentioned
Figure BDA0001852914340000135
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000136
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000137
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000138
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000139
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
In a seventh aspect, an embodiment of the present application further provides a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform the method of the first aspect or the second aspect.
In an eighth aspect, this application further provides a computer program product, which includes instructions that, when executed on a computer, cause the computer to perform the method of the first aspect or the second aspect.
In a ninth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the function of the network device in the foregoing method. The chip system may be formed by a chip, and may also include a chip and other discrete devices.
In a tenth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the functions of the terminal in the foregoing method. The chip system may be formed by a chip, and may also include a chip and other discrete devices.
In an eleventh aspect, the present application provides a system, which includes the communication apparatus in the third aspect or the fifth aspect, and the communication apparatus in the fourth aspect or the sixth aspect.
Drawings
Fig. 1 is a schematic diagram of cross-carrier scheduling according to an embodiment of the present application;
fig. 2 is a schematic diagram of CORESET provided by an embodiment of the present application;
fig. 3 is an example of cross-carrier scheduling provided by an embodiment of the present application;
fig. 4 is an example of BWP provided by an embodiment of the present application;
fig. 5 to fig. 7 are schematic diagrams of cross-carrier scheduling according to an embodiment of the present application;
fig. 8 is an example of a PDCCH time domain resource location provided in the embodiment of the present application;
fig. 9 and fig. 10 are flowcharts of a communication method provided in an embodiment of the present application;
fig. 11 to fig. 14 are diagrams illustrating an example of cross-carrier scheduling provided in an embodiment of the present application;
FIG. 15 is an example of candidate PDCCH positions;
fig. 16 and 17 are diagrams illustrating an example of a communication apparatus according to an embodiment of the present disclosure;
fig. 18 is an example of a communication system according to an embodiment of the present application.
Detailed Description
The technical solution in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
In wireless communication systems, there are concepts of self-scheduling (self-scheduling) and cross-carrier scheduling (cross-carrier scheduling). The self-scheduling refers to scheduling of a Physical Downlink Shared Channel (PDSCH) or a Physical Uplink Shared Channel (PUSCH) on one carrier by a Physical Downlink Control Channel (PDCCH) transmitted on the carrier. Cross-carrier scheduling refers to scheduling of PDSCH or PUSCH on one carrier by PDCCH transmitted on other carriers. In addition, the PDCCH may also be used to carry downlink control information, for example, activation or release of semi-persistent scheduling (SPS), triggering of reporting aperiodic Channel State Information (CSI), triggering of aperiodic channel state information reference signal (CSI-RS) resource, and the like, where the concept of the self-scheduling may also be described as: the downlink control information on one carrier is carried by the PDCCH sent on the carrier, and the concept of cross-carrier scheduling can also be described as follows: the downlink control information on one carrier is carried by the PDCCH sent on the other carrier. In the embodiment of the present application, the self-scheduling and the cross-carrier scheduling are both described by taking the scheduling of the PDSCH as an example, and are not limited to the present application.
For example, two carriers are set, namely a first carrier and a second carrier, where the first carrier corresponds to a primary cell (PCell) and the second carrier corresponds to a secondary cell (SCell). As shown in fig. 1, the base station may transmit two PDCCHs in the primary cell, for scheduling PDSCH on the primary cell and PDSCH on the secondary cell, respectively.
As shown in fig. 2, in a fifth generation mobile communication system, a time-frequency resource for a base station to perform wireless communication with a terminal device may be divided into two regions, which are a control region and a data region, respectively, where the control region includes one or more control resource sets (CORESET), and still referring to fig. 2, the entire control region may include two control resource sets, which are CORESET1 and CORESET2, respectively, each control resource set may include one or more Control Channel Elements (CCEs), and the base station may map one PDCCH onto one or more CCEs for transmission.
For the terminal device, the number of CCEs mapped by each PDCCH may be variable, and there is no signaling notification, so the terminal device needs to perform blind detection on the PDCCHs in the control resource set. Further, in order to reduce the number of blind reductions and reduce the blind reduction complexity of the terminal device, a series of locations where PDCCHs may occur are defined in the control resource set, and the PDCCH may occur is referred to as a PDCCH candidate (PDCCH candidate). Meanwhile, the PDCCH candidates that the terminal device needs to monitor are referred to as search spaces (search spaces). The PDCCH may support different Aggregation Levels (AL), where an aggregation level indicates the number of CCEs occupied by one PDCCH, and for example, the aggregation levels supported by the PDCCH may include {1,2,4,8,16} and the like. The candidate PDCCH set corresponding to a certain aggregation level is referred to as a search space in the aggregation level. The PDCCH candidates for multiple aggregation levels may also be referred to as a search space set. The "search space" and the "search space set" in the embodiment of the present application may be equivalently used. In the embodiments of the present application, a search space is taken as an example and described unless otherwise specified.
Meanwhile, in the fifth generation mobile communication system, a concept of a bandwidth part (BWP) is defined. The BWP refers to a set of continuous Resource Block (RB) resources on a carrier. A plurality of BWPs may be configured on each carrier unit (CC) of a terminal device, and at each time, there is only one active BWP in a carrier, where the active BWP is used for actually transmitting or receiving data, and a control resource set and an SS are configured under each BWP. Each SS and CORESET has a corresponding number (e.g., the numbers in the back bands of SS and CORESET in fig. 3 indicate their corresponding numbers). An SS may be associated with a CORESET. For example, as shown in fig. 3, the terminal device side is configured with 3 carrier cells, which are CC0, CC1, and CC2, respectively, and is configured with 4 BWPs, which are BWP1, BWP2, BWP3, and BWP4, respectively, under each BWP, is configured with control resource sets CORESET and SS, respectively. For example, the active BWP in CC0 is BWP1, the active BWP in CC1 is BWP2, and the active BWP in CC2 is BWP3, and the oblique line filling part in fig. 3 can be specifically referred to for the active BWP.
In the embodiment of the present application, taking CC1 scheduled by CC0 as an example, two PDCCHs are transmitted in a control resource set of CC0, which are a first PDCCH and a second PDCCH, respectively. For example, the first PDCCH is used to schedule PDSCH transmitted on BWP2 of CC1, and the second PDCCH is used to schedule PDSCH transmitted on BWP1 of CC0, which details the process of the embodiment of the present application:
in this embodiment of the present application, the terminal device may calculate a first resource location of the first PDCCH and a second resource location of the second PDCCH, and perform blind detection in the first resource location of the first PDCCH and the second resource location of the second PDCCH, respectively.
Specifically, the terminal device may sequentially monitor for activation of SS1, SS2, and SS3 configured under BWP 1. Taking the terminal equipment monitoring SS1 as an example, the process of monitoring SS2 and SS3 is similar to the process of monitoring SS 1.
When monitoring SS1, the terminal device may use the following equation 1 to calculate a first resource location of the first PDCCH and a second resource location of the second PDCCH, respectively.
Figure BDA0001852914340000151
Wherein, when calculating the second resource location of the second PDCCH, the parameter n in formula 1CIThe value is 0 and the value of the parameter s is SS 1. When calculating the first resource location of the first PDCCH, the parameter n in formula 1CIA Carrier Indicator Field (CIF) value configured by the network device for the cross-carrier scheduled CC1 is taken as a value, for example, the CIF value configured by the network device for the CC1 is 1, and a corresponding parameter n is taken as a valueCIIs 1, and the parameter s is SS1, but as can be seen from the above fig. 3, the currently activated BWP2 in CC1 is not configured with SS 1. In view of this, a solution is proposed: according to the serial number of the SS in the scheduling cell, the SS with the same serial number is searched in the scheduled cell, and the searched SS is possibly not activated B by the scheduled cellProblem of SS configured on WP. For example, still following the above example, when the terminal device monitors the CC0 for the SS1 configured by BWP1, if the resource location of the PDCCH serving CC1 is to be calculated, the SS1 may be searched in CC1, and it can be seen that the searched SS1 is located in the configuration of BWP1, and is not located in the configuration of activating BWP2, so this scheme may not be used. Based on the above, the present application provides a communication method, the principle of which is: and establishing an incidence relation between a search space in the scheduling cell and a search space in the scheduled cell, and acquiring corresponding calculation parameters by using the incidence relation between the search space of the scheduling cell and the search space of the scheduled cell when calculating the resource position of the PDCCH of the scheduled cell. For example, still using the example shown in fig. 3, an association relationship between SS1 in CC0 activated BWP1 and SS5 in CC1 activated BWP2 is established, and in the process of monitoring SS1 by the terminal device, the first resource location of the first PDCCH, that is, the resource location of the PDCCH served by scheduled cell CC1, is calculated by using SS5 associated with SS 1.
For ease of understanding, an explanation of concepts related to the present application is given by way of example for reference, as follows:
1) the network device may be a device in a network that connects the terminal device to the wireless network. The network device is a node in a radio access network, which may also be referred to as a base station, and may also be referred to as a Radio Access Network (RAN) node (or device). Currently, some examples of network devices are: a gNB, a Transmission Reception Point (TRP), an evolved Node B (eNB), a home base station (e.g., home evolved Node B, or home Node B, HNB), a Base Band Unit (BBU), or a WiFi Access Point (AP), etc. In addition, in a network structure, the network device may include a Centralized Unit (CU) node and a Distributed Unit (DU) node. The structure separates the protocol layers of the eNB in a Long Term Evolution (LTE) system, the functions of part of the protocol layers are controlled in the CU in a centralized way, the functions of the rest part or all of the protocol layers are distributed in the DU, and the CU controls the DU in a centralized way.
2) A terminal device, also called a User Equipment (UE), a Mobile Station (MS), a Mobile Terminal (MT), etc., is a device that provides voice and/or data connectivity to a user, for example, a handheld device with a wireless connection function, a vehicle-mounted device, etc. Currently, some examples of terminals are: a mobile phone (mobile phone), a tablet computer, a notebook computer, a palm top computer, a Mobile Internet Device (MID), a wearable device, a Virtual Reality (VR) device, an Augmented Reality (AR) device, a wireless terminal in industrial control (industrial control), a wireless terminal in self driving (self driving), a wireless terminal in remote surgery (remote medical supply), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation safety (smart security), a wireless terminal in city (smart city), a wireless terminal in home (smart home), and the like.
3) PDCCH, downlink control channel sent by a network device (such as a base station) to a terminal device, is mainly used for one or more of the following functions: (1) downlink scheduling information, also called Downlink (DL) allocation information, is transmitted to the terminal device, and the downlink scheduling information includes transmission parameters of the PDSCH, so that the terminal device receives the PDSCH. The PDSCH is used for bearing downlink data sent by the network equipment to the terminal equipment; (2) and sending uplink scheduling information to the terminal device, where the uplink scheduling information is also referred to as Uplink (UL) grant information, and the uplink scheduling information includes a transmission parameter of a PUSCH, so that the terminal device sends the PUSCH to the network device. The PUSCH is used for bearing uplink data sent to the network equipment by the terminal equipment; (3) sending a request for reporting a Channel Quality Indicator (CQI); (4) sending an uplink power control command, wherein the uplink power control command is used for a terminal device to determine the sending power of an uplink channel; (5) carrying related information of hybrid automatic repeat reQuest (HARQ); (6) the Radio Network Temporary Identifier (RNTI) information is carried, the RNTI information may be implicitly included in Cyclic Redundancy Check (CRC), and the RNTI information is used for the terminal device to determine whether the PDCCH sent by the network device is sent to the terminal device.
The information carried by the PDCCH may be referred to as Downlink Control Information (DCI), one PDCCH may only carry DCI of one format, and the information carried by the DCI may be different according to different DCI formats. The DCI may indicate cell-level information, such as system information, Radio Network Temporary Identifier (RNTI), paging RNTI (P-RNTI), or random access RNTI (RA-RNTI), and may also indicate terminal device-level information, such as cell RNTI (C-RNTI), configured scheduling RNTI (CS-RNTI), or semi-persistent CSI RNTI (SP-CSI RNTI).
A network device may send multiple PDCCHs simultaneously in a cell in a control region, where the multiple PDCCHs may carry the same or different control information, including scheduling information of downlink data or scheduling information of uplink data, that is, the scheduling information may schedule downlink data of a terminal device, and may also schedule uplink data of the terminal device. In addition, the network device may also schedule multiple terminal devices in one control region, and each scheduling information is transmitted on a separate PDCCH.
One PDCCH may be mapped to one or more CCEs for transmission, and may also be referred to as one PDCCH, where the time-frequency resource may include one or more CCEs. One CCE is composed of a plurality of Resource Element Groups (REGs), for example, one CCE is composed of 6 REGs, and 1 REG is equal to 1 Resource Block (RB) during 1 Orthogonal Frequency Division Multiplexing (OFDM) symbol. The CCE index of the first CCE occupied by PDCCH is called nCCE.
TABLE 1 aggregation levels supported by PDCCH
Figure BDA0001852914340000171
As shown in table 1, the PDCCH may support different Aggregation Levels (AL), for example, the aggregation levels supported by the PDCCH may include {1,2,4,8,16} and the like. For example, as shown in table 1, if the aggregation level supported by the PDCCH is 4, it indicates that the PDCCH occupies 4 consecutive CCEs. In practical applications, the network device may determine the aggregation level used by the current PDCCH according to factors such as channel quality. For example, if the PDCCH is sent to a terminal device with good downlink channel quality (e.g., a terminal device located in the center of a cell), the network device may send the PDCCH using 1 CCE; if the PDCCH is sent to a terminal device with poor downlink channel quality (e.g., a terminal device located at the edge of a cell), the network device may use 8 CCEs or even 16 CCEs to send the PDCCH to achieve sufficient robustness.
4) BWP, a set of contiguous RB resources on a carrier. In a release 15 of a new radio access technology (NR), it is specified that, for a terminal, at most 4 BWPs can be configured for one serving cell, where, in Frequency Division Duplexing (FDD), 4 BWPs can be configured for uplink and downlink, and in Time Division Duplexing (TDD), 4 BWPs can be configured for uplink and downlink. At any time, only one BWP can be activated, and the terminal device and the network device perform data transceiving on the activated BWP. As shown in #1 of fig. 4, within a carrier bandwidth (carrier BW), only one BWP may be supported, the bandwidth of the BWP being less than or equal to the UE bandwidth capability (UE bandwidth capability), the UE bandwidth capability being less than or equal to the carrier bandwidth (carrier BW). As shown in #2 of fig. 4, in the carrier bandwidth, two BWPs, BWP1 and BWP2, respectively, may be supported, and the bandwidths of BWP1 and BWP2 overlap. As shown in #3 of fig. 4, in the carrier bandwidth, two BWPs may be supported, BWP1 and BWP2, respectively, and BWP1 and BWP2 do not overlap.
5) And CORESET is a block of time-frequency resources in the control area. One core set corresponds to one or a group of user equipments. For example, as shown in fig. 2, CORESET1 may correspond to UE1, UE2, UE3 and UE4, and PDCCHs of UE1, UE2, UE3 and UE4 may be transmitted on CORESET 1. The CORESET2 may correspond to UE5, UE6, UE7, and UE8, and PDCCHs of UE5, UE6, UE7, and UE8 may be transmitted in CORESET 2. One UE may also correspond to multiple CORESET, and the parameter sets on these CORESET may be the same or different.
6) For the PDCCH candidates, the number of CCEs mapped to each PDCCH varies for the terminal device and is not signaled, so the terminal device has to perform blind detection on PDCCH candidates of all possible aggregation levels. In order to reduce the number of blind tests and the complexity of blind tests of the terminal equipment, the system may define an aggregation level set in advance. For example, an aggregation level set {1,2,4,8,16} may be defined, the network device may transmit PDCCHs using 1,2,4,8, or 16 CCEs, and accordingly, the terminal device may perform blind detection on PDCCHs with an aggregation level of 1,2,4,8, or 16, respectively, to determine whether there is a PDCCH addressed to itself. In order to further reduce the number of blind tests and the complexity of the blind test of the terminal equipment, the system defines a series of possible positions of PDCCH (physical Downlink control channel) in the control resource region for each aggregation level, wherein the possible PDCCH is called as PDCCH candidate (PDCCH candidate)
7) Search Space (SS), the set of PDCCHs that the terminal device needs to monitor is called a search space. The candidate PDCCH set corresponding to a certain aggregation level may be referred to as a search space under the aggregation level, and may be referred to as { S k (L) }. Where L denotes an aggregation level, and k denotes a sequence number of a PDCCH candidate in the aggregation level L. For example, when L takes 2 and k takes 2, { S2 (2) } indicates that there are two PDCCH candidates at the aggregation level L ═ 2, and the two PDCCH candidates can be denoted as S0(2) and S1 (2).
The search space is divided into a Common Search Space (CSS) and a UE-specific search space (USS). The CSS is used to transmit control information related to paging (paging), random access Response (RA Response), and Broadcast Control Channel (BCCH), where the control information is mainly cell-level common information, and the information is the same for all UEs. The USS is used to transmit control information related to a downlink shared channel (DL-SCH), an uplink shared channel (UL-SCH), and the like, where the control information is mainly UE-level information.
8) PDCCH blind detection: since the number of CCEs mapped by each PDCCH may be variable and there is no signaling, the terminal device needs to perform blind detection on the PDCCH in the control resource set. Meanwhile, since the terminal device does not know what aggregation level the PDCCH uses, the terminal device may perform blind detection on the PDCCH according to different aggregation levels.
For example, as shown in table 2, it is assumed that, for the common search space CSS, the terminal device needs to perform PDCCH blind tests for AL ═ 4 and AL ═ 8, respectively. When blind detection is carried out according to AL being 4, the size of a control region (such as CORESET) with 16 CCEs (control channel element) is required to be detected for 4 times in a blind mode, namely 4 candidate PDCCHs are provided; when blind detection is carried out according to AL being 8,16 CCEs need to be subjected to blind detection for 2 times, namely 2 candidate PDCCHs exist; it can be seen that for common spatial CSS, there are a total of 4+ 2-6 PDCCH candidates. For the UE-specific search space USS, it is assumed that the terminal device needs to perform PDCCH blind detection for AL ═ 1, AL ═ 2, AL ═ 4, and AL ═ 8, respectively. As can be seen from table 2, when blind detection is performed according to AL ═ 1, 6 CCEs need to be blind detected 6 times, that is, there are 6 candidate PDCCHs; when blind detection is carried out according to AL 2, the 12 CCEs need to be subjected to blind detection for 6 times, namely 6 candidate PDCCHs exist; when blind detection is carried out according to AL being 4,8 CCEs need to be subjected to blind detection for 2 times, namely 2 candidate PDCCHs exist; when blind detection is carried out according to AL being 8,16 CCEs need to be subjected to blind detection for 2 times, namely 2 candidate PDCCHs exist; it can be seen that for the UE-specific search space USS, there are a total of 6+6+2+ 2-16 PDCCH candidates.
Table 2 example of candidate PDCCH configuration that a terminal device needs to monitor
Figure BDA0001852914340000191
9) Self-scheduling (self-scheduling)
Self-scheduling, which means that the PDSCH on one carrier is scheduled by the PDCCH transmitted on that carrier. For example, as shown in fig. 5, a PDSCH on a primary cell (PCell) may be scheduled by a PDCCH transmitted on the PCell, a PDSCH on a secondary cell (SCell) 1 may be scheduled by a PDCCH transmitted on SCell1, and a PDSCH on SCell2 is scheduled by a PDCCH transmitted on SCell 2.
10) Cross-carrier scheduling (cross-carrier scheduling)
Cross-carrier scheduling based on a Carrier Indicator Field (CIF) allows a PDCCH of one serving cell (serving cell) to schedule radio resources on another serving cell. Herein, a cell for transmitting the PDCCH is referred to as a scheduling cell, and a cell for scheduled resources is referred to as a scheduled cell. As shown in fig. 6, the PCell may schedule radio resources on SCell 1. As shown in fig. 7, SCell2 may schedule radio resources on SCell 1. It should be noted that the PCell is not scheduled by other carriers, and the SCell may be configured to schedule other SCell carriers or configured to be scheduled by carriers of other scells.
11) Parameter set (numerology)
Parameter sets, which may include subcarrier spacing, symbol length, slot length, and Cyclic Prefix (CP) type, etc. Table 3 shows an example of the various parameter sets currently supported by the NR.
Table 3 transmission parameter set
Figure BDA0001852914340000192
12) Time domain resource location of PDCCH: also called PDCCH monitoring occasion (PDCCH monitoring occasion), which is a time unit for monitoring PDCCH, and can be determined according to related parameters in the search space SS. For example, the PDCCH monitoring occasion may be determined according to four parameters, namely, a PDCCH monitoring period, a PDCCH monitoring offset, a PDCCH monitoring mode, and the number of consecutive timeslots monitored by the PDCCH in the search space.
For example, as shown in fig. 8, the configuration parameters in the search space indicate that the monitoring period of the PDCCH is 2 slots (slots) and the offset value is 1 slot, so the monitoring slots of the PDCCH are slot1, slot3, slot5, slot7, and slot9, respectively. A 14-bit binary number may be used for each monitoring slot, for example, the 14-bit binary number may be 00001000001000, where 1 represents monitoring is required and 0 represents no monitoring is required. That makes it possible to determine that symbol 4, symbol 5, symbol 10 and symbol 11 can be monitored in turn for each monitored slot. For the monitoring time slot and the monitoring symbol, reference may be made to the diagonal filled portion in fig. 8.
13) Carrier Aggregation (CA) is a technology of aggregating at least 2 carrier elements (CCs) together to support a larger transmission bandwidth. In order to efficiently utilize fragmented spectrum, carrier aggregation supports aggregation between different carrier units, such as aggregation of carrier units within the same or different bandwidths, or aggregation between adjacent or non-adjacent carrier units within the same frequency band, or aggregation between carrier units within different frequency bands, etc. In addition, it is to be understood that the terms first, second, etc. in the description of the present application are used for distinguishing between the descriptions and not necessarily for describing a sequential or chronological order.
It is to be understood that, since one cell only includes one downlink carrier, the "cell" and the "carrier" in the embodiment of the present application may be equivalently used. Unless otherwise specified, the carrier in the embodiment of the present application is described by taking the following carrier as an example.
As shown in fig. 9, the present application provides a flow of a communication method, where an execution subject of the flow may be a terminal device or a network device. In the embodiments of the present application, a terminal device is taken as an example for description. It is understood that the functions of the network device may also be implemented by a chip applied to the network device, or by other means to support the network device; the functions of the terminal device may be implemented by a chip applied to the terminal device, or may be implemented by other means to support the terminal device. The process may specifically be:
s901, the terminal device determines a first SS of a first cell which activates BWP.
The terminal device can determine a second SS of the second cell which activates BWP, and determine the first SS according to the corresponding relation of the second SS and the first SS.
Optionally, when the terminal device is configured with multiple BWPs in a cell, the configuration information includes sequence number information of the first activated BWP, i.e. the first activated BWP ID. When the terminal device works in a single cell, the first activated BWP is the BWP corresponding to the first activated BWP ID in the configuration information, and then the network side may change the currently activated BWP information through the downlink control information DCI or the terminal device through an internal BWP deactivation timer, which may also be referred to as BWP handover. When the terminal device operates in carrier aggregation, only the active cell among the cells configured by the network for the terminal device is used for data transmission, that is, only the active cell has active BWP. In carrier aggregation, a primary cell is always in an activated state, and a secondary cell activates and deactivates the cell through control signaling. For the activated cell, the first activated BWP is the BWP corresponding to the first activated BWP ID in the cell configuration information, and then the network side may change the currently activated BWP information through the downlink control information DCI or the terminal device through the internal BWP deactivation timer, which may also be referred to as BWP handover. Thus, regardless of the scheduling cell or the scheduled cell, the terminal device knows which BWP on the cell is the active BWP.
And S902, the terminal equipment determines the resource position of the first PDCCH according to the first SS.
The first PDCCH is used for transmitting control information of the first cell, and as to which control information of the first cell the first PDCCH is specifically used for transmitting, reference may be made to the description in the PDCCH of concept interpretation section 3) described above. And the resource position of the first PDCCH is positioned in the resource of a second cell, and the first cell is different from the second cell.
The resource position of the first PDCCH comprises a frequency domain resource position of the first PDCCH and a time domain resource position of the first PDCCH. The frequency domain resource location of the first PDCCH may be located in the CORESET associated with the second SS that activates BWP of the second cell, and for the CORESET, refer to the above mentioned concept interpretation section 5) for description in the CORESET, and for the time domain resource location of the first PDCCH, refer to the above mentioned concept interpretation section 11) for description of the time domain resource location of the PDCCH. The number of PDCCH candidates included in the first SS can be referred to the above-mentioned description of the PDDCH candidate of the concept interpretation section 6) with respect to the PDCCH candidates.
S903, the terminal device detects the first PDCCH in the resource location of the first PDCCH, for example, the terminal device may perform PDCCH blind detection in the resource location of the first PDCCH, and for the PDCCH blind detection process, refer to the description of the PDCCH blind detection in the concept interpretation section 8).
As shown in fig. 10, the present application provides a flow of a communication method, and an execution subject of the flow may be a terminal device or a network device. In the embodiments of the present application, a terminal device is taken as an example for description. The process specifically comprises the following steps:
s1001: for a second SS in active BWP for a second cell, the terminal device determines a first SS in active BWP for a first cell.
The terminal equipment can determine the first SS according to the corresponding relation between the second SS and the first SS.
And S1002, the terminal equipment determines the resource position of the first PDCCH according to the first SS.
S1003, the terminal equipment detects the first PDCCH in the resource position of the first PDCCH.
Alternatively, S903 or S1003 may also be described as: and the terminal equipment receives the first PDCCH in the resource position of the first PDCCH, or the terminal equipment monitors (monitor) the first PDCCH in the resource position of the first PDCCH.
It is to be understood that if the above-mentioned flow shown in fig. 9 or fig. 10 is applied to the network device side, the execution process of step S903 or step S1003 may be replaced by: the network equipment sends the first PDCCH in a resource position of the first PDCCH. For example, the candidate resource locations of the first PDCCH may be multiple, and the network device may send the first PDCCH in one of the candidate resource locations of the first PDCCH according to the channel quality at each resource location.
It should be noted that, in the embodiment of the present application, the first cell may correspond to a first CC, and the second cell may correspond to a second CC. Therefore, in the above-mentioned flow shown in fig. 9 or fig. 10, the first cell may be described by replacing the first CC, and the second cell may be described by replacing the second CC, for example, S901 may be alternatively described as: the terminal device determines a first SS of the first CC that activates BWP.
In the embodiment of the present application, for one or more first SSs may be configured in the active BWP of the first cell, and one or more second SSs may be configured in the active BWP of the second cell, where the first SSs and the second SSs may include at least the number of PDCCH candidates under a certain aggregation level. Specifically, the number of PDCCH candidates included in the first SS configured on different BWPs of the first cell may be the same or different. Compared with the scheme that the number of candidate PDCCHs included in the first SSs of different BWPs in the first cell is always the same, the configuration flexibility can be improved.
Optionally, the configuration of the core set may also be performed in the active BWP of the second cell, and the configuration of the core set may not be performed in the active BWP of the first cell, or even if the configuration of the core set is performed in the active BWP of the first cell, the terminal device is not used. The first SS and the second SS may both be of the USS type.
As can be seen from the above, in the embodiment of the present application, flexible association between the first SS and the second SS can be achieved through lower signaling overhead, so as to implement flexible cross-carrier scheduling.
In the embodiment of the present application, the resource location of the first PDCCH may be calculated by using the following formula (2) or formula (3):
Figure BDA0001852914340000221
Figure BDA0001852914340000222
in an example, if only the number of candidate PDCCHs is included in the first SS and the time domain configuration parameter for determining the time domain resource location of the PDCCH is not included, the resource location of the first PDCCH may be calculated using the above formula 2. If the first SS includes both the number of candidate PDCCHs and the time-domain configuration parameter for determining the time-domain resource location of the PDCCH, the resource location of the first PDCCH may be calculated using the above formula 3. The examples are not intended as limitations on the present application. For example, if the first SS includes both the number of candidate PDCCHs and a time domain configuration parameter for determining a PDCCH time domain resource location, the resource location of the first PDCCH may also be calculated by using the above formula 2.
In formula 2 or formula 3, L represents the aggregation level of the first PDCCH, where L is an integer greater than or equal to 0, and for example, a value of L may be 1,2,4,8,16 or another value. smRepresenting the second SS. snRepresenting the first SS. p represents the CORESET associated with the second SS. n isCIRepresenting a CIF of the first cell. And mu represents a parameter set corresponding to the BWP where the second SS is located.
Figure BDA0001852914340000223
And
Figure BDA0001852914340000224
and the time domain resource position of the first PDCCH is represented, for example, the time slot in which the first PDCCH is located.
Figure BDA0001852914340000225
Indicating that the time domain resource position of the first PDCCH is
Figure BDA0001852914340000226
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure BDA0001852914340000227
Is according to a second SS smAnd (4) determining. The above-mentioned
Figure BDA0001852914340000228
Indicating that the time-frequency resource position of the first PDCCH is
Figure BDA0001852914340000229
When it is, the firstA starting location parameter of a frequency domain resource location of a PDCCH, the
Figure BDA00018529143400002210
Is according to the first snAnd (4) determining.
Figure BDA00018529143400002211
Represents the first SS snThe sequence number of the medium candidate PDCCH. N is a radical ofCCE,pRepresenting a second SS smThe number of CCEs included in the associated control resource set p. The above-mentioned
Figure BDA00018529143400002212
Indicates that the second cell is scheduled or capable of scheduling in active BWP of all first cells with the s when the aggregation level is LmCorresponding snThe maximum value of the number of candidate PDCCHs included in (1). The value of i is greater than or equal to 0 and less than or equal to L-1.
Specifically, in equations 2 and 3, when the second SSs aremIn the case of the CSS, the CSS is,
Figure BDA00018529143400002213
when the value of (1) is 0, when the second SS smIn USS, the value can be calculated by the following equation 5
Figure BDA00018529143400002214
Figure BDA00018529143400002215
Specifically, when the first SS snIn the case of the CSS, the CSS is,
Figure BDA00018529143400002216
taking a value of 0 when the first SS snIn USS, the following equation 6 can be used to calculate
Figure BDA00018529143400002219
Figure BDA00018529143400002218
Wherein, in formula 5 and formula 6, Yp,-1=nRNTINot equal to 0; when p mod3 is 0, Ap39827; when p mod3 is 1, Ap39829; when p mod3 is 2, Ap=39839;D=65537。
In the embodiment of the present application, the correspondence relationship between the second SS and the first SS may satisfy the following relationship:
for example, one first SS is configured in the active BWP of the first cell, one or more second SSs are configured in the active BWP of the second cell, and the first SS may correspond to all the second SSs configured in the active BWP of the second cell.
The second cell is taken as a scheduling cell, and the first cell is taken as a scheduled cell. As shown in fig. 11, CC0 denotes a scheduling cell, and CC1 denotes a scheduled cell. Wherein, 4 BWPs are respectively configured in CC0 and CC1, which are BWP1, BWP2, BWP3 and BWP4, the active BWP in CC0 is BWP1, and the active BWP in CC1 is BWP2, and for the active BWP, the oblique line filling part in fig. 11 can be specifically referred.
One or more SSs, and one or more CORESET, may be configured under each BWP in scheduling cell CC0, one associated with each SS. For example, SSs configured under BWP1 may include SS1, SS2, and SS3, configured CORESET may include CORESET1 and CORESET2, SS1 may be associated with CORESET1, and SS2 and SS3 may be associated with CORESET 2. Of course, the above examples are merely illustrative and not intended to limit the embodiments of the present disclosure, for example, SS1, SS2, and SS3 may be associated with CORESET1, or SS1, SS2, and SS3 may be associated with CORESET 2.
One SS may be configured next to each BWP in the scheduled cell CC1 and not configure CORESET or even if configured, the terminal device is not used. In fig. 11, the case where no core set is configured in the scheduled cell CC1 is described as an example. The number of PDCCH candidates included in the SS configured under different BWPs of the scheduled cell CC1 may be the same or different. For example, the numbers of PDCCH candidates included in SS7, SS13, SS2, and SS8 may be the same or different.
In the embodiment of the present application, a corresponding relationship between SS1, SS2 and SS3 in BWP1 in scheduling cell CC0 and SS13 in BWP2 in scheduled cell CC1 can be established. When the terminal device calculates the resource location of the first PDCCH of the scheduled cell CC1 (also referred to as the resource location of PDCCH candidates), the calculation may be performed using the number of PDCCH candidates allocated in the SS 13.
The resource location of the first PDCCH may be calculated using formula 2 or formula 3 above. For example, if the terminal device is monitoring SS1 in the scheduling cell CC0, s is in formula 2 or formula 3 abovemCan be SS1, snThe value of (b) can be SS13, set SS1 to be associated with CORESET1, and p can be CORESET to be CORESET 1. In the embodiment of the present application, as shown in table 4a, when the aggregation level is 2, in scheduling cell CC0, 2 PDCCH candidates are configured in SS1 configured in BWP1, 4 PDCCH candidates are configured in SS4 configured in BWP2, 1 PDCCH candidate is configured in SS7 configured in BWP3, and 5 PDCCH candidates are configured in SS9 configured in BWP 4. In scheduled cell CC1, 2 PDCCH candidates are allocated in SS7 allocated by BWP1, 3 PDCCH candidates are allocated in SS13 allocated by BWP2, 4 PDCCH candidates are allocated in SS2 allocated by BWP3, and 1 PDCCH candidate is allocated in SS8 allocated by BWP 4. When BWP1 is activated in scheduling cell CC0, BWP2 is activated in scheduled cell CC1,
Figure BDA0001852914340000231
the value of (2) is the larger value of the number of PDDCH candidates (2 PDCCH candidates) included in SS1 in the active BWP1 in the scheduling cell CC0 and the number of PDCCH candidates (3 PDCCH candidates) included in SS13 in the active BWP2 in the scheduled cell CC1,
Figure BDA0001852914340000232
is 3. When the aggregation level is 4, it is determined
Figure BDA0001852914340000233
The procedure of (a) is similar to that described above and will not be described again.
TABLE 4a PDCCH candidates number configuration Table
Figure BDA0001852914340000234
It should be noted that, at this time
Figure BDA0001852914340000235
S inmCorresponding to SS1 in active BWP (BWP1) in second cell CC 0. The bold BWP in the table indicates the active BWP in the cell. SS13 is a search space in first cell CC1 active BWP (BWP2) corresponding to SS 1.
Table 4b PDCCH candidate number configuration table
Figure BDA0001852914340000241
Table 4b shows an example of scheduling two first cells (scheduled cells) by one second cell (scheduling cell), and for simplicity of description, only configuration values of the number of PDCCH candidates corresponding to active BWP are shown in table 5. Wherein
Figure BDA0001852914340000242
Is the maximum value of the configuration values of the number of PDCCH candidates in all active BWPs in three cells. That is, according to formula 2 or formula 3, or formula 7, when calculating the locations of PDCCH candidates in the second cell and each first cell, configuration values of the number of PDCCH candidates in all first cells scheduled with the second cell and the second cell are required, rather than considering only the configuration values of the number of PDCCH candidates in the second cell and one first cell. Example two: the method comprises the steps that N first SSs are configured in an activation BWP of a first cell, M second SSs are configured in an activation BWP of a second cell, M and N are positive integers which are larger than or equal to 1, M is smaller than or equal to N, and M second search spaces correspond to M first search spaces one by one.
N first SSs configured in the first cell activation BWP and M second SSs configured in the second cell activation BWP may be ordered according to a certain rule, and a one-to-one correspondence relationship is established. For example, the first SS and the second SS may be sorted in ascending order or in descending order according to their sequence numbers, and a one-to-one correspondence relationship may be established.
For example, the second cell is a scheduling cell CC0, SS1, SS2 and SS3 are configured in active BWP1 of the scheduling cell CC0, the first cell is a scheduled cell CC1, and SS1, SS2 and SS6 are configured in active BWP2 of the scheduled cell. For example, as shown in fig. 12, a corresponding relationship between SS1 and SS1, a corresponding relationship between SS2 and SS2, and a corresponding relationship between SS3 and SS6 may be established. When the active BWP in the scheduling cell CC0 is handed over, if the number M of SSs configured for the active BWP after the handover is less than the number N of SSs configured for the active BWP in the scheduled cell CC1, there may be no SS corresponding to the excess SSs in the active BWP in the scheduled cell CC 1. For example, as shown in fig. 12, when active BWP in CC0 is switched from BWP1 to BWP3, the correspondence relationship between SS7 and SS1, the correspondence relationship between SS8 and SS2, and no corresponding SS in SS6 may be established.
The resource location of the first PDCCH can be calculated using formula 2 or formula 3 above, and in connection with the example shown in fig. 12, the resource location of the first PDCCH can also be referred to as a candidate PDCCH location served by the scheduling cell CC 1. In formula 2 or formula 3, smAnd snThe value of (c) should satisfy the above correspondence, for example, when s in the scheduling cell CC0mWhen SS1 on CC0BWP1 is selected, s that needs to be selected by scheduled cell CC1nSS1 on BWP 2; when scheduling s of a cellmWhen SS2 on CC0BWP1 is selected, s that needs to be selected by scheduled cell CC1nSS2 on CC1BWP 2; when scheduling s of a cellmWhen SS3 on CC0BWP1 is selected, s that needs to be selected by scheduled cell CC1nIs SS6 on CC1BWP 2.
Example three: n first SSs are configured in the active BWP of the first cell, M second SSs are configured in the active BWP of the second cell, M and N are positive integers which are more than or equal to 1, and M is more than or equal to N. The correspondence relationship between the M first SSs and the M second SSs may be established in the manner provided in the above example two, and the M-N second SSs may correspond to any one of the first SSs.
For example, as shown in fig. 13, the second cell is a scheduling cell CC0, SS1, SS2 and SS3 are configured in active BWP1 of the scheduling cell CC0, the first cell is a scheduled cell CC1, and SS4 and SS5 are configured in active BWP1 of the scheduled cell. The correspondence between SS1 and SS4, the correspondence between SS2 and SS5, the correspondence between SS3 and SS4, and the correspondence between SS3 and SS5 may be established, and in the example shown in fig. 13, the correspondence between SS3 and SS5 is established, which is described as an example and not a limitation of the present application, and the correspondence between different SSs may be re-established after the activated BWP of CC1 is switched, for example, when the activated BWP of CC1 is switched to BWP3, the correspondence between SS1 on CC0 and SS3 on CC1, the correspondence between SS2 on CC0 and SS8 on CC1, and the correspondence between SS3 on CC0 and SS9 on CC1 may be re-established. It can be seen that, in the embodiment of the present application, the SS configuration of the scheduled carrier when the base station performs cross-carrier scheduling is simple and flexible, and can support any BWP handover between the scheduling cell and the scheduled cell.
Example four: configuring N first SSs in an active BWP of a first cell, configuring M second SSs in an active BWP of a second cell, wherein M and N are positive integers which are greater than or equal to 1, and the first search space and the second search space satisfy the following corresponding relation: j ═ i mod N;
the terminal device may rank the M second SSs according to a first rule, where i represents a sequence number of the ranked M second search spaces, and a value of i is greater than or equal to 0 and less than or equal to M-1, or a value of i is greater than or equal to 1 and less than or equal to M. The terminal device may rank the N first SSs according to a second rule, where j represents a sequence number of the N first search spaces after ranking, and a value of j is greater than or equal to 0 and less than or equal to N-1, or a value of j is greater than or equal to 1 and less than or equal to N. The first rule and the second rule may specifically be: the SS numbers are arranged in ascending order or descending order, and the present application is not limited thereto.
For example, M is 5, N is 2, the second cell is a scheduling cell CC0, and the first cell is a scheduled cell CC 1. SS3, SS1, SS7, SS5 and SS2 are configured in CC0 in which BWP1 is activated, and SS8 and SS5 are configured in CC1 in which BWP2 is activated. It should be understood that the above SS3, SS1, SS8, etc. refer to serial number IDs of SSs, for example, SS3 may specifically refer to SS ID of 3, and other descriptions are similar and will not be described again.
The SSs configured to activate BWP1 in CC0 may be sorted in ascending order according to SS ID, and the sorted SSs are SS1, SS2, SS3, SS5, and SS7, respectively, according to the value of i from 0 to 4. And sequentially taking values from 0 to 4 for i, and calculating according to j-i mod 3. As can be seen from table 5, when i takes a value of 0, the corresponding value of j takes a value of 0; when i takes a value of 1, the corresponding j takes a value of 1; when i takes a value of 2, the corresponding value of j is 0; when i is 3, the corresponding j is 1; when i takes a value of 4, the corresponding j takes a value of 0.
Table 5 scheduling cell search spaces
Figure BDA0001852914340000251
And arranging the SSs configured by the BWP2 in the CC1 in an ascending order according to the SS ID, wherein the arranged SSs are SS5 and SS6 respectively according to the value of j from 0 to 1. See table 6 below for details.
Table 6 scheduled cell search space
Scheduled cell search space index SS8 SS 5
Search space ordering in SS ID ascending order SS 5 SS 8
j 0 1
It can be seen from table 5 above that, when i takes the value 0, j takes the value 0; when i takes on the value 1, j takes on the value 1; when i takes a value of 2, j takes a value of 0; when i takes on the value 3, j takes on the value 1; when i takes on the value 4, j takes on the value 0. Meanwhile, as can be seen from table 5, when i takes values from 0 to 4, it sequentially corresponds to SS1, SS2, SS3, SS5, and SS7, and as can be seen from table 6, when j takes values from 0 to 1, it sequentially corresponds to SS5 and SS8, so that the corresponding relationship between the SS configured by BWP1 activated by scheduling CC0 and the SS configured by BWP2 activated by scheduled cell CC1 is shown in table 7 and fig. 14 below.
Table 7 mapping relationship of search spaces of scheduling cell and scheduled cell
Figure BDA0001852914340000261
In the embodiments of the present application, the ascending order of SS IDs is taken as an example for description, and the present application is not limited to the examples. For example, the SSs may be sorted in descending order by SS ID, sorted in other ways, and so on.
Optionally, in this embodiment of the application, with respect to the flow shown in fig. 9 or 10, the method may further include: determining a second search space for the second cell to activate BWP; and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
Specifically, the resource location of the second PDCCH includes a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, the frequency domain resource location of the second PDCCH may be specifically located in a CORESET associated with a second SS, the time domain resource location of the second PDCCH may refer to the description of the time domain resource location of the PDCCH in the concept interpretation part 11), and the second search space includes the number of candidate PDCCHs. Optionally, the second search space may further include a time domain configuration parameter for determining a PDCCH time domain resource location.
In one example, the resource location of the second PDCCH can be determined using the following equation 7:
Figure BDA0001852914340000262
wherein L represents an aggregation level of the second PDCCH, L is an integer greater than or equal to 0, and smRepresenting the second search space; p represents a control resource set associated with the second search space, μ represents a parameter set corresponding to the BWP where the second search space is located, and μ represents
Figure BDA0001852914340000263
A time domain resource location representing the second PDCCH, the
Figure BDA0001852914340000264
Indicating that the time-frequency resource position of the second PDCCH is
Figure BDA0001852914340000265
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure BDA0001852914340000266
Is based on said second search space smDetermining; n isCIA carrier indicator field, CIF, representing the second cell; the above-mentioned
Figure BDA0001852914340000267
Represented in said second search space smThe sequence number of the medium candidate PDCCH; said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p; the above-mentioned
Figure BDA0001852914340000268
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included; the value of i is greater than or equal to 0 and less than or equal to L-1.
As shown in fig. 15, in the embodiment of the present application, the set associated with the second search space includes 24 CCEs, and the indexes are 0 to 23 in sequence. For PDCCH candidates with aggregation level L of 2, when 3 PDCCH candidates are configured in the first SS, that is, when the number of PDCCH candidates configured in the first SS is 3, using the above formula 2 or formula 3, 3 PDCCH candidate positions of the first PDCCH can be calculated, where CCE2 and CCE3 correspond to one PDCCH candidate position, CCE10 and CCE11 correspond to one PDCCH candidate position, and CCE18 and CCE19 correspond to one PDCCH candidate position, and for the 3 PDCCH candidate positions of the first PDCCH, see the dotted part in fig. 15 when L is 2. For PDCCH candidates with aggregation level L of 2, when 2 PDCCH candidates are configured in the second SS, that is, when the number of PDCCH candidates configured in the second SS is 2, using equation 7 above, 2 PDCCH candidate positions of the second PDCCH can be calculated, where CCE0 and CCE1 correspond to one PDCCH candidate position, CCE8 and CCE9 correspond to one PDCCH candidate position, and for the 2 PDCCH candidate positions of the second PDCCH, see the slope filling part in fig. 15 when L is 2.
Similarly, for PDCCH candidates with aggregation level L of 4, when 2 PDCCH candidates are configured in the first SS, using formula 2 or formula 3 above, 2 PDCCH candidate positions of the first PDCCH, which may specifically be CCE4 to CCE7, and CCE12 to CCE15, are calculated, where CCE4 to CCE7 correspond to one PDCCH candidate position, and CCE12 to CCE15 correspond to one PDCCH candidate position, and for the 2 PDCCH candidate positions of the first PDCCH, the dot filling part when L is 4 in fig. 15 can be referred to. For PDCCH candidates with aggregation equal to L being 4, when 1 PDCCH candidate is configured in the second SS, using the above equation 7, 1 PDCCH candidate location of the second PDCCH can be calculated, and the PDCCH candidate locations of the second PDCCH can be specifically CCE0 to CCE3, and for the 1 PDCCH candidate location of the second PDCCH, the slant line padding part when L is 4 in fig. 15 can be referred to.
It should be noted that, for one terminal, there may be multiple scheduling cells (second cells), and each scheduling cell may have multiple scheduled cells (first cells). When a plurality of first cells are scheduled by one second cell, each first cell may perform the candidate PDCCH location calculation using the above formula 2 or formula 3. Each second cell may perform the calculation of the candidate PDCCH location using equation 7.
In the embodiments provided in the present application, the method provided in the embodiments of the present application is introduced from the perspective of a network device, a terminal, and interaction between the network device and the terminal. In order to implement the functions in the method provided by the embodiments of the present application, the network device and the terminal may include a hardware structure and/or a software module, and the functions are implemented in the form of a hardware structure, a software module, or a hardware structure and a software module. Whether any of the above-described functions is implemented as a hardware structure, a software module, or a hardware structure plus a software module depends upon the particular application and design constraints imposed on the technical solution.
Similar to the above concept, as shown in fig. 16, the embodiment of the present application further provides an apparatus 1600, and the apparatus 1600 may include a processing module 1601 and a transceiver module 1602.
In a first example, the apparatus 1600 is configured to implement the functions of the terminal device in the foregoing method. The apparatus may be a terminal device, or an apparatus in a terminal device. Wherein the apparatus may be a system-on-a-chip. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices.
The processing module 1601 is configured to determine a first search space of an active bandwidth portion BWP of a first cell, and determine a resource location of a first physical downlink control channel PDCCH according to the first search space. The first PDCCH is used for sending control information of the first cell, and a resource location of the first PDCCH is located in a resource of a second cell. A transceiver module 1602, configured to receive the first PDCCH in a resource location of the first PDCCH. The first cell is different from the second cell.
In a second example, the apparatus 1600 is configured to implement the functions of the network device in the above method. The apparatus may be a network device, or an apparatus in a network device. Wherein the apparatus may be a system-on-a-chip.
The processing module 1601 is configured to determine a first search space of an active bandwidth portion BWP of a first cell and determine a resource location of a first physical downlink control channel PDCCH according to the first search space; a transceiver module 1602, configured to send the first PDCCH in the resource location of the first PDCCH.
For specific implementation procedures of the processing module 1601 and the transceiver module 1602, reference may be made to the descriptions in fig. 9 or fig. 10. The division of the modules in the embodiments of the present application is schematic, and only one logical function division is provided, and in actual implementation, there may be another division manner, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, may also exist alone physically, or may also be integrated in one module by two or more modules. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
Similar to the above concept, as shown in fig. 17, the present application provides an apparatus 1700 for implementing the functions of the terminal device in the above method. The apparatus may be a terminal device, or an apparatus in a terminal device, or the apparatus 1700 is used to implement the function of the network device in the foregoing method, and the apparatus may be a network device, or an apparatus in a network device.
The apparatus 1700 includes at least one processor 1720 for implementing functions of a terminal device or a network device in the method provided by the embodiment of the present application. For example, the processor 1720 may determine a first search space of the active bandwidth portion BWP of the first cell, and determine a resource location of the first physical downlink control channel PDCCH according to the first search space, which is specifically described in the detailed description of the method example and is not described herein again.
Apparatus 1700 may also include at least one memory 1730 for storing program instructions and/or data. Memory 1730 is coupled with processor 1720. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. Processor 1720 may operate in conjunction with memory 1730. Processor 1720 may execute program instructions stored in memory 1730. At least one of the at least one memory may be included in the processor.
Apparatus 1700 may also include a communication interface 1710 for communicating with other devices over a transmission medium, such that the apparatus used in apparatus 1700 may communicate with other devices. Illustratively, the communication interface 1710 may be a transceiver, circuit, bus, module, or other type of communication interface, which may be a terminal device or a network device. Processor 1720 sends and receives data using communication interface 1710 and is configured to implement the methods in the embodiments corresponding to fig. 9 or fig. 10.
The specific connection media between the communication interface 1710, the processor 1720, and the memory 1730 are not limited in this embodiment. In the embodiment of the present application, the memory 1730, the processor 1720, and the transceiver 1710 are connected through the bus 1740 in fig. 17, the bus is represented by a thick line in fig. 17, and the connection manner between other components is only schematically illustrated and is not limited. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 17, but this does not mean only one bus or one type of bus.
In the embodiments of the present application, the processor may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
In the embodiment of the present application, the memory may be a nonvolatile memory, such as a Hard Disk Drive (HDD) or a solid-state drive (SSD), and may also be a volatile memory, for example, a random-access memory (RAM). The memory is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory in the embodiments of the present application may also be circuitry or any other device capable of performing a storage function for storing program instructions and/or data.
According to the method provided by the embodiment of the present application, as shown in fig. 18, a communication system 1800 is further provided, which includes the foregoing network device 1801 and terminal device 1802. For example, the network device may determine a first search space of an active bandwidth portion BWP of a first cell, determine a resource location of a first PDCCH according to the first search space, and send the first PDCCH in the resource location of the first PDCCH. The terminal equipment can determine a first search space of an active bandwidth part BWP of a first cell, determine a resource position of a first physical downlink control channel PDCCH according to the first search space, and receive the first PDCCH in the resource position of the first PDCCH.
The method provided by the embodiment of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network appliance, a user device, or other programmable apparatus. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., an SSD), among others.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (12)

1. A method of communication, comprising:
determining a first search space of an active bandwidth part BWP of a first cell;
determining a resource position of a first Physical Downlink Control Channel (PDCCH) according to the first search space, wherein the first PDCCH is used for sending control information of the first cell, and the resource position of the first PDCCH is located in a resource of a second cell;
detecting the first PDCCH in a resource location of the first PDCCH;
the determining the first search space for active BWP of the first cell comprises:
determining a second search space for active BWP of the second cell;
and determining the first search space according to the corresponding relation between the second search space and the first search space, wherein the resource position of the first PDCCH is located in a control resource set associated with the second search space.
2. The method of claim 1, wherein the number of the first search spaces is one, the first search spaces corresponding to all second search spaces of the second cell.
3. The method of claim 1, wherein the number of the first search spaces is N, the number of the second search spaces is M, M and N are both positive integers greater than or equal to 1, M is less than or equal to N, and the M second search spaces correspond to the M first search spaces one to one.
4. The method of claim 1, wherein the number of the first search spaces is N, the number of the second search spaces is M, both N and M are positive integers greater than or equal to 1, and the jth first search space and the ith second search space satisfy the following correspondence: j ═ imod N;
wherein the value of i is greater than or equal to 0 and less than or equal to M-1, and the value of j is greater than or equal to 0 and less than or equal to N-1.
5. The method of claim 4, wherein the method further comprises:
sequencing the M second search spaces according to a first rule, wherein i represents the sequence numbers of the sequenced M second search spaces;
and sequencing the N first search spaces according to a second rule, wherein j represents the sequence numbers of the N sequenced first search spaces.
6. The method according to any one of claims 1 to 5, wherein the resource location of the first PDCCH comprises a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and the first search space comprises 1 or more candidate PDCCHs;
for the first in the first search space
Figure FDA0003161687420000011
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure FDA0003161687420000012
Resource location of each PDCCH candidate:
Figure FDA0003161687420000013
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0;
s ismRepresenting the second search space;
the p represents a set of control resources associated with the second search space;
the mu represents a parameter set corresponding to the BWP where the second search space is located;
the above-mentioned
Figure FDA0003161687420000014
Represents a time domain resource location of the first PDCCH;
the above-mentioned
Figure FDA0003161687420000015
Indicating that the time domain resource position of the first PDCCH is
Figure FDA0003161687420000016
A starting position parameter of the first PDCCH frequency domain resource position, the
Figure FDA0003161687420000021
Is based on said second search space smDetermining;
s isnRepresenting the first search space;
n isCIA carrier indicator field, CIF, representing the first cell;
the above-mentioned
Figure FDA0003161687420000022
Representing the first search space snThe sequence number of the medium candidate PDCCH;
said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p;
the above-mentioned
Figure FDA0003161687420000023
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs;
the value of i is greater than or equal to 0 and less than or equal to L-1.
7. The method of any one of claims 1 to 5, wherein the resource location of the first PDCCH comprises a frequency domain resource location of the first PDCCH and a time domain resource location of the first PDCCH, and wherein the first search space comprises 1 or more candidate PDCCHs;
for the first in the first search space
Figure FDA0003161687420000024
Determining a resource location of a first PDCCH according to the first search space, including: determining the second according to
Figure FDA0003161687420000025
Resource location of each PDCCH candidate:
Figure FDA0003161687420000026
wherein L represents an aggregation level of the first PDCCH, and is an integer greater than or equal to 0;
s isnRepresenting the first search space;
the p represents a set of control resources associated with the second search space;
n isCIA carrier indicator field, CIF, representing the first cell;
the v represents a parameter set corresponding to the BWP where the first search space is located;
the above-mentioned
Figure FDA0003161687420000027
Represents a time domain resource location of the first PDCCH;
the above-mentioned
Figure FDA0003161687420000028
Indicating that the time-frequency resource position of the first PDCCH is
Figure FDA0003161687420000029
A starting position parameter of a frequency domain resource position of the first PDCCH, the
Figure FDA00031616874200000210
Is based on said first search space snDetermining;
the above-mentioned
Figure FDA00031616874200000211
Representing the first search space snThe sequence number of the medium candidate PDCCH;
said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p;
the above-mentioned
Figure FDA00031616874200000212
Indicating that the second cell is scheduled when the aggregation level is LWith the second search space s in active BWP of all first cellsmCorresponding search space snThe maximum value of the number of the included candidate PDCCHs;
the value of i is greater than or equal to 0 and less than or equal to L-1.
8. The method of any of claims 1 to 5, further comprising:
determining a second search space for the second cell to activate BWP;
and determining a resource position of a second PDCCH according to the second search space, wherein the second PDCCH is used for sending the control information of the second cell, and the resource position of the second PDCCH is located in the resource of the second cell.
9. The method of claim 8, wherein the resource location of the second PDCCH comprises a frequency domain resource location of the second PDCCH and a time domain resource location of the second PDCCH, and wherein the second search space comprises one candidate PDCCH or more;
for the first of the candidate PDCCHs
Figure FDA00031616874200000213
Determining a resource location of a second PDCCH according to the second search space, including: determining the second according to
Figure FDA00031616874200000214
Resource location of each PDCCH candidate:
Figure FDA00031616874200000215
wherein L represents an aggregation level of the second PDCCH, and is an integer greater than or equal to 0;
s ismRepresenting the second search space;
the p represents a set of control resources associated with the second search space;
the mu represents a parameter set corresponding to the BWP where the second search space is located;
the above-mentioned
Figure FDA0003161687420000031
Represents a time domain resource location of the second PDCCH;
the above-mentioned
Figure FDA0003161687420000032
Indicating that the time-frequency resource position of the second PDCCH is
Figure FDA0003161687420000033
A starting position parameter of the second PDCCH frequency domain resource position, the
Figure FDA0003161687420000034
Is based on said second search space smDetermining;
n isCIA carrier indicator field, CIF, representing the second cell;
the above-mentioned
Figure FDA0003161687420000035
Represented in said second search space smThe sequence number of the medium candidate PDCCH;
said N isCCE,pRepresenting the number of Control Channel Elements (CCEs) included in the control resource set p;
the above-mentioned
Figure FDA0003161687420000036
Indicates that the second search space s is included in the active BWP of all the first cells scheduled by the second cell when the aggregation level is LmIn the corresponding search space, the maximum value of the number of the candidate PDCCHs is included;
the value of i is greater than or equal to 0 and less than or equal to L-1.
10. A communication apparatus, characterized in that it comprises means for implementing the method of any of claims 1 to 9.
11. A communications apparatus comprising a processor and a memory, the memory having stored therein instructions that, when invoked, cause the apparatus to perform the method of any of claims 1 to 9.
12. A computer-readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method of any of claims 1 to 9.
CN201811303215.5A 2018-11-02 2018-11-02 Communication method and device Active CN111148259B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201811303215.5A CN111148259B (en) 2018-11-02 2018-11-02 Communication method and device
PCT/CN2019/113768 WO2020088423A1 (en) 2018-11-02 2019-10-28 Communication method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811303215.5A CN111148259B (en) 2018-11-02 2018-11-02 Communication method and device

Publications (2)

Publication Number Publication Date
CN111148259A CN111148259A (en) 2020-05-12
CN111148259B true CN111148259B (en) 2021-10-26

Family

ID=70462977

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811303215.5A Active CN111148259B (en) 2018-11-02 2018-11-02 Communication method and device

Country Status (2)

Country Link
CN (1) CN111148259B (en)
WO (1) WO2020088423A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114640413B (en) * 2020-12-16 2024-01-23 北京紫光展锐通信技术有限公司 Channel monitoring method and device
US20240064789A1 (en) * 2020-12-30 2024-02-22 Beijing Xiaomi Mobile Software Co., Ltd. Parameter determination method, parameter determination apparatus and storage medium
EP4344114A1 (en) * 2021-07-23 2024-03-27 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Pdcch monitoring method and apparatus, and device and storage medium
CN115968020A (en) * 2021-10-13 2023-04-14 中兴通讯股份有限公司 Self-adaptive adjustment method and device of downlink control channel resource and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108111286A (en) * 2017-11-17 2018-06-01 中兴通讯股份有限公司 Information sending, receiving method and device, storage medium, processor
CN108633070A (en) * 2017-03-24 2018-10-09 北京三星通信技术研究有限公司 Semi-static resource scheduling method, Poewr control method and respective user equipment

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10512046B2 (en) * 2016-06-09 2019-12-17 Samsung Electronics Co., Ltd. Method and apparatus for measurement reference signal and synchronization
CN113115443B (en) * 2017-02-27 2022-12-23 维沃软件技术有限公司 Resource allocation indication method, base station and terminal

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108633070A (en) * 2017-03-24 2018-10-09 北京三星通信技术研究有限公司 Semi-static resource scheduling method, Poewr control method and respective user equipment
CN108111286A (en) * 2017-11-17 2018-06-01 中兴通讯股份有限公司 Information sending, receiving method and device, storage medium, processor

Also Published As

Publication number Publication date
CN111148259A (en) 2020-05-12
WO2020088423A1 (en) 2020-05-07

Similar Documents

Publication Publication Date Title
CN110474737B (en) Parameter determination method, monitoring method and communication device
CN113424474B (en) Apparatus and method for transmitting uplink control channel in wireless communication system
KR102208123B1 (en) Method and Apparatus for Transmitting or Receiving a Signal in a Wireless Communication System
CN111742510B (en) Method for transmitting uplink control information in wireless communication system and apparatus using the same
KR102469365B1 (en) Method, apparatus, and system for transmitting and receiving data channels and control channels in a wireless communication system
CN107113150B (en) Method and user equipment for transmitting uplink signal, and method and base station for receiving uplink signal
CN107431606B (en) Reducing blind decoding in enhanced carrier aggregation
CN111148259B (en) Communication method and device
EP3238363B1 (en) Apparatus and method for reception and transmission of control channels in listen-before-talk wireless system
US9602264B2 (en) Method for transmitting uplink control information, user equipment, method for receiving uplink control information, and base station
CN110249572B (en) Method and apparatus for short PDCCH operation
KR101611326B1 (en) Method for transmitting uplink signal, user equipment, method for receiving uplink signal, and base station
US8817726B2 (en) Uplink transmission method and apparatus in wireless communication system
JP2023130336A (en) Channel multiplexing method and multiplexed channel transmission method for wireless communication system, and device using the same
KR20200103801A (en) Communication method and device
US20180376497A1 (en) Control information reception method and user equipment, and control information transmission method and base station
US20230006803A1 (en) Information determination method and device, information adjustment method, threshold usage method, terminal, and storage medium
CN110830216A (en) Method and device for determining number of monitoring PDCCH candidates under carrier aggregation
KR20110081070A (en) Apparatus and method for transmitting data burst using cross-carrier scheduling in wireless communication system supporting multiple component carrier
EP2448158A2 (en) Uplink transmission method and apparatus in wireless communication system
KR20230087488A (en) Uplink transmission method, apparatus and system in wireless communication system
CN107306174B (en) Method, equipment and system for carrier scheduling of carrier aggregation
US10680867B2 (en) Control channel transmission method, network device, and terminal device
CN108400856B (en) Method and device for receiving and sending control information
CN117256114A (en) Method, apparatus and system for transmitting HARQ-ACK codebook in wireless communication system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant