Apparatus, method, and computer program
By optimizing the determination and allocation of downlink control channel candidates using a reduced control resource set size and distance-based function, the method addresses inefficiencies in communication systems, reducing user equipment blocking probabilities and improving performance.
Patent Information
- Authority / Receiving Office
- GB · GB
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-09-09
- Publication Date
- 2026-03-11
AI Technical Summary
Existing communication systems face inefficiencies in determining physical downlink control channel candidates, leading to increased user equipment blocking probabilities due to overlapping channel allocations.
A method and apparatus for determining physical downlink control channel candidates within a control resource set using a reduced control resource set size and setting a distance between candidates, based on a function that considers aggregation levels, maximum candidates, and carrier indicator values, to minimize overlapping and improve channel monitoring efficiency.
Reduces user equipment blocking probabilities by optimizing the allocation of downlink control channel candidates, enhancing communication system performance and efficiency.
Smart Images

Figure 00000000_0000_ABST
Abstract
Description
Field of the disclosure The present disclosure relates to techniques for determining physical downlink control channel candidates in a communication system. Background A communication system can be seen as a facility that enables communication sessions between two or more entities such as communication devices, base stations (BSs) and / or other nodes by providing carriers between the various entities involved in the communications path. The communication system may be a wireless communication system. Examples of wireless systems comprise public land mobile networks (PLMN) operating based on radio standards such as those provided by 3GPP, satellite based communication systems and different wireless local networks, for example wireless local area networks (WLAN). The wireless systems can typically be divided into cells, and are therefore often referred to as cellular systems. The communication system and associated devices typically operate in accordance with a given standard or specification which sets out what the various entities associated with the system are permitted to do and how that should be achieved. Communication protocols and / or parameters which shall be used for the connection are also typically defined. Examples of standard are 4G, 5G or 6G standards. Summary According to an aspect there is provided an apparatus comprising: determining physical downlink control channel candidates to monitor within a control resource setp with a control resource set size, JVCCE p, based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE:P, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. The control resource set size, NCCE p, and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between the physical downlink control channel candidates may be expressed as a number of control channel elements. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The function may use the reduced control resource set size smaller than the control resource set size, NCCE;P, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set the distance between the physical downlink control channel candidates for an aggregation level, L. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, ; or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s, and all carrier indicator values, nc / ; to set the distance between the physical downlink control channel candidates. The apparatus may comprise: determining the reduced control resource set size based on at least one of the control resource set size, NCCE p, and a value, XL. The determining the reduced control resource set size based on the control resource set size, ^cce,p> and the value, XL, may comprise: determining the reduced control resource set size by subtracting the value, XL, from the control resource set size, NCCE:P. The value, XL, may be determined based on at least one of: the control resource set size, A / CCEp; an aggregation level, L; a maximum number of physical downlink control channel candidates, , for an aggregation level, L, a search space s and a carrier indicator value nCI; another control resource set size, CCEK ; or a modulo function, mod. The value, XL, may be determined based on: Xl = 11 + mod(NCCEp / (L x M^CI)) if mod(NCCE,p / (L x M^c])) <N™ rshoot and NCCEp >CCEK to otherwise The apparatus may comprise: receiving, from a base station, the other control resource set size, CCEk . The other control resource set size, CCEK , may be set in standards. The other control resource set size , CCEK , may be selected by the base station amongst a set of control resource set sizes CCEK previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards.. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes, k , previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: determining the other control resource set size, CCEK , based on the index, k . The other control resource set size CCEK may be a first control resource set size, CCEk ,, -* ^starqL) of a first peak of user equipment blocking probability; and the index, k , may be an index, K-start(L)- Alternatively, the other control resource set size, CCEK , may be a first control resource set size , CCE^, of another peak of user equipment blocking probability. A user equipment blocking probability may be defined as the probability that all the physical downlink control channel candidates monitored by a user equipment are blocked by (e.g., overlapped with) physical downlink control channel candidates allocated to other user equipment. The user equipment blocking probability may depend on at least one of: the control resource set size, NCCEp, an aggregation level L or a number of user equipment. The user equipment blocking probability may comprise peaks of user equipment blocking probability. A first peak of user equipment blocking probability may be associated with a first control resource set size, CCEfcstart(L). Each subsequent peak of user equipment blocking probability may be associated with a first control resource set size CCEk(l) . The first control resource set size, CCE^tart(L), may be dependent on at least one of: an index ,Kstart(L)<an aggregation level, L, and a maximum number , of physical downlink control channel candidates for an aggregation level L, a search space s and a carrier indicator value •nci ■ Peaks of user equipment blocking probability may be separated by gaps. A gap between peaks of user equipment blocking probability may depend on at least one of: an aggregation level, L, and a maximum number of physical downlink control channel candidates ,M^, for an aggregation level, L, a search space, s , and a carrier indicator value >nCI- Each peak of user equipment blocking probability may have a number of consecutive control resource set sizes ,N^rshoot (e.g., window). The number of consecutive control resource set sizes ,N^ershoot (e.g., window), of a peak of user equipment blocking probability may be dependent on an aggregation level ,L , (e.g., may be equal to the aggregation level ,L). The index, Kstart(L)> may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The determining control resource set size, CCEK , based on the index, k , may be based on: ccek = cce^ , =Kstart(L) xLx MiK where is a maximum number of physical K Kstart(L) / b»nCl s»nCI ' J downlink control channel candidates for an aggregation level, L, a search space, s , and a carrier indicator value, nCI. The other control resource set size, CCEK , may be a threshold control resource set size, CCEkTh ■ The threshold control resource set size, CCEKth may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. The function may use at least one of: a pseudo-random number, Ypnn ; a physical downlink control channel candidate index, an aggregation level, L; a maximum number of physical downlink control channel candidates, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ; a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: msLnCi ’ (NcCE,p — XL) L • M^ax + nCI mod[(NCCE p - Xl) / L] [ + i The apparatus may be a user equipment. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates to monitor within a control resource setp with a control resource set size, NCCEp, based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEiP, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. The method may be performed by an apparatus. The control resource set size, NCCEjP, and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between the physical downlink control channel candidates may be expressed as a number of control channel elements. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The function may use the reduced control resource set size smaller than the control resource set size, NCCEiP, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set the distance between the physical downlink control channel candidates for an aggregation level, L. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, ; or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s, and all carrier indicator values, nCJ; to set the distance between the physical downlink control channel candidates. The method may comprise: determining the reduced control resource set size based on at least one of the control resource set size, NCCEp, and a value, XL. The determining the reduced control resource set size based on the control resource set size, ^cce,p> and the value, XL , may comprise: determining the reduced control resource set size by subtracting the value, XL, from the control resource set size, iVCCE p. The value, XL, may be determined based on at least one of: the control resource set size, ^cce,p; an aggregation level, L; a maximum number of physical downlink control channel candidates, , for an aggregation level, L, a search space s and a carrier indicator value nCI; another control resource set size, CCEK ; or a modulo function, mod. The value, XL, may be determined based on: Xl = 11 + mod(NCCE>p / (L x M^CI)) if mod(NCCE,p / (L x M^CI)) <fCLhootand ncce,p CCEK to otherwise The method may comprise: receiving, from a base station, the other control resource set size, CCEk . The other control resource set size, CCEK , may be set in standards. The other control resource set size , CCEK , may be selected by the base station amongst a set of control resource set sizes CCEK previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards.. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The method may comprise: receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes, k , previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The method may comprise: determining the other control resource set size, CCEK , based on the index, k . The other control resource set size CCEK may be a first control resource set size, CCE^start(L), of a first peak of user equipment blocking probability; and the index, k , may be an index, ^start(L). Alternatively, the other control resource set size, CCEK , may be a first control resource set size , CCEk(l), another peak of user equipment blocking probability. A user equipment blocking probability may be defined as the probability that all the physical downlink control channel candidates monitored by a user equipment are blocked by (e.g., overlapped with) physical downlink control channel candidates allocated to other user equipment. The user equipment blocking probability may depend on at least one of: the control resource set size, NCCE;P, an aggregation level L or a number of user equipment. The user equipment blocking probability may comprise peaks of user equipment blocking probability. A first peak of user equipment blocking probability may be associated with a first control resource set size, CCEhstart(L). Each subsequent peak of user equipment blocking probability may be associated with a first control resource set size CCE^ . The first control resource set size, CCE^tart(L), may be dependent on at least one of: an index ,Kstart(L> an aggregation level, L, and a maximum number , of physical downlink control channel candidates for an aggregation level L, a search space s and a carrier indicator value >nCI- Peaks of user equipment blocking probability may be separated by gaps. A gap between peaks of user equipment blocking probability may depend on at least one of: an aggregation level , L, and a maximum number of physical downlink control channel candidates for an aggregation level, L, a search space, s , and a carrier indicator value >nCI- Each peak of user equipment blocking probability may have a number of consecutive control resource set sizes ,N^ersh00t (e.g., window). The number of consecutive control resource set sizes ,N^ershoot (e.g., window), of a peak of user equipment blocking probability may be dependent on an aggregation level ,L , (e.g., may be equal to the aggregation level ,L). The index, / cstart(L), may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The determining control resource set size, CCEK , based on the index, k , may be based on: ccek = ccEtstart(M = Kstart(L) xLx M^ncl where is a maximum number of physical downlink control channel candidates for an aggregation level, L, a search space, s , and a carrier indicator value, nCI. The other control resource set size, CCEK , may be a threshold control resource set size, cceKth ■ The threshold control resource set size, CCEKth may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. The function may use at least one of: a pseudo-random number, Ynr,n ; a physical downlink control channel candidate index, m^c / ; an aggregation level, L; a maximum number of physical downlink control channel candidates, Ms(^ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ; a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: L • msLnCi ’ (NcCE,p — XL) L • M^ax + nCI mod[(NCCE p - Xl) / L] [ + i According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCEiP, based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCE:P, based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, ^cce,p. to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates to monitor within a control resource setp with a control resource set size, NCCEiP, based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEiP, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCEiP , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE>P , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the selected physical downlink control channel candidate. The apparatus may be a base station. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NqCEp . based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEiP , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the selected physical downlink control channel candidate. The method may be performed by an apparatus. The apparatus may be a base station. According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, WCCE p , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the selected physical downlink control channel candidate. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCEp , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the selected physical downlink control channel candidate. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCEiP , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to seta distance between the physical downlink control channel candidates; allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the selected physical downlink control channel candidate. According to an aspect there is provided an apparatus comprising: means for determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCE,P , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE:P, to set a distance between the physical downlink control channel candidates; and means for monitoring the physical downlink control channel candidates. The control resource set size, NCCE p , and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between the physical downlink control channel candidates may be expressed as a number of control channel elements. The function may use the reduced control resource set size smaller than the control resource set size, NCCEjP, to set the distance between the physical downlink control channel candidates for an aggregation level, L. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, ; or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ; to set the distance between the physical downlink control channel candidates. The function may use the control resource set size, NCCEp , to set the control resource set p where the physical downlink control channel candidates are located. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The apparatus may comprise: means for determining the reduced control resource set size based on at least one of the control resource set size, NCCEp, and a value, XE. The means for determining the reduced control resource set size based on the control resource set size, NCCEiP, and the value, XL, may comprise: means for determining the reduced control resource set size by subtracting the value, XL , from the control resource set size, NCcE,p. The value, XL , may be determined based on at least one of: the control resource set size, ncce,p; an aggregation level, L; a maximum number of physical downlink control channel candidates, , for an aggregation level L, a search space s and a carrier indicator value nCI; a number of consecutive control resource set sizes of a peak of user equipment blocking probability, N^ershoot; an other control resource set size, CCEK ; or a modulo function mod. The value, XL , may be determined based on: XL = I1 + m°d(WCCEp / (L x if mod(WCCE>p / (L x <N®ershoot and NCCEp >CCEK to otherwise The apparatus may comprise: means for receiving, from a base station, the other control resource set size, CCEK . The other control resource set size, CCEK , may be set in standards. The other control resource set size, CCEK , may be selected by the base station amongst a set of control resource set sizes, CCEK , previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: means for receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes k previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: means for determining the other control resource set size, CCEk , based on the index, k . The other control resource set size, CCEk , may be a first control resource set size, CCEKStart(L) , of a first peak of user equipment blocking probability; and the index, k , is an index, Kstart(L)- The other index Kstart(L) may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The means for determining the other control resource set size, CCEK , may be based on the index, k , may be based on: CCEk = CCEtstart(L) = Kstart(L) X L X Mga where is a maximum number of physical downlink control channel candidates for an aggregation level, L, a search space, s , and a carrier indicator value, ncl. The other control resource set size, CCEK , may be a threshold control resource set size, CCE«th- The threshold control resource set size, CCEKth, may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. The function may use at least one of: a pseudo-random number, Yu ; a physical downlink S‘f control channel candidate index, ; an aggregation level, L; a maximum number of physical downlink control channel candidates, for an aggregation level, L, a search space, s , and all carrier indicator values nc / ; a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: t (fv , msLnCi ’ (NCCE,p - XL) \ , J . L'j(YP,n^f+ ----- (l)------- + nci lmod[(NCCEp) / L]> + i I X L L ’ Ms,max J / J The apparatus may be a user equipment. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCEp , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE,P, to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. The method may be performed by an apparatus. The control resource set size, NCCEiP , and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between the physical downlink control channel candidates may be expressed as a number of control channel elements. The function may use the reduced control resource set size smaller than the control resource set size, NCCEp, to set the distance between the physical downlink control channel candidates for an aggregation level, L. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nct; to set the distance between the physical downlink control channel candidates. The function may use the control resource set size, NCCEp , to set the control resource set p where the physical downlink control channel candidates are located. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The method may comprise: determining the reduced control resource set size based on at least one of the control resource set size, NCCEp, and a value, XL. The determining the reduced control resource set size based on the control resource set size, NCCEp, and the value, XL, may comprise: determining the reduced control resource set size by subtracting the value, XL , from the control resource set size, NCCEp. The value, XL , may be determined based on at least one of: the control resource set size, ncce,p; an aggregation level, L; a maximum number of physical downlink control channel candidates, , for an aggregation level L, a search space s and a carrier indicator value nCI; a number of consecutive control resource set sizes of a peak of user equipment blocking probability, N^ershoot; an other control resource set size, CCEK ; or a modulo function mod. The value, XL , may be determined based on: XL = 11 + m°d(NCCEp / (L x if mod(iVCCEp / (L x <N®ershoot and WCCEp >CCEK to otherwise The method may comprise: receiving, from a base station, the other control resource set size, CCEk . The other control resource set size, CCEK , may be set in standards. The other control resource set size, CCEK , may be selected by the base station amongst a set of control resource set sizes, CCEK , previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The method may comprise: receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes k previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The method may comprise: determining the other control resource set size, CCEK , based on the index, k . The other control resource set size, CCEK , may be a first control resource set size, CCE^stdrt,L. ■ °f a fifSt Pea*< user equipment blocking probability; and the index, k , is an index, Kstart(L). The other index Kstart(L) may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The determining the other control resource set size, CCEK , may be based on the index, k , may be based on: CCEk = CCE*t m = Kstart(L) xLx , K Kstart(L) oLdiLV / ^’“Cl where is a maximum number of physical downlink control channel candidates for an aggregation level, L, a search space, s , and a carrier indicator value, na. The other control resource set size, CCEK , may be a threshold control resource set size, CCEkTh- The threshold control resource set size, CCEKth, may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. n ; a physical downlink S,f The function may use at least one of: a pseudo-random number, Ypn control channel candidate index, ; an aggregation level, L; a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values nc / ; a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: msLnCi ’ (NcCE,p — XL) L • M«ax + nCI mod[(NCCE p) / L] [ + i The apparatus may be a user equipment. According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates to monitor within a control resource setp with a control resource set size, NCCEp , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEiP, to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCEp , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, ^cce,p. to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates to monitor within a control resource setp with a control resource set size, NCCEiP , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE,p, to set a distance between the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising: means for determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCE:P , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCce,p, to set a distance between the physical downlink control channel candidates; and means for allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and means for transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. The apparatus is a base station. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, ncce,p . based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp, to set a distance between the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. The method may be performed by an apparatus. The apparatus is a base station. According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCce,p >based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE,P, to set a distance between the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCEiP , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE p, to set a distance between the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCE:P , based on a function, wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE>p, to set a distance between the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect there is provided an apparatus comprising: means for determining physical downlink control channel candidates to monitor within a control resource set, p , based on a function, wherein the function uses a value, Xm L, to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and means for monitoring the physical downlink control channel candidates. In this disclosure, the expressions “setting an offset” and “setting the value of an offset” may be used interchangeably. In this disclosure, the terms “offset” and “shift” may be used interchangeably. The function may use the value, Xm L , to set an offset for only one physical downlink control channel candidate amongst the physical downlink control channel candidates. The function may use the value, Xm,L, to set an offset for a last physical downlink control channel candidate amongst the physical downlink control channel candidates. The control resource set, p , may have a control resource set size, NCCEp, and the function uses the control resource set size, WCCE p , to set a distance between physical downlink control channel candidates other than the at least one physical downlink control channel candidate amongst the physical downlink control channel candidates. The control resource set size, NCCE p and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between physical downlink control channel candidates other than the at least one physical downlink control channel candidate amongst the physical downlink control channel candidates may be expressed as a number of control channel elements. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nct; to set the distance between the physical downlink control channel candidates. The function may use the control resource set size, NCCE p , to set the control resource set, p , where the physical downlink control channel candidates are located. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The value, XmL , may be determined based on at least one of: the control resource set size, ^cce,p; an aggregation level, L; a physical downlink control channel candidate index, ;a maximum number of physical downlink control channel candidates, , for an aggregation level, L, a search space, s , and a carrier indicator value, nCI; a number of consecutive control resource set sizes of a peak of user equipment blocking probability, N^ershoot; another control resource set size, CCEK ; or a modulo function ,mod. The value Xm.L may be determined based on: XmL =(1 if mod(wccE,P / (l x <^overshoot’ m^nc! = L -1 and WCCEp >CCEK to otherwise The apparatus may comprise: means for receiving, from a base station, the control resource set size, CCEKV The other control resource set size, CCEK , may be set in standards. The other control resource set size, CCEK , may be selected by the base station amongst a set of control resource set sizes, CCEK , previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: means for receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes, k , previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The apparatus may comprise: means for determining the other control resource set size, CCEk , based on the index, k . The other control resource set size, CCEK , may be a first control resource set size, CCE^startf[ i, of a first peak of user equipment blocking probability; and the index, k , may be an index, Kstart(L). The index, Kstart(L), may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The means for determining the other control resource set size, CCEK , based on the index, k , is based on: ccek = ccE^start(L) = Kstart(L) x L x where is a maximum number of physical downlink control channel candidates for an aggregation level, L, a search spaces and a carrier indicator value, nCI. The other control resource set size, CCEK , may be a threshold control resource set size, cceKth. The threshold control resource set size, CCEKth , may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. The function may use at least one of: a pseudo-random number, Y.- a physical downlink control channel candidate index, , ; an aggregation level, I; a maximum number of physical downlink control channel candidates, Ms(^iax, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ; a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: L • . L'M^ax . — L + nCI I mod[(NCCE p) / L| The apparatus may be a user equipment. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates to monitor within a control resource set, p , based on a function, wherein the function uses a value, XmL, to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. The method may be performed by an apparatus. In this disclosure, the expressions “setting an offset” and “setting the value of an offset” may be used interchangeably. In this disclosure, the terms “offset” and “shift” may be used interchangeably. The function may use the value, XmL, to set an offset for only one physical downlink control channel candidate amongst the physical downlink control channel candidates. The function may use the value, XmL, to set an offset for a last physical downlink control channel candidate amongst the physical downlink control channel candidates. The control resource set, p , may have a control resource set size, JVCCEp; and the function uses the control resource set size, NCCEiP , to set a distance between physical downlink control channel candidates other than the at least one physical downlink control channel candidate amongst the physical downlink control channel candidates. The control resource set size, NCCE p and / or the reduced control resource set size may be expressed as a number of control channel elements. The distance between physical downlink control channel candidates other than the at least one physical downlink control channel candidate amongst the physical downlink control channel candidates may be expressed as a number of control channel elements. The function may use at least one of: an aggregation level, L; a physical downlink control channel candidate index, ; or a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ; to set the distance between the physical downlink control channel candidates. The function may use the control resource set size, NCCEiP , to set the control resource set, p , where the physical downlink control channel candidates are located. The location of a physical downlink control channel candidate may be expressed as an index of a control channel element. The value, Xm.L , may be determined based on at least one of: the control resource set size, JVCCEp; an aggregation level, L; a physical downlink control channel candidate index, m^cf ;a maximum number of physical downlink control channel candidates, , for an aggregation level, L, a search space, s , and a carrier indicator value, nCI; a number of consecutive control resource set sizes of a peak of user equipment blocking probability, N^ersh00t; another control resource set size, CCEK ; or a modulo function ,mod. The value XmL may be determined based on: XmL =(1 if mod(WCCE,p / (l x ^s,nCI)) <Notershoof ms^riCI = L -1 and NCCEp >CCEK to otherwise The method may comprise: receiving, from a base station, the control resource set size, CCEK . The other control resource set size, CCEK , may be set in standards. The other control resource set size, CCEK , may be selected by the base station amongst a set of control resource set sizes, CCEK , previously received from the base station (e.g., configured). The other control resource set sizes, CCEK , may be received via radio resource control signaling or via a SearchSpace information element. The other control resource set sizes, CCEK , may be set in standards. The other control resource set size, CCEK , may be received via radio resource control signaling or via medium access control control element. The method may comprise: receiving, from a base station, an index, k . The index, k , may be selected by the base station amongst a set of indexes, k , previously received from the base station (e.g., configured). The set of indexes, k , may be received via radio resource control signaling or via a SearchSpace information element. The set of indexes, k , may be set in standards. The index, k , may be received via radio resource control signaling or via medium access control control element. The method may comprise: determining the other control resource set size, CCEK , based on the index, k . The other control resource set size, CCEK , may be a first control resource set size, CCEKstart(L)’ °fa f'rst Peak °fuser equipment blocking probability; and the index, k , may be an index, Kstart(L)- The index, Kstart(L), may be dependent on at least one of: an aggregation level, L; or a number of user equipment. The determining the other control resource set size, CCEK , based on the index, k , is based on: ccek = cce£ = Kstart(L) xLx where is a maximum number of physical downlink control channel candidates for an aggregation level, L, a search space s and a carrier indicator value, ncl. The other control resource set size, CCEK , may be a threshold control resource set size, The threshold control resource set size, CCEKth , may not be dependent on at least one of: an aggregation level, L; or a number of user equipment. The function may use at least one of: a pseudo-random number, Ynnn ; a physical downlink control channel candidate index, ; an aggregation level, L; a maximum number of physical downlink control channel candidates, Ms(^ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nC[\ a carrier indicator value, nc / ; a modulo function, mod; or an integer, i. The function may be based on: ( / -N \ A L ’ ) I Yp,n% + —J „(l)—“ — Xm,L + nci I mod[(NCCE p) / L] [ + i S|' lj™s,max / J The apparatus may be a user equipment. According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates to monitor within a control resource set, p , based on a function, wherein the function uses a value, to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates to monitor within a control resource set, p , based on a function, wherein the function uses a value, Xm>L, to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates to monitor within a control resource set, p , based on a function, wherein the function uses a value, XmL, to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and monitoring the physical downlink control channel candidates. According to an aspect there is provided an apparatus comprising: means for determining physical downlink control channel candidates within a control resource set, p , based on a function, wherein the function uses a value, XmL , to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and means for allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and means for transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. The apparatus may be a base station. According to an aspect there is provided a method comprising: determining physical downlink control channel candidates within a control resource set, p , based on a function, wherein the function uses a value, Xm L , to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and r transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. The method may be performed by an apparatus. The apparatus may be a base station. According to an aspect there is provided an apparatus comprising at least one processor and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: determining physical downlink control channel candidates within a control resource set, p , based on a function, wherein the function uses a value, Xm>L , to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and r transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect there is provided an apparatus comprising circuitry configured to perform: determining physical downlink control channel candidates within a control resource set, p , based on a function, wherein the function uses a value, , to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and r transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect there is provided a computer program comprising computer executable code which when run on at least one processor is configured to perform: determining physical downlink control channel candidates within a control resource set, p , based on a function, wherein the function uses a value, Xm>L , to set on offset for at least one physical downlink control channel candidate amongst the physical downlink control channel candidates; and allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and r transmitting the physical downlink control channel on the allocated physical downlink control channel candidate. According to an aspect, there is provided a computer readable medium comprising program instructions stored thereon for performing at least one of the above methods. According to an aspect, there is provided a non-transitory computer readable medium comprising program instructions stored thereon for performing at least one of the above methods. According to an aspect, there is provided a non-volatile tangible memory medium comprising program instructions stored thereon for performing at least one of the above methods. In the above, many different aspects have been described. It should be appreciated that further aspects may be provided by the combination of any two or more of the aspects described above. Various other aspects are also described in the following detailed description and in the attached claims. List of abbreviations AF: Application Function AL: Aggregation Level AMF: Access and Mobility Management Function BS: Base Station CCE: Control Channel Element CSS: Common Search Space CORESET: Control Resource Set CU: Centralized Unit DCI: Downlink Control Information DL: Downlink DU: Distributed Unit gNB: gNodeB IE: Information Element loT: Internet of Things LTE: Long Term Evolution MIB : Master Information Block MS: Mobile Station MTC: Machine Type Communication NEF: Network Exposure Function NF: Network Function NR: New radio NRF: Network Repository Function OFDM: Orthogonal Frequency Division Multiplexing PLMN: Public Land Mobile Network PUCCH: Physical Uplink Control Channel PUSCH: Physical Uplink Shared Channel PDCCH: Physical Downlink Control Channel RAM: Random Access Memory (R)AN: (Radio) Access Network RACH: Random Access Channel RB: Resource Block REG: Resource Element Group ROM: Read Only Memory SIB: System Information Block SSB: Synchronisation Signal Block UE: User Equipment USS: User Equipment specific Search Space 4G: 4th Generation 5G: 5th Generation 5GC: 5G Core network 5GS: 5G System 6G: 6th Generation Brief Description of the Figures Embodiments will now be described, by way of example only, with reference to the accompanying Figures in which: Fig. 1 shows a schematic representation of an example 5G system; Fig. 2 shows a schematic representation of an example control apparatus; Fig. 3 shows a schematic representation of an example user equipment; Fig. 4 shows an example of physical downlink control channel candidates for a user equipment; Fig. 5 shows an example of physical downlink control channel candidates for ten user equipment; Fig. 6 shows an example of a graph of a user equipment blocking probability as a function of a control resource set size for an aggregation level one and for a number of user equipment equal to ten, twenty, thirty and forty and an overall user equipment blocking probability as a function of a control resource set size for a number of user equipment equal to ten, twenty, thirty and forty calculated for an existing hashing function; Fig. 7 shows an example of a graph of a user equipment blocking probability as a function of a control resource set size for an aggregation level two and for a number of user equipment equal to ten, twenty, thirty and forty and an overall user equipment blocking probability as a function of a control resource set size for a number of user equipment equal to ten, twenty, thirty and forty calculated for an existing hashing function; Fig. 8 shows an example of a graph of a user equipment blocking probability for an existing hashing function as a function of a control resource set size for an aggregation level four and for a number of user equipment equal to ten, twenty, thirty and forty and an overall user equipment blocking probability as a function of a control resource set size for a number of user equipment equal to ten, twenty, thirty and forty calculated for an existing hashing function; Fig.9a and Fig.9b shows an example of a signaling diagram of a method for determining physical downlink control channel candidates; Fig. 10a shows an example of a graph of a user equipment blocking probability as a function of a control resource set size for an aggregation level one and for a number of user equipment equal to thirty calculated for an existing hashing function and hashing functions according to a first solution, a second solution and a third solution; Fig. 10b shows an example of a graph of a user equipment blocking probability as a function of a control resource set size for an aggregation level two and for a number of user equipment equal to twenty calculated for an existing hashing function and hashing functions according to a first solution, a second solution and a third solution; Fig. 11a shows an example of a graph of an overall user equipment blocking probability as a function of a control resource set size for a number of user equipment equal to fifteen calculated for an existing hashing function and hashing functions according to a first solution, a second solution and a third solution; Fig. 11b shows an example of a graph of an overall user equipment blocking probability as a function of a control resource set size for a number of user equipment equal to twenty five calculated for an existing hashing function and hashing functions according to a first solution, a second solution and a third solution; Fig. 12 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a first solution performed by the user equipment; Fig. 13 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a first solution performed by a base station; Fig. 14 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a second solution performed by the user equipment; Fig. 15 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a second solution performed by a base station; Fig. 16 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a third solution performed by the user equipment; Fig. 17 shows a block diagram of an example of a method for determining physical downlink control channel candidates according to a third solution performed by a base station; and Fig. 18 shows a schematic representation of a non-volatile memory medium storing instructions which when executed by a processor allow a processor to perform one or more of the steps of the method of any of Fig. 12 to Fig. 17. Detailed Description of the Figures In the following certain embodiments are explained with reference to mobile communication devices capable of communication via a wireless cellular system and mobile communication systems serving such mobile communication devices. Before explaining in detail the exemplifying embodiments, certain general principles of a wireless communication system, access systems thereof, and mobile communication devices are briefly explained with reference to Fig. 1, Fig.2 and Fig.3 to assist in understanding the technology underlying the described examples. FIG. 1 shows a schematic representation of an example 5G system (5GS). The 5GS may comprises user equipment (UEs), a (radio) access network ((R)AN), a 5G core network (5GC), one or more application functions (AF) and one or more data networks (DN). The 5G (R)AN may comprise one or more base stations (BSs). The one or more BSs may comprise one or more gNodeBs (gNBs). The gNodeBs may comprise one or more gNB distributed unit functions connected to one or more gNB centralized unit functions. The gNodeBs may comprise activator gNodeBs, reader gNodeBs or activator and reader gNodeBs. The 5GC may comprise an access and mobility management function (AMF), a session management function (SMF), an authentication server function (AUSF), a user data management (UDM), a user plane function (UPF), a network exposure function (NEF). It will be understood that although solutions for determining physical downlink control channel (PDCCH) candidates are discussed in the context of a 5GS, these solutions may be used with other communication systems, in particular a 6GS. It will be understood that other communication systems, in particular a 6GS, may comprise some or all of the components of a 5GS. Fig. 2 illustrates an example of a control apparatus 200 for controlling a function of the (R)AN or the 5GC as illustrated on Fig. 1. The control apparatus may comprise at least one random access memory (RAM) 211a, at least on read only memory (ROM) 211b, at least one processor 212, 213 and an input / output interface 214. The at least one processor 212, 213 may be coupled to the RAM 211a and the ROM 211b. The at least one processor 212, 213 may be configured to execute an appropriate software code 215. The software code 215 may for example allow to perform one or more steps to perform one or more of the present aspects. The software code 215 may be stored in the ROM 211b. The control apparatus 200 may be interconnected with another control apparatus 200 controlling another function of the 5G (R)AN or the 5GC. In some embodiments, each function of the (R)AN or the 5GC comprises a control apparatus 200. In alternative embodiments, two or more functions of the (R)AN or the 5GC may share a control apparatus. Fig. 3 illustrates an example of a user equipment 300, such as the user equipment illustrated on Fig. 1. The UE 300 may be provided by any device capable of sending and receiving radio signals. Non-limiting examples comprise a mobile station (MS) or mobile device such as a mobile phone or what is known as a ’smart phone’, a computer provided with a wireless interface card or other wireless interface facility (e.g., USB dongle), a personal data assistant (PDA) or a tablet provided with wireless communication capabilities, a machine-type communications (MTC) device, an Internet of things (loT) device or any combinations of these or the like. The UE 300 may provide, for example, communication of data for carrying communications. The communications may be one or more of voice, electronic mail (email), text message, multimedia, data, machine data and so on. The UE 300 may receive signals over an air or radio interface 307 via appropriate apparatus for receiving and may transmit signals via appropriate apparatus for transmitting radio signals. In Fig. 3 transceiver apparatus is designated schematically by block 306. The transceiver apparatus 306 may be provided for example by means of a radio part and associated antenna arrangement. The antenna arrangement may be arranged internally or externally to the mobile device. The UE 300 may be provided with at least one processor 301, at least one memory ROM 302a, at least one RAM 302b and other possible components 303 for use in software and hardware aided execution of tasks it is designed to perform, including control of access to and communications with access systems and other communication devices. The at least one processor 301 is coupled to the RAM 302b and the ROM 302a. The at least one processor 301 may be configured to execute an appropriate software code 308. The software code 308 may for example allow to perform one or more of the present aspects. The software code 308 may be stored in the ROM 302a. The processor, storage and other relevant control apparatus can be provided on an appropriate circuit board and / or in chipsets. This feature is denoted by reference 304. The device may optionally have a user interface such as keypad 305, touch sensitive screen or pad, combinations thereof or the like. Optionally one or more of a display, a speaker and a microphone may be provided depending on the type of the device. A BS may schedule a physical uplink shared channel (PUSCH) and a physical downlink shared channel (PDSCH) by transmitting a physical downlink control channel (PDCCH) to a UE. The PDCCH may convey downlink control information (DCI) comprising information for transmission of PUSCH by the UE and reception of PDSCH by the UE. Unlike PUSCH and PDSCH, the BS may not schedule the PDCCH by transmitting a channel to the UE. The UE may perform blind decoding of PDCCH candidates in a search space associated with a control resource set (CORESET). The CORESET may span over one, two, or three contiguous orthogonal frequency-division multiplexing (OFDM) symbols and over multiple resource blocks (RBs). A RB may comprise twelve subcarriers. The search space may comprise PDCCH candidates. Each PDCCH candidate may comprise one, two, four, eight or sixteen control channel elements (CCEs). The number of CCEs may be defined by an aggregation level (AL). A CCE may comprise six resource element groups (REGs). A REG may comprise twelve resource elements (REs) in one OFDM symbol. A CCE may be identified by a CCE index. The search space may comprise a common search space (CSS) commonly monitored by a group of UEs or a UE-specific search space (USS) monitored by a specific UE. The BS may allocate a PDCCH candidate amongst the PDCCH candidates. The BS may transmit the PDCCH on the allocated PDCCH candidate Fig. 4 shows an example of PDCCH candidates for a UE. Here, the CORESET comprises sixty-four CCEs. The search space of the UE comprises six PDCCH candidates. Each PDCCH candidate comprises one CCE (i.e., aggregation level one). The PDCCH candidates over which a UE is expected to perform the blind decoding may be determined by a hashing function. A criterion for the design of the hashing function is the UE blocking probability and / or the overall UE blocking probability. The UE blocking probability may refer to the probability that all PDCCH candidates monitored by a UE are blocked by (e.g., overlap with) PDCCH candidates allocated to other UEs so that the UE cannot receive the PDCCH, when each PDCCH candidate monitored by the UE comprises a specific number of CCEs (i.e., specific aggregation level). The overall UE blocking probability may refer to the probability that all PDCCH candidates monitored by a UE are blocked by (e.g., overlap with) PDCCH candidates allocated to other UEs so that the PDCCH for the UE cannot be transmitted, when each PDCCH candidate monitored by the UE comprise any number of CCEs (i.e., any aggregation level). The overall UE blocking probability may be an average of all UE blocking probabilities of a serving cell. Fig. 5 shows an example of PDCCH candidates for ten UEs. Here, the CORESET comprises sixty-four CCEs. The search space of a UE2 comprises one PDCCH candidate. The PDCCH candidate comprises sixteen CCEs (i.e., aggregation level sixteen). The search space of a UE5 comprises two PDCCH candidates. Each PDCCH candidate comprises eight CCEs (i.e., aggregation level eight). The PDCCH candidate of the UE2 is blocked by a PDCCH candidate allocated to the UE5. The PDCCH cannot be transmitted for UE2. Likewise, the search space of a UE8 comprises one PDCCH candidate. The PDCCH candidate comprises sixteen CCEs (i.e., aggregation level sixteen). The search space of a UE9 comprises two PDCCH candidates. Each PDCCH candidate comprises eight CCEs (i.e., aggregation level eight). The PDCCH candidate of the UE8 is blocked by a PDCCH candidate allocated to the UE9. The PDCCH cannot be transmitted for UE8. The hashing function may be designed to reduce or minimize the UE blocking probability. An existing hashing function is defined in 3GPP TS 38.123 (clause 10.1) as follows. For a search space set s associated with CORESET p. the CCE indexes for aggregation level L corresponding to PDCCH candidate of the search space set in slot for an active DL 's ' ^CCE v L ■ 1 ‘^max + na modpVccE,P / h] + i BWP of a serving cell corresponding to carrier indicator field value nCI, or corresponding to value nCI of nCI-Value associated with a set of serving cells MC-DCI-SetojCells, are given by Y n + V’ns,f where for any CSS, Y u = 0; P'ns,f for a USS, Yn = (a„ ■ Yn a , ) modD, Yv -i = nRNTI #= 0, A„ = 39827 for pmod3 = 0, Ap = 39829 for pmod3 = 1, Ap = 39839 for pmod3 = 2, and D = 65537; i = 0,-,L- 1; ^cce,p is the number of CCEs, numbered from 0 to NCCEp — 1, in CORESET p and, if any, per RB set; nCI is - the carrier indicator field value, if provided by cif-InSchedulingCell in CrossCarrierSchedulingConfig for the serving cell on which PDCCH is monitored, except for scheduling of the serving cell from the same serving cell in which case nC[ = 0; - the nCI-Value, if provided, for the set of serving cells MC-DCI-SetojCells', - otherwise, including for any CSS, na = 0 msLnr, = 0»_ 1, where is the number of PDCCH candidates the UE is s>nci s>nci s>nci configured to monitor for aggregation level L of a search space set s for a serving cell corresponding to nC / -, for any CSS, = for a USS, M^ax is the maximum of M^CI over all configured nc / values for a CCE aggregation level L of search space set s ; the RNTI value used for nRNTI is the C-RNTI, may be configured via radio resourse signaling. M^cr may be configured via a SearchSpace information element (IE). SearchSpace information element - ASNISTART - TAG-SEARCHSPACE-START SearchSpace ::= SearchSpace Id control Resource SctI d SEQUENCE| SearchSpaceld, ControlRcsourccSctld OPTIONAL. - Cond SctupOnh monitoringSlotPcriodicih Andbffsct Cl IO1CE { sll sl2 NULL. INTEGER (OJ.l). sI4 s!5 INTEGER (().;3). INTEGER (0..4). S18 INTEGER (0,.7). si 10 INTEGER (0..9), si 16 INTEGER (0..15). sl20 INTEGER (0..19). s!40 IN 1 EGER (0,..39). s!80 INTEGER (0..79). si 160 INTEGER (0..159), S1320 INTEGER (0..319). sI640 INTEGER (0..639). si 1280 INTEGER (0.. 1279). sl2560 INTEGER (0..2559) J OPTIONAL. -Cond Sctup4 du rat ion Need S INTEGER (2.,2559) OPTIONAL. - monitoringS' mbolsWithinSlot BIT STRING (SIZE (14)) OPTIONAL. - Cond Setup nrofCandidatcs SEQUENCE{ aggregationLevel 1 ENUMERATED {n0, nl, n2, n3, n4, n5, n6, n8}, aggregationLeve!2 ENUMERATED {n0, nl, n2, n3, n4, n5, n6, n8}, aggregationLeve!4 ENUMERATED {n0, nl, n2, n3, n4, n5, n6, n8}, aggregationLevel8 ENUMERATED {n0, nl, n2. n3, n4, n5, n6, n8}. aggregationLevel 16 ENUMERATED {n0, nl, n2, n3. n4, n5, n6,118} The UE blocking probability calculated for the existing hashing function may depend on a CORESET size, an aggregation level and / or a number of (scheduled) UEs. 5 Fig. 6 shows an example of a graph of a UE blocking probability as a function of a CORESET size for an aggregation level one and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty and an overall UE blocking probability as a function of a CORESET size for a number of (scheduled) UEs equal to ten, twenty, thirty and forty calculated for the existing 10 hashing function. Fig. 7 shows an example of a graph of a UE blocking probability as a function of a CORESET size for an aggregation level two and fora number of (scheduled) UEs equal to ten, twenty, thirty and forty and an overall UE blocking probability as a function of a CORESET size for a 15 number of (scheduled) UEs equal to ten, twenty, thirty and forty calculated for an existing hashing function. Fig. 8 shows an example of a graph of a UE blocking probability as a function of a CORESET size for an aggregation level four and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty and an overall UE blocking probability as a function of a CORESET size for a number of (scheduled) UEs equal to ten, twenty, thirty and forty calculated for an existing hashing function. pmf_AL may refer to a probability mass function for aggregation level [1,2,4,8,16] and M_AL may refer to a number of PDCCH candidates for aggregation level [1,2,4,8,16], As can be seen, the UE blocking probability may significantly increase for certain CORESET sizes. In other words, the UE blocking probability may comprise peaks of UE blocking probability for certain CORESET sizes. In this disclosure, the expression “peak” or “overshoot” may be used interchangeably. For example, for aggregation level one and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty (see Fig. 6), the UE blocking probability may comprise a peak of UE blocking probability for a CORESET size equal to thirty-six CCEs. For aggregation level two and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty (see Fig. 7), the UE blocking probability may comprise a peak of UE blocking probability for a CORESET size equal to twenty-six CCEs and twenty-seven CCEs. For aggregation level four and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty (see Fig. 7), the UE blocking probability may comprise a peak of UE blocking probability for a CORESET size equal to forty-eight CCEs, forty-nine CCEs, fifty CCEs and fifty-one CCEs. Aggregation level one, two and four may be the most used aggregation levels. However, other aggregation levels (e.g., three, five, seven, eight or sixteen) may be used as well and the same behaviour may be observed. One or more aspect of this disclosure relates to providing a new hashing function to determine PDCCH candidates within a CORESET p with a CORESET size NCCE,P. One or more aspect of this disclosure relates to providing a new hashing function that reduces or minimizes peaks in UE blocking probability and / or in overall UE blocking probability. In this disclosure, the expression “hashing function” or “function” may be used interchangeably. Preliminary observation As explained above, the UE blocking probability calculated for the existing hashing function may comprise peaks of UE probability. Each peak of UE blocking probability may have a number of consecutive CORESET sizes , ,. (e.g., window). The number of consecutive CORESET sizes , _ (e.g., window) of a peak of UE blocking probability may be dependent on an aggregation level L. The number of consecutive CORESET sizes N^ersh00t of a peak of UE blocking probability may be based on: Peaks of UE blocking probability may be separated by gaps CCE^ (e.g., steps). A gap CCEggp between peaks of UE blocking probability may be expressed as a number of CCEs. A gap CCEggp between peaks of UE blocking probability may depend on at least one of: an aggregation level L and a maximum number of PDCCH candidates for an aggregation level L, a search space s and a carrier indicator value nCI. A gap CCE^p between peaks of UE blocking probability may be based on: CCE W I v gap L x Ms,nCI Each peak of UE blocking probability may be associated with a single CORESET size or with multiple consecutive CORESET sizes. A first peak of UE blocking probability may be associated with a first CORESET size CCEL and / or consecutive CORESET sizes CCE^start+i(L)< ■■■ CCE^start+L_1(L). Each subsequent peak of UE blocking probability may be associated with a first CORESET size CCE^, and / or consecutive CORESET sizes CCE*+1(l), ... CCE^+l_1(l). The first CORESET sizes may be expressed as a number of CCEs. The first CORESET size CCEKStart(L) may be dependent on a number of (scheduled) UEs. The first CORESET size CCEt ..,,,, may be dependent on at least one of: an index.an '■Srdlll Lj vSvdI Tt U J aggregation level L and a maximum number of PDCCH candidates for an aggregation level L, a search space s and a carrier indicator value nCI. The first CORESET size CCE^start(L) may be based on: CCEKstart(L) — KKstart(L) X X ^s,nCi For example, for aggregation level one and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty (see Fig. 6), the first CORESET size CCE^start(L. may be twelve CCEs, eighteen CCEs, twenty-four CCEs and thirty CCEs. Therefore, the index KKstart(L) may be two, three, four and five. First solution The hashing function may be based on pseudo-random number Yp nn , index m^C[, a reduced CORESET size smaller than the CORESET size NCCE p, an aggregation level L, a maximum number of PDCCH candidates Ms®axfor an aggregation level L, a search spaces and all carrier indicator values nCh a carrier indicator value ncl, a modulo function mod and / or an integer i. The hashing function may use a reduced CORESET size smaller than the CORESET size NCCEp and / or an aggregation level L to set a portion of the CORESET p where the PDCCH candidates are located. It will be understood that the CORESET size NCCE p and / or the reduced CORESET size may be expressed as a number of CCEs. It will be understood that the location of a PDCCH candidate may be expressed as an index of a CCE. The hashing function may use a PDCCH index the reduced CORESET size smaller than the CORESET size NCCEp, an aggregation level L, and / or or a maximum number of PDCCH candidates Mj^axfor an aggregation level L, a search space s and all carrier indicator values nC{ to set the distance between the PDCCH candidates. It will be understood that the distance between the PDCCH candidates may be expressed as a number of CCEs. The hashing function may be based on: L • \ P-nsf + msLnCI ’ (^CCE,p — *l) + nc^ mod[(NCCEp - XL) / Lj| + i where, for example: for any CSS, =0; V'ns,f for a USS, Yu = (ap-Yu ^modD , Yp = nRNT1 * 0 , / 1. = 39827 for pmod3 = 0 , Ap = 39829 for pmod3 = 1, Ap = 39839 for pmod3 = 2 , and D = 65537; i = 0,.. ■, L - 1; / VCCE;P is the number of CCEs, numbered from 0 to NCCEiP - 1, in CORESET p and, if any, per RB set; nCi is - the carrier indicator field value, if provided by cif-lnSchedulingCell in CrossCarrierSchedulingConfig for the serving cell on which PDCCH is monitored, except for scheduling of the serving cell from the same serving cell in which case nci = 0; - the nCI-Value, if provided, for the set of serving cells MC-DCI-SetofCells; - otherwise, including for any CSS, nCI = 0 = - 1, where is the number of PDCCH candidates the UE s>nci s,nci ’ s,nCi is configured to monitor for aggregation level L of a search space set s for a serving cell corresponding to nc / ; for any CSS, = Ms#'> for a USS, M^ax is the maximum of M^ci over all configured nCI values for a CCE aggregation level L of search space set s ; the RNTI value used for nRNTI is the C-RNTI. The reduced CORESET size may be obtained by subtracting a parameter XL from the CORESET size NCCEp. The parameter XL may be based on a modulo function mod, a CORESET size 7VCCE>P of a CORESET p, an aggregation level L, a maximum number of PDCCH candidates M^Jor an aggregation level L, a search space s and a carrier indicator values nCI, a number of consecutive CORESET sizes N^ershoot of a peak of UE blocking probability and / or CORESET size CCEk . It will be understood that the CORESET size CCEK may be different from the CORESET size JVCce,p of the CORESET p. The CORESET size CCEK may be smaller than the CORESET size NCCEp of the CORESET p. As will be apparent below the CORESET size CCEK may comprise the first CORESET size CCEKStart(L) associated with the first peak of UE blocking probability. Alternatively, the CORESET size CCEK may comprise a threshold CORESET size CCEKra. The parameter XL may be equal to or greater than one. The parameter XL may be determined so that the reduced CORESET size is the largest CORESET size not resulting in a peak in UE blocking capability. For example, for aggregation level one and for a number of (scheduled) UEs equal to ten, twenty, thirty and forty (see Fig. 6), the first CORESET size CCE^tartrL. may be twelve CCEs, eighteen CCEs, twenty-four CCEs and thirty CCEs. Therefore, the parameter XL may be determined so that the reduced CORESET size is eleven CCEs. Seventeen CCEs, twenty-three CCEs and twenty-nine CCEs. The parameter XL may be determined so that the reduced CORESET size is smaller than the largest CORESET size not resulting in a peak in UE blocking capability. However, the smaller the reduced CORESET size the larger the UE block probability (i.e., the reduced CORESET size may be unnecessarily small limiting the number of CCEs for locating PDCCH candidates). The parameter XL may be based on: X| = I 1 + mod(JVCCEp / (L x if mod(JVCCE,p / (l x rshoot and NCCKp >CCEK 10 otherwise In an implementation, the CORESET size CCEK may comprise the first CORESET size CCEKStart(L) associated with the first peak of UE blocking probability. The UE may receive, from the BS, the first CORESET size CCE^start(L). The UE may determine the parameter XL based on the first CORESET size CCE^ t The first CORESET size CCE«starfL' may be received via RRC signalling or MAC CE. The first CORESET size CCEKStart(L) may be selected amongst a set (e.g., group or range) of first CORESET sizes CCEk , . The set of first CORESET sizes CCE^ , may be previously received from the BS (e.g., configured). The set of first CORESET sizes CCEj? t may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of first CORESET sizes CCEKstarrL may be set in the standards. Alternatively, the UE may receive, from the BS, the index kk „ The UE may determine the vsrarr( l j first CORESET size CCE,<, based on the index kk , The UE may determine the first Kstart(L) Kstart(L) J CORESET size CCE^,,,,,.based on: CCEk = CCEtstartfL) = «start(L) x L x M^C[ The UE may determine the parameter XL based on the first CORESET size CCE^starHLr The index Kstart(L) may be received via RRC signalling or MAC CE. The index Kstart(L) may be selected amongst a set (e.g., group or range) of indexes / cstart(L)- The index k st l) may be dependent on an aggregation level L and / or a number of (scheduled) UEs. The set of indexes Kstart(L) may be previously received from the BS (e.g., configured). The set of first indexes Kstart(L) may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of indexes Kstart(L) may be set in the standards. Alternatively, the UE may not receive, from the BS, the first CORESET size CCEKStart(L) or the index Kstart(L)- The first CORESET size CCEj? , may be set in the standards. The UE may determine the parameter XL based on the first CORESET size CCE^ , In another implementation, the CORESET size CCEK may comprise a threshold CORESET size CCEKt„. ^IH The UE may receive, from the BS, a CORESET size CCEKth. The UE may determine the parameter XL based on the CORESET size CCEKth. The CORESET size CCEKth may be set in the standards. Alternatively, the UE may not receive, from the BS, the CORESET size CCEKth . The CORESET size CCEKth may be set in the standards. The UE may determine the parameter XL based on the CORESET size CCEKth. A UE may determine PDCCH candidates to monitor within a CORESET p with a CORESET size NCCEp based on the hashing function. Determining PDCCH candidates may comprise determining locations of PDCCH candidates (i.e., determining CCE indexes of PDCCH candidates). The UE may monitor the PDCCH candidates. The UE may receive a PDCCH on an allocated PDCCH candidate amongst the PDCCH candidates. Second solution The hashing function may be based on pseudo-random number Yp nn , index m^C[, a reduced CORESET size smaller than the CORESET size WCCE p, an aggregation level L, a maximum number of PDCCH candidates Ms®axfor an aggregation level L, a search spaces and all carrier indicator values nCI, a carrier indicator value nCh a modulo function mod and / or an integer i. The hashing function may use the CORESET size NCCEp and / or an aggregation level L to set the CORESET p where the PDCCH candidates are located. It will be understood that the CORESET size NCCe,p and / or the reduced CORESET size may be expressed as a number of CCEs. It will be understood that the location of a PDDCH candidate may be expressed as an index of a CCE. The hashing function may use a PDCCH index m^ the reduced CORESET size smaller than the CORESET size NCCEp, an aggregation level L, and / or or a maximum number of PDCCH candidates axfor an aggregation level L, a search space s and all carrier indicator values ncl to set the distance between the PDCCH candidates. It will be understood that the distance between the PDCCH candidates may be expressed as a number of CCEs. The hashing function may be based on: m^nCJ ' (^CCE.p - *L) + nCI mod[(NCCEiP) / L\ where, for example: for any CSS, Yn « =0; p,nsj for a USS, = (A„-Yr.nfi ^modD , K-i = nRNT] 0 , 4,, = 39827 for ’ p,Tls f y P p,rls^—Yy 1 P: * fj pmod3 = 0 , Ap = 39829 for pmod3 = 1, Ap = 39839 for pmod3 = 2 , and D = 65537; i = 0,--,L - 1; NCCE>P is the number of CCEs, numbered from 0 to NCCEiP - 1, in CORESET p and, if any, per RB set; nci is - the carrier indicator field value, if provided by cif-lnSchedulingCell in CrossCarrierSchedulingConfig for the serving cell on which PDCCH is monitored, except for scheduling of the serving cell from the same serving cell in which case nci = 0; - the nCI-Value, if provided, for the set of serving cells MC-DCI-SetofCells; - otherwise, including for any CSS, nCI = 0 = 0,--, - 1, where is the number of PDCCH candidates the UE s>nci s,nci ’ s.nci is configured to monitor for aggregation level L of a search space set s for a serving cell corresponding to nc / ; for any CSS, = for a USS, ax is the maximum of over all configured nc / values for a CCE aggregation level L of search space set s ; the RNTI value used for nRNT1 is the C-RNTI. The reduced CORESET size may be obtained by subtracting a parameter XL from the CORESET size NCCEiP. The parameter XL may be based on a modulo function mod, a CORESET size / VCCE>p of a CORESET p, an aggregation level L, a maximum number of PDCCH candidates for an aggregation level L, a search space s and a carrier indicator values nCI, a number of consecutive CORESET sizes N^ershoot of a peak of UE blocking probability and / or CORESET size CCEk . It will be understood that the CORESET size CCEK may be different from the CORESET size A / CCEp °f the CORESET p. The CORESET size CCEK may be smaller than the CORESET size NCCEtP of the CORESET p. As will be apparent below the CORESET size CCEK may comprise the first CORESET size CCEks associated with the first peak of UE blocking probability. Alternatively, the CORESET size CCEK may comprise a threshold CORESET size CCEKth. The parameter XL may be based on: x ( 1 + mod(JVCCEp / (l x lo if mod(AfCCE,p / (LxMs^ >CCEk otherwise In an implementation, the CORESET size CCEK may comprise the first CORESET size CCEKstart(L) associated with the first peak of UE blocking probability. The UE may receive, from the BS, the first CORESET size CCE^start(L). The UE may determine the parameter XL based on the first CORESET size CCEfe, ,. The first CORESET size CCE^ maY be received via RRC signalling or MAC CE. The first CORESET size ,vSLd.rt^LJ CCE^start(L) may be selected amongst a set (e.g., group or range) of first CORESET sizes CCEk , . The set of first CORESET sizes CCE^ , may be previously received from the BS (e.g., configured). The set of first CORESET sizes CCEj? t may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of first CORESET sizes CCEKStart(L) may be set in the standards. Alternatively, the UE may receive, from the BS, the index kk , The UE may determine the vsuaiT(L; j first CORESET size CCE^, abased on the index kk , The UE may determine the first Kstart(L) Kstart(L) J CORESET size CCELartn-,based on: ''•Start^L ) CCE = CCELart(L) = Kstart(L) X L X The UE may determine the parameter XL based on the first CORESET size CCE*s The index Kstart(L) may be received via RRC signalling or MAC CE. The index Kstart(L) may be selected amongst a set (e.g., group or range) of indexes Kstart(L). The index KKstart(L) may be dependent on an aggregation level L and / or a number of (scheduled) UEs. The set of indexes Kstart(L) may be previously received from the BS (e.g., configured). The set of first indexes Kstart(L) may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of indexes / cstart(L) may be set in the standards. Alternatively, the UE may not receive, from the BS, the first CORESET size CCEKStart(L) or the index Kstart(L)- The first CORESET size CCEKStart(L) may be set in the standards. The UE may determine the parameter XL based on the first CORESET size CCEKStart(L). In another implementation, the CORESET size CCEK may comprise a threshold CORESET size CCEKth. The UE may receive, from the BS, a CORESET size CCEKth. The UE may determine the parameter XL based on the CORESET size CCEKth. The CORESET size CCEKth may be set in the standards. A UE may determine PDCCH candidates to monitor within a CORESET p with a CORESET size Ncce.p based on the hashing function. Determining PDCCH candidates may comprise determining locations of PDCCH candidates (i.e., determining CCE indexes of PDCCH candidates). The UE may monitor the PDCCH candidates. The UE may receive a PDCCH on an allocated PDCCH candidate amongst the PDCCH candidates. It will be understood that since the PDCCH candidates are located in the whole CORESET p with the CORESET sizeNCCE;P as opposed to a portion of the CORESET p with a reduced CORESET size improved performance may be expected compared to solution 1. Third solution The hashing function may be based on pseudo-random number Yp nn , indexing, the CORESET size NCce,p, an aggregation level L, a maximum number of PDCCH candidates Mi,maxf°r an aggregation level L, a search space s and all carrier indicator values nC], a carrier indicator value nC], a modulo function mod and / or an integer i. The hashing function may use the CORESET size NCCE:P and / or an aggregation level L to set the CORESET p where the PDCCH candidates are located. It will be understood that the CORESET size NCCEp may be expressed as a number of CCEs. It will be understood that the location of a PDDCH candidate may be expressed as an index of a CCE. The hashing function may use a PDCCH index m^c / , the CORESET size NCCEiP, an aggregation level L, and / or or a maximum number of PDCCH candidates Ms(maxfor an aggregation level L, a search space s and all carrier indicator values nCI to set the distance between PDCCH candidates other than at least one PDCCH candidate amongst the PDCCH candidates. It will be understood that the distance between PDCCH candidates other than at least one PDCCH candidate amongst the PDCCH candidates may be expressed as a number of CCEs. Also, the distance between at least one PDCCH candidate amongst the PDCCH candidates and a PDCCH candidate other than the at least one PDCCH candidate amongst the PDCCH candidates may be expressed as a number of CCEs (e.g., smaller). The hashing function may use a parameter XmL to set on offset (e.g., shift) for at least one PDCCH candidate amongst the PDCCH candidates. The hashing function may use a parameter Xm,L to set on offset for at least a last PDCCH candidate amongst the PDCCH candidates. The hashing function may use a parameter XmM to set on offset for only one PDCCH candidate amongst the PDCCH candidates. The hashing function may use a parameter XmL to set on offset for only a last PDCCH candidate amongst the PDCCH candidates. The hashing function may be based on: ms,ncf'WCCE,p 's,max - Xm,L + ncl I mod[(NCCEp) / L\ [ + i, where, for example: for any CSS, Yn nn =0; P’ns,f for a USS, Y u = (av -Y u AmodD , = nRNTI =# 0 , Ap = 39827 for pmod3 = 0 , Ap = 39829 for pmod3 = 1, Ap = 39839 for pmod3 = 2 , and D = 65537; i = 0, ■ ■ •, L — 1; ^cce,p is the number of CCEs, numbered from 0 to NCCE:P - 1, in CORESET p and, if any, per RB set; nCi is - the carrier indicator field value, if provided by cif-lnSchedulingCell in CrossCarrierSchedulingConfig for the serving cell on which PDCCH is monitored, except for scheduling of the serving cell from the same serving cell in which case nci = 0; - the nCI-Value, if provided, for the set of serving cells MC-DCI-SetofCells; - otherwise, including for any CSS, nCI = 0 = — - 1, where is the number of PDCCH candidates the UE s.nci s,nci ’ s,rtci is configured to monitor for aggregation level L of a search space set s for a serving cell corresponding to nCI; for any CSS, M^ax = for a USS, Ms^ax is the maximum of M^ci over all configured nCI values for a CCE aggregation level L of search space set s ; the RNTI value used for nRNTI is the C-RNTI. The parameter XmL may be based on a modulo function mod, a CORESET size NCCE:P of a CORESET p, an aggregation level L, a maximum number of PDCCH candidates for an aggregation level L, a search space s and a carrier indicator values nCI, a number of consecutive CORESET sizes N^ershoot of a peak of UE blocking probability, a PDCCH candidate index and / or CORESET size CCEK . The parameter may be based on: 1 if mod(NCCEp / (L x <N^rshoot- = L- 1 and WCCE,P > ccek otherwise In an implementation, the CORESET size CCEK may comprise the first CORESET size CCE^start(|. associated with the first peak of UE blocking probability. The UE may receive, from the BS, the first CORESET size CCEKStart(L). The UE may determine the parameter based on the first CORESET size CCE^start(L). The first CORESET size CCEKStart(L) may be received via RRC signalling or MAC CE. The first CORESET size CCEKStart(L) may be selected amongst a set (e.g., group or range) of first CORESET sizes CCEk , . . The set of first CORESET sizes CCE^ , may be previously received from the BS (e.g., configured). The set of first CORESET sizes CCEEstart(L) may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of first CORESET sizes CCEKStart(L) may be set in the standards. Alternatively, the UE may receive, from the BS, the index kk f The UE may determine the vSL«iT( Uj first CORESET size CCE^, abased on the index kk f The UE may determine the first Kstart(L) Kstart(L) J CORESET size CCEfestart(L) based on: CCEk = CCE^start(L) = / <start(L) x L x M^a The UE may determine the parameter Xm,L based on the first CORESET size CCE^tart(L). The index Kstart(L) may be received via RRC signalling or MAC CE. The index Kstart(L) may be selected amongst a set (e.g., group or range) of indexes Kstart(L). The index KKstart(L) may be dependent on an aggregation level L and / or a number of (scheduled) UEs. The set of indexes Kstart(L) may be previously received from the BS (e.g., configured). The set of first indexes Kstart(L) may be received via RRC signaling or via a SearchSpace IE (e.g., via an explicit or an implicit field). The set of indexes Kstart(L) may be set in the standards. Alternatively, the UE may not receive, from the BS, the first CORESET size CCE^start(L) or the index Kstart(L). The first CORESET size CCEKStart(L) may be set in the standards. The UE may determine the parameter XL based on the first CORESET size CCEbstartT / In another implementation, the CORESET size CCEK may comprise a threshold CORESET size CCEKth. The UE may receive, from the BS, a CORESET size CCEKth. The UE may determine the parameter XmL based on the CORESET size CCEKth. The CORESET size CCEKth may be set in the standards. A UE may determine PDCCH candidates to monitor within a CORESET p with a CORESET size NCCEp based on the hashing function. Determining PDCCH candidates may comprise determining locations of PDCCH candidates (i.e., determining CCE indexes of PDCCH candidates). The UE may monitor the PDCCH candidates. The UE may receive a PDCCH on an allocated PDCCH candidate amongst the PDCCH candidates. It will be understood that since the PDCCH candidates are located in the whole CORESET p with the CORESET size / VCCEjP as opposed to a portion of the CORESET p with a reduced CORESET size improved performance may be expected compared to solution 1. Fig.9a and Fig.9b shows an example of a signaling diagram of a method for determining PDCCH candidates. At step 1, a UE may perform a band scan. The UE may read a synchronisation signal block (SSB). The UE may acquire a master information block (MIB). At step 2, the UE may read a system information block (SIB). The UE may perform a random access channel (RACH) procedure. The UE may connect to the network. At step 3, the UE may acquire a CORESET configuration and / or a search space set configuration. The UE may acquire a CORESET configuration via a ControlResourceSet IE and / or a search space set configuration via a SearchSpace IE. The CORESET configuration may comprise a CORESET size NCCE p. Here, the CORESET size NCCE p may be set to 48 CCEs. The search space set configuration may comprise a maximum number of PDCCH candidates M^c / for an aggregation level L, a search space s and a carrier indicator value nCI. Here, the maximum number of PDCCH candidates for an aggregation level one, a search space s and a carrier indicator value nCI may be set to six. Here, the maximum number of PDCCH candidates M^for an aggregation level two, a search space s and a carrier indicator value nCI may be set to five. Here, the maximum number of PDCCH candidates M^cr for an aggregation level four, a search space s and a carrier indicator value nCI may be set to two. Here, the maximum number of PDCCH candidates for an aggregation level eight, a search space s and a carrier indicator value nCI may be set to zero. Here, the maximum number of PDCCH candidates Mj„c / for an aggregation level sixteen, a search space s and a carrier indicator value nCI may be set to zero. At step 4, the UE may receive, from the BS, multiple sets (e.g., groups) of indexes / cstart(L) for an aggregation level one, two, four, eight and sixteen and multiple numbers of (scheduled) UEs (i.e., multiple UE scheduling loads). The multiple sets of indexes KstartU) may be received via RRC signaling. Alternatively, the UE may receive, from the BS, a single set (e.g., group) of indexes KstartU) for an aggregation level one, two, four, eight and sixteen and a single number of (scheduled) UEs). The single set of indexes Kstart(X) may be received via RRC signaling. Here, the UE may receive, from the BS, a first set (e.g. group A) of indexes / cstart(O for an aggregation level one, two, four, eight and sixteen and a number of (scheduled) UEs equal to ten (i.e., first UE scheduling load). The UE may receive, from the BS, a second set (e.g., group B) of indexes KstartU) f°r an aggregation level one, two, four, eight and sixteen and a number of (scheduled) UEs equal to twenty (i.e., second UE scheduling load). It will be understood that the number of (scheduled) UEs associated with a set (e.g., group) of indexes / cstart(L)may not be known by the UE. At step 5, the BS may decide to select (i.e., activate or enable) a set (e.g., group) of indexes KstartU) amongst the first set (e.g., group A) of indexes KstartU) and the second set (e.g. group B) of indexes Kstart(L). It will be understood that one set (e.g., group) of indexes xstart(L)may be selected (i.e., activated or enabled) at a time. At step 6, the UE may receive, from the BS, an indication of the set (e.g., group) of indexes KstartU) selected (i.e., activated or enabled) amongst the first set (e.g., group A) of indexes ^startU') and the second set (e.g. group B) of indexes Kstart(T)- The indication may be received via RRC signaling or MAC CE. Here, the UE may receive, from the BS, an indication of a set (e.g., group B) of indexes K-startCO ■ It will be understood that if at step 3 the UE may receive, from the BS, a single set (e.g. group) of indexes KstartU)> then step 4 and step 5 may be omitted. At step 7, the UE may determine PDCCH candidates to monitor within a CORESET p with the control resource set size NCCEp based on a hashing function. The hashing function may be according to the first solution, the second solution or the third solution. Here, for aggregation level one, Kstart(X = 1) may be equal to two and the first CORSET size CCEKstart(L) may be equal to twelve. Here, for aggregation level two, Kstart(L = 2) may be equal to three and the first CORSET size CCEKstart(L) may be equal to thirty. Here, for aggregation level four, Kstart(X = 4) may be equal to five and the first CORSET size CCE^tart(L) maybe eciual to forty- It will be understood that, for aggregation level one, a CORESET size equal to forty-eight CCEs may be associated with a peak of UE blocking probability. It will be understood that, for aggregation level two, a CORESET size equal to forty-eight CCEs may not be associated with a peak of UE blocking probability. It will be understood that, for aggregation level four, a CORESET size equal to forty-eight CCEs may be associated with a peak of UE blocking probability. This can be verified from the first condition set in the brackets for calculation of the parameter XL (for Solution 1 and 2) or XmiL (for solution 3). This first condition is written below, wherein any CORESET size associated with a peak in UE blocking probability may be identified or checked based on this equation. if mod(WCCE p / (L X MX)) <^overshoot = L / 48 \ For aggregation level one: mod (—I = 0< L = 1 -» a peak of UE blocking probability may \lx6z be expected. / 48 \ For aggregation level two: mod (—) = 8^ L = 2 -> a peak of UE blocking probability may not be expected. For aggregation level four: mod ) = 0 <I = 4 -> a peak of UE blocking probability may be expected. The UE may monitor the PDCCH candidates. The BS may allocated a PDCCH candidate amongst the PDCCH candidates to transmit a PDDCH. The UE may receive the PDCCH on the allocated PDCCH candidate amongst the PDCCH candidates. Fig. 10a shows an example of a graph of a UE blocking probability as a function of a CORESET size for an aggregation level one and for a number of (scheduled) UEs equal to thirty calculated for the existing hashing function and the hashing functions according to the first solution, the second solution and the third solution. Fig. 10b shows an example of a graph of a UE blocking probability as a function of a CORESET size for an aggregation level two and for a number of (scheduled) UEs equal to twenty calculated for the existing hashing function and the hashing functions according to the first solution, the second solution and the third solution. Error! Reference source not found, show that the hashing functions according to the first solution, the second solution and the third solution reduces peaks in UE blocking probably. Fig. 11a shows an example of a graph of an overall UE blocking probability as a function of a CORESET size for a number of (scheduled) UEs equal to fifteen calculated for the existing hashing function and the hashing functions according to the first solution, the second solution and the third solution. Fig. 11b shows an example of a graph of an overall UE blocking probability as a function of a CORESET size for a number of (scheduled) UEs equal to twenty-five calculated for the existing hashing function and the hashing functions according to the first solution, the second solution and the third solution. Error! Reference source not found, show that the hashing functions according to the first solution, the second solution and the third solution reduces peaks in overall UE blocking probably. Fig. 12 shows a block diagram of an example of a method for determining PDCCH candidates according to a first solution performed by a UE. At step 1200, the UE may determine PDCCH candidates to monitor within a CORESET p with a CORESET size NCCE:P based on a function, wherein the function uses a reduced CORESET size smaller than the CORESET size NCCe,p to set a portion of the CORESET p where the PDCCH candidates are located and to set a distance between the PDCCH candidates. At step 1202, the UE may monitor the PDCCH candidates. Fig. 13 shows a block diagram of an example of a method for determining PDCCH candidates according to a first solution performed by a BS. At step 1300, the BS may determine PDCCH candidates within a CORESET p with a CORESET size NCCEiP based on a function, wherein the function uses a reduced CORESET size smaller than the CORESET NCCEiP to set a portion of the CORESET p where the PDCCH candidates are located and to set a distance between the PDCCH candidates. At step 1302, the BS may allocate a PDCCH candidate amongst the PDCCH candidates to transmit a PDCCH. At step 1304, the BS may transmit the PDCCH on the allocated PDCCH candidate. Fig. 14 shows a block diagram of an example of a method for determining PDCCH candidates according to a second solution performed by a UE. At step 1400, the UE may UE may determine PDCCH candidates to monitor within a CORESET p with a control resource set size NCCE:P based on a function, wherein the function uses a reduced CORESET size smaller than the control resource set size NCCErP to set a distance between the PDCCH candidates. At step 1402, the UE may monitor the PDCCH candidates. Fig. 15 shows a block diagram of an example of a method for determining PDCCH candidates according to a second solution performed by a BS. At step 1500, the BS may determine PDCCH candidates within a CORESET p with a CORESET sizeJVCCE;P based on a function, wherein the function uses a reduced CORESET size smaller than the CORESET size NCCEp to set a distance between the PDCCH candidates. At step 1502, the BS may allocate a PDCCH candidate amongst the PDCCH candidates to transmit a PDCCH. At step 1504, the BS may transmit the PDCCH on the allocated PDCCH candidate. Fig. 16 shows a block diagram of an example of a method for determining PDCCH candidates according to a third solution performed by a UE. At step 1600, the UE may determine PDCCH channel candidates to monitor within a CORESET p based on a function, wherein the function uses a parameter XmL to set on offset for at least one PDCCH candidate amongst the PDCCH candidates. At step 1602, the UE may monitor the PDCCH candidates. Fig. 17 shows a block diagram of an example of a method for determining PDCCH candidates according to a third solution performed by a BS. At step 1700, the BS may determine PDCCH candidates within a CORESET p based on a function, wherein the function uses a parameter Xm L to set on offset for at least one PDCCH candidate amongst the PDCCH candidates. At step 1702, the BS may allocate a PDCCH candidate amongst the PDCCH candidates to transmit a PDCCH. At step 1704, the BS may transmit the PDCCH on the allocated PDCCH candidate. Fig. 18 shows a schematic representation of non-volatile memory media 1800 storing instructions which when executed by a processor allow the processor to perform one or more of the steps of the method of any of Fig. 12 to 17. It is noted that while the above describes example embodiments, there are several variations and modifications which may be made to the disclosed solution without departing from the scope of the present invention. The embodiments may thus vary within the scope of the attached claims. In general, some embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although embodiments are not limited thereto. While various embodiments may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as nonlimiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof. The embodiments may be implemented by computer software stored in a memory and executable by at least one data processor of the involved entities or by hardware, or by a combination of software and hardware. Further in this regard it should be noted that any procedures, e.g., as in any of Fig. 12 to Fig. 17, may represent program steps, or interconnected logic circuits, blocks and functions, or a combination of program steps and logic circuits, blocks and functions. The software may be stored on such physical media as memory chips, or memory blocks implemented within the processor, magnetic media such as hard disk or floppy disks, and optical media such as for example DVD and the data variants thereof, CD. The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The data processors may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASIC), gate level circuits and processors based on multi-core processor architecture, as non-limiting examples. Alternatively or additionally some embodiments may be implemented using circuitry. The circuitry may be configured to perform one or more of the functions and / or method steps previously described. That circuitry may be provided in the base station and / or in the communications device. As used in this application, the term “circuitry” may refer to one or more or all of the following: (a) hardware-only circuit options (such as options in only analogue and / or digital circuitry); (b) combinations of hardware circuits and software, such as: (i) a combination of analogue and / or digital hardware circuit(s) with software / firmware and (ii) any portions of hardware processor(s) with software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as the communications device or base station to perform the various functions previously described; and (c) hardware circuit(s) and or processor(s), such as a microprocessor(s) or a portion of a microprocessor(s), that requires software (e.g., firmware) for operation, but the software may not be present when it is not needed for operation. This definition of circuitry applies to all uses of this term in this application, including in any claims. As a further example, as used in this application, the term circuitry also covers an option of merely a hardware circuit or processor (or multiple processors) or portion of a hardware circuit or processor and its (or their) accompanying software and / or firmware. The term circuitry also covers, for example integrated device. The term “means” as used in the description and in the claims may refer to one or more individual elements configured to perform the corresponding recited functionality or functionalities, or it may refer to several elements that perform such functionality or functionalities. Furthermore, several functionalities recited in the claims may be performed by the same individual means or the same combination of means. For example, performing such functionality or functionalities may be caused in an apparatus by a processor that executes instructions stored in a memory of the apparatus. The foregoing description has provided by way of exemplary and non-limiting examples a full and informative description of some embodiments However, various modifications and adaptations may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and the appended claims. However, all such and similar modifications of the teachings will still fall within the scope as defined in the appended claims.
Claims
1. An apparatus comprising:means for determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCEiP, based on a function,wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCEp, to set a portion of the control resource set, p, where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; andmeans for monitoring the physical downlink control channel candidates.
2. The apparatus of claim 1, wherein the function uses at least one of:an aggregation level, L;a physical downlink control channel candidate index, m^cr ora maximum number of physical downlink control channel candidates, „, for an aggregation level, L, a search space, s, and all carrier indicator values, na\to set the distance between the physical downlink control channel candidates.
3. The apparatus of claim 1 or claim 2, comprising:means for determining the reduced control resource set size based on at least one of the control resource set size, NCCE>P, and a value, XL.
4. The apparatus of claim 3, wherein the means for determining the reduced control resource set size based on the control resource set size, NCCEp, and the value, XL , comprises: means for determining the reduced control resource set size by subtracting the value, XL, from the control resource set size, NCCEiP.
5. The apparatus of claim 3 and claim 4, wherein the value, XL, is determined based on at least one of:the control resource set size, yvCCE p;an aggregation level, L;a maximum number of physical downlink control channel candidates, , for an aggregation level, L, a search space s and a carrier indicator value nCI;another control resource set size, CCEK ; or a modulo function, mod.
6. The apparatus of claim 5, comprising:means for receiving, from a base station, the other control resource set size, CCEK .
7. The apparatus of claim 5, comprising:means for receiving, from a base station, an index, k .
8. The apparatus of claim 7, comprising:means for determining the other control resource set size, CCErc , based on the index,K .
9. The apparatus of claim 7 or claim 8, wherein the other control resource set size CCEk is a first control resource set size, CCEKStart(L), of a first peak of user equipment blocking probability; andwherein the index, k , is an index, Kstart(L)-10. The apparatus of 9, wherein the index, Kstart(L), is dependent on at least one of: an aggregation level, L; ora number of user equipment.
11. The apparatus of claim 7 or claim 8, wherein the other control resource set size, CCEk , is a threshold control resource set size, CCE,,12. The apparatus of 11, wherein the threshold control resource set size, CCEKTHis not dependent on at least one of:an aggregation level, L; ora number of user equipment.
13. The apparatus of any of claims 1 to 12, wherein the function uses at least one of:a pseudo-random number,a physical downlink control channel candidate index, ;an aggregation level, L;a maximum number of physical downlink control channel candidates, M®ax, for an aggregation level, L, a search space, s , and all carrier indicator values, nc / ;a carrier indicator value, nc / ;a modulo function, mod; oran integer, i.
14. The apparatus of any of claims 1 to 13, wherein the apparatus is a user equipment.
15. An apparatus comprising:means for determining physical downlink control channel candidates within a control resource set, p , with a control resource set size, NCCEp , based on a function,wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE:P , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; andmeans for allocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; andmeans for transmitting the physical downlink control channel on the selected physical downlink control channel candidate.
16. The apparatus of claim 15, wherein the apparatus is a base station.
17. A method comprising:determining physical downlink control channel candidates to monitor within a control resource set p with a control resource set size, NCCEp , based on a function,wherein the function uses a reduced control resource set size smaller than the control resource set size, NCCE p, to set a portion of the control resource set, p .where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; andmonitoring the physical downlink control channel candidates.
18. A method comprising:determining physical downlink control channel candidates within a control resource set p with a control resource set size, NCCEp , based on a function,wherein the function uses a reduced control resource set size smaller than the control5 resource set size, NCCE p , to set a portion of the control resource set, p , where the physical downlink control channel candidates are located and to set a distance between the physical downlink control channel candidates; andallocating a physical downlink control channel candidate amongst the physical downlink control channel candidates to transmit a physical downlink control channel; and10 transmitting the physical downlink control channel on the allocated physical downlinkcontrol channel candidate.
Citation Information
Patent Citations
User terminal, base station apparatus, and radio communication method
US20200163062A1
User terminal and radio communication method
US20210168844A1
Control resource sets and synchronization signal blocks for new radio with less than 5 mhz bandwidth
WO2024094806A1