Resource allocation method and apparatus, electronic device, and storage medium

Abstract

The present disclosure provides a resource allocation method and device, electronic equipment and storage medium, and relates to the technical field of mobile communication. The method comprises the following steps: acquiring a plurality of terminal corresponding candidate CCE position set of physical downlink control channel; determining the initial CCE position corresponding to each terminal according to the candidate CCE position set corresponding to each terminal, calculating the CCE repetition value of the initial CCE position corresponding to each terminal; according to the initial CCE position corresponding to each terminal and the CCE repetition value of the corresponding initial CCE position, iteratively determining the target CCE position corresponding to each terminal; according to the target CCE position corresponding to each terminal, the allocation of physical downlink control channel resources is carried out. The embodiments of the present disclosure can preferably determine the target CCE position of each terminal, avoid the user blocking caused by the repetition of the target CCE positions corresponding to multiple terminals, and improve the CCE resource utilization rate.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of mobile communication, and particularly relates to a resource allocation method and device, an electronic device and a storage medium. BACKGROUND

[0002] In the process of scheduling terminals by a base station to realize data transmission and reception, the base station can allocate and schedule transmission resources through a physical downlink control channel (PDCCH). The PDCCH can allocate resources in a basic unit of a CCE (Control Channel Element).

[0003] Among them, one CCE can be allocated to each terminal to realize the allocation of PDCCH resources. If multiple terminals are allocated CCEs at the same location, user blocking will occur, and the utilization rate of CCE resources is low. Since the allocation of PDCCH resources is directly related to the capacity and performance of the 5G system, there is an urgent need for a resource allocation algorithm to reduce user blocking and improve the utilization rate of CCE resources.

[0004] It should be noted that the information disclosed in the above background section is only used to strengthen the understanding of the background of the present disclosure, and therefore can include information that does not constitute prior art known to those of ordinary skill in the art. SUMMARY

[0005] The present disclosure provides a resource allocation method and device, an electronic device and a storage medium, which at least partially overcome the problems of related technologies that are prone to user blocking and have low CCE resource utilization.

[0006] Other characteristics and advantages of the present disclosure will become apparent from the following detailed description, or will be learned by practice of the present disclosure.

[0007] According to one aspect of an embodiment of the present disclosure, a resource allocation method is provided, comprising:

[0008] obtaining a candidate CCE position set of a physical downlink control channel corresponding to each of a plurality of terminals; determining an initial CCE position corresponding to each of the terminals according to the candidate CCE position set corresponding to each of the terminals, and calculating a CCE repetition substitution value of the initial CCE position corresponding to each of the terminals, wherein the CCE repetition substitution value of the initial CCE position corresponding to each of the terminals is used to indicate whether the initial CCE position corresponding to each of the terminals is repeated; iteratively determining a target CCE position corresponding to each of the terminals according to the initial CCE position corresponding to each of the terminals and the CCE repetition substitution value of the corresponding initial CCE position; and allocating physical downlink control channel resources according to the target CCE position corresponding to each of the terminals.

[0009] In some embodiments of the present disclosure, the calculating of the CCE repetition substitution value of the initial CCE position corresponding to each terminal comprises:

[0010] The positions occupied by the initial CCE positions in the candidate CCE position set corresponding to the plurality of terminals are marked by a plurality of arrays respectively; the elements at the corresponding positions in the plurality of arrays are accumulated to obtain a sum value array, the sum value array comprising: a plurality of elements, each element being the accumulation result of the elements at the corresponding positions in the plurality of arrays; and the elements greater than 1 in the sum value array are accumulated to obtain the CCE repetition substitution value of the initial CCE position corresponding to each terminal.

[0011] In some embodiments of the present disclosure, the iterative determination of the target CCE position corresponding to each terminal according to the initial CCE position corresponding to each terminal and the CCE repetition substitution value of the corresponding initial CCE position comprises:

[0012] The target CCE position set corresponding to each terminal is determined according to the initial CCE position corresponding to each terminal and the CCE repetition substitution value of the initial CCE position in sequence until a preset iteration end condition is met, and the target CCE position corresponding to each terminal is obtained.

[0013] In some embodiments of the present disclosure, the preset iteration end condition is that the current iteration number is greater than a preset iteration number threshold or the current CCE repetition substitution value is equal to zero.

[0014] In some embodiments of the present disclosure, the method comprises:

[0015] The iteration operation is performed on the initial CCE position corresponding to each terminal in sequence to determine the target CCE position set corresponding to each terminal, as follows:

[0016] The first neighborhood CCE position of the initial CCE position corresponding to the target terminal is obtained, and the CCE repetition substitution value corresponding to the first neighborhood CCE position is calculated; if the CCE repetition substitution value corresponding to the first neighborhood CCE position of the target terminal does not satisfy a preset substitution value condition, the second neighborhood CCE position of the initial CCE position corresponding to the target terminal is obtained, and the CCE repetition substitution value corresponding to the second neighborhood CCE position is calculated; if the CCE repetition substitution value corresponding to the second neighborhood CCE position of the target terminal satisfies the preset substitution value condition, the second neighborhood CCE position of the target terminal is taken as the target CCE position of the target terminal.

[0017] In some embodiments of the present disclosure, the first neighborhood CCE position of the initial CCE position corresponding to the target terminal is any CCE position in the candidate CCE position set corresponding to the target terminal except the initial CCE position.

[0018] In some embodiments of the present disclosure, the method further comprises:

[0019] calculating a CCE repetition generation value of the target CCE position corresponding to each terminal;

[0020] the allocation of the physical downlink control channel resource according to the target CCE position corresponding to each terminal comprises:

[0021] if the CCE repetition generation value of the target CCE position corresponding to each terminal indicates that the target CCE position corresponding to at least one terminal is repeated, adjusting the target CCE position corresponding to the at least one terminal according to the terminal priority or the aggregation level, and allocating the physical downlink control channel resource according to the adjusted target CCE position set.

[0022] In some embodiments of the present disclosure, the adjustment of the target CCE position corresponding to the at least one terminal according to the terminal priority or the aggregation level comprises:

[0023] sorting the terminals whose target CCE positions are repeated in the order of the terminal priority or the aggregation level from small to large, and allocating the repeated target CCE position to the terminal with the highest terminal priority or aggregation level.

