Codebook processing method and apparatus for base station carrier aggregation scheduling, and computer device

Abstract

A codebook processing method and apparatus for base station carrier aggregation scheduling, and a computer device. The method comprises: at the beginning of a current transport time interval, obtaining total scheduling data in a shared memory communicated with all serving cells, and determining whether the total scheduling data has been updated; and if the total scheduling data has not been updated, stopping data synchronization operation in all the serving cells, and filling codebook data in downlink control information on the basis of the total scheduling data and data having been scheduled in the shared memory.

Description

Method and device for base station carrier aggregation scheduling codebook processing and computer equipment

[0001] Related applications

[0002] The present application claims priority to the Chinese patent application No. 202410948706.4, filed on July 16, 2024, and entitled "Method and device for base station carrier aggregation scheduling codebook processing and computer equipment", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] The present application relates to the field of wireless communication, and in particular to a method and device for base station carrier aggregation scheduling codebook processing and computer equipment. BACKGROUND

[0004] With the continuous development of mobile communication, the increasing demand for services puts higher requirements on the peak rate and system capacity of user equipment (UE). Carrier aggregation (CA) increases the transmission bandwidth and improves the data transmission rate and spectrum efficiency by allowing the UE to communicate with multiple physical component carriers (CCs) simultaneously.

[0005] CA carriers are divided into primary carriers (PCells) and secondary carriers (SCells). The scheduling mode at the base station side is usually controlled by the PCell, and the SCell is only used for scheduling traffic improvement. In this way, the SCell has no physical uplink control channel (PUCCH) resources, and the feedback information of the downlink HARQ needs to be sent on the PUCCH resources of the PCell. At this time, a reasonable HARQ CodeBook needs to be designed to clearly express the feedback bit number of the PCell and the SCell.

[0006] The commonly used HARQ codebook includes a semi-static codebook and a dynamic codebook. The semi-static codebook uses a fixed bit length, and reserves sufficient bits for each carrier in advance to carry the HARQ feedback information. This way avoids the message synchronization process between the SCell and the 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 the PCell and the SCell, and fully utilizes the PUCCH channel resource, but needs the PCell and the SCell to synchronize information at each scheduling transport time interval (TTI), which has great difficulty in implementation. SUMMARY

[0007] According to various embodiments of the present application, a base station carrier aggregation scheduling codebook processing method, device, computer equipment, computer readable storage medium and computer program product are provided.

[0008] In a first aspect, the present application provides a base station carrier aggregation scheduling codebook processing method, comprising:

[0009] At the beginning of the current transmission time interval, total scheduling data in the shared memory connected with all serving cells is acquired, and it is judged whether the total scheduling data is updated;

[0010] If no update occurs, the data synchronization operation between the all 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.

[0011] In one embodiment, before the judgment of whether the total scheduling data is updated, the method further comprises:

[0012] The scheduled data in the shared memory is updated by a core serving cell in the all serving cells.

[0013] In one embodiment, the updating of the scheduled data in the shared memory by the core serving cell in the all serving cells comprises:

[0014] The number of cells of the all serving cells is acquired, and the scheduled data is updated according to the number of cells.

[0015] In one embodiment, 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 comprises:

[0016] if the target serving cell among the total serving cells has no data transmission in the current transmission time interval, performing a blanking process at a corresponding position in the codebook data;

[0017] if the remaining serving cells except the target serving cell among the total serving cells have data transmission in the current transmission time interval, updating the total scheduling data and the scheduled data on the basis of the blanking process, and filling the codebook data in the downlink control information with the updated total scheduling data and the updated scheduled data.

[0018] In one embodiment, the filling the codebook data in the downlink control information with the total scheduling data and the scheduled data in the shared memory comprises:

[0019] if the target serving cell has data transmission in the current transmission time interval, updating the total scheduling data according to the number of the total serving cells.

[0020] In one embodiment, the codebook processing method for base station carrier aggregation scheduling further comprises:

[0021] updating the shared memory with data of the primary carrier and the secondary carrier;

[0022] filling the codebook data with the updated data.

[0023] In a second aspect, the present application further provides a codebook processing apparatus for base station carrier aggregation scheduling, which comprises:

[0024] an updating judging module, configured to acquire total scheduling data in a shared memory connected with all serving cells at the beginning of a current transmission time interval, and judge whether the total scheduling data is updated;

