Codebook processing method, device and computer equipment for base station carrier aggregation scheduling
By filling codebook data only when the total scheduling data is updated, synchronous operations between cells are cancelled, and the problems of PUCCH waste and dynamic codebook synchronization difficulty of semi-static codebooks are solved, and efficient resource utilization is achieved and simplification of codebook generation.
Patent Information
- Application Number
- CN202410948706.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-07-16
AI Technical Summary
In the prior art, semi-static codebooks in carrier aggregation scheduling have PUCCH waste problems, while dynamic codebooks require information synchronization between PCell and SCell, which is difficult to achieve.
When the current transmission time interval begins, the total scheduling data in the shared memory is obtained to determine whether to update. If it is not updated, the data synchronization operation will be stopped, and the codebook data in the downlink control information will be directly filled in, and the synchronization between each cell will be cancelled. Operation, reduce data volume and complexity.
It significantly reduces the fixed occupation of codebook data in semi-static codebooks, reduces decoding overhead, and reduces the complexity of codebook generation process, taking into account the full utilization of PCell and SCell message synchronization and PUCCH resources.
Smart Images

Figure CN118488568B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of wireless communications, and in particular to a codebook processing method, device and computer equipment for base station carrier aggregation scheduling. Background Art
[0002] With the continuous development of mobile communications, the growing business needs have put forward higher requirements on the peak rate and system capacity of user equipment (UE). Carrier aggregation (CA) increases the transmission bandwidth, improves the data transmission rate and spectrum efficiency by allowing UE to communicate with multiple physical carrier units (CC) at the same time.
[0003] CA carriers are divided into two forms: primary cell (PCell) and secondary cell (SCell). The scheduling method on the base station side is usually uniformly controlled by PCell, and SCell is only used for scheduling to increase traffic. In this way, SCell has no physical uplink control channel (PUCCH) resources, and the downlink HARQ feedback information needs to be sent uniformly on the PUCCH resources of PCell. At this time, a reasonable HARQ CodeBook needs to be designed to clearly express the number of feedback bits of PCell and SCell.
[0004] Commonly used HARQ CodeBooks include semi-static codebooks and dynamic codebooks. The semi-static codebook uses a fixed bit length and reserves sufficient bits for each carrier in advance to carry HARQ feedback information. This method avoids the message synchronization process between SCell and PCell, but there is a waste of PUCCH. The dynamic codebook determines the codebook bit length according to the number of downlink control information (DCI) actually scheduled by PCell and SCell, making full use of PUCCH channel resources, but requires PCell and SCell to synchronize information in each scheduled transmission time interval (Transport Time Interval, TTI), which is difficult to implement. Summary of the invention
[0005] Based on this, it is necessary to provide a codebook processing method, device, computer equipment, computer-readable storage medium and computer program product for base station carrier aggregation scheduling without scheduling TTI information synchronization to address the technical problems existing in both semi-static codebooks and dynamic codebooks.
[0006] In a first aspect, the present application provides a codebook processing method for base station carrier aggregation scheduling, the codebook processing method for base station carrier aggregation scheduling comprising:
[0007] At the beginning of the current transmission time interval, obtaining total scheduling data in a shared memory connected to all serving cells, and determining whether the total scheduling data is updated;
[0008] If no update occurs, the data synchronization operation between all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0009] In one embodiment, before determining whether the overall scheduling data is updated, the method further includes:
[0010] The scheduled data in the shared memory is updated through the core service cell among all the service cells.
[0011] In one embodiment, updating the scheduled data in the shared memory through a core serving cell among all the serving cells includes:
[0012] The number of cells of all the serving cells is obtained, and the scheduled data is updated according to the number of cells.
[0013] In one embodiment, the filling of codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory includes:
[0014] If the target serving cell in all the serving cells has no data to send in the current transmission time interval, performing blank processing at the corresponding position in the codebook data;
[0015] If the remaining service cells among all the service cells except the target service cell have sent data within the current transmission time interval, the total scheduling data and the scheduled data are updated on the basis of the blank processing, and the updated total scheduling data and the updated scheduled data are used to fill the codebook data in the downlink control information.
[0016] In one embodiment, the filling of codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory includes:
[0017] If the target serving cell has data to send within the current transmission time interval, the total scheduling data is updated according to the number of all serving cells.
[0018] In one of the embodiments, the codebook processing method for base station carrier aggregation scheduling further includes:
[0019] Updating the shared memory according to the data of the primary carrier and the secondary carrier;
[0020] The codebook data is filled according to the updated data.
[0021] In a second aspect, the present application further provides a codebook processing device for base station carrier aggregation scheduling, and the codebook processing device for base station carrier aggregation scheduling includes:
[0022] An update judgment module, used to obtain the total scheduling data in the shared memory connected to all service cells at the beginning of the current transmission time interval, and judge whether the total scheduling data is updated;
[0023] The data filling module is used to stop the data synchronization operation in all the serving cells if no update occurs, and fill the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.
[0024] In a third aspect, the present application further provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:
[0025] At the beginning of the current transmission time interval, obtaining total scheduling data in a shared memory connected to all serving cells, and determining whether the total scheduling data is updated;
[0026] If no update occurs, the data synchronization operation in all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0027] In a fourth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:
[0028] At the beginning of the current transmission time interval, obtaining total scheduling data in a shared memory connected to all serving cells, and determining whether the total scheduling data is updated;
[0029] If no update occurs, the data synchronization operation in all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0030] In a fifth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the following steps are implemented:
[0031] At the beginning of the current transmission time interval, obtaining total scheduling data in a shared memory connected to all serving cells, and determining whether the total scheduling data is updated;
[0032] If no update occurs, the data synchronization operation in all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0033] The codebook processing method, device, computer equipment, storage medium and computer program product of the base station carrier aggregation scheduling, compared with the processing method using a semi-static codebook in the prior art, can save the fixed occupancy of codebook data in the semi-static codebook by filling the codebook data only after the total scheduling data is updated, and significantly reduce the decoding overhead. In addition, by canceling the synchronization operation that must be performed between each serving cell in the dynamic codebook process before filling the codebook, the amount of data transmitted between the cells is reduced, and the complexity of the codebook generation process is reduced. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] Figure 1 This is an application environment diagram of a codebook processing method for carrier aggregation scheduling of a base station in one embodiment;
[0035] Figure 2 It is a flowchart of a codebook processing method for carrier aggregation scheduling of a base station in one embodiment;
[0036] Figure 3 is a schematic diagram of the process of step S40 in one embodiment;
[0037] Figure 4 is a schematic diagram of a codebook obtained in an embodiment;
[0038] Figure 5 It is a structural block diagram of a codebook processing device for carrier aggregation scheduling of a base station in one embodiment;
[0039] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION
[0040] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0041] The codebook processing method for base station carrier aggregation scheduling provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The data storage system can store the data that the server 104 needs to process. The data storage system can be integrated on the server 104, or it can be placed on the cloud or other network servers. Among them, the terminal 102 can be but is not limited to various personal computers, laptops, smart phones, tablets, Internet of Things devices and portable wearable devices. The Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart car-mounted devices, etc. Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server 104 can be implemented with an independent server or a server cluster consisting of multiple servers.
[0042] In one embodiment, Figure 2 As shown, a codebook processing method for base station carrier aggregation scheduling is provided, and the method is applied to Figure 1 The terminal in is used as an example to illustrate, including the following steps:
[0043] Step S20: When the current transmission time interval starts, the total scheduling data in the shared memory connected to all the serving cells is obtained, and it is determined whether the total scheduling data is updated.
[0044] Among them, under normal circumstances, the service cells covered by the base station include the core service cell cell0 and the non-core service cells cell1 and cell2 (here three service cells are taken as an example). The dynamic codebook in the prior art needs to obtain the scheduling data of each service cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of its own service cell to the other two service cells, and complete the synchronization operation between the cells by mutually transmitting the scheduling data.
[0045] Step S40: If no update occurs, the data synchronization operation between all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0046] Among them, the present application abandons the synchronization operation of sending scheduling data between cells at the beginning stage, and stores the scheduling data required to fill the code book in a shared memory connected to all service cells, so that the non-core service cells in all cells perform the operation of detecting whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval. If the total scheduling data in the shared memory has not been updated within the current transmission time interval, it means that the total scheduling data has been updated within the current transmission time interval, and the total scheduling data in the shared memory can be used to fill the code book. The service cell directly reads the total scheduling data and the scheduled data in the shared memory to fill the code book data.
[0047] The present invention proposes a codebook processing method for base station carrier aggregation scheduling, which saves the fixed occupancy of codebook data in a semi-static codebook by filling the codebook data only after the total scheduling data is updated, and significantly reduces the decoding overhead. In addition, before the codebook is filled, the synchronization operation that must be performed between each service cell in the dynamic codebook process is cancelled, which reduces the amount of data transmitted between each cell and reduces the complexity of the codebook generation process.
[0048] In one of the embodiments, before executing step S20, the codebook processing method for base station carrier aggregation scheduling proposed in this embodiment further includes: updating the scheduled data in the shared memory through the core service cell among all the service cells.
[0049] In implementation, at the beginning of each transmission time interval, it is necessary to control the core service cell in all service cells to determine whether DCI needs to be sent in the current transmission time interval, and update the scheduled data (counter DAI, C-DAI, including the cumulative number of currently scheduled PDSCH) in the shared memory if it is determined that it needs to be sent. The specific updating method is: obtaining the number of cells of all service cells, and updating the scheduled data according to the number of cells.
[0050] In one embodiment, the filling operation of the codebook data performed in step S40 has two different processing modes according to whether the target cell sends data in the current transmission time interval, such as Figure 3 As shown, step S40 includes:
[0051] Step S42: If the target serving cell in all the serving cells has no data to send in the current transmission time interval, blank processing is performed at the corresponding position in the codebook data.
[0052] Step S44: If the remaining service cells among all the service cells except the target service cell have sent data within the current transmission time interval, the total scheduling data and the scheduled data are updated on the basis of the blank processing, and the updated total scheduling data and the updated scheduled data are used to fill the codebook data in the downlink control information.
[0053] Step S46: If the target serving cell has data to send within the current transmission time interval, the total scheduling data is updated according to the number of cells of all serving cells.
[0054] In implementation, all service cells in this embodiment are divided into core service cells that actively aggregate data within the current transmission time interval and non-core service cells that do not need to perform aggregation operations according to their functions. The designated service cell corresponding to the current time node is the target service cell, and the specific target service cell at this time can be a core service cell or a non-core service cell. Relatively speaking, the service cells other than the target service cell in all service cells are called remaining service cells. In other words, the target service cell and the remaining service cell are just names for the action of whether the core service cell and the non-core service cell send data at the current node.
[0055] Based on the naming reasons for the target service cells and the remaining service cells mentioned above, for the target service cells that have no data to send, the corresponding codebook data will no longer be filled with data, but will be directly left blank. For the remaining service cells that send data, the total scheduling data and the scheduled data will be updated based on the blank data that already exists in the codebook data, instead of calculating the blank data as zero. The calculation process is referred to later. Figure 4 The operation of leaving the blank here will increase the bit occupancy in the codebook, but compared with the processing of all bit occupancy in the codebook in the semi-static codebook, it can still significantly reduce the decoding overhead; by canceling the synchronization operation between the serving cells in the existing codebook, there is no need to wait for the synchronization data to generate the codebook, which reduces the complexity of generating the codebook.
[0056] In one of the embodiments, the codebook processing method for base station carrier aggregation scheduling includes:
[0057] Updating the shared memory according to the data of the primary carrier and the secondary carrier;
[0058] The codebook data is filled according to the updated data.
[0059] In implementation, since the codebook processing method for base station carrier aggregation scheduling proposed in the implementation of this application eliminates the data transmission operation between service cells, this will cause each service cell to be unable to determine the specific values of the scheduled data and the total scheduled data when filling the codebook data, so a shared memory connected to each service cell is added. At the beginning of each transmission time interval, the core service cell will be controlled to update the data in the shared memory according to the PCell and SCell data, so that the non-core service cell can obtain accurate data from the shared memory when filling the codebook data.
[0060] A specific example of the codebook processing method proposed in the embodiment of the present application is as follows: Figure 4 As shown, it involves a codebook including core service cell cell0, non-core service cells cell1 and cell2. Three transmission time intervals 0, 1, and 2 are set for each service cell. The three columns on the left are downlink data sent by the base station to the UE, and the column on the right is uplink data PUCCH sent by the UE to the base station. The data format in the codebook is (C-DAI, T-DAI), and each data format occupies one bit.
[0061] Corresponding to transmission time interval 0, the three service cells are informed that they need to send DCI. At this time, in the codebook, the DCI data corresponding to the three service cells are (1, 3), (2, 3), and (3, 3). The second digit 3 in each DCI data is calculated by adding the number of all current cells to the second digit of the previous transmission time interval for the core service cell. Since there is no cell that transmits DCI in the previous transmission time interval, the second digit 3 in each DCI data in transmission time interval 0 is calculated by 0+3=3. The first digit in each DCI data is assigned 1, 2, and 3 in turn according to the order of DCI data transmission in the current transmission time interval 0.
[0062] Since all serving cells do not send DCI in transmission time interval 1, the data corresponding to transmission time interval 1 are all empty.
[0063] Corresponding to transmission time interval 2, only the core service cell cell0 and the non-core service cell cell2 are involved in DCI data transmission. Referring to the calculation method disclosed in the previous text, it can be known that the second digit in each DCI data should be 3 (the number of cells involved in DCI transmission in the previous transmission time interval) + 2 (the number of cells involved in DCI transmission in the current transmission time interval) = 5. However, in this embodiment, the non-service cell cell1 that does not transmit DCI data is ignored, and the second digit is still assigned according to the calculation method of 3+3=6. However, for the DCI data of the non-service cell cell1, a blank filling method is adopted. After receiving the generated code book, the base station will ignore the blank filling data and believe that in the transmission time interval 2, the non-core service cell cell1 is indeed not involved in the transmission of DCI data. This can still ensure the correct parsing of the code book.
[0064] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.
[0065] Based on the same inventive concept, the embodiment of the present application also provides a codebook processing device for base station carrier aggregation scheduling for implementing the codebook processing method for base station carrier aggregation scheduling involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in the embodiments of the codebook processing device for base station carrier aggregation scheduling provided below can refer to the limitations of the codebook processing method for base station carrier aggregation scheduling above, and will not be repeated here.
[0066] In one embodiment, Figure 5 As shown, a codebook processing device 50 for base station carrier aggregation scheduling is provided, comprising:
[0067] The update determination module 52 is used to obtain the total scheduling data in the shared memory connected to all the serving cells at the beginning of the current transmission time interval, and determine whether the total scheduling data is updated.
[0068] Among them, under normal circumstances, the service cells covered by the base station include the core service cell cell0 and the non-core service cells cell1 and cell2 (here three service cells are taken as an example). The dynamic codebook in the prior art needs to obtain the scheduling data of each service cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of its own service cell to the other two service cells, and complete the synchronization operation between the cells by mutually transmitting the scheduling data.
[0069] The data filling module 54 is used to stop the data synchronization operation in all the serving cells if no update occurs, and fill the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.
[0070] Among them, the present application abandons the synchronization operation of sending scheduling data between cells at the beginning stage, and stores the scheduling data required to fill the code book in a shared memory connected to all service cells, so that the non-core service cells in all cells perform the operation of detecting whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval. If the total scheduling data in the shared memory has not been updated within the current transmission time interval, it means that the total scheduling data has been updated within the current transmission time interval, and the total scheduling data in the shared memory can be used to fill the code book. The service cell directly reads the total scheduling data and the scheduled data in the shared memory to fill the code book data.
[0071] The present invention proposes a codebook processing device for carrier aggregation scheduling of a base station, which saves the fixed occupancy of codebook data in a semi-static codebook by filling the codebook data only after the total scheduling data is updated, and significantly reduces the decoding overhead. In addition, before the codebook is filled, the synchronization operation that must be performed between each service cell in the dynamic codebook process is cancelled, which reduces the amount of data transmitted between each cell and reduces the complexity of the codebook generation process.
[0072] Each module in the codebook processing device for carrier aggregation scheduling of the base station can be implemented in whole or in part by software, hardware, or a combination thereof. Each of the above modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each of the above modules.
[0073] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 6As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store DCI data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a codebook processing method for base station carrier aggregation scheduling is implemented.
[0074] Those skilled in the art will understand that Figure 6 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0075] In one embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:
[0076] Step S20: When the current transmission time interval starts, the total scheduling data in the shared memory connected to all the serving cells is obtained, and it is determined whether the total scheduling data is updated.
[0077] Among them, under normal circumstances, the service cells covered by the base station include the core service cell cell0 and the non-core service cells cell1 and cell2 (three service cells are taken as an example here). The dynamic code book in the prior art needs to obtain the scheduling data of each service cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of its own service cell to the other two service cells. In the embodiment of the present application, the scheduling operation of sending the scheduling data to other service cells is abandoned at the beginning stage, and the scheduling data required to fill the code book is stored in a shared memory connected to all service cells, so that the non-core service cell detects whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.
[0078] Step S40: If no update occurs, the data synchronization operation between all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0079] If the total scheduling data in the shared memory is not updated within the current transmission time interval, it indicates that the core service cell has updated the total scheduling data, and the total scheduling data in the shared memory can be used to fill the codebook. The non-core service cell can directly read the total scheduling data and scheduled data in the shared memory to fill the codebook data.
[0080] The present invention proposes a codebook processing method for carrier aggregation scheduling of base stations. The operation of leaving the bits corresponding to the service cells that do not send DCI data blank will increase the bit occupancy, but it can still significantly reduce the decoding overhead compared with the processing of semi-static codebooks; at the same time, by canceling the synchronization operation between the service cells in the existing codebook in the codebook of carrier aggregation scheduling, the complexity of the codebook generation process is reduced. PCell and SCell message synchronization and full utilization of PUCCH resources are taken into account, and the waste of PUCCH resources is reduced on the basis of simplifying the message synchronization process as much as possible.
[0081] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:
[0082] Step S20: When the current transmission time interval starts, the total scheduling data in the shared memory connected to all the serving cells is obtained, and it is determined whether the total scheduling data is updated.
[0083] Among them, under normal circumstances, the service cells covered by the base station include the core service cell cell0 and the non-core service cells cell1 and cell2 (three service cells are taken as an example here). The dynamic code book in the prior art needs to obtain the scheduling data of each service cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of its own service cell to the other two service cells. In the embodiment of the present application, the scheduling operation of sending the scheduling data to other service cells is abandoned at the beginning stage, and the scheduling data required to fill the code book is stored in a shared memory connected to all service cells, so that the non-core service cell detects whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.
[0084] Step S40: If no update occurs, the data synchronization operation between all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0085] If the total scheduling data in the shared memory is not updated within the current transmission time interval, it indicates that the core service cell has updated the total scheduling data, and the total scheduling data in the shared memory can be used to fill the codebook. The non-core service cell can directly read the total scheduling data and scheduled data in the shared memory to fill the codebook data.
[0086] The present invention proposes a codebook processing method for carrier aggregation scheduling of base stations. The operation of leaving the bits corresponding to the service cells that do not send DCI data blank will increase the bit occupancy, but it can still significantly reduce the decoding overhead compared with the processing of semi-static codebooks; at the same time, by canceling the synchronization operation between the service cells in the existing codebook in the codebook of carrier aggregation scheduling, the complexity of the codebook generation process is reduced. PCell and SCell message synchronization and full utilization of PUCCH resources are taken into account, and the waste of PUCCH resources is reduced on the basis of simplifying the message synchronization process as much as possible.
[0087] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:
[0088] Step S20: When the current transmission time interval starts, the total scheduling data in the shared memory connected to all the serving cells is obtained, and it is determined whether the total scheduling data is updated.
[0089] Among them, under normal circumstances, the service cells covered by the base station include the core service cell cell0 and the non-core service cells cell1 and cell2 (three service cells are taken as an example here). The dynamic code book in the prior art needs to obtain the scheduling data of each service cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of its own service cell to the other two service cells. In the embodiment of the present application, the scheduling operation of sending the scheduling data to other service cells is abandoned at the beginning stage, and the scheduling data required to fill the code book is stored in a shared memory connected to all service cells, so that the non-core service cell detects whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.
[0090] Step S40: If no update occurs, the data synchronization operation between all the serving cells is stopped, and the codebook data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory.
[0091] If the total scheduling data in the shared memory is not updated within the current transmission time interval, it indicates that the core service cell has updated the total scheduling data, and the total scheduling data in the shared memory can be used to fill the codebook. The non-core service cell can directly read the total scheduling data and scheduled data in the shared memory to fill the codebook data.
[0092] The present invention proposes a codebook processing method for carrier aggregation scheduling of base stations. The operation of leaving the bits corresponding to the service cells that do not send DCI data blank will increase the bit occupancy, but it can still significantly reduce the decoding overhead compared with the processing of semi-static codebooks; at the same time, by canceling the synchronization operation between the service cells in the existing codebook in the codebook of carrier aggregation scheduling, the complexity of the codebook generation process is reduced. PCell and SCell message synchronization and full utilization of PUCCH resources are taken into account, and the waste of PUCCH resources is reduced on the basis of simplifying the message synchronization process as much as possible.
[0093] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.
[0094] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.
[0095] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0096] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.
Claims
1. A codebook processing method for base station carrier aggregation scheduling, characterized in that: The codebook processing method for base station carrier aggregation scheduling includes: At the beginning of the current transmission time interval, obtaining total scheduling data in a shared memory connected to all serving cells, and determining whether the total scheduling data is updated; If no update occurs, the data synchronization operation in all the service cells is stopped, and the code book data in the downlink control information is filled according to the total scheduling data and the scheduled data in the shared memory, including: if the target service cell in all the service cells has no data to send within the current transmission time interval, then blank processing is performed at the corresponding position in the code book data; if the remaining service cells in all the service cells except the target service cell have sent data within the current transmission time interval, then based on the blank processing, the total scheduling data and the scheduled data are updated, and the code book data in the downlink control information is filled with the updated total scheduling data and the updated scheduled data.
2. The codebook processing method for base station carrier aggregation scheduling according to claim 1, characterized in that: Before determining whether the overall scheduling data is updated, the method further includes: The scheduled data in the shared memory is updated through the core service cell among all the service cells.
3. The codebook processing method for base station carrier aggregation scheduling according to claim 2, characterized in that: The updating of the scheduled data in the shared memory by the core serving cell among all the serving cells includes: The number of cells of all the serving cells is obtained, and the scheduled data is updated according to the number of cells.
4. The codebook processing method for base station carrier aggregation scheduling according to claim 1, characterized in that: The filling of the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory also includes: If the target serving cell has data to send within the current transmission time interval, the total scheduling data is updated according to the number of cells of all serving cells.
5. The codebook processing method for base station carrier aggregation scheduling according to claim 1, characterized in that: Also includes: Updating the shared memory according to the data of the primary carrier and the secondary carrier; The codebook data is filled according to the updated data.
6. A codebook processing device for carrier aggregation scheduling of a base station, characterized in that: The codebook processing device for carrier aggregation scheduling of the base station includes: An update judgment module, used to obtain the total scheduling data in the shared memory connected to all service cells at the beginning of the current transmission time interval, and judge whether the total scheduling data is updated; A data filling module is used to stop the data synchronization operation in all the service cells if no update occurs, and fill the code book data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory, including: if the target service cell in all the service cells has no data to send within the current transmission time interval, then leave it blank at the corresponding position in the code book data; if the remaining service cells in all the service cells except the target service cell have sent data within the current transmission time interval, then based on the blank processing, update the total scheduling data and the scheduled data, and use the updated total scheduling data and the updated scheduled data to fill the code book data in the downlink control information.
7. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.
9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.