[0024] In some embodiments of the present disclosure, the obtaining of the candidate CCE position set of the physical downlink control channel corresponding to each of the plurality of terminals comprises:

[0025] obtaining the candidate CCE position set of the physical downlink control channel corresponding to each of the plurality of terminals according to the search space of the physical downlink control channel.

[0026] According to another aspect of the present disclosure, a resource allocation apparatus is provided, comprising:

[0027] a candidate CCE position set obtaining module, configured to obtain a candidate CCE position set of a physical downlink control channel corresponding to each of a plurality of terminals;

[0028] an initial CCE position determining module, configured to determine an initial CCE position corresponding to each terminal according to the candidate CCE position set corresponding to each terminal, and calculate a CCE repetition generation value of the initial CCE position corresponding to each terminal, wherein the CCE repetition generation value of the initial CCE position corresponding to each terminal is used to indicate whether the initial CCE position corresponding to each terminal is repeated;

[0029] a target CCE position determination module configured to determine a target CCE position corresponding to each terminal according to an initial CCE position corresponding to each terminal and a CCE repetition generation value of the initial CCE position;

[0030] a resource allocation module configured to allocate a physical downlink control channel resource according to the target CCE position corresponding to each terminal.

[0031] In some embodiments of the present disclosure, the initial CCE position determination module is configured to mark positions occupied by initial CCE positions in a candidate CCE position set corresponding to each terminal by using a plurality of arrays respectively; accumulate elements at corresponding positions in the plurality of arrays to obtain a sum value array, the sum value array including a plurality of elements, each element being an accumulation result of elements at corresponding positions in the plurality of arrays; and accumulate elements greater than 1 in the sum value array to obtain a CCE repetition generation value of the initial CCE position corresponding to each terminal.

[0032] In some embodiments of the present disclosure, the target CCE position determination module is configured to determine a target CCE position set corresponding to each terminal according to the initial CCE position corresponding to each terminal and the CCE repetition generation value of the initial CCE position in sequence until a preset iteration end condition is met, to obtain the target CCE position corresponding to each terminal.

[0033] In some embodiments of the present disclosure, the preset iteration end condition is that a current iteration number is greater than a preset iteration number threshold or a current CCE repetition generation value is equal to zero.

[0034] In some embodiments of the present disclosure, the target CCE position determination module is configured to perform the following iteration operation on the initial CCE position corresponding to each terminal in sequence to determine a target CCE position set corresponding to each terminal.

[0035] obtain a first neighborhood CCE position of the initial CCE position corresponding to the target terminal, calculate a CCE repetition generation value corresponding to the first neighborhood CCE position, if the CCE repetition generation value corresponding to the first neighborhood CCE position of the target terminal does not satisfy a preset generation value condition, obtain a second neighborhood CCE position of the initial CCE position corresponding to the target terminal, calculate a CCE repetition generation value corresponding to the second neighborhood CCE position, and if the CCE repetition generation value corresponding to the second neighborhood CCE position of the target terminal satisfies the preset generation value condition, take the second neighborhood CCE position of the target terminal as the target CCE position of the target terminal.

[0036] In some embodiments of the present disclosure, the first neighborhood CCE position of the initial CCE position corresponding to the target terminal is any CCE position in the candidate CCE position set corresponding to the target terminal except the initial CCE position.

[0037] In some embodiments of the present disclosure, the target CCE position determination module is further configured to: calculate the CCE repetition generation value of the target CCE position corresponding to each terminal;

[0038] The resource allocation module is configured to: if the CCE repetition generation value of the target CCE position corresponding to each terminal indicates that the target CCE position corresponding to at least one terminal is repeated, adjust the target CCE position corresponding to the at least one terminal according to the terminal priority or the aggregation level, and allocate the physical downlink control channel resource according to the adjusted target CCE position set.

[0039] In some embodiments of the present disclosure, the resource allocation module is configured to: sort the terminals whose target CCE positions are repeated in ascending order of the terminal priority or the aggregation level, and allocate the repeated target CCE positions to the terminal with the highest terminal priority or aggregation level.

[0040] In some embodiments of the present disclosure, the candidate CCE position set acquisition module is configured to: acquire the candidate CCE position set of the physical downlink control channel corresponding to each terminal according to the search space of the physical downlink control channel.

[0041] According to still another aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory configured to store executable instructions of the processor; wherein the processor is configured to execute the above-mentioned resource allocation method via execution of the executable instructions.

[0042] According to yet another aspect of the present disclosure, a computer readable storage medium is provided, which stores a computer program, and the computer program is executed by a processor to implement the above-mentioned resource allocation method.

[0043] The technical solution provided by the embodiments of the present disclosure can determine the target CCE position corresponding to each terminal iteratively according to the initial CCE position corresponding to each terminal and the CCE repetition generation value of the corresponding initial CCE position. Therefore, the embodiments of the present disclosure can determine the target CCE position of each terminal more optimally, avoid user blocking caused by repetition of the target CCE positions corresponding to multiple terminals, and improve the CCE resource utilization rate.

[0044] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0045] The accompanying drawings, which are incorporated herein and constitute part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, further serve to explain the principles of the present disclosure. It is apparent that the drawing in the following description is only some embodiments of the present disclosure, and other drawings can be obtained according to these drawings without creative labor for those skilled in the art.

[0046] Figure 1 A schematic diagram showing a system structure provided by an embodiment of the present disclosure;

[0047] Figure 2 A flow chart showing a resource allocation method provided by an embodiment of the present disclosure;

[0048] Figure 3 A flow chart showing a method for calculating a CCE repetition value of an initial CCE position corresponding to each terminal provided by an embodiment of the present disclosure;

[0049] Figure 4 A flow chart showing a method for determining a target CCE position set corresponding to each terminal provided by an embodiment of the present disclosure;

[0050] Figure 5 A flow chart showing another resource allocation method provided by an embodiment of the present disclosure;

[0051] Figure 6 A schematic diagram showing a resource allocation apparatus in an embodiment of the present disclosure; and

[0052] Figure 7 A structural block diagram of an electronic device in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0053] Example implementations will now be described more fully with reference to the accompanying drawings. Example implementations may, however, be implemented in many different forms and should not be construed as limited to the examples set forth herein; rather, these implementations are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example implementations to those skilled in the art. The described features, structures, or characteristics can be combined in any suitable manner in one or more implementations.