[0025] a data filling module, configured to stop data synchronization operation in the total serving cells if no update occurs, and fill codebook data in downlink control information with the total scheduling data and scheduled data in the shared memory.

[0026] In a third aspect, the present application further provides a computer device. The computer device comprises a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0027] acquiring total scheduling data in a shared memory connected with all serving cells at the beginning of a current transmission time interval, and judging whether the total scheduling data is updated;

[0028] If no update occurs, stopping the data synchronization operation in the all serving cells, filling the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.

[0029] In a fourth aspect, the present application provides a computer readable storage medium. The computer readable storage medium has a computer program stored thereon, and the computer program, when executed by a processor, implements the following steps:

[0030] At the beginning of a current transmission time interval, obtaining total scheduling data in a shared memory connected with all serving cells, and judging whether the total scheduling data has been updated;

[0031] If no update occurs, stopping the data synchronization operation in the all serving cells, filling the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.

[0032] In a fifth aspect, the present application provides a computer program product. The computer program product comprises a computer program, and the computer program, when executed by a processor, implements the following steps:

[0033] At the beginning of a current transmission time interval, obtaining total scheduling data in a shared memory connected with all serving cells, and judging whether the total scheduling data has been updated;

[0034] If no update occurs, stopping the data synchronization operation in the all serving cells, filling the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.

[0035] The details of one or more embodiments of the present application are presented in the following drawings and description to make other features, objects and advantages of the present application more clear and easy to understand. BRIEF DESCRIPTION OF DRAWINGS

[0036] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative effort based on the disclosed drawings.

[0037] FIG. 1 is an application environment diagram of a codebook processing method of base station carrier aggregation scheduling in an embodiment.

[0038] FIG. 2 is a flowchart of a codebook processing method of base station carrier aggregation scheduling in an embodiment.

[0039] FIG. 3 is a flowchart of step S40 in one embodiment.

[0040] FIG. 4 is a schematic diagram of a codebook obtained in one embodiment.

[0041] FIG. 5 is a block diagram of a codebook processing device for base station carrier aggregation scheduling in one embodiment.

[0042] FIG. 6 is an internal structure diagram of a computer device in one embodiment. DETAILED DESCRIPTION

[0043] To make the purposes, technical solutions and advantages of the present application clearer, the present application is further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and not intended to limit the present application.

[0044] The codebook processing method for base station carrier aggregation scheduling provided by the embodiments of the present application can be applied in the application environment as shown in FIG. 1. In the application environment, the terminal 102 communicates with the server 104 through a network. A data storage system can store data required to be processed by the server 104. The data storage system can be integrated on the server 104, or placed on a cloud or other network server. The terminal 102 can be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, Internet of Things devices and portable wearable devices. The Internet of Things devices can be smart speakers, smart televisions, smart air conditioners, smart vehicle devices, etc. The portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server 104 can be implemented by an independent server or a server cluster composed of multiple servers.

[0045] In one embodiment, as shown in FIG. 2, a codebook processing method for base station carrier aggregation scheduling is provided. Taking the terminal in FIG. 1 as an example, the method includes the following steps:

[0046] In step S20, at the beginning of a current transmission time interval, total scheduling data in a shared memory connected with all serving cells is obtained, and it is determined whether the total scheduling data is updated.

[0047] In general, the serving cells covered by the base station include a core serving cell cell0 and non-core serving cells cell1 and cell2 (three serving cells are taken as an example here). The dynamic codebook in the related art needs to obtain scheduling data of each serving cell in the current transmission time interval in the order of cell0, cell1 and cell2, and send the scheduling data of the serving cell to the other two serving cells, so as to complete the synchronization operation between the cells by transmitting the scheduling data.

[0048] 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.

[0049] In the present application, the synchronization operation of transmitting scheduling data between cells is abandoned at the beginning stage, and the scheduling data required for filling the codebook is stored in the shared memory connected to all the serving cells. The non-core serving cells in all the 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 is not updated in the current transmission time interval, it indicates that the total scheduling data has been updated in the current transmission time interval, and the total scheduling data in the shared memory can be used to fill the codebook. The serving cells directly read the total scheduling data and the scheduled data in the shared memory to fill the codebook data.

