CCE resource allocation method, electronic device and storage medium
By segmenting the CCE resource pool into optimal and suboptimal resource pools in a multi-cell environment, and allocating CCE resources in a specific index order, the PDCCH interference problem caused by CCE resource allocation is solved, resource staggering is achieved, and cell staggering is reduced Interference between.
Patent Information
- Application Number
- CN202211385813.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-11-07
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2042-11-07
AI Technical Summary
In a multi-cell environment, the CCE resource allocation method in the prior art causes overlapping time-frequency domain positions, resulting in inter-cell PDCCH interference.
By obtaining the number of neighboring cells within the base station coverage, segment the CCE resource pool into the optimal and suboptimal resource pools, and when the CCE resource allocation is allocated, the allocation starts from the starting index of the optimal resource pool, and then after completion Allocation from the suboptimal resource pool ensures that the starting CCE index of each cell is different to reduce interference.
It effectively reduces interference between PDCCH, ensuring that the allocated CCE resources are staggered when the CCE resources are not fully scheduled, and avoids inter-cell interference.
Smart Images

Figure CN115865292B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication technology, and in particular to a CCE resource allocation method, electronic equipment and storage medium. Background Art
[0002] At present, in a multi-cell environment, the allocation method of non-interleaved CCE resources is the same, that is, according to the number of RBs and symbols of the coreset, the total CCE resources are obtained, and then the CCE resources are determined according to the terminal's RNTI, scheduling slot and aggregation degree. This exists in a multi-cell environment. If the CCE resources are not fully allocated at the current moment, and each cell has the same CCE allocation principle, there will be overlap in the time-frequency domain position, and there will be interference areas between the PDCCHs of the cells. Summary of the invention
[0003] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention proposes a CCE resource allocation method, an electronic device and a storage medium, which can reduce interference between PDCCHs when CCE is not fully scheduled.
[0004] A CCE resource allocation method according to an embodiment of the present invention includes:
[0005] S1. Obtain the number N of neighboring cells within the coverage area of the base station, and divide the total number T of CCE resources into CCE resource pool segments according to the number of neighboring cells;
[0006] S2. Set an optimal CCE resource pool for each cell and set a suboptimal CCE resource pool for some cells;
[0007] S3. When each cell allocates CCE resources, it first allocates from the starting CCE index of the optimal CCE resource pool. After the optimal CCE resource allocation is completed, it allocates from the suboptimal CCE resources.
[0008] In some embodiments of the present invention, the total number T of CCE resources in step S1 is the number of CCE resources under the current BWP, the configured PDCCH resources are full bandwidth, and the number of symbols is 1 or 2.
[0009] In some embodiments of the present invention, in step S1, if the number of neighboring cells is N≤5, the total number of CCE resources is divided into n equal parts, where n=N; if the number of neighboring cells N>5, the base station neighboring areas are divided into several groups, each group includes 3 or 4 cells, and the group number is mod(PCIi, 3) or mod(PCIi, 4), where i=1, 2, ..., N / 3 or N / 4; N / 3 and N / 4 are rounded up.
[0010] In some embodiments of the present invention, the optimal CCE resource pool and the suboptimal CCE resource pool of each cell in step S2 are as follows:
[0011] When the number of neighboring cells N≤5, the total number of CCE resources is divided into n equal parts:
[0012] The starting index of the optimal CCE resource pool of cell 1 is 0, and the optimal CCE resource pool is 0 to (T-1);
[0013] The starting index of the optimal CCE resource pool of cell j is The optimal CCE resource pool is The suboptimal CCE resource pool is
[0014] Wherein, j=2, ..., n; and n=N;
[0015] When the number of neighboring cells N=6, each group includes 3 cells. Let M be the remainder of K / 3, K=1, 2, ..., N. If M=1, the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=3;
[0016] When the number of neighboring cells N>6, each group includes 3 cells, let M be the remainder of K / 3, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, then the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=3;
[0017] When the number of neighboring cells N>6, each group includes 4 cells, let M be the remainder of K / 4, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2 or M=3, then the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=4.
[0018] In some embodiments of the present invention, when each cell performs CCE resource allocation in step S4, it first starts with the starting index of the optimal CCE resource pool. If the optimal CCE resource pool does not have enough available CCE resources, it continues to allocate CCE from the initial CCE index of the suboptimal CCE resource pool; the allocation order of each resource pool is as follows: optimal CCE resource pool (optimal CCE resource pool starting index -> optimal CCE resource pool ending index) -> suboptimal CCE resource pool (index 0 -> optimal CCE resource pool starting index - 1).
[0019] An electronic device comprises: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-mentioned CCE resource allocation method by executing the executable instructions.
[0020] A storage medium stores a computer program, including the computer program that implements the above-mentioned CCE resource allocation method when executed by a processor.
[0021] According to the CCE resource allocation method, electronic device and storage medium of the embodiment of the present invention, when each cell allocates PDCCH resources, it prioritizes allocation from the starting CCE index of the priority CCE resource pool. The starting CCE index of each cell is different, and the allocated CCE resources can be staggered. When CCE is not fully scheduled, interference between PDCCHs can be reduced. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] Figure 1 The figure is a flow chart of a CCE resource allocation method according to an embodiment of the present invention.
[0023] Figure 2 is a schematic diagram of the distribution of resources of each cell according to a CCE resource allocation method in an embodiment of the present invention;
[0024] Figure 3 It is a specific execution diagram of a CCE resource allocation method according to an embodiment of the present invention. DETAILED DESCRIPTION
[0025] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present invention, and should not be construed as limiting the present invention.
[0026] For ease of understanding, before introducing the embodiments of the present disclosure, several terms involved in the embodiments of the present disclosure are first explained as follows:
[0027] UE: User Equipment, also known as user terminal, or terminal for short.
[0028] PDCCH: Physical Downlink Control Channel, physical downlink control channel.
[0029] CCE: ControlChannelElement, control channel element.
[0030] RNTI: Radio Network Temporary Identity, wireless network temporary identification, used in public transmission
[0031] Identifies the UE on the channel.
[0032] BWP: bandwidthpart, partial bandwidth, refers to a subset of the total bandwidth of the cell.
[0033] Reference below Figure 1-Figure 3 The CCE resource allocation method according to an embodiment of the present invention includes:
[0034] S1. Obtain the number N of neighboring cells within the coverage area of the base station, and divide the total number T of CCE resources into CCE resource pool segments according to the number of neighboring cells;
[0035] S2. Set an optimal CCE resource pool for each cell and set a suboptimal CCE resource pool for some cells;
[0036] S3. When each cell allocates CCE resources, it first allocates from the starting CCE index of the optimal CCE resource pool. After the optimal CCE resource allocation is completed, it allocates from the suboptimal CCE resources.
[0037] In some embodiments of the present invention, the total number T of CCE resources in step S1 is the number of CCE resources under the current BWP, the configured PDCCH resources are full bandwidth, and the number of symbols is 1 or 2.
[0038] In some embodiments of the present invention, in step S1, if the number of neighboring cells is N≤5, the total number of CCE resources is divided into n equal parts, where n=N; if the number of neighboring cells N>5, the base station neighboring areas are divided into several groups, each group includes 3 or 4 cells, and the group number is mod(PCIi, 3) or mod(PCIi, 4), where i=1, 2, ..., N / 3 or N / 4; N / 3 and N / 4 are rounded up.
[0039] In some embodiments of the present invention, the optimal CCE resource pool and the suboptimal CCE resource pool of each cell in step S2 are as follows:
[0040] When the number of neighboring cells N≤5, the total number of CCE resources is divided into n equal parts:
[0041] The starting index of the optimal CCE resource pool of cell 1 is 0;
[0042] The starting index of the optimal CCE resource pool of cell j is The optimal CCE resource pool is The suboptimal CCE resource pool is
[0043] Wherein, j=2, ..., n; and n=N;
[0044] When the number of neighboring cells N=6, each group includes 3 cells. Let M be the remainder of K / 3, K=1, 2, ..., N. If M=1, the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=3;
[0045] When the number of neighboring cells N>6, each group includes 3 cells, let M be the remainder of K / 3, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, then the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=3;
[0046] When the number of neighboring cells N>6, each group includes 4 cells, let M be the remainder of K / 4, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2 or M=3, then the starting index of the optimal CCE resource pool of the corresponding cell is The optimal CCE resource pool is The suboptimal CCE resource pool is If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is T*(3 / n)+1, the optimal CCE resource pool is T*(3 / n)+1~T, and the suboptimal CCE resource pool is 0~T*(3 / n); where n=4.
[0047] For example, the BWP full bandwidth is 273RB (FR1), the number of symbols is 2, the total number of CCEs is 90 CCEs, and the number of cells is 4. Accordingly, according to the CCE resource allocation method of the present invention, the optimal CCE resource pool and the suboptimal CCE resource pool of each cell are as follows:
[0048] The starting index of the priority resource pool of cell 1 is 0, and the priority resource pools range from 0 to 89;
[0049] The starting CCE index of the priority resource of cell 2 is 23, the priority resource pool is 23 to 90; the suboptimal resources are: 0 to 22;
[0050] The priority resource starting CCE index of cell 3 is 46, the priority resource pool is 46-90; the suboptimal resources are: 0-45;
[0051] The priority resource starting CCE index of cell 4 is 68, the priority resource pool is 68-90, and the suboptimal resources are 0-67.
[0052] For a larger number of districts, considering that the equal division effect is not good, the above-mentioned mode of division of module 3 or module 4 can be adopted. As for whether to use module 3 or module 4, it can be determined according to actual needs. The integer division mode is preferred. For example, when there are 15 cells, the mode of division of module 3 is preferred, and for 16 cells, the mode of division of module 4 is preferred. The division of each resource pool refers to the above and will not be repeated here.
[0053] In some embodiments of the present invention, when each cell performs CCE resource allocation in step S4, it first starts with the starting index of the optimal CCE resource pool. If the optimal CCE resource pool does not have enough available CCE resources, it continues to allocate CCE from the initial CCE index of the suboptimal CCE resource pool; the allocation order of each resource pool is as follows: optimal CCE resource pool (optimal CCE resource pool starting index -> optimal CCE resource pool ending index) -> suboptimal CCE resource pool (index 0 -> optimal CCE resource pool starting index - 1).
[0054] For example, according to Figure 3 As shown, CCE resources are allocated to cell 2. According to RNTI (93), total number of CCE resources (90), time slot number (0), aggregation degree (2), number of candidate sets (4), candidate set index (0-3) and coresetID (1), the CCE start indexes corresponding to each candidate set are obtained, which are 10, 32, 54, and 76 respectively. Then the order of the CCE start positions corresponding to each candidate set is: 32->54->76->10. Then, according to the order of the CCE start indexes of each candidate set, CCE resources are obtained until available CCE resources are obtained.
[0055] Verification example: In a time-division indoor base station, when PDCCH is not interleaved, one base station is configured with 4 cells, and the PDCCH resources of each cell are configured with full bandwidth in the frequency domain, i.e., 273 RBs, and the symbol is 2, i.e., the total number of CCEs is 90. The aggregation degree is 4, corresponding to the number of candidate sets is 4. Each cell has 4 UEs for scheduling, the UE of cell 1 is rnti125,317; the UE of cell 2 is rnti157,285; the UE of cell 3 is rnti189,253; the UE of cell 4 is rnti221,349;
[0056] Get time slot 0, the starting CCE index corresponding to each UE candidate set (0 to 3) is as follows:
[0057] Cell 1: rnti125: 48, 68, 4, 24; rnti317: 36, 56, 80, 12;
[0058] Cell 2: rnti157: 48, 68, 4, 24; rnti285: 40, 60, 84, 16;
[0059] Cell 3: rnti189: 44, 64, 0, 20; rnti253: 40, 60, 84, 16;
[0060] Cell 4: rnti221: 44, 64, 0, 20; rnti349: 36, 56, 80, 12;
[0061] If the solution provided by the patent is not used, then
[0062] The CCE resources allocated to rnti125 of cell 1 are: 48-51; the CCE resources allocated to rnti317 are 36-39;
[0063] The CCE resources allocated to rnti157 of cell 2 are: 48-51; the CCE resources allocated to rnti285 are 40-43;
[0064] The CCE resources allocated to rnti189 of cell 3 are: 44-47; the CCE resources allocated to rnti253 are 40-43;
[0065] The CCE resources allocated by rnti221 of cell 4 are: 44-47; the CCE resources allocated by rnti349 are 40-43.
[0066] This will cause the CCE resources of each cell to overlap, which will cause interference between PDCCH channels of the cells.
[0067] According to the CCE resource allocation method provided by the present invention,
[0068] The CCE resources allocated to rnti125 of cell 1 are: 4-7; the CCE resources allocated to rnti317 are 12-15;
[0069] The CCE resources allocated to rnti157 of cell 2 are: 24-27; the CCE resources allocated to rnti285 are 40-43;
[0070] The CCE resources allocated to rnti189 of cell 3 are: 64-67; the CCE resources allocated to rnti253 are 60-63;
[0071] The CCE resources allocated by rnti221 of cell 4 are: 0-3; the CCE resources allocated by rnti349 are 80-83.
[0072] It can be seen that the CCEs allocated to the PDCCH resources of each cell are different, and there will be no interference between the PDCCH resources of the cells.
[0073] The present invention also provides an electronic device, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-mentioned CCE resource allocation method by executing the executable instructions.
[0074] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor, the at least one memory, and a bus connecting different system components (including the memory and the processor).
[0075] The above-mentioned memory stores program code, and the program code can be executed by the processor, so that the processor executes the steps described in the above-mentioned "Exemplary Method" section of this specification according to various exemplary embodiments of the present disclosure. For example, the processor can execute the following steps of the above-mentioned method embodiment: obtain the number N of neighboring cells within the coverage area of the base station, and divide the total number T of CCE resources into CCE resource pool segments according to the number of neighboring cells; set an optimal CCE resource pool and a suboptimal CCE resource pool for each cell; when each cell allocates CCE resources, it starts with the starting CCE index of the optimal CCE resource pool, and after the optimal CCE resource allocation is completed, it allocates from the suboptimal CCE resources.
[0076] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).
[0077] The memory may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include an implementation of a network environment.
[0078] Electronic equipment can also communicate with one or more external devices (such as keyboards, pointing devices, bluetooth devices, etc.), can also communicate with one or more devices that enable users to interact with the electronic equipment, and / or communicate with any device (such as routers, modems, etc.) that enables the electronic equipment to communicate with one or more other computing devices. This communication can be carried out through an input / output (I / O) interface. In addition, the electronic equipment can also communicate with one or more networks (such as local area networks (LANs), wide area networks (WANs) and / or public networks, such as the Internet) through a network adapter. As shown in the figure, the network adapter communicates with other modules of the electronic equipment through a bus.
[0079] The present invention also provides a computer-readable storage medium, which may be a readable signal medium or a readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the above-mentioned CCE resource allocation method is implemented.
[0080] Finally, according to the CCE resource allocation method, electronic device and storage medium of the embodiments of the present invention, when each cell allocates PDCCH resources, it prioritizes allocation from the starting CCE index of the priority CCE resource pool. The starting CCE index of each cell is different, and the allocated CCE resources can be staggered. When CCE is not fully scheduled, the interference between PDCCHs can be reduced.
[0081] Note that in the above formulas, if 1 / n or other starting CCE index number and ending index number cannot be divided evenly, they are rounded down.
[0082] Although the embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.
Claims
1. A CCE resource allocation method, characterized in that: include: S1. Obtain the number N of neighboring cells within the coverage area of the base station, and divide the total number T of CCE resources into CCE resource pool segments according to the number of neighboring cells; S2. Set an optimal CCE resource pool for each cell and set a suboptimal CCE resource pool for some cells; S3, when each cell allocates CCE resources, it starts with the starting CCE index of the optimal CCE resource pool, and after the optimal CCE resource allocation is completed, it allocates from the suboptimal CCE resources; The total number T of CCE resources in step S1 is the number of CCE resources under the current BWP, the configured PDCCH resources are full bandwidth, and the number of symbols is 1 or 2; In the step S1, if the number of neighboring cells is N≤5, the total number of CCE resources is divided into n equal parts, where n=N; if the number of neighboring cells N>5, the base station neighboring areas are divided into several groups, each group includes 3 or 4 cells, and the group number is mod(PCIi, 3) or mod(PCIi, 4), where i=1, 2, ..., N / 3 or N / 4; N / 3 and N / 4 are rounded up; The optimal CCE resource pool and suboptimal CCE resource pool of each cell in step S2 are as follows: When the number of neighboring cells N≤5, the total number of CCE resources is divided into n equal parts: The starting index of the optimal CCE resource pool of cell 1 is 0, and the optimal CCE resource pool is 0~(T-1); The starting index of the optimal CCE resource pool of cell j is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; Where j=2,...,n; and n=N; When the number of neighboring cells N=6, each group includes 3 cells. Let M be the remainder of K / 3, K=1, 2, ..., N. If M=1, the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; Among them, n=3; When the number of neighboring cells N>6, each group includes 3 cells, let M be the remainder of K / 3, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2, then the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; Among them, n=3; When the number of neighboring cells N>6, each group includes 4 cells, let M be the remainder of K / 4, K=1, 2, ..., N, if M=1, then the starting index of the optimal CCE resource pool of the corresponding cell is 0, and the optimal CCE resource pool is 0~(T-1); if M=2 or M=3, then the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; If M=0, the starting index of the optimal CCE resource pool of the corresponding cell is , the optimal CCE resource pool is ~T, the suboptimal CCE resource pool is 0~ ; where n=4.
2. A CCE resource allocation method according to claim 1, characterized in that: In the step S3, when each cell allocates CCE resources, it first starts with the starting index of the optimal CCE resource pool. If the optimal CCE resource pool does not have enough available CCE resources, it continues to allocate CCE from the initial CCE index of the suboptimal CCE resource pool; the allocation order of each resource pool is as follows: optimal CCE resource pool -> suboptimal CCE resource pool, wherein the optimal CCE resource pool refers to the starting index of the optimal CCE resource pool -> the ending index of the optimal CCE resource pool, and the suboptimal CCE resource pool refers to index 0 -> the starting index of the optimal CCE resource pool -1.
3. An electronic device, characterized in that: include: processor; A memory, configured to store executable instructions of the processor; The processor is configured to execute the CCE resource allocation method described in any one of claims 1-2 by executing the executable instructions.
4. A storage medium having a computer program stored thereon, characterized in that: Including, when the computer program is executed by a processor, implementing the CCE resource allocation method described in any one of claims 1-2.
Citation Information
Patent Citations
Method and device for allocating PDCCH resources
CN101820669A
PDCCH resource allocation method and device and storage medium
CN114980346A
Wireless communication mobile station apparatus and control channel decoding method
US20100260124A1
Interference mitigation on a physical downlink control channel
US20130188594A1