[0054] In addition, the accompanying drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification. The drawings are not necessarily to scale, the same or analogous reference numerals in different drawings represent the same or similar elements and redundant detailed descriptions are omitted for clarity. Some of the blocks in the drawings are functional entities that do not necessarily have to correspond to physically or logically independent entities. These functional entities can be implemented in software, or in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0055] Figure 1 A schematic diagram of an exemplary system architecture to which the resource allocation method or the resource allocation apparatus of the embodiments of the present disclosure can be applied is shown.

[0056] As shown in Figure 1 , the system architecture 100 can include a terminal device 101 and an access network device 102. Exemplarily, the terminal device 101 and the access network device 102 can communicate with each other through some air interface technology, for example, the Uu interface.

[0057] The terminal device 101 can be various electronic devices, including but not limited to a smartphone, a tablet computer, a laptop computer, a desktop computer, a wearable device, an augmented reality device, a virtual reality device, etc.

[0058] The access network device 102 is configured to provide a wireless communication function for the terminal device 101, i.e., the access network device 102 can be a device with a base station function, including but not limited to an evolved Node B (eNB), a 5G base station (gNB), a radio network controller (RNC), a Node B (NB), a base station controller (BSC), a base transceiver station (BTS), a home base station, a baseband unit (BBU), a wireless fidelity (WIFI) access point (AP), a transmission and receiver point (TRP or transmission point, TP), etc. It should be noted that in systems using different radio access technologies, the names of devices with base station functions can be different, and the description of “base station” can change as the communication technology evolves. In the embodiments of the present disclosure, the devices described above that provide a wireless communication function for the terminal device 101 are collectively referred to as access network devices.

[0059] Those skilled in the art can know, Figure 1 The number of terminal devices 101 and access network devices 102 in the above embodiment is only illustrative, and any number of terminal devices and access network devices can be provided according to actual needs. The embodiments of the present disclosure do not limit this.

[0060] The present example embodiment will be described in detail below with reference to the accompanying drawings and examples.

[0061] First, a resource allocation method is provided in the embodiments of the present disclosure, which can be executed by any electronic device with computing processing capability.

[0062] Figure 2 A flowchart of a resource allocation method in the embodiments of the present disclosure is shown, as shown in Figure 2 The resource allocation method provided in the embodiments of the present disclosure includes the following steps S202 to S208.

[0063] S202, obtaining a candidate CCE position set of a physical downlink control channel corresponding to each of a plurality of terminals.

[0064] The embodiments of the present disclosure do not limit the CCE. In some embodiments, 1 CCE can contain 6 REGs (Resource Element Groups), each REG occupies 1 OFDM (Orthogonal Frequency Division Multiplexing) symbol in the time domain and 12 subcarriers in the frequency domain. For different capacity and coverage requirements, a PDCCH can contain one or more index position continuous CCEs, and the number of CCEs can be determined by the aggregation level size of the PDCCH, etc. The "position" in the "CCE position" in the embodiments of the present disclosure is the index position of the CCE. For example, a certain CCE position can be [31, 34], which can correspond to four continuous CCEs with index positions 31, 32, 33, and 34, and the above four CCEs can form a PDCCH. The set of CCE positions that each terminal can be allocated is the candidate CCE position set corresponding to the terminal. In a possible implementation, the candidate CCE position set corresponding to a certain terminal can be {[10, 11], [26, 27], [40, 41], [56, 57], [70, 71], [86, 87]}. Alternatively, the candidate CCE position set corresponding to a certain terminal can be {[10, 11], [26, 27], [30, 31], [42, 43], [54, 55], [67, 68]}.

[0065] In some embodiments, obtaining the candidate CCE location set of the physical downlink control channel corresponding to each of the multiple terminals may include: obtaining the candidate CCE location set of the physical downlink control channel corresponding to each of the multiple terminals according to the search space of the physical downlink control channel.

[0066] In an exemplary embodiment, each terminal device corresponds to a user that needs to be scheduled. Assuming the number of users that need to be scheduled is K, the total set of candidate CCE locations for the PDCCH of K users can be represented as S. K ={S0, ..., S K-1}. The set of candidate CCE locations for the Kth user can be obtained through S. K express.

[0067] For example, in, For the first The positions occupied by each candidate CCE The index value of the candidate CCE.

[0068] It should be noted that n CI It can be used to represent carrier indication values ​​in carrier aggregation scenarios. L can be used to indicate the aggregation level. Therefore... It can be used to represent the number of candidate CCEs with aggregation level L in the S-th search space of the serving cell of a carrier.

[0069] In an exemplary embodiment, the following formula (1) can be used to calculate the...

[0070]

[0071] In formula (1), the serving cell of a carrier can correspond to a CORESET (control-resource set) P, where P is the number of the control-resource set. CCE,P This can represent the number of candidate CCEs contained in CORESET P. The mod function represents the modulo operation. The parameter i is an integer, and the value of i can be 0, ..., L-1. The formula (1) is used to represent a time slot, where f represents the frame index and u represents the parameter set. For example, the value of u can be 0, 1, 2, 3, or 4. Therefore, this formula (1) can be used to calculate the time slot. The number of candidate CCEs with aggregation level L in the S-th search space of the corresponding CORESET P.

[0072] and, It can represent all carriers n CI of the maximum value in the formula (1).

[0073] In addition, the embodiments of the present disclosure do not limit the type of the first S search space, and the first S search space can be a common search space or a UE (User Equipment) dedicated search space. The common search space can be used to configure cell-level PDCCH monitoring. The UE dedicated search space can be used to configure UE-level PDCCH monitoring.

[0074] For the common search space, The value of the formula (2) can be seen as follows: for the UE dedicated search space, The formula (3) can be used to calculate.

[0075]

[0076]

[0077] In the formula (2), Y P,-1 = n RNTI ≠ 0. The UE can perform blind detection of the PDCCH in the UE dedicated search space according to the RNTI (Radio Network Temporary Identifier) type, and for the UE dedicated search space, the n RNTI The value of the formula (2) can be seen as follows: for the UE dedicated search space, P The value of the formula (2) can be seen as follows: for the UE dedicated search space, P = 39827; when Pmod3 = 1, A P = 39829; when Pmod3 = 1, A P = 39839.