[0050] The present application provides a codebook processing method for base station carrier aggregation scheduling. The codebook data is filled only after the total scheduling data is updated, thereby saving the fixed occupation of the codebook data in the semi-static codebook and significantly reducing the decoding cost. In addition, the synchronization operation between the serving cells in the dynamic codebook process is cancelled before the codebook is filled, thereby reducing the data amount transmitted between the cells and the complexity of the codebook generation process.

[0051] In one embodiment, before step S20 is performed, the codebook processing method for base station carrier aggregation scheduling provided by the present embodiment further includes: updating the scheduled data in the shared memory by the core serving cell in all the serving cells.

[0052] In the embodiment, at the beginning of each transmission time interval, the core serving cell in all the serving cells needs to determine whether the DCI needs to be transmitted in the current transmission time interval, and the scheduled data (C-DAI, including the cumulative number of the current PDSCH) in the shared memory is updated in the case of determining that the DCI needs to be transmitted. The specific updating method is: obtaining the number of cells of all the serving cells, and updating the scheduled data according to the number of cells.

[0053] In one embodiment, the filling operation of the codebook data performed in step S40 has two different processing methods according to whether the target cell transmits data in the current transmission time interval, as shown in FIG. 3, step S40 includes:

[0054] Step S42, if the target serving cell among all serving cells has no data transmission in the current transmission time interval, a blanking processing is performed at the corresponding position in the codebook data.

[0055] Step S44, if the remaining serving cells except the target serving cell among all serving cells have data transmission in the current transmission time interval, the total scheduling data and the scheduled data are updated on the basis of the blanking processing, and the codebook data in the downlink control information is filled with the updated total scheduling data and the updated scheduled data.

[0056] Step S46, if the target serving cell has data transmission in the current transmission time interval, the total scheduling data is updated according to the number of cells of all serving cells.

[0057] In implementation, all serving cells in the embodiment are divided into core serving cells which actively collect data in the current transmission time interval and non-core serving cells which do not need to perform the collection operation. The designated serving cell at the current time node is the target serving cell, and the target serving cell at this time can be the core serving cell or the non-core serving cell. Relatively, the serving cells except the target serving cell among all serving cells are called the remaining serving cells. That is, the target serving cell and the remaining serving cell are only the naming of whether the core serving cell and the non-core serving cell perform the data transmission at the current node.

[0058] Based on the naming reasons of the target serving cell and the remaining serving cell, for the target serving cell without data transmission, the data filling is not performed in the corresponding codebook data, but the blanking processing is directly performed. For the remaining serving cells with data transmission, the total scheduling data and the scheduled data are updated on the basis of the existing blanking data in the codebook data, instead of calculating the blanking data as digital zero. The calculation process is referred to the calculation content of FIG. 4 in the following. The blanking operation here increases the occupation of the bit in the codebook, but compared with the processing of occupying all bits in the codebook in the semi-static codebook, the decoding overhead is still significantly reduced. By canceling the synchronization operation between the serving cells in the related codebook, the codebook generation process does not need to wait for the synchronization data, and the complexity of generating the codebook is reduced.

[0059] In one embodiment, the codebook processing method of the base station carrier aggregation scheduling comprises:

[0060] updating the shared memory according to the data of the primary carrier and the secondary carrier;

[0061] The codebook data is filled according to the updated data.

[0062] In the implementation, since the codebook processing method for base station carrier aggregation scheduling proposed in the application eliminates the data transmission operation between the serving cells, the specific values of the scheduled data and the total scheduled data cannot be determined when each serving cell fills the codebook data, and therefore a shared memory connected to each serving cell is added. At the starting point of each transmission time interval, the core serving cell is controlled to update the data in the shared memory according to the PCell and SCell data, so that the non-core serving cell can obtain accurate data from the shared memory when filling the codebook data.

[0063] The specific example of the codebook processing method proposed in the application is shown in FIG. 4, which involves a codebook containing a core serving cell cell0, non-core serving cells cell1 and cell2, three transmission time intervals 0, 1 and 2 are set for each serving cell, the left three columns are downlink data sent by the base station to the UE, and the right column 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.

[0064] For the transmission time interval 0, the three serving cells are informed to perform DCI transmission, at this time in the codebook, the DCI data corresponding to the three serving cells are (1, 3), (2, 3) and (3, 3) respectively, the second digit 3 in each DCI data is calculated by adding the number of all cells in the current transmission time interval to the second digit in the previous transmission time interval. Since there is no cell performing DCI transmission in the previous transmission time interval, the second digit 3 in each DCI data in the 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.

