A resource allocation method and device based on bitmap precalculation
By generating a bitmap during the initialization phase, the high complexity of the PDCCH resource allocation process is solved, enabling fast resource allocation and low CPU load, thus meeting the scheduling requirements of high-frequency communication systems.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- BEIJING BLUE TOWER OPTICAL TRANSMISSION INTELLIGENT TECHNOLOGY CO LTD
- Filing Date
- 2026-01-12
- Publication Date
- 2026-05-19
AI Technical Summary
In existing technologies, the resource allocation process of the Physical Downlink Control Channel (PDCCH) has high computational complexity, which leads to extended scheduling time and increased CPU load, making it difficult to meet the fast scheduling requirements of high-frequency communication systems.
A resource allocation method based on bitmap pre-computation is adopted, which generates a global resource status bitmap and a candidate pre-allocation bitmap in advance during the system initialization or configuration update phase. Resource allocation is completed through bitmap retrieval and simple calculations, avoiding complex real-time calculations.
It significantly improves resource allocation speed, reduces CPU load, meets the low latency requirements of high-frequency communication systems, has simple and easy-to-maintain logic, and is adaptable to dynamic updates in multiple scenarios.
Smart Images
Figure CN121547874B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of wireless communication technology, and in particular, to a resource allocation method. Specifically, it relates to a resource allocation method based on bitmap pre-computation, which can be used for resource allocation in the Physical Downlink Control Channel (PDCCH). This method can significantly improve allocation speed and reduce CPU load, and is suitable for high-frequency communication systems such as millimeter-wave communication / satellite communication that have stringent requirements for scheduling latency. Background Technology
[0002] The PDCCH (Physical Downlink Control Channel) is the core physical channel in wireless communication systems (especially 5G and subsequent evolution systems) that carries downlink control information (DCI). It is a key bridge for the "scheduling instruction transmission" between the base station and the terminal (UE), and directly determines whether the uplink and downlink data transmission of the terminal can proceed in an orderly manner. It is used to indicate the uplink and downlink data scheduling authorization of the terminal (UE).
[0003] In 5G and subsequent evolution systems, terminals use blind detection to receive PDCCH. To reduce the complexity of blind detection, the 3GPP protocol defines a search space mechanism based on control channel elements (CCEs), where one CCE consists of six resource element groups (REGs).
[0004] REG is a smaller resource unit (composed of multiple resource elements RE). CCE achieves flexible resource allocation through the combination of REG to adapt to control information transmission needs of different sizes.
[0005] In existing technologies, the real-time computational complexity of resource allocation is high. Specifically, when a base station allocates PDCCH resources to a UE, it needs to calculate the starting index of the CCE in real time using a complex formula specified by the protocol, based on multiple dynamic variables such as the current slot, user temporary identifier (C-RNTI), aggregation level, and candidate set. Then, it needs to traverse and check the occupancy of the CCE and its mapped REGs on the time-frequency resource grid. This process involves a large number of modulo operations, logical judgments, and loop traversals.
[0006] This real-time computing model has significant drawbacks:
[0007] First, there's the computational time consumption: performing complex calculations during scheduling directly encroaches on the already extremely short scheduling decision-making time window. For example, when the subcarrier spacing is 480kHz, a time slot is only about 31.25μs, making the high real-time computational load a scheduling bottleneck.
[0008] Secondly, it is complex to implement: the code logic is cumbersome and not conducive to software maintenance.
[0009] Therefore, how to improve the allocation speed of the Physical Downlink Control Channel (PDCCH), reduce the CPU computational load, and improve the maintainability and reliability of the computation method have become technical problems that need to be solved by existing technologies. Summary of the Invention
[0010] The purpose of this invention is to propose a resource allocation method and apparatus based on bitmap pre-computation, which can be used for resource allocation of the Physical Downlink Control Channel (PDCCH). This method advances the relevant complex calculations to the system initialization or configuration update stage and reduces the computational complexity at the scheduling time, thereby greatly improving the allocation speed.
[0011] To achieve this objective, the present invention adopts the following technical solution:
[0012] A resource allocation method based on bitmap pre-computation includes the following steps:
[0013] A global resource status bitmap is generated based on the control resource set CORESET configuration in the physical downlink control channel PDCCH, which is used to dynamically represent the real-time occupancy status of all resource element groups REG.
[0014] Based on user, aggregation degree, candidate set, and time slot, the REG bitmap occupied by each possible candidate PDCCH is pre-calculated and stored to form a candidate pre-allocated bitmap set;
[0015] Based on the current state, aggregation degree, and time slot of the terminal UE, the corresponding pre-allocated bitmap is extracted from the candidate pre-allocated bitmap set and used as the candidate set bitmap;
[0016] The candidate set bitmap is compared with the global resource status bitmap to determine whether there is a resource conflict. If there is no resource conflict, the resource is available and can be occupied.
[0017] Optionally, if the resource is available, update the global resource status bitmap, occupy the resource, and indicate that the resource allocation was successful.
[0018] Optionally, the step of generating a global resource status bitmap based on the control resource set CORESET in the physical downlink control channel PDCCH to dynamically represent the real-time occupancy status of all resource element groups REG specifically includes:
[0019] Based on the number of frequency domain resource blocks (RBs) and the number of time domain symbols in the CORESET configuration, the total number of resource element groups (REGs) is calculated, and the number of control channel units (CCEs) is determined. Then, following the resource mapping order of time domain first and then frequency domain, a bitmap with the same number of REGs is created to form the global resource state bitmap, and all bits in the global resource state bitmap are initialized to 0.
[0020] Optionally, the step of pre-calculating the REG bitmap occupied by each possible candidate PDCCH according to user, aggregation degree, candidate set, and time slot, and storing it to form a candidate pre-allocated bitmap set, specifically includes:
[0021] Each Control Channel Unit (CCE) is mapped to 6 REGs via interleaving or non-interleaving, creating a bitmap with a length equal to the total number of REGs. The bits corresponding to the 6 REGs mapped by the CCE are set to "1", and the remaining bits are kept to "0", forming the channel control unit bitmap.
[0022] Based on the maximum number of users, a computed user equipment identifier (CRNTI) is assigned to each possible user to determine the number and location of CCEs in the dedicated search space. According to the blind detection formula, the starting index of the CCE and the number of consecutively occupied CCEs are calculated for each possible aggregation degree and candidate set. Based on the aggregation degree, the number L of consecutively occupied CCEs is determined. Each candidate set occupies L consecutive CCEs, and each CCE has one CCE bitmap. The L CCE bitmaps are bitwise ORed to generate the total pre-allocated bitmap of the candidate set and saved to obtain the candidate pre-allocated bitmap set.
[0023] Optionally, the step of extracting the corresponding pre-allocated bitmap from the candidate pre-allocated bitmap set as a candidate set bitmap based on the current state, aggregation degree, and time slot of the terminal UE specifically includes:
[0024] Based on the current scheduling requirements, the target search space, user equipment identifier, aggregation degree, candidate set, and time slot number of the terminal UE are determined. From the candidate pre-allocated bitmap set, a pre-allocated bitmap that matches the target search space, user equipment identifier, aggregation degree, candidate set, and time slot number of the terminal UE is retrieved and used as the candidate set bitmap.
[0025] Optionally, comparing the candidate set bitmap with the global resource state bitmap to determine whether there is a resource conflict, and if there is no resource conflict, the resource is available and can be occupied, specifically includes:
[0026] Perform a bitwise AND operation between the candidate set bitmap and the global resource status bitmap. If the result is non-zero, it indicates that there is a resource conflict; if the result is 0, it indicates that all resources are idle and available. If a resource conflict is detected, select the next candidate set in a predetermined order, retrieve the candidate set bitmap, and repeat the above steps until the resource is available.
[0027] Optionally, if a resource is available, updating the global resource status bitmap and occupying that resource indicates successful resource allocation specifically includes:
[0028] If resources are available, perform a bitwise OR operation on the candidate set bitmap and the global resource status bitmap, and assign the result to the global resource status bitmap to complete resource occupancy, i.e., PDCCH resource allocation is successful. If all possible candidate sets have resource conflicts, the current user scheduling fails.
[0029] Optionally, the global resource status bitmap and the candidate pre-allocated bitmap set are space-compressed using a sparse bitmap approach, storing the position of "1" by using an index list instead of a complete bitmap.
[0030] Optionally, when the configuration of the control resource set CORESET or the search space configuration of the terminal UE changes, the corresponding bitmap is recalculated and updated.
[0031] The present invention further discloses an electronic device, including a processor and a memory, which are connected by a bus. The memory stores instructions or programs suitable for the processor to execute, and the processor implements the steps of the above-described resource allocation method based on bitmap pre-computation when executing the instructions or programs.
[0032] In summary, the present invention has the following advantages:
[0033] 1. Significantly improves allocation speed and reduces latency.
[0034] By shifting the computation of complex functions during scheduling to pre-calculation during the initialization phase, only simple bitmap retrieval and bit operations are required during scheduling, significantly reducing the time consumption of PDCCH resource allocation and perfectly adapting to the stringent latency requirements of short time slot high-frequency communications such as millimeter wave and satellite communications.
[0035] 2. Reduce CPU load and improve system energy efficiency
[0036] By replacing real-time intensive computation with pre-stored bitmaps, CPU load is significantly reduced, allowing the processor to focus on core scheduling algorithms, reducing resource redundancy consumption, and effectively improving the overall capacity and energy utilization efficiency of the communication system.
[0037] 3. High reliability, easy maintenance, and strong adaptability
[0038] The solution has a simple logic, isolates complex calculations in the initialization phase, has a clear and easy-to-maintain code structure, supports dynamic updates in multiple scenarios and bitmap-optimized storage, is compatible with 3GPP protocols, and can adapt to diverse scheduling needs. Attached Figure Description
[0039] Figure 1 This is a flowchart of a resource allocation method based on bitmap pre-computation according to a specific embodiment of the present invention;
[0040] Figure 2 This is a flowchart of the initialization phase according to a specific embodiment of the present invention;
[0041] Figure 3 This is a flowchart of the Physical Downlink Control Channel (PDCCH) resource allocation phase according to a specific embodiment of the present invention;
[0042] Figure 4 This is a schematic diagram of a resource allocation device based on bitmap pre-calculation according to a specific embodiment of the present invention. Detailed Implementation
[0043] The present invention will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and not intended to limit it. Furthermore, it should be noted that, for ease of description, the accompanying drawings show only the parts relevant to the present invention, and not all of the structures.
[0044] In this invention, the relevant terms are explained as follows:
[0045] 1. Resource allocation mechanism based on CCE
[0046] The resource allocation of PDCCH is based on the control channel unit (CCE). One CCE is fixed to consist of 6 resource element groups (REG).
[0047] REG is a smaller resource unit, composed of multiple resource elements RE. CCE achieves flexible resource allocation through the combination of REG, adapting to control information transmission needs of different sizes.
[0048] 2. Blind Detection
[0049] The terminal UE cannot know the exact location and format of the PDCCH in advance, and needs to traverse the preset "Search Space" through a "blind detection" method to try to decode the DCI in the PDCCH;
[0050] To reduce the complexity of blind detection, the 3GPP protocol defines a common search space (CSS, general control information for all terminals) and a dedicated search space (USS, specific control information for a particular terminal). Terminals only need to perform detection within the corresponding search space, reducing unnecessary traversal.
[0051] 3. Aggregation Level Adaptation
[0052] The aggregation degree is a core configuration parameter of PDCCH, which refers to the number of consecutive CCEs occupied by PDCCH (supporting specifications such as 1, 2, 4, 8, 16, etc.).
[0053] When the channel quality is poor, the base station will choose a higher aggregation degree (such as 8 or 16 CCEs) to improve the decoding success rate of PDCCH by stacking more resources; when the channel quality is good, a lower aggregation degree (such as 1 or 2 CCEs) will be chosen to save control channel resources and improve system capacity.
[0054] The main feature of this invention is that the complex calculations related to dynamic variables in the allocation of Physical Downlink Control Channel (PDCCH) resources are completed in advance during the system initialization or configuration update stage, and the results are pre-stored in the form of a bitmap. During scheduling, resource allocation is simplified to retrieval of the pre-stored bitmap and simple bit operations, thereby greatly improving the allocation speed.
[0055] For details, see Figure 1 The flowchart illustrates a resource allocation method based on bitmap pre-computation according to the present invention, used for resource allocation in the Physical Downlink Control Channel (PDCCH), comprising the following steps:
[0056] A global resource status bitmap is generated based on the control resource set CORESET configuration in the physical downlink control channel PDCCH, which is used to dynamically represent the real-time occupancy status of all resource element groups REG.
[0057] Based on user, aggregation degree, candidate set, and time slot, pre-calculate the REG bitmap occupied by each possible candidate PDCCH and store it permanently, for example, in a database, to form a candidate pre-allocated bitmap set;
[0058] Based on the current state, aggregation degree, and time slot of the terminal UE, the corresponding pre-allocated bitmap is extracted from the candidate pre-allocated bitmap set and used as the candidate set bitmap;
[0059] The candidate set bitmap is compared with the global resource status bitmap to determine whether there is a resource conflict. If there is no resource conflict, the resource is available and can be occupied.
[0060] Furthermore, if the resource is available, the global resource status bitmap is updated, and the resource is occupied, indicating that the resource allocation was successful.
[0061] In this method, the generation of the global resource state bitmap and the candidate pre-allocation bitmap set belongs to the initialization stage of the present invention. By pre-calculating and generating two types of key bitmaps, the complex dynamic calculations at the scheduling time are staticized, laying the foundation for simple bit operations in the subsequent scheduling stage.
[0062] The resource allocation process is based on the bitmap generated during the initialization phase. It replaces the complex real-time calculation of traditional solutions with the logic of "retrieval-detection-occupation", and completes conflict-free resource allocation within an extremely short scheduling window, meeting the low latency requirements of high-frequency communication.
[0063] Further, see Figure 2 The flowchart of the initialization phase of a specific embodiment of the present invention is shown.
[0064] The step of generating a global resource status bitmap based on the control resource set CORESET in the physical downlink control channel PDCCH to dynamically represent the real-time occupancy of all resource element groups REG specifically includes:
[0065] Based on the number of frequency domain resource blocks (RBs) and the number of time domain symbols in the CORESET configuration, the total number of resource element groups (REGs) is calculated, and the number of control channel units (CCEs) is determined. Subsequently, following the resource mapping order of time domain first and then frequency domain, a bitmap with the same number of REGs is created to form the global resource state bitmap, and all bits in the global resource state bitmap are initialized to 0.
[0066] The process of pre-calculating the REG bitmap for each possible candidate PDCCH based on user, aggregation degree, candidate set, and time slot, and then storing it to form a candidate pre-allocated bitmap set, specifically includes:
[0067] Each Control Channel Unit (CCE) is mapped to 6 REGs using either interleaving or non-interleaving. Given that the 6 REGs may not be continuous in the time-frequency domain due to the interleaving or non-interleaving mapping method, a bitmap with a length equal to the total number of REGs is created. The bits corresponding to the 6 REGs mapped by the CCE are set to "1", and the remaining bits are kept to "0", forming the Channel Control Unit Bitmap (CCE BITMAP).
[0068] Based on the maximum number of users, a computed user equipment identifier (CRNTI) is assigned to each possible user to determine the number and location of CCEs in the dedicated search space. According to the blind detection formula, the starting index of CCE and the number of consecutively occupied CCEs are calculated for each possible aggregation degree and candidate set in the public and dedicated search spaces. Based on the aggregation degree, the number L of consecutively occupied CCEs is determined, i.e., the number and location of CCEs are determined. Each candidate set occupies L consecutive CCEs, and each CCE has one CCE bitmap. The L CCE bitmaps are bitwise ORed to generate the total pre-allocated bitmap of the candidate set and saved, thus obtaining the candidate pre-allocated bitmap set.
[0069] The global resource state bitmap represents the initial idle state of all REGs;
[0070] The Channel Control Unit (CCE) bitmap maps the CCE to the REG.
[0071] The candidate pre-allocated bitmap set covers all possible PDCCH candidate set resource usage scenarios and can be stored in a bitmap database.
[0072] Therefore, by performing a one-time calculation, the corresponding bitmap is generated during system initialization or configuration update, eliminating the need for repeated calculations. The generated bitmap remains stable when the configuration remains unchanged, ensuring the reliability of retrieval during the scheduling phase. Furthermore, the bitmap has strong adaptability, supporting interleaved / non-interleaved mapping, multiple aggregation degrees, and multi-user scenarios, and is compatible with 3GPP protocol specifications.
[0073] See Figure 3 The flowchart of the Physical Downlink Control Channel (PDCCH) resource allocation phase according to a specific embodiment of the present invention is shown.
[0074] The step of extracting the corresponding pre-allocated bitmap from the candidate pre-allocated bitmap set as a candidate set bitmap based on the current state, aggregation degree, and time slot of the terminal UE specifically includes:
[0075] Based on the current scheduling requirements, the target search space (public search space or dedicated search space), user equipment identifier (C-RNTI), aggregation degree, candidate set and time slot number of the terminal UE are determined. From the candidate pre-allocated bitmap set, such as a bitmap database, a pre-allocated bitmap that matches the above parameters is retrieved as the candidate set bitmap.
[0076] The step of comparing the candidate set bitmap with the global resource status bitmap to determine whether there is a resource conflict, and if there is no resource conflict, the resource is available and can be occupied, specifically includes:
[0077] Perform a bitwise AND operation between the candidate set bitmap and the global resource status bitmap. If the result is non-zero, it indicates that there is a resource conflict; if the result is 0, it indicates that all resources are idle and available. If a resource conflict is detected, select the next candidate set in a predetermined order, retrieve the candidate set bitmap, and repeat the above steps until the resource is available.
[0078] If a resource is available, the global resource status bitmap is updated, and the resource is occupied, indicating successful resource allocation. This specifically includes:
[0079] If resources are available, perform a bitwise OR operation on the candidate set bitmap and the global resource status bitmap, and assign the result to the global resource status bitmap to complete resource occupancy, i.e., PDCCH resource allocation is successful. If all possible candidate sets have resource conflicts, the current user scheduling fails.
[0080] Therefore, PDCCH resource allocation only involves bitmap retrieval and bit operations, eliminating the need for complex formula calculations and loop traversal, greatly reducing time consumption and meeting the short time slot scheduling requirements of high-frequency systems such as millimeter-wave communication; the resource allocation process has a simple logic, and bit operations can be quickly implemented through hardware circuits or software, resulting in low code complexity and easy maintenance; it has high overall adaptability, supporting public / private search spaces, multiple aggregation degrees, and multi-user scenarios, and is compatible with 3GPP protocol specifications, which can flexibly adapt to the scheduling needs of 5G and subsequent evolution systems.
[0081] Furthermore, the global resource status bitmap and the candidate pre-allocated bitmap set are space-compressed using a sparse bitmap approach, and the positions of "1" are stored by using an index list instead of a complete bitmap to save storage space.
[0082] In addition, the present invention also has a dynamic update mechanism, which triggers the recalculation and update of the corresponding bitmap when the configuration of the control resource set CORESET or the search space configuration of the terminal UE changes.
[0083] For example, when the configuration of the control resource set CORESET changes, the global resource status bitmap is updated again. Since the control resource set CORESET is related to the total number of REGs and the mapping relationship between CCE and REGs, the candidate pre-allocation bitmap set is also updated again.
[0084] When the search space configuration of a UE changes, the relevant bitmap of the dedicated search space corresponding to that UE can be updated.
[0085] See Figure 4The present invention also discloses an electronic device, such as a resource allocation device based on bitmap pre-computation, comprising a processor 91 and a memory 92, the processor 91 and the memory 92 being connected via a bus 93. The memory 92 stores instructions or programs suitable for execution by the processor 91, and when the processor 91 executes the instructions or programs, it implements the steps of the above-described resource allocation method based on bitmap pre-computation.
[0086] The present invention further discloses a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the above-described resource allocation method based on bitmap pre-computation.
[0087] In summary, the present invention has the following advantages:
[0088] 1. Significantly improves allocation speed and reduces latency.
[0089] By shifting the computation of complex functions during scheduling to pre-calculation during the initialization phase, only simple bitmap retrieval and bit operations are required during scheduling, significantly reducing the time consumption of PDCCH resource allocation and perfectly adapting to the stringent latency requirements of short time slot high-frequency communications such as millimeter wave and satellite communications.
[0090] 2. Reduce CPU load and improve system energy efficiency
[0091] By replacing real-time intensive computation with pre-stored bitmaps, CPU load is significantly reduced, allowing the processor to focus on core scheduling algorithms, reducing resource redundancy consumption, and effectively improving the overall capacity and energy utilization efficiency of the communication system.
[0092] 3. High reliability, easy maintenance, and strong adaptability
[0093] The solution has a simple logic, isolates complex calculations in the initialization phase, has a clear and easy-to-maintain code structure, supports dynamic updates in multiple scenarios and bitmap-optimized storage, is compatible with 3GPP protocols, and can adapt to diverse scheduling needs.
[0094] Obviously, those skilled in the art will understand that the various units or steps of the present invention described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device, or alternatively, they can be implemented using computer-executable program code, thereby allowing them to be stored in a storage device for execution by the computing device. Alternatively, they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the present invention is not limited to any particular combination of hardware and software.
[0095] The above description is a further detailed explanation of the present invention in conjunction with specific preferred embodiments. It should not be considered that the specific embodiments of the present invention are limited to this. For those skilled in the art, several simple deductions or substitutions can be made without departing from the concept of the present invention, and all such deductions or substitutions should be considered to fall within the scope of protection of the present invention as defined by the submitted claims.
Claims
1. A resource allocation method based on bitmap pre-computation, characterized in that, Includes the following steps: A global resource status bitmap is generated based on the control resource set CORESET configuration in the Physical Downlink Control Channel (PDCCH). This bitmap dynamically represents the real-time occupancy status of all resource element groups (REGs). Specifically, Based on the number of frequency domain resource blocks (RBs) and the number of time domain symbols in the CORESET configuration, the total number of resource element groups (REGs) is calculated, and then the number of control channel units (CCEs) is determined. Subsequently, following the resource mapping order of first time domain and then frequency domain, a bitmap equal to the total number of REGs is created to form the global resource state bitmap, and all bits in the global resource state bitmap are initialized to 0. Based on user, aggregation degree, candidate set, and time slot, the REG bitmap occupied by each possible candidate PDCCH is pre-calculated and stored to form a candidate pre-allocated bitmap set. Specifically, Each Control Channel Unit (CCE) is mapped to 6 REGs via interleaving or non-interleaving, creating a bitmap with a length equal to the total number of REGs. The bits corresponding to the 6 REGs mapped by the CCE are set to "1", while the remaining bits are kept to "0", thus forming the Control Channel Unit (CCE) bitmap. Based on the maximum number of users, a User Equipment Identifier (CRNTI) is assigned to each possible user to determine the number and location of CCEs in the dedicated search space. According to the blind detection formula, the starting index of the CCE and the number of consecutively occupied CCEs are calculated for each possible aggregation degree and candidate set. Based on the aggregation degree, the number L of consecutively occupied CCEs is determined. Each candidate set occupies L consecutive CCEs, and each CCE has one CCE bitmap. The L CCE bitmaps are bitwise ORed to generate the total pre-allocated bitmap for each candidate set and are saved to obtain the candidate pre-allocated bitmap set. The global resource state bitmap represents the initial idle state of all REGs; The control channel unit (CCE) bitmap implements the mapping between CCE and REG; Based on the current state, aggregation degree, and time slot of the terminal UE, the corresponding pre-allocated bitmap is extracted from the candidate pre-allocated bitmap set as a candidate set bitmap. Specifically, Based on the current scheduling requirements, the target search space, user equipment identifier (CRNTI), aggregation degree, candidate set, and time slot number of the terminal UE are determined. From the candidate pre-allocated bitmap set, a pre-allocated bitmap that matches the target search space, user equipment identifier (CRNTI), aggregation degree, candidate set, and time slot number of the terminal UE is retrieved and used as the candidate set bitmap. The candidate set bitmap is compared with the global resource status bitmap to determine if there is a resource conflict. If there is no resource conflict, the resource is available and can be occupied. If the resource is available, update the global resource status bitmap, occupy the resource, indicating successful resource allocation, specifically including: If resources are available, perform a bitwise OR operation on the candidate set bitmap and the global resource status bitmap, and assign the result to the global resource status bitmap to complete resource occupancy, i.e., PDCCH resource allocation is successful. If all possible candidate sets have resource conflicts, the current user scheduling fails.
2. The resource allocation method according to claim 1, characterized in that: The step of comparing the candidate set bitmap with the global resource status bitmap to determine whether there is a resource conflict, and if there is no resource conflict, the resource is available and can be occupied, specifically includes: Perform a bitwise AND operation between the candidate set bitmap and the global resource status bitmap. If the result is non-zero, it indicates that there is a resource conflict; if the result is 0, it indicates that all resources are idle and available. If a resource conflict is detected, select the next candidate set in a predetermined order, retrieve the candidate set bitmap, and repeat the comparison with the global resource status bitmap until the resource is available.
3. The resource allocation method according to claim 1 or 2, characterized in that: The global resource status bitmap and the candidate pre-allocated bitmap set are space-compressed using a sparse bitmap approach, storing the position of "1" using an index list instead of a complete bitmap.
4. The resource allocation method according to claim 3, characterized in that: When the configuration of the control resource set CORESET or the search space configuration of the terminal UE changes, the corresponding bitmap is recalculated and updated.
5. An electronic device comprising a processor and a memory, the processor and the memory being connected via a bus, characterized in that: The memory stores instructions or programs suitable for processor execution, and the processor executes the instructions or programs to implement the steps of the resource allocation method based on bitmap pre-computation as described in any one of claims 1-4.