[0078] S204, according to the candidate CCE position set corresponding to each terminal, determine the initial CCE position corresponding to each terminal, calculate the CCE repetition substitution value of the initial CCE position corresponding to each terminal, wherein the CCE repetition substitution value of the initial CCE position corresponding to each terminal is used to indicate whether the initial CCE position corresponding to each terminal is repeated.

[0079] In an exemplary embodiment, after obtaining the candidate CCE position set corresponding to each terminal through the above calculation process, the initial CCE position corresponding to each terminal can be determined from the candidate CCE position set corresponding to each terminal. The initial CCE position corresponding to a certain terminal can be any CCE position in the candidate CCE position set corresponding to that terminal. Taking K terminals as an example, the initial CCE position set of the PDCCH candidates for the K terminals can be X. init Therefore, X init The data may contain the initial CCE positions corresponding to K terminals. This disclosure does not limit the method for determining the initial CCE position corresponding to each terminal.

[0080] For example, the candidate CCE locations corresponding to each terminal can be selected separately. The corresponding CCE position is used as the initial CCE position. Therefore, the above set of initial CCE positions...

[0081] After determining the initial CCE position for each terminal, the CCE duplication cost corresponding to the initial CCE can be calculated to indicate the number of duplicate CCE positions in the CCE position set. For example, taking an application scenario with three terminals, UE1, UE2, and UE3, the number of candidate CCEs in CORESET P can be 16. Assuming that the aggregation level of UE1 is 1, the initial CCE position corresponding to UE1 can be [5]. The aggregation level of UE2 is 2, and the initial CCE position corresponding to UE2 can be [6, 7]. The aggregation level of UE3 is 4, and the initial CCE position corresponding to UE3 can be [4, 5, 6, 7]. Therefore, the CCE position occupancy situation can be shown in Table 1.

[0082] Table 1

[0083] CCE 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 UE1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 UE2 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 UE3 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0

[0084] Next, the elements at the corresponding positions in the table can be summed bit by bit to obtain the sum array shown in Table 2. Then, the elements in this sum array that are greater than 1 are accumulated, resulting in 2 + 2 + 2 = 6. Therefore, the CCE repetition cost value in this embodiment is 6.

[0085] Table 2

[0086]

[0087] S206, based on the initial CCE position corresponding to each terminal and the CCE repetition value of the corresponding initial CCE position, iteratively determine the target CCE position corresponding to each terminal.

[0088] In some embodiments, the target CCE position corresponding to each terminal can be determined according to the initial CCE position corresponding to each terminal and the CCE repetition substitution value of the corresponding initial CCE position, including: determining the target CCE position set corresponding to each terminal according to the initial CCE position corresponding to each terminal and the CCE repetition substitution value of the initial CCE position in turn, until a preset iteration end condition is met, to obtain the target CCE position corresponding to each terminal. Illustratively, the target CCE position corresponding to a certain terminal can be any CCE position in the candidate CCE position set corresponding to the terminal, and the target CCE position corresponding to a certain terminal can be the same as or different from the initial CCE position corresponding to the terminal.

[0089] Illustratively, the initial CCE position of a first terminal can be replaced one by one according to the candidate CCE position set corresponding to the terminal, and the sizes of the CCE repetition substitution values are compared, and the CCE position with the smaller CCE repetition substitution value is retained, and finally the replaced CCE position and the initial CCE positions corresponding to other terminals can form a CCE set. Wherein, the replaced CCE position can be the target CCE position of the terminal. Then, the initial CCE positions corresponding to other terminals can be iteratively replaced according to the candidate CCE position set corresponding to each terminal by the above method, until a preset iteration end condition is met, and a target CCE position set can be obtained, which can include the target CCE positions corresponding to each terminal.

[0090] The preset iteration end condition is not limited in the embodiments of the present disclosure, and illustratively, the preset iteration end condition can be that the current iteration number is greater than a preset iteration number threshold, or the current CCE repetition substitution value is equal to zero. The preset iteration number threshold can be limited based on experience or application scenarios, for example, the preset iteration number threshold can be 40 or 30.

[0091] S208, according to the target CCE position corresponding to each terminal, the physical downlink control channel resource is allocated.

[0092] In some embodiments, the resource allocation method provided by the present disclosure can further include: calculating the CCE repetition substitution value of the target CCE position corresponding to each terminal. Illustratively, the method of calculating the CCE repetition substitution value of the target CCE position corresponding to each terminal here can be the same as the method of calculating the CCE repetition substitution value of the initial CCE position corresponding to each terminal described above, which will not be repeated here.

[0093] In this case, the allocation of the physical downlink control channel resources according to the target CCE positions of the terminals can comprise: if the CCE repetition generation value of the target CCE positions of the terminals indicates that the target CCE positions of at least one terminal are repeated, adjusting the target CCE positions of the at least one terminal according to the terminal priorities or the aggregation levels, and allocating the physical downlink control channel resources according to the adjusted target CCE position set.

[0094] In some embodiments, the adjusting of the target CCE positions of the at least one terminal according to the terminal priorities or the aggregation levels can comprise: sorting the terminals whose target CCE positions are repeated according to the order of the terminal priorities or the aggregation levels from small to large, and allocating the repeated target CCE positions to the terminal with the highest terminal priority or aggregation level.

[0095] In a possible implementation, the CCE repetition generation value of the target CCE positions of the terminals can be 2. In this case, the target CCE positions of the third terminal and the fifth terminal are repeated. At this time, the third terminal and the fifth terminal can be sorted according to the order of the terminal priorities or the aggregation levels from small to large. For example, the third terminal and the fifth terminal can be sorted according to the terminal priorities. When the terminal priority of the third terminal is higher than that of the fifth terminal, the corresponding target CCE position can be allocated to the third terminal. The fifth terminal can be allocated again at the next scheduling time of resource allocation. For another example, the third terminal and the fifth terminal can be sorted according to the aggregation levels. When the aggregation level corresponding to the third terminal is lower than that corresponding to the fifth terminal, the corresponding target CCE position can be allocated to the fifth terminal. The third terminal can be allocated again at the next scheduling time of resource allocation. Exemplarily, the terminal priorities can be set based on experience or application scenarios, which are not limited in the embodiments of the present disclosure.