[0065] Since no DCI is transmitted in all serving cells in the transmission time interval 1, the data corresponding to the transmission time interval 1 is all empty.

[0066] Corresponding to the second transmission time interval, only the core serving cell cell0 and the non-core serving cell cell2 are involved in the DCI data transmission. According to the calculation method disclosed above, the second bit number in each DCI data should be 3 (the number of cells involved in the DCI transmission in the previous transmission time interval) + 2 (the number of cells involved in the DCI transmission in the current transmission time interval) = 5. However, in this embodiment, the non-serving cell cell1 which does not perform DCI data transmission is ignored, and the second bit number is still assigned according to the calculation method of 3 + 3 = 6. However, the DCI data for the non-serving cell cell1 is filled in the empty filling mode. After receiving the generated codebook, the base station ignores the empty filling data and considers that the non-core serving cell cell1 is indeed not involved in the DCI data transmission in the second transmission time interval, so that the codebook can still be correctly parsed.

[0067] It should be understood that, although each step in the flowchart involved in each embodiment as described above is displayed in sequence according to the arrow, these steps are not necessarily executed in sequence according to the arrow. Unless otherwise specified herein, the execution of these steps is not strictly limited in sequence, and these steps can be executed in other sequences. Moreover, at least part of the steps in the flowchart involved in each embodiment as described above can include multiple steps or stages, which are not necessarily executed at the same time, but can be executed at different times, and the execution sequence of these steps or stages is not necessarily sequential, but can be executed in rotation or alternation with at least part of other steps or steps or stages in other steps.

[0068] Based on the same inventive concept, the embodiment of the present application also provides a base station carrier aggregation scheduling codebook processing device for implementing the base station carrier aggregation scheduling codebook processing method described above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme described in the above method, so the specific limitations in one or more base station carrier aggregation scheduling codebook processing device embodiments provided below can refer to the limitations of the base station carrier aggregation scheduling codebook processing method described above, which will not be repeated here.

[0069] In one embodiment, as shown in FIG. 5, a base station carrier aggregation scheduling codebook processing device 50 is provided, which comprises:

[0070] The update judgment module 52 is configured to obtain total scheduling data in the shared memory connected with all serving cells at the beginning of the current transmission time interval, and judge whether the total scheduling data is updated.

[0071] The base station covers a service cell, which includes a core service cell cell0 and non-core service cells cell1 and cell2 (three service cells are taken as an example).

[0072] The data filling module 54 is configured to stop the data synchronization operation in all the service 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.

[0073] In the present application, the synchronization operation of sending scheduling data between cells is abandoned at the beginning, and the scheduling data required for filling the codebook is stored in the shared memory connected to all the service cells. The non-core service cells in all the 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 is not updated in the current transmission time interval, it indicates that the total scheduling data has been updated in the current transmission time interval, and the total scheduling data in the shared memory can be used to fill the codebook. The service cells directly read the total scheduling data and the scheduled data in the shared memory to fill the codebook data.

[0074] The present application provides a codebook processing device for base station carrier aggregation scheduling, which fills the codebook data only after the total scheduling data is updated, saves the fixed occupation of the codebook data in the semi-static codebook, and significantly reduces the decoding cost. In addition, the synchronization operation between the service cells in the dynamic codebook process is cancelled before the codebook is filled, which reduces the amount of data transmitted between the cells and the complexity of the codebook generation process.

[0075] The modules in the codebook processing device for base station carrier aggregation scheduling can be realized by software, hardware and a combination thereof. The modules can be embedded in or independent of the processor in the computer device in hardware form, or stored in the memory in the computer device in software form, so as to be called and executed by the processor. The modules can also be realized by various processors.

[0076] In an embodiment, a computer device is provided, which can be a server, and an internal structure diagram of the computer device can be as shown in FIG. 6. The computer device includes a processor, a memory, and a network interface connected through a system bus. The processor of the computer device is configured 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 running the operating system and the computer program in the non-volatile storage medium. The database of the computer device is configured to store DCI data. The network interface of the computer device is configured to communicate with an external terminal through a network connection. The computer program is executed by the processor to implement a codebook processing method for base station carrier aggregation scheduling.

