Interference bitmap generation method and device, equipment and medium
By detecting interference within multiple time windows and updating the interference bitmap by combining local and global interference conditions, the problem of low reliability of interference bitmaps in existing technologies is solved, thereby improving the reliability of interference bitmaps and the efficiency of resource block scheduling.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-09
- Publication Date
- 2026-03-13
AI Technical Summary
The reliability of interference bitmaps in existing technologies is relatively low, and they cannot effectively cope with the frequently changing interference in real communication environments, resulting in reduced signal-to-noise ratio, decreased data rate, and limited system capacity.
Based on the interference detection results within multiple time windows, a candidate interference bitmap is generated. By combining the local and global interference situation of the resource block with the current interference bitmap, it is determined whether an update is needed and a new interference bitmap is generated for resource scheduling.
It improves the reliability and overall update of interference bitmaps, avoids dependence on detection cycles, addresses the problem of low reliability in interference bitmap generation, and enhances the scheduling efficiency of resource blocks.
Smart Images

Figure CN121665358A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of wireless communication technology, and more specifically, to an interference bitmap generation method, apparatus, device, and medium. Background Technology
[0002] In wireless communication technology, interference refers to any unwanted signals that superimpose on the target signal, making it difficult for the receiver to correctly demodulate and decode information. The impact of interference on communication systems is manifested in the following ways: 1. Interference directly reduces the signal-to-noise ratio (SNR) or signal-to-interference-plus-noise ratio (SINR), resulting in decreased throughput and data rate; 2. Interference degrades service quality, leading to user experiences such as stuttering, high latency, dropped calls, and poor call quality; 3. Interference limits system capacity, requiring the system to adopt more conservative modulation and coding schemes or allocate more resources to combat interference, thus reducing the overall network capacity and efficiency. Therefore, selecting channels with less interference during communication can effectively avoid signal interference. However, in real-world communication environments, in addition to some fixed interference, there are also frequently changing interferences. In such cases, base stations need to monitor interference in real time and select frequency resources with less interference for services. However, current technologies suffer from relatively low reliability in generating interference bitmaps to characterize interference. Summary of the Invention
[0003] In view of this, the purpose of this application is to provide a method, apparatus, device and medium for generating interference bitmaps, so as to improve the problem of relatively low reliability of interference bitmaps in the prior art.
[0004] To achieve the above objectives, this application adopts the following technical solution: A method for generating an interference bitmap, comprising: Based on the results of interference detection on multiple resource blocks within multiple time windows, a candidate interference bitmap is determined, wherein the candidate interference bitmap is used to reflect the interference situation of each resource block. Based on the local interference situation of the resource block and / or the global interference situation of the resource block, the candidate interference bitmap is compared with the current interference bitmap to determine whether the interference bitmap needs to be updated. When it is determined that an interference bitmap update is required, a new current interference bitmap is generated based on at least the candidate interference bitmap, wherein the new current interference bitmap is used to replace the current interference bitmap as a basis for resource scheduling of the multiple resource blocks.
[0005] In a preferred embodiment of this application, in the above-described interference bitmap generation method, the step of comparing the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource block to determine whether an interference bitmap update is needed includes: The number of resource blocks with different interference conditions between the candidate interference bitmap and the current interference bitmap is counted to obtain the number of resource block changes. The number of resource block changes is then compared with a predetermined number threshold to obtain a number comparison result. If the quantity comparison result indicates that the number of changes in the resource block is greater than the quantity threshold, then it is determined that an interference bitmap update is required. If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then based on the difference between the interference detection results of each resource block in multiple time windows and the interference situation of the resource block in the current interference bitmap, it is determined whether the interference bitmap needs to be updated.
[0006] In a preferred embodiment of this application, in the above-described interference bitmap generation method, the step of determining whether an interference bitmap update is needed based on the difference between the interference detection results of each resource block within multiple time windows and the interference status of that resource block in the current interference bitmap if the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold includes: If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then for each resource block, it is determined whether the results of interference detection of the resource block in multiple time windows have consecutive results greater than or equal to a predetermined target number that are different from the interference situation of the resource block in the current interference bitmap, and if they are different from the interference situation of the resource block in the current interference bitmap, then the resource block is determined as the target resource block. If at least one target resource block exists, it is determined that an interference bitmap update is required; If there is no target resource block, then it is determined that no interference bitmap update is required.
[0007] In a preferred embodiment of this application, the step of determining candidate interference bitmaps based on the results of interference detection on multiple resource blocks within multiple time windows in the above-described interference bitmap generation method includes: For each of the multiple time windows, an initial interference bitmap corresponding to that time window is generated based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window. One time window corresponds to one initial interference bitmap. The initial interference bitmaps corresponding to each of the multiple time windows are merged to form a candidate interference bitmap.
[0008] In a preferred embodiment of this application, in the above-described interference bitmap generation method, the step of generating an initial interference bitmap corresponding to each of the multiple time windows, based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window, includes: For each of the multiple time windows, based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window, the interference situation corresponding to each resource block in that time window is determined. If the maximum value of the interference level represented by the results of multiple interference detections is greater than a predetermined interference level threshold, the determined interference situation is considered to have interference. If the maximum value of the interference level represented by the results of multiple interference detections is not greater than the predetermined interference level threshold, the determined interference situation is considered to have no interference. For each of the multiple time windows, based on the interference situation of each resource block in the multiple resource blocks corresponding to that time window, an initial interference bitmap corresponding to that time window is determined, wherein the initial interference bitmap is used to reflect whether the interference situation of each resource block in the corresponding time window is present or not.
[0009] In a preferred embodiment of this application, the step of fusing the initial interference bitmaps corresponding to each of the plurality of time windows to form a candidate interference bitmap in the above-described interference bitmap generation method includes: For each resource block, the number of interference situations corresponding to the resource block in the multiple initial interference bitmaps corresponding to the multiple time windows is counted, and the candidate interference situations of the resource block are determined based on the relationship between the number and the predetermined interference number threshold. Based on the candidate interference situation of each resource block, a candidate interference bitmap is determined.
[0010] In a preferred embodiment of this application, in the above-described interference bitmap generation method, after the step of generating a new current interference bitmap based at least on the candidate interference bitmap when it is determined that an interference bitmap update is needed, the interference bitmap generation method further includes: The number of times the interference bitmap update is determined to be needed is counted to obtain the target update count; If the target update count is greater than a predetermined update count threshold, then a slow update operation for the interference bitmap is performed. This slow update operation is used to adjust relevant parameters in the step of determining candidate interference bitmaps based on the results of interference detection of multiple resource blocks within multiple time windows, and / or to adjust relevant parameters in the step of comparing the candidate interference bitmaps with the current interference bitmap based on local and / or global interference conditions of resource blocks, in order to reduce the number of times an interference bitmap update is required.
[0011] This application also provides an interference bitmap generation apparatus, comprising: The interference bitmap determination module is used to determine candidate interference bitmaps based on the results of interference detection on multiple resource blocks within multiple time windows. The candidate interference bitmaps are used to reflect the interference situation of each resource block. The update determination module is used to compare the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource block, so as to determine whether the interference bitmap needs to be updated. An interference bitmap generation module is used to generate a new current interference bitmap based on at least the candidate interference bitmap when it is determined that an interference bitmap update is needed. The new current interference bitmap is used to replace the current interference bitmap as the basis for resource scheduling of the multiple resource blocks.
[0012] Based on the above, this application also provides an electronic device, including: Memory, used to store computer programs; A processor connected to the memory is used to execute a computer program stored in the memory to implement the above-described method for generating interference bitmaps.
[0013] Based on the above, this application also provides a computer-readable storage medium storing a computer program that, when executed, performs the various steps of the above-described interference bitmap generation method.
[0014] The interference bitmap generation method, apparatus, device, and medium provided in this application first determine candidate interference bitmaps based on the interference detection results of multiple resource blocks within multiple time windows. These candidate interference bitmaps reflect the interference situation of each resource block. Second, based on the local and / or global interference situations of the resource blocks, the candidate interference bitmaps and the current interference bitmap are compared to determine whether an interference bitmap update is needed. Then, when an update is determined, a new current interference bitmap is generated based on at least the candidate interference bitmaps. This new current interference bitmap replaces the current interference bitmap and serves as the basis for resource scheduling of multiple resource blocks. Based on the above, since the candidate interference bitmaps are determined based on interference detection results within multiple time windows, compared to the conventional scheme that obtains the interference bitmap by threshold comparison based on detection results within a single time window, this method offers higher reliability. It effectively avoids reliance on reliable detection cycle settings, thereby improving the problem of low reliability of interference bitmaps caused by inappropriate detection cycles. On the other hand, since the update is based on the local and / or global interference of resource blocks, compared to schemes that directly obtain the interference bitmap by comparing thresholds based on detection results within a single time window, this approach improves the overall consistency of the interference bitmap update. In other words, the update is performed holistically, rather than on individual resource blocks, thus enhancing reliability. Therefore, this approach addresses the relatively low reliability of interference bitmap generation in existing technologies. Attached Figure Description
[0015] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings.
[0016] Figure 1 A structural block diagram of an electronic device provided in an embodiment of this application.
[0017] Figure 2 This is a flowchart illustrating the interference bitmap generation method provided in an embodiment of this application.
[0018] Figure 3 This is a schematic diagram of generating an interference bitmap using a sliding window, as provided in an embodiment of this application.
[0019] Figure 4 This is a block diagram of an interference bitmap generation device provided in an embodiment of this application. Detailed Implementation
[0020] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. The components of the embodiments of this application described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.
[0021] Therefore, the following detailed description of the embodiments of this application provided in the accompanying drawings is not intended to limit the scope of the claimed application, but merely to illustrate selected embodiments of the application. All other embodiments obtained by those skilled in the art based on the embodiments of this application without inventive effort are within the scope of protection of this application.
[0022] like Figure 1 As shown in the illustration, this application provides an electronic device. The electronic device may include a memory, a processor, and an interference bitmap generation device.
[0023] In detail, the memory and the processor are electrically connected directly or indirectly to enable data transmission or interaction. For example, the memory and the processor can be electrically connected via one or more communication buses or signal lines. The interference bitmap generation device includes at least one software functional module stored in the memory in the form of software or firmware. The processor is used to execute executable computer programs stored in the memory, such as the software functional modules and computer programs included in the interference bitmap generation device, to implement the interference bitmap generation method provided in the embodiments of this application.
[0024] Optionally, the memory may be, but is not limited to, random access memory (RAM), read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), etc.
[0025] Optionally, the processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), a system on chip (SoC), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.
[0026] Understandable. Figure 1 The structure shown is for illustrative purposes only; the electronic device may also include components that are more advanced than those shown. Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown may include, for example, a communication unit for exchanging information with other devices.
[0027] Combination Figure 2 This application also provides an interference bitmap generation method applicable to the aforementioned electronic device. The method steps defined in the process related to the interference bitmap generation method can be implemented by the electronic device. The following will describe... Figure 2 The specific process shown will be explained in detail.
[0028] Step S110: Based on the results of interference detection on multiple resource blocks within multiple time windows, candidate interference bitmaps are determined.
[0029] In this embodiment, the electronic device can determine a candidate interference bitmap based on the results of interference detection on multiple resource blocks (RBs, e.g., an RB specifically includes 12 or other numbers of consecutive subcarriers and a time interval, such as 0.5ms or 1ms) within multiple time windows. The candidate interference bitmap reflects the interference situation of each resource block, such as whether interference exists or the degree of interference. It should also be noted that the multiple time windows can be formed by sliding windows (the step size of the sliding window is not limited, such as 1, 2, 3, etc.), or they can be not formed by sliding windows.
[0030] Step S120: Based on the local interference situation of the resource block and / or the global interference situation of the resource block, compare the candidate interference bitmap with the current interference bitmap to determine whether the interference bitmap needs to be updated.
[0031] In this embodiment, after obtaining the candidate interference bitmap, the electronic device can compare the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource blocks to determine whether an interference bitmap update is needed. That is, it can compare the local interference situation of the resource blocks in the candidate interference bitmap with the local interference situation of the resource blocks in the current interference bitmap to determine whether an interference bitmap update is needed; it can also compare the global interference situation of the resource blocks in the candidate interference bitmap with the global interference situation of the resource blocks in the current interference bitmap to determine whether an interference bitmap update is needed; or it can combine the comparison results of the local interference situation and the comparison results of the global interference situation to determine whether an interference bitmap update is needed.
[0032] Step S130: When it is determined that the interference bitmap needs to be updated, a new current interference bitmap is generated based on at least the candidate interference bitmap.
[0033] In this embodiment, after determining whether an interference bitmap update is needed, the electronic device can generate a new current interference bitmap based at least on the candidate interference bitmaps. The new current interference bitmap replaces the current interference bitmap and serves as the basis for resource scheduling of the multiple resource blocks. For example, resource blocks with no interference or low interference levels can be selected for data transmission.
[0034] Based on the above, on the one hand, since the candidate interference bitmap is determined based on interference detection results within multiple time windows, it offers higher reliability compared to the conventional approach of obtaining the interference bitmap through threshold comparison based on detection results within a single time window. This effectively avoids reliance on reliable detection cycle settings, thus mitigating the problem of low reliability caused by inappropriate detection cycles. On the other hand, since updates are based on the local and / or global interference conditions of resource blocks, compared to approaches that directly obtain the interference bitmap through threshold comparison based on detection results within a single time window, the overall nature of the interference bitmap update is improved. That is, the update is holistic, rather than performed on individual resource blocks, further enhancing reliability. Therefore, this approach addresses the relatively low reliability of interference bitmap generation in existing technologies.
[0035] Firstly, regarding step S110, it should be noted that the specific method for determining the candidate interference bitmap is not limited and can be selected according to actual needs.
[0036] For example, in an alternative implementation, in order to ensure that the determined candidate interference bitmap has high reliability, that is, to be able to provide a relatively stable and reliable characterization of the interference situation of each resource block, the above step S110 may further include steps S111 and S112, wherein the specific contents of each step are as follows.
[0037] Step S111: For each of the multiple time windows, based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window, an initial interference bitmap corresponding to that time window is generated.
[0038] In this embodiment, for each of multiple time windows, an initial interference bitmap corresponding to that time window can be generated based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window. One time window corresponds to one initial interference bitmap. That is, within a time window, multiple interference detections are performed on a resource block, resulting in multiple corresponding results. Then, based on these multiple results, the interference situation of the resource block in the initial interference bitmap is determined, thus ensuring the reliability of the determined interference situation.
[0039] Step S112: Merge the initial interference bitmaps corresponding to each of the multiple time windows to form a candidate interference bitmap.
[0040] In this embodiment of the application, after obtaining the initial interference bitmap corresponding to each time window, the initial interference bitmaps corresponding to each time window in the multiple time windows can be merged to form a candidate interference bitmap, thereby further improving the reliability of the interference bitmap.
[0041] It is understood that the specific method of generating the initial interference bitmap in step S111 above is not limited. For example, in an alternative implementation, in order to further improve the reliability of the generated initial interference bitmap in representing the interference situation, step S111 above may further include steps S111a and S111b, wherein the specific contents of each step are as follows.
[0042] Step S111a: For each of the multiple time windows, based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window, determine the interference situation of each resource block in that time window.
[0043] In this embodiment, for each of the multiple time windows, the interference situation of each resource block in that time window can be determined based on the results of multiple interference detections performed on each resource block within that time window. Specifically, if the maximum value of the interference severity represented by the multiple interference detection results is greater than a predetermined interference severity threshold, the determined interference situation is considered to have interference; if the maximum value of the interference severity represented by the multiple interference detection results is not greater than the predetermined interference severity threshold, the determined interference situation is considered to have no interference. In other words, for a resource block, multiple interference detections can be performed continuously within a time window, yielding multiple interference detection results (Ni, noise / interference power value; the detection method can refer to relevant existing technologies and is not specifically limited here). Then, the maximum value can be determined from these multiple interference detection results, i.e., the maximum interference level. Finally, this maximum value can be compared with an interference level threshold. If it is greater than the threshold, interference is determined to exist, for example, represented by a first value. Conversely, if it is not greater than the threshold, interference is determined to not exist, for example, represented by a second value. The specific values of the first and second values are not limited, as long as they are two distinct values that can be differentiated. For example, the first value can be 1, the second value can be 0, or other combinations of values. Thus, determining interference through multiple consecutive interference detection results can improve the reliability of the determined interference situation to a certain extent, avoiding detection errors caused by normal burst signals.
[0044] Step S111b: For each of the multiple time windows, based on the interference situation of each resource block in the multiple resource blocks corresponding to that time window, determine the initial interference bitmap corresponding to that time window.
[0045] In this embodiment, after obtaining the interference situation of each resource block in each time window, an initial interference bitmap corresponding to each of the multiple time windows can be determined based on the interference situation of each resource block in that time window. The initial interference bitmap reflects whether the interference situation of each resource block within the corresponding time window is present or absent. In other words, the interference situations of resource blocks belonging to the same time window can be combined to obtain the initial interference bitmap corresponding to that time window.
[0046] It is understood that the specific method of forming the candidate interference bitmap in step S112 above is not limited. For example, in an alternative implementation, in order to further improve the reliability of the formed candidate interference bitmap, step S112 above may further include steps S112a and S112b, wherein the specific contents of each step are as follows.
[0047] Step S112a: For each resource block, count the number of interference situations corresponding to the resource block in the multiple initial interference bitmaps corresponding to the multiple time windows that have interference, and determine the candidate interference situation of the resource block based on the relationship between the number and the predetermined interference number threshold.
[0048] In this embodiment, for each resource block, the number of interference cases corresponding to the resource block in the multiple initial interference bitmaps corresponding to multiple time windows that are considered to have interference can be counted. Based on the relationship between this number and a predetermined interference quantity threshold, candidate interference cases for the resource block can be determined. For example, if the number of interference cases corresponding to a resource block in the multiple initial interference bitmaps corresponding to multiple time windows that are considered to have interference is greater than the interference quantity threshold, it can be determined that the resource block is largely subject to interference, or in other words, there is relatively stable interference. Therefore, the candidate interference cases for the resource block can be determined as having interference, for example, represented by a first parameter. Conversely, if the number of interference cases corresponding to a resource block in the multiple initial interference bitmaps corresponding to multiple time windows that are considered to have interference is not greater than the interference quantity threshold, it can be determined that the resource block is largely free of interference, or in other words, there is no relatively stable interference. Therefore, the candidate interference cases for the resource block can be determined as having no interference, for example, represented by a second parameter.
[0049] Step S112b: Determine the candidate interference bitmap based on the candidate interference situation of each resource block.
[0050] In this embodiment of the application, after obtaining the candidate interference situation of each resource block, a candidate interference bitmap can be determined based on the candidate interference situation of each resource block. That is, the candidate interference situation of each resource block can be combined together to form a candidate interference bitmap.
[0051] Secondly, regarding step S120, it should be noted that there are no restrictions on the specific method for determining whether an interference bitmap update is needed, and the appropriate method can be selected according to actual needs.
[0052] For example, in an alternative implementation, in order to ensure the necessity of updating the interference bitmap and avoid the problem of wasting resources due to invalid updates, the above step S120 may further include steps S121, S122 and S123, wherein the specific contents of each step are as follows.
[0053] Step S121: Count the number of resource blocks with different interference conditions between the candidate interference bitmap and the current interference bitmap to obtain the number of resource block changes, and compare the number of resource block changes with a predetermined number threshold to obtain the number comparison result.
[0054] In this embodiment of the application, the number of resource blocks with different interference conditions between the candidate interference bitmap and the current interference bitmap can be counted to obtain the number of resource block changes. The number of resource block changes can be compared with a predetermined number threshold to obtain a number comparison result. For example, it can be determined whether the number of resource block changes is greater than the number threshold, thereby determining the changes or differences in the global interference conditions between the candidate interference bitmap and the current interference bitmap.
[0055] Step S122: If the quantity comparison result indicates that the number of changes in the resource block is greater than the quantity threshold, then it is determined that an interference bitmap update is required.
[0056] In this embodiment of the application, after obtaining the quantity comparison result, if the quantity comparison result indicates that the number of changes in the resource block is greater than the quantity threshold, it is determined that the interference bitmap needs to be updated. That is, when there are significant changes and differences between the candidate interference bitmap and the current interference bitmap, it indicates that the effectiveness of the current interference bitmap is relatively insufficient. Therefore, it is necessary to perform a corresponding update to ensure the reliability of the latest interference bitmap.
[0057] Step S123: If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then based on the difference between the result of interference detection of each resource block in multiple time windows and the interference situation of the resource block in the current interference bitmap, it is determined whether the interference bitmap needs to be updated.
[0058] In this embodiment, after obtaining the quantity comparison result, if the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then based on the difference between the interference detection results of each resource block within multiple time windows and the interference situation of the resource block in the current interference bitmap, i.e., the local interference situation of the resource block, it is determined whether an interference bitmap update is needed. In other words, when there are small changes and differences between the candidate interference bitmap and the current interference bitmap, it indicates that the effectiveness of the current interference bitmap is not insufficient. Therefore, it can be determined that no interference bitmap update is needed. Alternatively, to further improve the reliability of the update judgment, a further determination can be made based on the local interference situation of the resource block.
[0059] It is understood that in step S123 above, the specific method of determining whether to perform interference bitmap update is not limited. For example, in an alternative implementation, in order to ensure the reliability of interference bitmap update based on local interference of resource blocks, step S123 above may further include steps S123a, S123b and S123c, the specific contents of which are as follows.
[0060] Step S123a: If the quantity comparison result indicates that the change in the number of resource blocks is not greater than the quantity threshold, then for each resource block, determine whether the results of interference detection of the resource block in multiple time windows have consecutive results greater than or equal to a predetermined target number that are different from the interference situation of the resource block in the current interference bitmap, and if they are different from the interference situation of the resource block in the current interference bitmap, then determine the resource block as the target resource block.
[0061] In this embodiment of the application, if the quantity comparison result indicates that the change in the number of resource blocks is not greater than the quantity threshold, then for each resource block, it is determined whether the results of interference detection of the resource block in multiple time windows have a continuous number of results greater than or equal to a predetermined target number that are different from the interference situation of the resource block in the current interference bitmap (for example, the interference situation in the current interference bitmap is that there is no interference, but there is a continuous large number of results in the multiple interference detection results corresponding to multiple time windows that indicate the presence of interference; or, for example, the interference situation in the current interference bitmap is that there is interference, but there is a continuous large number of results in the multiple interference detection results corresponding to multiple time windows that indicate the absence of interference), and if neither of these conditions is present in the current interference bitmap, then the resource block is determined as the target resource block, that is, the interference situation changes to another stable situation.
[0062] In step S123b, if at least one target resource block exists, it is determined that an interference bitmap update is required.
[0063] In this embodiment of the application, if there is at least one target resource block, it is determined that the interference bitmap needs to be updated. That is, when there is a resource block whose interference situation changes to another stable situation, the interference bitmap can be updated as a whole.
[0064] In step S123c, if there is no target resource block, it is determined that no interference bitmap update is required.
[0065] In this embodiment of the application, if there is no target resource block, it is determined that no interference bitmap update is required. That is, when there is no resource block whose interference situation has changed to another stable situation, the interference bitmap can be not updated as a whole.
[0066] Thirdly, regarding step S130, it should be noted that the specific method for generating a new current interference bitmap based on the candidate interference bitmap is not limited and can be selected according to actual needs. For example, in an alternative implementation, the candidate interference bitmap can be used as the new current interference bitmap to achieve a complete update of the interference bitmap.
[0067] Fourthly, regarding the aforementioned interference bitmap generation method, it should also be noted that after generating a new current interference bitmap, other processing can be performed, for example, it may include the following steps: First, we can count the number of times the interference bitmap update is determined to be needed to obtain the target update count. In other words, after each interference bitmap update, we can count the number of times to obtain the current target update count. Secondly, if the target update count is greater than a predetermined update count threshold, then a slow update operation for the interference bitmap is performed; conversely, if the target update count is not greater than the predetermined update count threshold, then a slow update operation for the interference bitmap is not performed. The slow update operation for the interference bitmap is used to adjust relevant parameters in the step of determining candidate interference bitmaps based on the results of interference detection of multiple resource blocks within multiple time windows, and / or to adjust relevant parameters in the step of comparing the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of resource blocks, to determine whether an interference bitmap update is needed. This adjustment aims to reduce the number of times an interference bitmap update is required. For example, various thresholds can be increased to a certain extent, such as the aforementioned quantity threshold, interference degree threshold, and interference quantity threshold.
[0068] Fifthly, it should also be noted that when it is determined that no interference bitmap update is needed, the specific processing method is not limited.
[0069] For example, in an alternative implementation, no update may be performed directly, or the interference status of only a certain resource block may be updated. For example, the interference status of the target resource block in the candidate interference bitmap may be updated to the current interference bitmap to obtain a new current interference bitmap.
[0070] To facilitate understanding of the above-described method for generating interference bitmaps, this application also provides a detailed application example, the details of which are as follows: 1. The Ni values on each RB periodically detected by the base station are obtained. = , where N represents the total number of RBs in the cell, and i represents the i-th measurement.
[0071] 2. In step 1, C1 times were tested consecutively to obtain Ni= .
[0072] 3. Obtain the maximum value of each RB in the C1 measurement of Ni. = .
[0073] 4. Based on the obtained The algorithm determines whether the maximum Ni value corresponding to each Rb exceeds the set threshold THD_Ni. If it exceeds THD_Ni, the corresponding RB information is marked, resulting in an array element representing the number of RBs as the marker information (Sign). Each element is either 0 or 1, where 1 indicates that Ni exceeds the threshold and 0 indicates that Ni does not exceed the threshold. This information is then recorded. = ,in, arrive It can be 0 or 1.
[0074] 5. Set the sliding window length C2, repeat steps 1 to 4, and record the results. .
[0075] 6. Calculation and = .
[0076] 7. Set threshold C3 and determine the sum of S values corresponding to each RB. If the size is greater than the threshold C3, it is marked as 1; otherwise, it is marked as 0, denoted as BitMap = ,in, arrive A value of 0 or 1 indicates a bitmap update indicator for that RB; 1 indicates that an update is needed, and 0 indicates that an update is not needed.
[0077] 8. Set threshold C4 to compare the BitMap with the current... If the number of different RBs in the bitmap is greater than C4, then the bitmap is considered updatable and sent to the base station scheduling module. At the same time, save the bitmap and record it as... It is used as a benchmark for the next bitmap update comparison.
[0078] 9. If 8 cannot be satisfied (i.e., not greater than C4), then set the threshold C6 and check BitMap = The B value corresponding to each RB in the equation, if it is C6 consecutive times equal to... If the B value in the bitmap is different, then the bitmap is considered to need updating. The bitmap is then sent to the base station scheduling module. At the same time, save the bitmap and record it as... It is used as the reference for the next bitmap update.
[0079] 10. Repeat steps 1 through 4 to obtain the latest... Repeat steps 6 to 9 to generate a new bitmap if the conditions are met.
[0080] 11. Set a threshold value C7; if the bitmap update count... If C7 is selected, the bitmap update enters slow mode, and C1 to C7 are adjusted accordingly to slow down the bitmap update.
[0081] 12. In the initial stage of bitmap update, in order to obtain more accurate samples, a threshold value C8 can be set. The sampled values are used for bitmap decision only when the number of samplings is greater than C8.
[0082] 13. For example Figure 3 The image shows the process of each bitmap generation sliding window. Figure 3 The text illustrates the sliding window process from the m-th BitMap to the (m+4)-th BitMap, with each BitMap decision using C2 sign samples.
[0083] Combination Figure 4 This application also provides an interference bitmap generation device applicable to the aforementioned electronic device. The interference bitmap generation device may include an interference bitmap determination module, an update determination module, and an interference bitmap generation module.
[0084] The interference bitmap determination module is used to determine candidate interference bitmaps based on the results of interference detection on multiple resource blocks within multiple time windows. The candidate interference bitmaps reflect the interference status of each resource block. In this embodiment, the interference bitmap determination module can be used to execute... Figure 2 The relevant content regarding the interference bitmap determination module in step S110 shown can be found in the previous description of step S110.
[0085] The update determination module is used to compare the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource block, to determine whether an interference bitmap update is needed. In this embodiment, the update determination module can be used to execute... Figure 2 The details of step S120, and the relevant content regarding the update determination module, can be found in the preceding description of step S120.
[0086] The interference bitmap generation module is used to generate a new current interference bitmap based at least on the candidate interference bitmap when it is determined that an interference bitmap update is needed. The new current interference bitmap replaces the current interference bitmap and serves as the basis for resource scheduling of the multiple resource blocks. In this embodiment, the interference bitmap generation module can be used to execute... Figure 2 The relevant content regarding the interference bitmap generation module in step S130 shown can be found in the previous description of step S130.
[0087] In this embodiment of the application, corresponding to the above-described method for generating an interference bitmap applied to the electronic device, a computer-readable storage medium is also provided, which stores a computer program that executes the various steps of the interference bitmap generation method when the computer program is run.
[0088] The steps executed by the aforementioned computer program during runtime will not be described in detail here, but can be found in the explanation of the interference bitmap generation method above.
[0089] In summary, the interference bitmap generation method, apparatus, device, and medium provided in this application first determine candidate interference bitmaps based on the interference detection results of multiple resource blocks within multiple time windows. These candidate interference bitmaps reflect the interference situation of each resource block. Second, based on the local and / or global interference situations of the resource blocks, the candidate interference bitmaps are compared with the current interference bitmap to determine whether an update is needed. Then, when an update is determined, a new current interference bitmap is generated based on at least the candidate interference bitmaps. This new current interference bitmap replaces the current interference bitmap and serves as the basis for resource scheduling of multiple resource blocks. Based on the above, since the candidate interference bitmaps are determined based on interference detection results within multiple time windows, compared to the conventional method of obtaining an interference bitmap by threshold comparison based on detection results within a single time window, this method offers higher reliability. It effectively avoids reliance on reliable detection cycle settings, thereby improving the problem of low reliability of interference bitmaps caused by inappropriate detection cycles. On the other hand, since the update is based on the local and / or global interference of resource blocks, compared to schemes that directly obtain the interference bitmap by comparing thresholds based on detection results within a single time window, this approach improves the overall consistency of the interference bitmap update. In other words, the update is performed holistically, rather than on individual resource blocks, thus enhancing reliability. Therefore, this approach addresses the relatively low reliability of interference bitmap generation in existing technologies.
[0090] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can also be implemented in other ways. The apparatus and method embodiments described above are merely illustrative. For example, the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram and / or flowchart, and combinations of blocks in block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.
[0091] In addition, the functional modules in the various embodiments of this application can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.
[0092] If the aforementioned functions are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, electronic device, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks. It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. In the absence of further restrictions, an element defined by the phrase "comprising a..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.
[0093] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.
Claims
1. A method for generating an interference bitmap, characterized in that, include: Based on the results of interference detection on multiple resource blocks within multiple time windows, a candidate interference bitmap is determined, wherein the candidate interference bitmap is used to reflect the interference situation of each resource block. Based on the local interference situation of the resource block and / or the global interference situation of the resource block, the candidate interference bitmap is compared with the current interference bitmap to determine whether the interference bitmap needs to be updated. When it is determined that an interference bitmap update is required, a new current interference bitmap is generated based on at least the candidate interference bitmap, wherein the new current interference bitmap is used to replace the current interference bitmap as a basis for resource scheduling of the multiple resource blocks.
2. The interference bitmap generation method according to claim 1, characterized in that, The step of comparing the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource block to determine whether the interference bitmap needs to be updated includes: The number of resource blocks with different interference conditions between the candidate interference bitmap and the current interference bitmap is counted to obtain the number of resource block changes. The number of resource block changes is then compared with a predetermined number threshold to obtain a number comparison result. If the quantity comparison result indicates that the number of changes in the resource block is greater than the quantity threshold, then it is determined that an interference bitmap update is required. If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then based on the difference between the interference detection results of each resource block in multiple time windows and the interference situation of the resource block in the current interference bitmap, it is determined whether the interference bitmap needs to be updated.
3. The interference bitmap generation method according to claim 2, characterized in that, If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then the step of determining whether an interference bitmap update is needed, based on the difference between the interference detection results of each resource block within multiple time windows and the interference status of that resource block in the current interference bitmap, includes: If the quantity comparison result indicates that the number of changes in the resource block is not greater than the quantity threshold, then for each resource block, it is determined whether the results of interference detection of the resource block in multiple time windows have consecutive results greater than or equal to a predetermined target number that are different from the interference situation of the resource block in the current interference bitmap, and if they are different from the interference situation of the resource block in the current interference bitmap, then the resource block is determined as the target resource block. If at least one target resource block exists, it is determined that an interference bitmap update is required; If there is no target resource block, then it is determined that no interference bitmap update is required.
4. The interference bitmap generation method according to claim 1, characterized in that, The step of determining candidate interference bitmaps based on the results of interference detection on multiple resource blocks within multiple time windows includes: For each of the multiple time windows, an initial interference bitmap corresponding to that time window is generated based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window. One time window corresponds to one initial interference bitmap. The initial interference bitmaps corresponding to each of the multiple time windows are merged to form a candidate interference bitmap.
5. The interference bitmap generation method according to claim 4, characterized in that, The step of generating an initial interference bitmap corresponding to each of the multiple time windows, based on the results of multiple interference detections performed on each resource block within the multiple resource blocks within that time window, includes: For each of the multiple time windows, based on the results of multiple interference detections performed on each of the multiple resource blocks within that time window, the interference situation corresponding to each resource block in that time window is determined. If the maximum value of the interference level represented by the results of multiple interference detections is greater than a predetermined interference level threshold, the determined interference situation is considered to have interference. If the maximum value of the interference level represented by the results of multiple interference detections is not greater than the predetermined interference level threshold, the determined interference situation is considered to have no interference. For each of the multiple time windows, based on the interference situation of each resource block in the multiple resource blocks corresponding to that time window, an initial interference bitmap corresponding to that time window is determined, wherein the initial interference bitmap is used to reflect whether the interference situation of each resource block in the corresponding time window is present or not.
6. The interference bitmap generation method according to claim 4, characterized in that, The step of fusing the initial interference bitmaps corresponding to each of the multiple time windows to form a candidate interference bitmap includes: For each resource block, the number of interference situations corresponding to the resource block in the multiple initial interference bitmaps corresponding to the multiple time windows is counted, and the candidate interference situations of the resource block are determined based on the relationship between the number and the predetermined interference number threshold. Based on the candidate interference situation of each resource block, a candidate interference bitmap is determined.
7. The interference bitmap generation method according to any one of claims 1-6, characterized in that, After the step of generating a new current interference bitmap based at least on the candidate interference bitmap when it is determined that an interference bitmap update is needed, the interference bitmap generation method further includes: The number of times the interference bitmap update is determined to be needed is counted to obtain the target update count; If the target update count is greater than a predetermined update count threshold, then a slow update operation for the interference bitmap is performed. This slow update operation is used to adjust relevant parameters in the step of determining candidate interference bitmaps based on the results of interference detection of multiple resource blocks within multiple time windows, and / or to adjust relevant parameters in the step of comparing the candidate interference bitmaps with the current interference bitmap based on local and / or global interference conditions of resource blocks, in order to reduce the number of times an interference bitmap update is required.
8. An interference bitmap generation device, characterized in that, include: The interference bitmap determination module is used to determine candidate interference bitmaps based on the results of interference detection on multiple resource blocks within multiple time windows. The candidate interference bitmaps are used to reflect the interference situation of each resource block. The update determination module is used to compare the candidate interference bitmap with the current interference bitmap based on the local interference situation and / or the global interference situation of the resource block, so as to determine whether the interference bitmap needs to be updated. An interference bitmap generation module is used to generate a new current interference bitmap based on at least the candidate interference bitmap when it is determined that an interference bitmap update is needed. The new current interference bitmap is used to replace the current interference bitmap as the basis for resource scheduling of the multiple resource blocks.
9. An electronic device, characterized in that, include: Memory, used to store computer programs; A processor connected to the memory is used to execute a computer program stored in the memory to implement the interference bitmap generation method according to any one of claims 1-7.
10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed, performs the interference bitmap generation method according to any one of claims 1-7.