[0096] For another example, the target CCE positions of the at least one terminal can be adjusted according to the terminal priorities first. If the terminal priorities of the at least one terminal are the same, the target CCE positions of the at least one terminal can be adjusted according to the aggregation levels. Continuing with the above example in which the target CCE positions of the third terminal and the fifth terminal are repeated, if the terminal priority of the third terminal is the same as that of the fifth terminal, the third terminal and the fifth terminal can be sorted according to the order of the aggregation levels from small to large. When the aggregation level corresponding to the third terminal is higher than that corresponding to the fifth terminal, the corresponding target CCE position can be allocated to the third terminal. The fifth terminal can be allocated again at the next scheduling time of resource allocation.

[0097] In some embodiments, a method for calculating the CCE repetition substitution value of the initial CCE position corresponding to each terminal can include the steps as shown in Figure 3

[0098] S302, marking the positions occupied by the initial CCE positions in the candidate CCE position set corresponding to each terminal by multiple arrays respectively.

[0099] In some embodiments, each of the above arrays can be a 1xN CCE,P dimensional array, N CCE,P is the number of candidate CCEs contained in the CORESET P. The number of arrays can be K, K is the number of terminals. Wherein, each 1xN CCE,P dimensional array is used to mark the CCE positions occupied by a terminal, and any element in the 1xN CCE,P dimensional array corresponds to a candidate CCE position of the terminal. When calculating the CCE repetition substitution value, the array element corresponding to the CCE position occupied by each terminal can be assigned a value of 1, and the array element not occupied can be assigned a value of 0. At this time, the CCE position occupied by any terminal is the initial CCE position of the terminal.

[0100] S304, adding the elements in the corresponding positions of the multiple arrays to obtain a sum value array, the sum value array includes: multiple elements, each element is the addition result of the elements in the corresponding positions of the multiple arrays.

[0101] Exemplarily, for the above K 1xN CCE,P dimensional arrays, the K 1xN CCE,P dimensional arrays after assignment can be added in the corresponding positions of the elements to obtain a 1xN CCE,P dimensional sum value array.

[0102] S306, adding the elements greater than 1 in the sum value array to obtain the CCE repetition substitution value of the initial CCE position corresponding to each terminal.

[0103] Exemplarily, for the above K 1xN CCE,P dimensional arrays, the sum of the elements greater than 1 in the obtained sum value array can be calculated to obtain the CCE repetition substitution value of the initial CCE position corresponding to each terminal at the current moment.

[0104] In some embodiments, as shown in Figure 4 , the following iterative operation can be performed on the initial CCE position corresponding to each terminal in turn to determine the target CCE position set corresponding to each terminal:

[0105] ​S402, obtaining a first neighbor CCE position of the initial CCE position corresponding to the target terminal, and calculating a CCE repetition generation value corresponding to the first neighbor CCE position.

[0106] In a possible implementation, the candidate CCE position set S K The S K ={ [10, 11], [26, 27], [40, 41], [56, 57], [70, 71], [86, 87]}. According to the candidate CCE position set S K , the initial CCE position corresponding to the target terminal is [10, 11]. Therefore, all the neighbor CCE positions of the initial CCE position corresponding to the target terminal can include [26, 27], [40, 41], [56, 57], [70, 71] and [86, 87].

[0107] In some embodiments, the first neighbor CCE position of the initial CCE position corresponding to the target terminal is any CCE position in the candidate CCE position set S

[0108] For example, continuing the case of the above S K ={ [10, 11], [26, 27], [40, 41], [56, 57], [70, 71], [86, 87]}. Therefore, the first neighbor CCE position of the initial CCE position corresponding to the target terminal can be any one of [26, 27], [40, 41], [56, 57], [70, 71], [86, 87].

[0109] S404, if the CCE repetition generation value corresponding to the first neighbor CCE position of the initial CCE position corresponding to the target terminal does not satisfy a preset generation value condition, obtaining a second neighbor CCE position of the initial CCE position corresponding to the target terminal, and calculating a CCE repetition generation value corresponding to the second neighbor CCE position.

[0110] For example, after determining the first neighbor CCE position of the initial CCE position corresponding to the target terminal, a CCE set composed of the first neighbor CCE position of the initial CCE position corresponding to the target terminal and the initial CCE positions corresponding to other terminals can be obtained. The CCE repetition generation value of the CCE set is calculated, and when the CCE repetition generation value of the CCE set is less than the CCE repetition generation value of the initial CCE position corresponding to each terminal, the first neighbor CCE position of the initial CCE position corresponding to the target terminal can be retained. For example, a current optimal CCE position X tmp may be set. At this time, X tmpThe first neighborhood CCE position can be the initial CCE position of the target terminal. tmp The first neighborhood CCE position can be the initial CCE position of the target terminal.

[0111] S406, if the CCE repetition generation value corresponding to the second neighborhood CCE position of the target terminal satisfies the preset generation value condition, the second neighborhood CCE position of the target terminal is taken as the target CCE position of the target terminal.

[0112] Exemplarily, the second neighborhood CCE position of the initial CCE position corresponding to the target terminal can be continuously acquired, and the CCE repetition generation value corresponding to the second neighborhood CCE position can be calculated. When the CCE repetition generation value corresponding to the second neighborhood CCE position is equal to zero, the second neighborhood CCE position can be directly taken as the target CCE position corresponding to the target terminal. Otherwise, the CCE repetition generation value corresponding to the second neighborhood CCE position is compared with the CCE repetition generation value corresponding to the current X tmp . If the CCE repetition generation value corresponding to the second neighborhood CCE position is less than the CCE repetition generation value corresponding to the current X tmp , the second neighborhood CCE position is reserved. Otherwise, the above X tmp is continuously reserved. Subsequently, other neighborhood CCE positions of the initial CCE position corresponding to the target terminal can be continuously acquired in sequence until the CCE repetition generation value is 0. Or until the last neighborhood CCE position of the target terminal is processed, and the CCE position corresponding to the minimum CCE repetition generation value is reserved, which is the target CCE position of the target terminal.