[0077] Those skilled in the art can understand that the structure shown in FIG. 6 is only a block diagram of part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. Specifically, the computer device can include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0078] In an embodiment, a computer device is provided, which includes a memory and a processor. The memory stores a computer program. The processor executes the computer program to implement the following steps:

[0079] In step S20, total scheduling data in a shared memory connected with all serving cells is obtained at the beginning of a current transmission time interval, and it is determined whether the total scheduling data is updated.

[0080] In general, the serving cells covered by the base station include a core serving cell cell0 and non-core serving cells cell1 and cell2 (three serving cells are taken as an example here). The dynamic codebook in the related art needs to obtain scheduling data of each serving cell in the current transmission time interval in the order of cell0, cell1, and cell2, and send the scheduling data of the serving cell to the other two serving cells. In the embodiment of the present application, the scheduling operation of sending the scheduling data to other serving cells is abandoned at the beginning stage, and the scheduling data required for filling the codebook is stored in the shared memory connected with all serving cells, so that the non-core serving cells detect whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.

[0081] In step S40, if the update does not occur, the data synchronization operation between the all 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.

[0082] If the total scheduling data in the shared memory is not updated in the current transmission time interval, it indicates that the core serving cell has updated the total scheduling data, and the total scheduling data in the shared memory can be used to fill the codebook.

[0083] The base station carrier aggregation scheduling codebook processing method proposed in the application can increase the bit occupancy by performing the blanking processing operation on the bit corresponding to the service cell without sending DCI data, but still can significantly reduce the decoding overhead compared with the processing of the semi-static codebook. Meanwhile, by canceling the synchronization operation between the service cells in the related codebook in the carrier aggregation scheduling codebook, the complexity of the codebook generation process is reduced. The PCell and SCell message synchronization and the full use of PUCCH resources are taken into account, the waste of PUCCH resources is reduced on the basis of simplifying the message synchronization process as much as possible.

[0084] In one embodiment, a computer readable storage medium is provided, and the computer program is stored on the computer readable storage medium, and the computer program is executed by a processor to implement the following steps:

[0085] In step S20, at the beginning of the current transmission time interval, the total scheduling data in the shared memory connected with all the service cells is obtained, and it is determined whether the total scheduling data is updated.

[0086] In general, the service cells covered by the base station include the core serving cell cell0 and the non-core serving cells cell1 and cell2 (three service cells are taken as an example here). The dynamic codebook in the related 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 the service cell to the other two service cells. In the embodiment of the application, the scheduling operation of sending the scheduling data to the other service cells is abandoned at the beginning stage, and the scheduling data required for filling the codebook is stored in the shared memory connected with all the service cells, so that the non-core serving cell detects whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.

[0087] In step S40, if the total scheduling data is not updated, the data synchronization operation between the service 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.

[0088] If the total scheduling data in the shared memory is not updated in the current transmission time interval, it indicates that the core serving 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 serving cell directly reads the total scheduling data and the scheduled data in the shared memory to fill the codebook data.

[0089] The base station carrier aggregation scheduling codebook processing method proposed in the application can increase the bit occupancy by performing the blanking operation on the bit corresponding to the service cell without sending DCI data, but the decoding overhead can still be significantly reduced compared with the processing of the semi-static codebook. Meanwhile, by canceling the synchronization operation between the service cells in the related codebook in the carrier aggregation scheduling codebook, the complexity of the codebook generation process is reduced. The PCell and SCell message synchronization and the full use 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.

[0090] In one embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the following steps:

[0091] Step S20, at the beginning of the current transmission time interval, obtaining the total scheduling data in the shared memory connected to all the service cells, and judging whether the total scheduling data is updated.

[0092] In general, the service cells covered by the base station include the core serving cell cell0 and the non-core serving cells cell1 and cell2 (three service cells are taken as an example here). The dynamic codebook in the related 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 the service cell to the other two service cells. In the embodiment of the application, the scheduling operation of sending the scheduling data to other service cells is abandoned at the beginning stage, and the scheduling data required for filling the codebook is stored in the shared memory connected to all the service cells, so that the non-core serving cell detects whether the total scheduling data in the shared memory is updated at the beginning of each transmission time interval.

[0093] Step S40, if the total scheduling data is not updated, stopping the data synchronization operation between the service cells, and filling the codebook data in the downlink control information according to the total scheduling data and the scheduled data in the shared memory.

