Enhanced pdcch search space processing method based on dm-rs
A DM-RS and search space technology, applied in network traffic/resource management, digital transmission systems, electrical components, etc., can solve problems such as search space design, inability to obtain frequency domain diversity gain, and frequency domain channel deep fading
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0037] In this embodiment 1, the search space is designed based on CCE interleaving sorting, specifically including figure 2 The flow shown:
[0038] In step 201, all CCEs in the enhanced PDCCH are sequentially sorted in ascending order of frequency to obtain a CCE sequence.
[0039] Step 202, performing interleaving and sorting on the CCE sequence to obtain a search space.
[0040] Take the number of all CCEs of the enhanced PDCCH as N CCE example pair figure 2 The flow shown is described:
[0041] First, for all N in the enhanced PDCCH CCE CCEs are sorted. Here, all N in the enhanced PDCCH are sorted according to the traditional PDCCH sorting method. CCE CCEs are sequentially sorted, that is, all CCEs are sorted in ascending order of frequency to obtain a CCE sequence, and the sequence numbers of the CCEs in the CCE sequence are 0, 1, ..., N CCE -1.
[0042] Afterwards, perform interleaving and sorting on the obtained CCE sequences, that is, perform interleaving pro...
Embodiment 2
[0056] This embodiment 2 is different from embodiment 1. In this embodiment 2, it defines respective search spaces for different aggregation levels, specifically including Figure 4 The flow shown:
[0057] Step 401 , for the aggregation level L, group all CCEs in the enhanced PDCCH in units of L, where the value of L is 1, 2, 4, or 8.
[0058] Step 402, interleaving and sorting the sequence numbers of all CCE groups to obtain a search space.
[0059] In this step 402, the specific operation of interleaving and sorting the sequence numbers of all CCE groups is: according to the principle of row-by-row writing, the sequence numbers of all CCE groups are sent to the block interleaver whose column number is a set value G, The principle of reading is to use the obtained sequence numbers of all CCE groups as the sequence numbers of all CCE groups after interleaving and sorting.
[0060] It can be seen that in this embodiment 2, for the aggregation level L, all CCEs are grouped in...
Embodiment 3
[0069] In the above-mentioned embodiment 1 and embodiment 2, the distribution of the RB pairs carrying the enhanced PDCCH is not limited, and it does not need to perform any processing on the CCEs defined above.
[0070] However, in Embodiment 3, it is applied to a scenario where the RB pairs carrying the enhanced PDCCH are symmetrically distributed on both sides of the system bandwidth, and the search space is mainly designed based on frequency hopping. In this solution, it is necessary to further perform processing on the CCE: to divide the CCE into two CCE segments (CCEsegment), specifically as Figure 5 shown. Based on this, when defining CCE above, the must be divisible by 2.
[0071] In the mth CCE, the resource positions of the two CCE segments obtained by dividing the CCE (n PRB , i) is:
[0072]
[0073] Among them, n PRB Indicates the RB number, i indicates the number of the CCE segment in the RB, is the number of RB pairs in the downlink system bandwidth,...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 