[0113] The resource allocation method provided by the embodiments of the present disclosure can determine the target CCE position corresponding to each terminal iteratively according to the initial CCE position corresponding to each terminal and the CCE repetition generation value of the corresponding initial CCE position. Therefore, the embodiments of the present disclosure can determine the target CCE position of each terminal more optimally, avoid user blocking caused by the repetition of the target CCE positions corresponding to multiple terminals, and improve the CCE resource utilization rate.

[0114] Exemplarily, the resource allocation method provided in the embodiments of the present disclosure can be as shown in Figure 5 .

[0115] S502, start.

[0116] S504, acquire the candidate CCE position of all terminals. This step can refer to the above S202, which will not be repeated here.

[0117] S506, assign an initial CCE position X to each terminal init This step can refer to S204 described above, and will not be repeated here.

[0118] S508, calculate the CCE repetition value f(X init ) of the initial CCE position X init . Exemplarily, the operation of calculating the CCE repetition value of X init may be represented by f(X init ). This step can refer to S204 described above, and will not be repeated here.

[0119] S510, start the loop.

[0120] S512, select a neighborhood X tmp of the current optimal position set X neigh and calculate the repetition value f(X neigh ). Exemplarily, a neighborhood X neigh may be set, and when the first neighborhood CCE position of the initial CCE position corresponding to the target terminal is obtained, the first neighborhood CCE position of the initial CCE position corresponding to the target terminal is the neighborhood X neigh of the target terminal at this time. And calculate the repetition value f(X neigh ) corresponding to the neighborhood X neigh .

[0121] S514, determine whether f(X neigh ) is less than f(X init ). If yes, execute S516. If no, execute S518.

[0122] S516, take the neighborhood X neigh as the target CCE set of the terminal, and update its neighborhood set. Exemplarily, updating the neighborhood set is to delete the neighborhood X neigh at this time from all neighborhoods to obtain the updated neighborhood set.

[0123] S518, only update the neighborhood set.

[0124] S520, determine whether all neighborhoods corresponding to all terminals have been traversed. Exemplarily, the operations of S512 to S518 described above can be performed for each terminal in turn until all neighborhoods corresponding to all terminals have been traversed.

[0125] S522, determine whether a preset iteration end condition is met. This step can refer to S206 described above, and will not be repeated here.

[0126] S524, it is judged whether the CCE repetition generation value of the target CCE position of each terminal is 0. If yes, S526 is executed. If no, S528 is executed.

[0127] S526, all terminals are successfully allocated CCE positions.

[0128] S528, resource allocation is performed according to the set terminal priority, and the blocked terminal is allocated resources at the next scheduling moment. This step can refer to S208 described above, and will not be repeated here.

[0129] S530, end.

[0130] Based on the same inventive concept, the embodiment of the present disclosure also provides a resource allocation device, as described in the following embodiment. Since the principle of solving the problem of the device embodiment is similar to the above-mentioned method embodiment, the implementation of the device embodiment can refer to the implementation of the above-mentioned method embodiment, and the repeated part will not be repeated.

[0131] Figure 6 A schematic diagram of a resource allocation device in an embodiment of the present disclosure is shown, as shown in the figure, the device comprises: Figure 6

[0132] The candidate CCE position set acquisition module 601 is configured to acquire a candidate CCE position set of a physical downlink control channel corresponding to each terminal;

[0133] The initial CCE position determination module 602 is configured to determine an initial CCE position corresponding to each terminal according to the candidate CCE position set corresponding to each terminal, and calculate a CCE repetition generation value of the initial CCE position corresponding to each terminal, wherein the CCE repetition generation value of the initial CCE position corresponding to each terminal is used to indicate whether the initial CCE position corresponding to each terminal is repeated;

[0134] The target CCE position determination module 603 is configured to determine a target CCE position corresponding to each terminal by iteration according to the initial CCE position corresponding to each terminal and the CCE repetition generation value of the corresponding initial CCE position;

[0135] The resource allocation module 604 is configured to allocate physical downlink control channel resources according to the target CCE position corresponding to each terminal.

[0136] ​In some embodiments of the present disclosure, the initial CCE position determination module 602 is configured to mark positions occupied by initial CCE positions in the candidate CCE position set corresponding to each terminal in the plurality of arrays respectively; and accumulate elements at corresponding positions in the plurality of arrays to obtain a sum value array, wherein the sum value array includes a plurality of elements, and each element is an accumulation result of elements at corresponding positions in the plurality of arrays; and accumulate elements greater than 1 in the sum value array to obtain a CCE repetition value of the initial CCE position corresponding to each terminal.

[0137] In some embodiments of the present disclosure, the target CCE position determination module 603 is configured to determine a target CCE position set corresponding to each terminal in turn according to the initial CCE position corresponding to each terminal and the CCE repetition value of the initial CCE position, until a preset iteration end condition is met, to obtain the target CCE position corresponding to each terminal.

[0138] In some embodiments of the present disclosure, the preset iteration end condition is that a current iteration number is greater than a preset iteration number threshold, or a current CCE repetition value is equal to zero.

[0139] In some embodiments of the present disclosure, the target CCE position determination module 603 is configured to perform the following iteration operation on the initial CCE position corresponding to each terminal in turn to determine the target CCE position set corresponding to each terminal.

[0140] obtain a first neighborhood CCE position of the initial CCE position corresponding to the target terminal, calculate a CCE repetition value corresponding to the first neighborhood CCE position, if the CCE repetition value corresponding to the first neighborhood CCE position of the target terminal does not satisfy a preset value condition, obtain a second neighborhood CCE position of the initial CCE position corresponding to the target terminal, calculate a CCE repetition value corresponding to the second neighborhood CCE position, and if the CCE repetition value corresponding to the second neighborhood CCE position of the target terminal satisfies the preset value condition, take the second neighborhood CCE position of the target terminal as the target CCE position of the target terminal.

[0141] In some embodiments of the present disclosure, the first neighborhood CCE position of the initial CCE position corresponding to the target terminal is any CCE position in the candidate CCE position set corresponding to the target terminal except the initial CCE position.

[0142] In some embodiments of the present disclosure, the target CCE position determination module 603 is further configured to calculate a CCE repetition value of the target CCE position corresponding to each terminal.