[0094] If the total scheduling data in the shared memory is not updated in the current transmission time interval, it indicates that the core serving 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 serving cell directly reads the total scheduling data and the scheduled data in the shared memory to fill the codebook.

[0095] The base station carrier aggregation scheduling codebook processing method proposed in the application can increase the bit occupancy by performing the blanking processing operation on the bit corresponding to the service cell without sending the DCI data, but the decoding overhead can still be significantly reduced compared with the processing of the semi-static codebook. Meanwhile, by canceling the synchronization operation between the service cells in the related codebook in the carrier aggregation scheduling codebook, the complexity of the codebook generation process is reduced. The PCell and SCell message synchronization and the full use of the PUCCH resource are taken into account, the waste of the PUCCH resource is reduced on the basis of simplifying the message synchronization process as much as possible.

[0096] It should be noted that the user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or authorized by all parties.

[0097] 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. The computer program can be stored in a non-volatile computer readable storage medium, and when the computer program is executed, the processes of the above-mentioned embodiments of the methods can be included. Any reference to memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (Read-Only Memory, ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive memory (ReRAM), magnetoresistive memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric memory (Ferroelectric Random Access Memory, FRAM), phase change memory (Phase Change Memory, PCM), graphene memory, etc. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, etc. As an illustration but not limitation, the RAM can be in various forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), etc. The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a block chain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., without being limited thereto.

[0098] Any combination of the technical features of the above embodiments can be made. In order to make the description simple, all possible combinations of the technical features in the above embodiments are not described, however, as long as the combination of the technical features does not exist contradictory, it should be considered as the scope of the present application.

[0099] The above embodiments only express several implementation manners of the present application, and the description is more specific and detailed, but it should not be understood as a limitation on the scope of the patent of the present application. It should be pointed out that for ordinary skilled in the art, without departing from the concept of the present application, a number of modifications and improvements can be made, which are within the scope of protection of the present application. Therefore, the protection scope of the present application should be subject to the appended claims.

Claims

1. A method for codebook processing of base station carrier aggregation scheduling, characterized in that, The codebook processing method of the base station carrier aggregation scheduling comprises the following steps: At the beginning of a current transmission time interval, total scheduling data in a shared memory connected with all serving cells is acquired, and it is determined whether the total scheduling data is updated; If the total scheduling data is not updated, a data synchronization operation in all serving cells is stopped, and codebook data in downlink control information is filled according to the total scheduling data and scheduled data in the shared memory.

2. The method of claim 1, wherein, Before the determination of whether the total scheduling data is updated, the method further comprises the following steps: The scheduled data in the shared memory is updated by a core serving cell in all serving cells.

3. The method of claim 2, wherein, The updating of the scheduled data in the shared memory by the core serving cell in all serving cells comprises the following steps: The number of cells of all serving cells is acquired, and the scheduled data is updated according to the number of cells.

4. The method of claim 1, wherein, 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 comprises the following steps: If a target serving cell in all serving cells has no data transmission in the current transmission time interval, a blanking process is performed at a corresponding position in the codebook data; If the remaining serving cells except the target serving cell in all serving cells have data transmission in the current transmission time interval, the total scheduling data and the scheduled data are updated on the basis of the blanking process, and the codebook data in the downlink control information is filled by using the updated total scheduling data and the updated scheduled data.

5. The method of claim 4, wherein, 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 comprises the following steps: If the target serving cell has data transmission in the current transmission time interval, the total scheduling data is updated according to the number of cells of all serving cells.

6. The method of claim 1, wherein, The method further comprises the following steps: The shared memory is updated according to data of a primary carrier and a secondary carrier; The codebook data is filled according to the updated data.

7. A codebook processing apparatus for base station carrier aggregation scheduling, characterized in that, The codebook processing device of the base station carrier aggregation scheduling comprises the following steps: An update determination module is configured to acquire total scheduling data in a shared memory connected with all serving cells at the beginning of a current transmission time interval, and determine whether the total scheduling data is updated; A data filling module is configured to stop a data synchronization operation in all serving cells if the total scheduling data is not updated, and fill codebook data in downlink control information according to the total scheduling data and scheduled data in the shared memory.

8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that, The processor executes the computer program to implement the steps of the method in any one of claims 1 to 6.

9. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 6.

10. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 6.

Images