[0143] The resource allocation module 604 is configured to: if the CCE repetition value of the target CCE position corresponding to each terminal is repeated, indicating that the target CCE position corresponding to at least one terminal is repeated, adjusting the target CCE position corresponding to the at least one terminal according to the terminal priority or the aggregation level, and allocating the physical downlink control channel resource according to the adjusted target CCE position set.

[0144] In some embodiments of the present disclosure, the resource allocation module 604 is configured to: sort the terminals whose target CCE positions are repeated in ascending order of the terminal priority or the aggregation level, and allocate the repeated target CCE positions to the terminal with the highest terminal priority or aggregation level.

[0145] In some embodiments of the present disclosure, the candidate CCE position set acquisition module 601 is configured to: acquire, according to the search space of the physical downlink control channel, the candidate CCE position set of the physical downlink control channel corresponding to each terminal.

[0146] The resource allocation apparatus provided by the embodiments of the present disclosure can determine the target CCE position corresponding to each terminal iteratively according to the initial CCE position corresponding to each terminal and the CCE repetition value of the corresponding initial CCE position. Therefore, the embodiments of the present disclosure can determine the target CCE position of each terminal more optimally, avoid user blocking caused by the repetition of the target CCE positions corresponding to multiple terminals, and improve the CCE resource utilization rate.

[0147] Those skilled in the art can understand that each aspect of the present disclosure can be implemented as a system, a method or a program product. Therefore, each aspect of the present disclosure can be specifically implemented as a complete hardware embodiment, a complete software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects, which can be collectively referred to as "circuitry", "module" or "system".

[0148] The electronic device 700 according to this embodiment of the present disclosure will be described below with reference to Figure 7 Figure 7 The electronic device 700 shown is merely an example and should not limit the functions and use range of the embodiments of the present disclosure.

[0149] As Figure 7 shown, the electronic device 700 is in the form of a general computing device. The components of the electronic device 700 can include, but are not limited to, the at least one processing unit 710 described above, the at least one storage unit 720 described above, and a bus 730 connecting different system components, including the storage unit 720 and the processing unit 710.

[0150] ​The storage unit stores program codes which can be executed by the processing unit 710, so that the processing unit 710 performs the steps described in the above "DETAILED DESCRIPTION" section according to various exemplary embodiments of the present disclosure.

[0151] The storage unit 720 can include a readable medium in the form of volatile storage unit, such as a random access memory (RAM) 7201 and / or a cache memory 7202, and further include a read-only memory (ROM) 7203.

[0152] The storage unit 720 can further include a program / utility 7204 having a set of program modules 7205 such as an operating system, one or more application programs, other program modules, and program data, each of which gives the electronic device 700 the ability to function in a networked environment, as each of these examples or some combination thereof.

[0153] The bus 730 can represent one or more of several types of bus structures, including a storage unit bus or bus controller, a peripheral bus, a graphics acceleration port, a processing unit bus, or a local bus using any of a variety of bus architectures.

[0154] The electronic device 700 can also communicate with one or more external devices 740 such as a keyboard or pointing device, a Bluetooth device, etc.; other devices such as printers, scanners, etc.; and / or various types of networks including a local area network (LAN), a wide area network (WAN), and / or the Internet. As illustrated, the electronic device 700 can communicate with one or more networks, such as a local area network (LAN), a wide area network (WAN), and / or the Internet, through a network adapter 760. The network adapter 760 can be any of a plurality of different types of such devices capable of attaching to a network and communicating over a network. The network adapter 760 can include, for example, an Ethernet adapter, a Bluetooth adapter, an 802.11 adapter, a wireless adapter, or the like. The network adapter 760 can include an internal or external device, a component, or the like, and can be connected to a system bus of the electronic device 700 via, for example, an input / output (I / O) interface 750, as illustrated in FIG. 7. The network adapter 760 can be connected to the system bus via, for example, an I / O interface 750 and / or another bus structure (not shown), as the skilled artisan will appreciate. The network adapter 760 can be configured to perform the functions of the network interface 230 described above with respect to FIG. 2.

[0155] Those skilled in the art can easily understand from the above description of the embodiments that the example embodiments described herein can be implemented by software or by software in combination with necessary hardware. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a U disk, a mobile hard disk, etc.) or a network, and includes a number of instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to perform the methods according to the embodiments of the present disclosure.

[0156] In the example embodiments of the present disclosure, a computer readable storage medium is also provided, which can be a readable signal medium or a readable storage medium. A program product capable of implementing the above method of the present disclosure is stored thereon. In some possible embodiments, various aspects of the present disclosure can also be implemented in the form of a program product, which includes program codes for causing a terminal device to perform the steps according to various example embodiments of the present disclosure described in the above “Detailed Description” section of the present specification when the program product is run on the terminal device.

[0157] More specific examples of the computer readable storage medium in the present disclosure can include, but are not limited to, an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0158] In the present disclosure, the computer readable storage medium can include a data signal carried in a baseband or as a part of a carrier wave, in which readable program codes are borne. Such a propagated data signal can take multiple forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The readable signal medium can also be any readable medium other than the readable storage medium, which can send, propagate or transmit programs for use by or in connection with an instruction execution system, apparatus or device.

[0159] Optionally, the program codes contained on the computer readable storage medium can be transmitted by any suitable medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above.

[0160] In particular embodiments, the program code utilized by the program code instructions can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++, or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computing device, partly on the user's computing device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device or entirely on the remote computing device or server. In the latter scenario, the remote computing device can be connected to the user's computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computing device, such as through the Internet using an Internet Service Provider. The application programming interface (API) server 106 can be used to facilitate the connection between the client device 102 and the remote computing device.

[0161] It should be noted that, although several modules or units of devices for action execution are mentioned in the foregoing detailed description, such division is not mandatory. Indeed, features and functionalities of two or more modules or units described above can be embodied in one module or unit according to embodiments of the present disclosure. Conversely, features and functionalities of one module or unit described above can be further divided into multiple modules or units.

[0162] Furthermore, although the various steps of the methods in the present disclosure are described in a particular order in the figures, this is not required or implied in any way as to the order of the steps or that all illustrated steps be performed to achieve desirable results. Additionally or alternatively, certain steps can be omitted, combined into fewer steps, separated into multiple steps, and / or performed in a different order than that shown.

[0163] From the above description of the embodiments, those skilled in the art will readily perceive that the example embodiments described herein can be implemented by software and / or by hardware and / or by a combination of software and hardware. Accordingly, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product. The software product can be stored in a non-volatile storage medium, such as a CD-ROM, a USB flash drive, a mobile hard disk, or the like, or on a network, and includes a number of instructions for causing a computing device (such as a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the methods according to the embodiments of the present disclosure.

[0164] Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the features disclosed herein. It is intended that the disclosure be construed as including any patents, patent applications, publications, publications, or other disclosure of complementary subject matter that is within the scope of the disclosure. It is intended that the specification and examples be considered exemplary only, with the true scope and spirit of the disclosure being indicated by the following claims.

Claims

1. A resource allocation method characterized by, The method comprises: obtaining a plurality of terminal corresponding candidate control channel element (CCE) position sets of a physical downlink control channel (PDCCH); determining initial CCE positions corresponding to each terminal according to the candidate CCE position sets corresponding to each terminal, and calculating CCE repetition replacement values of the initial CCE positions corresponding to each terminal, comprising: marking positions occupied by the initial CCE positions in the candidate CCE position sets corresponding to each terminal through a plurality of arrays; accumulating elements at corresponding positions in the plurality of arrays to obtain a sum value array, wherein the sum value array comprises a plurality of elements, and each element is an accumulation result of elements at corresponding positions in the plurality of arrays; and accumulating elements greater than 1 in the sum value array to obtain the CCE repetition replacement values of the initial CCE positions corresponding to each terminal, wherein the CCE repetition replacement values of the initial CCE positions corresponding to each terminal are used to indicate whether the initial CCE positions corresponding to each terminal are repeated; iteratively determining target CCE positions corresponding to each terminal according to the initial CCE positions corresponding to each terminal and the CCE repetition replacement values of the corresponding initial CCE positions; allocating PDCCH resources according to the target CCE positions corresponding to each terminal.

2. The resource allocation method of claim 1, wherein, The iteratively determining target CCE positions corresponding to each terminal according to the initial CCE positions corresponding to each terminal and the CCE repetition replacement values of the corresponding initial CCE positions comprises: determining a target CCE position set corresponding to each terminal according to the initial CCE position corresponding to each terminal and the CCE repetition replacement value of the initial CCE position in turn until a preset iteration end condition is met, to obtain the target CCE positions corresponding to each terminal.

3. The resource allocation method of claim 2, wherein, The preset iteration end condition is that a current iteration number is greater than a preset iteration number threshold or a current CCE repetition replacement value is equal to zero.

4. The resource allocation method according to any one of claims 2 or 3, characterized by, The method comprises: performing the following iteration operation on the initial CCE position corresponding to each terminal in turn to determine a target CCE position set corresponding to each terminal: obtaining a first neighborhood CCE position of the initial CCE position corresponding to a target terminal, and calculating a CCE repetition replacement value corresponding to the first neighborhood CCE position; if the CCE repetition replacement value corresponding to the first neighborhood CCE position of the target terminal does not meet a preset replacement value condition, obtaining a second neighborhood CCE position of the initial CCE position corresponding to the target terminal, and calculating a CCE repetition replacement value corresponding to the second neighborhood CCE position; if the CCE repetition replacement value corresponding to the second neighborhood CCE position of the target terminal meets the preset replacement value condition, taking the second neighborhood CCE position of the target terminal as a target CCE position of the target terminal.

5. The resource allocation method of claim 4, wherein, The first neighborhood CCE position of the initial CCE position corresponding to the target terminal is any CCE position in the candidate CCE position set corresponding to the target terminal except the initial CCE position.

6. The method of claim 1, wherein, The method further comprises: calculating CCE repetition replacement values of the target CCE positions corresponding to each terminal; The target CCE position of each terminal is determined according to the initial CCE position of each terminal and the CCE repetition generation value of the corresponding initial CCE position. If the CCE repetition generation value of the target CCE position of each terminal indicates that the target CCE position of at least one terminal is repeated, the target CCE position of the at least one terminal is adjusted according to the terminal priority or the aggregation level, and the physical downlink control channel resource is allocated according to the adjusted target CCE position set.

7. The resource allocation method of claim 6, wherein, The target CCE position of the at least one terminal is adjusted according to the terminal priority or the aggregation level, including: The terminal whose target CCE position is repeated is sorted according to the terminal priority or the aggregation level from small to large, and the repeated target CCE position is allocated to the terminal with the highest terminal priority or aggregation level.

8. The method of claim 1, wherein, The target CCE position of each terminal is determined according to the initial CCE position of each terminal and the CCE repetition generation value of the corresponding initial CCE position. The candidate CCE position set of the physical downlink control channel corresponding to each terminal is obtained according to the search space of the physical downlink control channel.

9. A resource allocation apparatus characterized by comprising: Including: A candidate CCE position set obtaining module is configured to obtain the candidate CCE position set of the physical downlink control channel corresponding to each terminal. An initial CCE position determining module is configured to determine the initial CCE position corresponding to each terminal according to the candidate CCE position set corresponding to each terminal, and calculate the CCE repetition generation value of the initial CCE position corresponding to each terminal, including: marking the positions occupied by the initial CCE position in the candidate CCE position set corresponding to each terminal through multiple arrays; adding the elements at the corresponding positions in the multiple arrays to obtain a sum value array, the sum value array including: multiple elements, each element being the cumulative result of the elements at the corresponding positions in the multiple arrays; adding the elements greater than 1 in the sum value array to obtain the CCE repetition generation value of the initial CCE position corresponding to each terminal, wherein the CCE repetition generation value of the initial CCE position corresponding to each terminal is used to indicate whether the initial CCE position corresponding to each terminal is repeated; A target CCE position determining module is configured to determine the target CCE position corresponding to each terminal iteratively according to the initial CCE position corresponding to each terminal and the CCE repetition generation value of the corresponding initial CCE position. A resource allocation module is configured to allocate the physical downlink control channel resource according to the target CCE position corresponding to each terminal.

10. An electronic device, comprising: Including: A processor; And A memory configured to store executable instructions of the processor; Wherein the processor is configured to execute the resource allocation method of any one of claims 1-8 by executing the executable instructions.

11. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the resource allocation method of any one of claims 1-8. The computer program is executed by the processor to implement the resource allocation method of any one of claims 1-8.

Images