CN113067670A - Method and device for determining starting position of MPDCCH (Multi-program control channel) search space and computer readable storage medium - Google Patents
Method and device for determining starting position of MPDCCH (Multi-program control channel) search space and computer readable storage medium Download PDFInfo
- Publication number
- CN113067670A CN113067670A CN202110271902.9A CN202110271902A CN113067670A CN 113067670 A CN113067670 A CN 113067670A CN 202110271902 A CN202110271902 A CN 202110271902A CN 113067670 A CN113067670 A CN 113067670A
- Authority
- CN
- China
- Prior art keywords
- candidate set
- mpdcch
- current
- mpdcch candidate
- calculation result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
- H04L1/0038—Blind format detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
A method and a device for determining a starting position of an MPDCCH search space, and a computer-readable storage medium, wherein the method comprises the following steps: adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set; determining a first number according to a second calculation result of the current MPDCCH candidate set, and determining a bit with the lowest first number in the first calculation result of the current MPDCCH candidate set as a complementation operation result of the current MPDCCH candidate set; substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set. The scheme of the invention can determine the initial position of the MPDCCH search space by a more simplified algorithm, thereby greatly reducing the calculation complexity of the UE.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method and a device for determining an initial position of an MPDCCH search space and a computer readable storage medium.
Background
In a communication system, a User Equipment (User Equipment, UE for short) obtains Downlink Control Information (DCI for short) by blind detection of a Control channel to obtain scheduling Information for a Downlink data channel or an uplink data channel, uplink power Control Information, Information related to uplink preamble transmission, or release of semi-persistent scheduling.
When blind-detecting a Control Channel, the position of a search space in which each Machine Type Communication Physical Downlink Control Channel (MTC PDCCH, i.e., MPDCCH) candidate set is located needs to be calculated. While the calculation formula (abbreviated as "initial position calculation formula") of the initial Control Channel Element (CCE) of the search space corresponding to the MPDCCH candidate set m specified by the existing protocol needs to use division operation and remainder (mod) operation in calculation.
For different MPDCCH candidate sets m, the corresponding starting positions need to be calculated by using a starting position calculation formula. The remainder operation and the division operation have high operation complexity and large operation overhead when the remainder operation and the division operation are realized at fixed points, and the operation burden of the UE is seriously increased.
Disclosure of Invention
The invention solves the technical problem of how to reduce the operation complexity when determining the starting position of the MPDCCH searching space.
In order to solve the above technical problem, an embodiment of the present invention provides a method for determining an initial position of an MPDCCH search space, where the method includes: adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula; determining a first quantity according to a second calculation result of the current MPDCCH candidate set, and determining a bit with the lowest first quantity in the first calculation result of the current MPDCCH candidate set as a result of the remainder operation of the current MPDCCH candidate set, wherein the second calculation result is a calculation result of a second part of an equation in the starting position calculation formula, and the first part of the equation and the second part of the equation are operation objects of the remainder operation in the starting position calculation formula; substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
Optionally, the adding the first calculation result of the previous MPDCCH candidate set and the step value corresponding to the current MPDCCH candidate set to obtain the first calculation result of the current MPDCCH candidate set includes: acquiring a first calculation result obtained when the initial position of the previous MPDCCH candidate set is calculated; searching a preset association relation table to obtain a step value corresponding to the current MPDCCH candidate set, wherein the preset association relation table is used for recording the corresponding relation between the MPDCCH candidate set and the step value; and adding the obtained first calculation result of the previous MPDCCH candidate set and the step value obtained by searching to obtain a first calculation result of the current MPDCCH candidate set.
Optionally, the preset association table is obtained by performing calculation in advance through all MPDCCH candidate sets.
Optionally, the preset association table corresponds to an application scenario one to one, and the searching the preset association table to obtain the step value corresponding to the current MPDCCH candidate set includes: and determining a corresponding preset incidence relation table according to the current application scene, and searching the preset incidence relation table to obtain a step value corresponding to the current MPDCCH candidate set.
Optionally, the preset association table only stores step values with values other than 1 and corresponding MPDCCH candidate sets, and the searching the preset association table to obtain the step values corresponding to the current MPDCCH candidate sets includes: searching whether the preset association relation table contains the current MPDCCH candidate set or not; if the search result is that the preset association relation table contains the current MPDCCH candidate set, determining a numerical value corresponding to the current MPDCCH candidate set recorded in the preset association relation table as a corresponding step value; and if the search result indicates that the current MPDCCH candidate set is not contained in the preset association relation table, determining that the step value corresponding to the current MPDCCH candidate set is 1.
Optionally, the determining the first number according to the second calculation result of the current MPDCCH candidate set includes: and determining a first quantity corresponding to a second calculation result of the current MPDCCH candidate set according to a preset corresponding relation, wherein the preset corresponding relation is used for recording the corresponding relation between the second calculation result and the first quantity.
Optionally, the preset corresponding relationship is determined by traversing configurations of all MPDCCHs in advance.
Optionally, the second calculation result in the preset corresponding relationship is selected from a set {1,2,4,8,16}, and the first quantity is selected from a set {0,1,2,3,4 }.
Optionally, the starting position calculation formula is:
wherein the content of the first and second substances,
is the starting position corresponding to the MPDCCH candidate set m of the aggregation level L', the repetition level R on the subframe k,
the number of MPDCCH candidate sets for aggregation level L' on MPDCCH set p; n'ECCE,p,kIs the number of ECCEs on subframe k, MPDCCH set p; for UE-specific MPDCCH search space, Yp,k＝(Ap·Yp,k-1)mod D，Yp,-1＝nRNTI≠0，A0＝39827，A139829, D65537 and
nsis the number of time slots in each radio frame; for MPDCCH common search space, Yp,k＝0；i＝0,...,L'-1；
Is a rounding down operation.
Optionally, the first part is calculated as
The second part is calculated as
To solve the foregoing technical problem, an embodiment of the present invention further provides an apparatus for determining a starting position of an MPDCCH search space, where the apparatus includes: the adding module is used for adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula; a determining module, configured to determine a first number according to a second calculation result of the current MPDCCH candidate set, and determine a lowest first number of bits in the first calculation result of the current MPDCCH candidate set as a result of a remainder operation of the current MPDCCH candidate set, where the second calculation result is a calculation result of a second partial equation in the starting position calculation formula, and the first partial equation and the second partial equation are operation objects of the remainder operation in the starting position calculation formula; and the processing module is used for substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
To solve the above technical problem, an embodiment of the present invention further provides a computer-readable storage medium, which is a non-volatile storage medium or a non-transitory storage medium, and has a computer program stored thereon, where the computer program is executed by a processor to perform the steps of the above method.
In order to solve the above technical problem, an embodiment of the present invention further provides an apparatus for determining a starting position of an MPDCCH search space, where the apparatus includes a memory and a processor, where the memory stores a computer program executable on the processor, and the processor executes the steps of the method when executing the computer program.
Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:
the embodiment of the invention provides a method for determining an initial position of an MPDCCH search space, which comprises the following steps: adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula; determining a first quantity according to a second calculation result of the current MPDCCH candidate set, and determining a bit with the lowest first quantity in the first calculation result of the current MPDCCH candidate set as a result of the remainder operation of the current MPDCCH candidate set, wherein the second calculation result is a calculation result of a second part of an equation in the starting position calculation formula, and the first part of the equation and the second part of the equation are operation objects of the remainder operation in the starting position calculation formula; substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
Compared with the prior art, the initial position of the search space corresponding to each MPDCCH candidate set needs to be actually calculated once according to the initial position calculation formula, so that a large amount of division operation and remainder operation are caused, and further, the operation complexity is increased to increase the operation burden of the UE. The embodiment provides a simplified algorithm of the initial position, simple addition operation and a storage table are used for replacing remainder operation and division operation in an initial position calculation formula, and the calculation complexity can be effectively reduced. Further, the reduction in computational complexity facilitates improving power consumption and response speed of the UE.
Further, the first part is calculated as
The second part is calculated as
The step value corresponding to the current MPDCCH candidate set may be predetermined and solidified in a table or the like, and only an addition operation needs to be performed based on the step value to obtain a division operation result in the starting position calculation formula, without actually performing a division operation. Thus, the operation amount of division operation is successfully saved. Further, the first quantity corresponding to the second calculation result may also be predetermined and solidified in a table or the like, and the result of the complementation operation may be directly obtained based on the first quantity without actually performing a complementation operation. Therefore, the operation amount of the complementation operation is also successfully saved.
Further, the embodiment enumerates all configurations of the MPDCCH, deduces a simplified algorithm of the initial CCE where all candidate sets of the MPDCCH are located according to different values, and replaces division and remainder operations in the initial position calculation formula based on the step value and the first number, thereby greatly reducing the calculation complexity.
Drawings
Fig. 1 is a flowchart of a method for determining a starting position of an MPDCCH search space according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an apparatus for determining a starting position of an MPDCCH search space according to an embodiment of the present invention.
Detailed Description
As background art shows, when calculating the starting position of the MPDCCH search space, the existing UE has high calculation complexity and large calculation burden, which seriously affects the power consumption and response speed of the UE.
In particular, the MPDCCH search space
From one toThe set of MPDCCH candidates consists of a degree of polymerization (also called a polymerization level) L' e {1,2,4,8,16,12,24}, a repetition level R e {1,2,4,8,16,32,64,128,256 }. For a Physical Resource Block (PRB) set p (MPDCCH-PRB-set p) of an MPDCCH, an existing protocol specifies a starting position (i.e., a starting CCE (also called enhanced CCE, abbreviated ECCE)) of a search space corresponding to an MPDCCH candidate set m, and a calculation formula is as follows:
wherein the content of the first and second substances,
is the starting position corresponding to the MPDCCH candidate set m of the aggregation level L', the repetition level R on the subframe k,
the number of MPDCCH candidate sets for aggregation level L' on MPDCCH set p; n'ECCE,p,kIs the number of ECCEs on subframe k, MPDCCH set p; for UE-specific MPDCCH search space (MPDCCH UE-specific search space), Yp,k＝(Ap·Yp,k-1)mod D，Yp,-1＝nRNTI≠0，A0＝39827，A139829, D65537 and
nsis the number of time slots in each radio frame; for MPDCCH common search space (MPDCCH common search space), Yp,k＝0；i＝0,...,L'-1；
Is a rounding down operation.
Determining the number of MPDCCH candidate sets (number of MPDCCH candidates) with reference to different tables for different application scenarioss)
The specific numerical values of (a) are as follows:
for UE-specific MPDCCH search spaces, if parameters
Or
The MPDCCH repetition number (MPDCCH-NumRepetition) is 1 and the MPDCCH is configured to be distributed. The MPDCCH candidate set tables at this time refer to tables 9.1.4-1a and 9.1.4-1b below.
Table 9.1.4-1a
Table 9.1.4-1b
The application scenarios for table 9.1.4-1a and table 9.1.4-1b are: UE-specific MPDCCH search space and is distributed configured. Wherein case1 is applicable to a normal subframe, a normal Cyclic Prefix (CP) and nMPDCCH＜104，nMPDCCHThe number of resource units which can be used for MPDCCH transmission in one PRB is represented; or special subframe configuration 3/4/8 special subframe, normal CP and n in frame structure type 2MPDCCH< 104. case2 is applicable to normal subframes and extends CP; or special subframe configuration for frame structure type 2 as special subframe of 1/2/6/7/9/10 and normal CP; or special subframe configuration 1/2/3/5/6 special subframe and extended CP when frame structure type 2. case 3 is applicable to scenes other than case1 and case 2.
For UE-specific MPDCCH search spaces, if parameters
Or
The number of MPDCCH repetitions (MPDCCH-NumRepetition) is 1 and the MPDCCH is configured in a localized manner. The MPDCCH candidate set tables at this time refer to tables 9.1.4-2a and 9.1.4-2b below.
Table 9.1.4-2a
Table 9.1.4-2b
The application scenarios for table 9.1.4-2a and table 9.1.4-2b are: UE-specific MPDCCH search space and configured centrally. Wherein, the applicable scenarios of case1, case2 and case 3 are the same as above, and refer to the related descriptions of case1, case2 and case 3 in tables 9.1.4-1a and 9.1.4-1 b.
For UE-specific MPDCCH search spaces, if parameters
Or the number of times of the MPDCCH repetition (mPDCCH-NumRepetition) is more than 1. The MPDCCH candidate set table at this time refers to table 9.1.5-1a, table 9.1.5-1b, table 9.1.5-2a, or table 9.1.5-2b below.
Table 9.1.5-1a
Table 9.1.5-1b
Table 9.1.5-2a
Table 9.1.5-2b
In the above four tables, r1, r2, r3 and r4 are the candidate repetition times of MPDCCH, and the specific value may be determined by the maximum repetition time rmaxAnd (6) determining. The relationship between the two can be found in table 9.1.5-3:
table 9.1.5-3
| rmax | r1 | r2 | r3 | r4 |
| 1 | 1 | - | - | - |
| 2 | 1 | 2 | - | - |
| 4 | 1 | 2 | 4 | - |
| >＝8 | rmax/8 | rmax/4 | rmax/2 | rmax |
The applicable application scenarios of the tables 9.1.5-1a and 9.1.5-1b are: UE-specific MPDCCH search space, the enhanced coverage mode of the UE is cemoda. Wherein the table 9.1.5-1a is applicable to MPDCCH-PRB-set having a size of 2 PRBs or 4 PRBs, and the number of repetitions of MPDCCH is greater than 1; the size of the table 9.1.5-1b applicable to MPDCCH-PRB-set is 6 PRBs, where 2PRB set in 2+4PRB set refers to 2 PRBs out of 6 PRBs in total 2+4, 4PRB set in 2+4PRB set refers to 4 PRBs out of 6 PRBs in total 2+4, and Both PRB sets in 2+4PRB set refers to all PRBs out of 6 PRBs in total 2+ 4.
The applicable application scenarios of the tables 9.1.5-2a and 9.1.5-2b are: UE-specific MPDCCH search space and the enhanced coverage mode of the UE is cemob. Where the table 9.1.5-2a is applicable for MPDCCH-PRB-set of size 2 PRBs or 4 PRBs, and the table 9.1.5-2b is applicable for MPDCCH-PRB-set of size 6 PRBs.
The MPDCCH candidate set table is a subset of the above table for all MPDCCH common search spaces.
The prior art implementation calculates the positions of all MPDCCH candidate sets according to the above starting position calculation formula. For example, for an MPDCCH specific UE search space, if
And mPDCCH-NumRepetition is 1, mPDCCH is configured as distributed, then
The candidate set table refers to the above table 9.1.4-1 a. In this example, the UE needs to calculate L' ═ 2 during blind detection,
L'＝4，
L'＝8，
a total of 7 MPDCCH candidate sets. Correspondingly, 7 complementation operations are required, of which there are 4 candidate sets (m)>0 hour), the calculation amount is huge, and the power consumption and the response speed of the UE are seriously influenced.
In order to solve the above technical problem, an embodiment of the present invention provides a method for determining an initial position of an MPDCCH search space, where the method includes: adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula; determining a first quantity according to a second calculation result of the current MPDCCH candidate set, and determining a bit with the lowest first quantity in the first calculation result of the current MPDCCH candidate set as a result of the remainder operation of the current MPDCCH candidate set, wherein the second calculation result is a calculation result of a second part of an equation in the starting position calculation formula, and the first part of the equation and the second part of the equation are operation objects of the remainder operation in the starting position calculation formula; substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
The embodiment provides a simplified algorithm of the initial position, simple addition operation and a storage table are used for replacing remainder operation and division operation in an initial position calculation formula, and the calculation complexity can be effectively reduced. Further, the reduction in computational complexity facilitates improving power consumption and response speed of the UE.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
Fig. 1 is a flowchart of a method for determining a starting position of an MPDCCH search space according to an embodiment of the present invention.
The embodiment can be applied to an application scene of blind detection of the control channel. By executing the simplified algorithm provided by the embodiment, the starting position of the search space where the MPDCCH candidate set is located can be determined with less calculation amount.
This embodiment may be performed by the user equipment side, such as by a UE on the user equipment side.
In a specific implementation, the starting position determining method provided in steps S101 to S103 may be executed by a chip with a blind detection function in the ue, or may be executed by a baseband chip in the ue.
Specifically, referring to fig. 1, the method for determining the starting position of the MPDCCH search space in this embodiment may include the following steps:
step S101, adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set. The step value is the deviation degree of a first calculation result when starting positions of two MPDCCH candidate sets before and after are calculated by using a starting position calculation formula, and the first calculation result is the calculation result of a first partial formula in the starting position calculation formula;
step S102, determining a first number according to the second calculation result of the current MPDCCH candidate set, and determining the lowest first number of bits in the first calculation result of the current MPDCCH candidate set as the remainder operation result of the current MPDCCH candidate set. The second calculation result is a calculation result of a second partial equation in the initial position calculation formula, and the first partial equation and the second partial equation are operation objects of the remainder operation in the initial position calculation formula;
and step S103, substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
In one embodiment, the first partial equation may be
The second partial equation may be
That is, the first partial equation and the second partial equation are respectively the divisor and dividend of the remainder operation in the initial position calculation equation.
Specifically, the first partial equation z (m) of the MPDCCH candidate set m may be given as
Accordingly, if m is 0, z (m) is Yp,k(ii) a If m>0, Z (m) ═ Z (m-1) + step, where step is the step size.
Further, the corresponding relationship between the step value and the MPDCCH candidate set m may be pre-stored in a preset association table. For example, all m values of all MPDCCH candidate set tables may be traversed to obtain a step value step corresponding to each MPDCCH candidate set m. The step value step corresponding to the MPDCCH candidate set m is equivalent to the calculation result of the rounded-down part in the first partial equation.
That is to say
In one implementation, the step S101 may include the steps of: acquiring a first calculation result obtained when the initial position of the previous MPDCCH candidate set is calculated; searching a preset association relation table to obtain a step value corresponding to the current MPDCCH candidate set; and adding the obtained first calculation result of the previous MPDCCH candidate set and the step value obtained by searching to obtain a first calculation result of the current MPDCCH candidate set.
Specifically, the starting position of the previous MPDCCH candidate set may also be calculated by using this embodiment.
Therefore, in this embodiment, it is actually only necessary to calculate Z (0), and the step values of all MPDCCH candidate sets m from m ═ 1 can be obtained by searching the preset association table, and then the first calculation result Z (m-1) of the MPDCCH candidate set m-1 is accumulated, so as to obtain the first calculation result Z (m) of the MPDCCH candidate set m.
In a specific implementation, the preset association table may only store a value of Step that is not 1 as the Step value, so as to save the memory space of the UE.
Correspondingly, when the preset association table is searched in step S101 to obtain the step value corresponding to the current MPDCCH candidate set, the following steps may be specifically performed: searching whether the preset association relation table contains the current MPDCCH candidate set or not; if the search result is that the preset association relation table contains the current MPDCCH candidate set, determining a numerical value corresponding to the current MPDCCH candidate set recorded in the preset association relation table as a corresponding step value; and if the search result indicates that the current MPDCCH candidate set is not contained in the preset association relation table, determining that the step value corresponding to the current MPDCCH candidate set is 1.
For example, in all MPDCCH candidate sets m found traversing all the MPDCCH candidate set tables described above, the step value step calculation results for all the MPDCCH candidate sets m in tables 9.1.4-1a, 9.1.5-1b, 9.1.5-2a, and 9.1.5-2b are all 1, and therefore do not need to be stored.
Except for the MPDCCH candidate set m in the following preset association relationship table 1, the step values step in the table 9.1.4-1b are all 1:
table 1 of predetermined association relationship
NA indicates that the parameter combination is not configured.
Except for the MPDCCH candidate set m in the following preset association relationship table 2, the step values step in the table 9.1.4-2b are all 1:
table 2 of predetermined association relationship
Except for the MPDCCH candidate set m in the following preset association relationship table 3 in the table 9.1.5-1a, the step values are all 1:
table 2 of predetermined association relationship
Different tables correspond to different application scenarios, and correspondingly, the preset association tables 1 to 3 correspond to different application scenarios.
Further, if m is greater than 0, when step S101 is executed, according to an application scenario to which the current MPDCCH candidate set m belongs, a corresponding step value step is obtained from the corresponding preset association table.
If the step value step corresponding to the current m value cannot be found from the corresponding preset association relation table, it may be determined that the corresponding step value step is 1.
Then, according to the step value step found or determined to be 1, a first calculation result of the current MPDCCH candidate set m is calculated based on the formula Z (m) ═ Z (m-1) + step.
Therefore, the step value corresponding to the current MPDCCH candidate set may be predetermined and solidified in a table or the like, and only an addition operation needs to be performed based on the step value to obtain a division operation result in the starting position calculation formula, without actually performing a division operation. Thus, the operation amount of division operation is successfully saved. In a variation, the first partial equation may be
This can also serve to saveThe effect of the amount of arithmetic operations.
In one implementation, step S102 may include the steps of: and determining a first quantity corresponding to a second calculation result of the current MPDCCH candidate set according to a preset corresponding relation, wherein the preset corresponding relation is used for recording the corresponding relation between the second calculation result and the first quantity.
Specifically, traversing all configurations of MPDCCH in advance may enumerate all possible second calculation results of the second partial equation to be {1,2,4,8,16 }.
Further, traversing all configurations of MPDCCH in advance may enumerate to obtain all possible first numbers corresponding to all possible second calculation results, where the possible first numbers are {0,1,2,3,4 }.
Correspondingly, when step S102 is executed, if the second calculation result of the current MPDCCH candidate set is 1, the remainder calculation result is 0; if the second calculation result of the current MPDCCH candidate set is 2, the complementation operation result is the lowest 1 bit of the first calculation result; if the second calculation result of the current MPDCCH candidate set is 4, the complementation operation result is the lowest 2 bits of the first calculation result; if the second calculation result of the current MPDCCH candidate set is 8, the complementation operation result is the lowest 3 bits of the first calculation result; if the second calculation result of the current MPDCCH candidate set is 16, the modulo operation result is the lowest 4 bits of the first calculation result.
Further, the lowest first number of bits in step S102 may refer to a first number of Least Significant Bits (LSB).
In one embodiment, the result of the remainder operation portion (i.e., the parenthesis) in the starting position calculation formula can be calculated by executing step S101 and step S102. Further, when step S103 is executed, the starting position of the current MPDCCH candidate set m can be obtained by only calculating the remainder operation result obtained by multiplying L' by step S102 and adding i
Specifically, the preset numerical value i defaults to 0.
Therefore, the first number corresponding to the second calculation result can also be predetermined and solidified in a form of a table and the like, and the complementation calculation result can be directly obtained based on the first number without actually performing the complementation calculation once. Therefore, the operation amount of the complementation operation is also successfully saved.
Further, the embodiment enumerates all configurations of the MPDCCH, deduces a simplified algorithm of the initial CCE of the search space where all candidate sets of the MPDCCH are located according to different values, and implements, based on the step value and the first quantity, a simple addition operation and a memory table instead of a division operation and a remainder operation in an initial position calculation formula, thereby greatly reducing the calculation complexity. Further, the reduction in computational complexity facilitates improving power consumption and response speed of the UE.
Fig. 2 is a schematic structural diagram of an apparatus for determining a starting position of an MPDCCH search space according to an embodiment of the present invention. Those skilled in the art understand that the starting position determining apparatus of the present embodiment may be used to implement the method technical solution described in the embodiment of fig. 1.
Specifically, referring to fig. 2, the starting position determining apparatus 2 according to the present embodiment may include: the adding module 21 is configured to add a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, where the step value is a deviation of the first calculation result when starting positions of the previous and next MPDCCH candidate sets are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first partial calculation formula in the starting position calculation formula; a determining module 22, configured to determine a first number according to a second calculation result of the current MPDCCH candidate set, and determine a lowest first number of bits in the first calculation result of the current MPDCCH candidate set as a result of a remainder operation of the current MPDCCH candidate set, where the second calculation result is a calculation result of a second partial equation in the starting position calculation formula, and the first partial equation and the second partial equation are operation objects of the remainder operation in the starting position calculation formula; and the processing module 23 is configured to substitute the result of the remainder operation of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
For more details of the operation principle and the operation mode of the start position determining apparatus 2, reference may be made to the related description in fig. 1, and details are not repeated here.
In a specific implementation, the start position determining device 2 may correspond to a Chip having a blind detection function in the ue, or correspond to a Chip having a data processing function, such as a System-On-a-Chip (SOC), a baseband Chip, and the like; or the chip module group comprises a chip with a blind detection function in the corresponding user equipment; or to a chip module having a chip with data processing function, or to a user equipment.
In a specific implementation, each module/unit included in each apparatus and product described in the foregoing embodiments may be a software module/unit, may also be a hardware module/unit, or may also be a part of a software module/unit and a part of a hardware module/unit.
For example, for each device or product applied to or integrated into a chip, each module/unit included in the device or product may be implemented by hardware such as a circuit, or at least a part of the module/unit may be implemented by a software program running on a processor integrated within the chip, and the rest (if any) part of the module/unit may be implemented by hardware such as a circuit; for each device or product applied to or integrated with the chip module, each module/unit included in the device or product may be implemented by using hardware such as a circuit, and different modules/units may be located in the same component (e.g., a chip, a circuit module, etc.) or different components of the chip module, or at least some of the modules/units may be implemented by using a software program running on a processor integrated within the chip module, and the rest (if any) of the modules/units may be implemented by using hardware such as a circuit; for each device and product applied to or integrated in the terminal, each module/unit included in the device and product may be implemented by using hardware such as a circuit, and different modules/units may be located in the same component (e.g., a chip, a circuit module, etc.) or different components in the terminal, or at least part of the modules/units may be implemented by using a software program running on a processor integrated in the terminal, and the rest (if any) part of the modules/units may be implemented by using hardware such as a circuit.
The embodiment of the present invention further provides another starting position determining apparatus, which includes a memory and a processor, where the memory stores a computer program that can be executed on the processor, and the processor executes the steps of the starting position determining method provided in the embodiment corresponding to fig. 1 when executing the computer program.
An embodiment of the present invention further provides a computer-readable storage medium, which is a non-volatile storage medium or a non-transitory storage medium, and on which a computer program is stored, where the computer program is executed by a processor to perform the steps of the start position determining method provided in any of the above embodiments. Preferably, the computer-readable storage medium may include a computer-readable storage medium such as a non-volatile (non-volatile) memory or a non-transitory (non-transient) memory. The computer readable storage medium may include ROM, RAM, magnetic or optical disks, and the like.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (13)
1. A method for determining the starting position of an MPDCCH search space is characterized by comprising the following steps:
adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula;
determining a first quantity according to a second calculation result of the current MPDCCH candidate set, and determining a bit with the lowest first quantity in the first calculation result of the current MPDCCH candidate set as a result of the remainder operation of the current MPDCCH candidate set, wherein the second calculation result is a calculation result of a second part of an equation in the starting position calculation formula, and the first part of the equation and the second part of the equation are operation objects of the remainder operation in the starting position calculation formula;
substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
2. The method of claim 1, wherein the adding the first calculation result of the previous MPDCCH candidate set and the step size corresponding to the current MPDCCH candidate set to obtain the first calculation result of the current MPDCCH candidate set comprises:
acquiring a first calculation result obtained when the initial position of the previous MPDCCH candidate set is calculated;
searching a preset association relation table to obtain a step value corresponding to the current MPDCCH candidate set, wherein the preset association relation table is used for recording the corresponding relation between the MPDCCH candidate set and the step value;
and adding the obtained first calculation result of the previous MPDCCH candidate set and the step value obtained by searching to obtain a first calculation result of the current MPDCCH candidate set.
3. The method of claim 2, wherein the predetermined association table is calculated in advance through all MPDCCH candidate sets.
4. The method of claim 2, wherein the preset association table corresponds to an application scenario one to one, and the searching for the preset association table to obtain the step value corresponding to the current MPDCCH candidate set comprises:
and determining a corresponding preset incidence relation table according to the current application scene, and searching the preset incidence relation table to obtain a step value corresponding to the current MPDCCH candidate set.
5. The method as claimed in claim 2, wherein the preset association table stores only step values with values other than 1 and corresponding MPDCCH candidate sets, and the searching the preset association table to obtain the step value corresponding to the current MPDCCH candidate set includes:
searching whether the preset association relation table contains the current MPDCCH candidate set or not;
if the search result is that the preset association relation table contains the current MPDCCH candidate set, determining a numerical value corresponding to the current MPDCCH candidate set recorded in the preset association relation table as a corresponding step value;
and if the search result indicates that the current MPDCCH candidate set is not contained in the preset association relation table, determining that the step value corresponding to the current MPDCCH candidate set is 1.
6. The method of claim 1, wherein the determining the first number according to the second calculation result of the current MPDCCH candidate set comprises:
and determining a first quantity corresponding to a second calculation result of the current MPDCCH candidate set according to a preset corresponding relation, wherein the preset corresponding relation is used for recording the corresponding relation between the second calculation result and the first quantity.
7. The method of claim 6, wherein the predetermined correspondence is determined in advance through all configurations of the MPDCCH.
8. The method of claim 6, wherein the second calculation result in the predetermined correspondence is selected from a set {1,2,4,8,16} and the first number is selected from a set {0,1,2,3,4 }.
9. The home position determination method according to any one of claims 1 to 8, wherein the home position calculation formula is:
wherein the content of the first and second substances,
is the starting position corresponding to the MPDCCH candidate set m of the aggregation level L', the repetition level R on the subframe k,
the number of MPDCCH candidate sets for aggregation level L' on MPDCCH set p; n'ECCE,p,kIs the number of ECCEs on subframe k, MPDCCH set p; for UE-specific MPDCCH search space, Yp,k＝(Ap·Yp,k-1)modD，Yp,-1＝nRNTI≠0，A0＝39827，A139829, D65537 and
nsis the number of time slots in each radio frame; for MPDCCH common search space, Yp,k＝0；i＝0,...,L'-1；
Is a rounding down operation.
10. The home position determination method of claim 9, wherein the first partial equation is
The second part is calculated as
11. An apparatus for determining a starting position of an MPDCCH search space, comprising:
the adding module is used for adding a first calculation result of a previous MPDCCH candidate set and a step value corresponding to a current MPDCCH candidate set to obtain a first calculation result of the current MPDCCH candidate set, wherein the step value is a deviation degree of the first calculation result when starting positions of the previous MPDCCH candidate set and the next MPDCCH candidate set are calculated by using a starting position calculation formula, and the first calculation result is a calculation result of a first part of calculation formula in the starting position calculation formula;
a determining module, configured to determine a first number according to a second calculation result of the current MPDCCH candidate set, and determine a lowest first number of bits in the first calculation result of the current MPDCCH candidate set as a result of a remainder operation of the current MPDCCH candidate set, where the second calculation result is a calculation result of a second partial equation in the starting position calculation formula, and the first partial equation and the second partial equation are operation objects of the remainder operation in the starting position calculation formula;
and the processing module is used for substituting the complementation operation result of the current MPDCCH candidate set into the starting position calculation formula to obtain the starting position of the current MPDCCH candidate set.
12. A computer-readable storage medium, being a non-volatile storage medium or a non-transitory storage medium, having a computer program stored thereon, the computer program, when being executed by a processor, performing the steps of the method according to any one of claims 1 to 10.
13. An apparatus for determining a starting position of an MPDCCH search space, comprising a memory and a processor, the memory having stored thereon a computer program which is executable on the processor, wherein the processor executes the computer program to perform the steps of the method according to any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271902.9A CN113067670B (en) | 2021-03-12 | 2021-03-12 | Method and device for determining starting position of MPDCCH (Multi-program control channel) search space |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271902.9A CN113067670B (en) | 2021-03-12 | 2021-03-12 | Method and device for determining starting position of MPDCCH (Multi-program control channel) search space |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113067670A true CN113067670A (en) | 2021-07-02 |
| CN113067670B CN113067670B (en) | 2022-05-20 |
Family
ID=76560277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110271902.9A Active CN113067670B (en) | 2021-03-12 | 2021-03-12 | Method and device for determining starting position of MPDCCH (Multi-program control channel) search space |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113067670B (en) |
Citations (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945403A (en) * | 2010-08-06 | 2011-01-12 | 中兴通讯股份有限公司 | Method and device for determining specific search space for user |
| CN102045140A (en) * | 2009-10-10 | 2011-05-04 | 中兴通讯股份有限公司 | Method and terminal for feeding back ACK/NACK (Acknowledgement/Non-acknowledgement) information with uplink sub-frame |
| CN102325378A (en) * | 2011-08-31 | 2012-01-18 | 新邮通信设备有限公司 | Method and device for controlling physical downlink control channel (PDCCH) transmission |
| US20120051270A1 (en) * | 2010-08-24 | 2012-03-01 | Qualcomm Incorporated | Handling ambiguous relay physical downlink control channel (r-pdcch) decoding for a relay node |
| CN103181093A (en) * | 2010-09-28 | 2013-06-26 | 富士通株式会社 | Method, user equipment, base station and system for determining component carrier scheduled in cross-carrier scheduling |
| CN103297195A (en) * | 2013-06-18 | 2013-09-11 | 重庆邮电大学 | Blind test efficiency improvement method for TD-LTE (Time Division Long Term Evolution) system |
| US20130242904A1 (en) * | 2012-03-15 | 2013-09-19 | Futurewei Technologies, Inc. | Systems and Methods for UE-Specific Search Space and ePDCCH Scrambling |
| EP2753016A2 (en) * | 2013-01-03 | 2014-07-09 | Samsung Electronics Co., Ltd | Obtaining control channel elements of physical downlink control channels for cross-carrier scheduling |
| CN103959872A (en) * | 2011-12-28 | 2014-07-30 | 富士通株式会社 | Mapping method and device for search space of downlink control channel |
| US20150029953A1 (en) * | 2013-07-26 | 2015-01-29 | Qualcomm Incorporated | Transmission time interval (tti) bundling for control channels in long term evolution (lte) |
| CN104509009A (en) * | 2012-07-30 | 2015-04-08 | 夏普株式会社 | Base station device, mobile station device, communication method, and integrated circuit |
| US20150215906A1 (en) * | 2012-10-04 | 2015-07-30 | Lg Electronics Inc. | Method and apparatus for transreceiving downlink signal by considering antenna port relationship in wireless communication system |
| US20150237624A1 (en) * | 2012-11-01 | 2015-08-20 | Huawei Technologies Co., Ltd. | Method and apparatus for determining control channel search space |
| CN107432008A (en) * | 2015-04-10 | 2017-12-01 | 诺基亚技术有限公司 | EPDCCH search spaces determine |
| CN107623948A (en) * | 2016-07-15 | 2018-01-23 | 普天信息技术有限公司 | The system of selection of CCE position candidates and device under a kind of PDCCH polymerization grades |
| US20180199313A1 (en) * | 2015-06-19 | 2018-07-12 | Sharp Kabushiki Kaisha | Terminal device, communication method, and integrated circuit |
| US20180242283A1 (en) * | 2015-08-11 | 2018-08-23 | Panasonic Intellectual Property Corporation Of America | Improved blind decoding of (e)pdcch for partial subframes |
| CN108631995A (en) * | 2017-03-24 | 2018-10-09 | 中兴通讯股份有限公司 | The determination method, apparatus and computer storage media of control channel search space |
| US10327213B1 (en) * | 2015-10-01 | 2019-06-18 | Origin Wireless, Inc. | Time-reversal communication systems |
| CN110492972A (en) * | 2018-05-14 | 2019-11-22 | 北京松果电子有限公司 | Blind examination control method, device, base station, user equipment and storage medium |
| CN111294150A (en) * | 2019-07-05 | 2020-06-16 | 北京展讯高科通信技术有限公司 | Physical downlink control channel blind detection method, user equipment and readable storage medium |
-
2021
- 2021-03-12 CN CN202110271902.9A patent/CN113067670B/en active Active
Patent Citations (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045140A (en) * | 2009-10-10 | 2011-05-04 | 中兴通讯股份有限公司 | Method and terminal for feeding back ACK/NACK (Acknowledgement/Non-acknowledgement) information with uplink sub-frame |
| CN101945403A (en) * | 2010-08-06 | 2011-01-12 | 中兴通讯股份有限公司 | Method and device for determining specific search space for user |
| US20120051270A1 (en) * | 2010-08-24 | 2012-03-01 | Qualcomm Incorporated | Handling ambiguous relay physical downlink control channel (r-pdcch) decoding for a relay node |
| CN103181093A (en) * | 2010-09-28 | 2013-06-26 | 富士通株式会社 | Method, user equipment, base station and system for determining component carrier scheduled in cross-carrier scheduling |
| CN102325378A (en) * | 2011-08-31 | 2012-01-18 | 新邮通信设备有限公司 | Method and device for controlling physical downlink control channel (PDCCH) transmission |
| CN103959872A (en) * | 2011-12-28 | 2014-07-30 | 富士通株式会社 | Mapping method and device for search space of downlink control channel |
| US20130242904A1 (en) * | 2012-03-15 | 2013-09-19 | Futurewei Technologies, Inc. | Systems and Methods for UE-Specific Search Space and ePDCCH Scrambling |
| CN104509009A (en) * | 2012-07-30 | 2015-04-08 | 夏普株式会社 | Base station device, mobile station device, communication method, and integrated circuit |
| US20150215906A1 (en) * | 2012-10-04 | 2015-07-30 | Lg Electronics Inc. | Method and apparatus for transreceiving downlink signal by considering antenna port relationship in wireless communication system |
| US20150237624A1 (en) * | 2012-11-01 | 2015-08-20 | Huawei Technologies Co., Ltd. | Method and apparatus for determining control channel search space |
| EP2753016A2 (en) * | 2013-01-03 | 2014-07-09 | Samsung Electronics Co., Ltd | Obtaining control channel elements of physical downlink control channels for cross-carrier scheduling |
| CN103297195A (en) * | 2013-06-18 | 2013-09-11 | 重庆邮电大学 | Blind test efficiency improvement method for TD-LTE (Time Division Long Term Evolution) system |
| US20150029953A1 (en) * | 2013-07-26 | 2015-01-29 | Qualcomm Incorporated | Transmission time interval (tti) bundling for control channels in long term evolution (lte) |
| CN107432008A (en) * | 2015-04-10 | 2017-12-01 | 诺基亚技术有限公司 | EPDCCH search spaces determine |
| US20180199313A1 (en) * | 2015-06-19 | 2018-07-12 | Sharp Kabushiki Kaisha | Terminal device, communication method, and integrated circuit |
| US20180242283A1 (en) * | 2015-08-11 | 2018-08-23 | Panasonic Intellectual Property Corporation Of America | Improved blind decoding of (e)pdcch for partial subframes |
| US10327213B1 (en) * | 2015-10-01 | 2019-06-18 | Origin Wireless, Inc. | Time-reversal communication systems |
| CN107623948A (en) * | 2016-07-15 | 2018-01-23 | 普天信息技术有限公司 | The system of selection of CCE position candidates and device under a kind of PDCCH polymerization grades |
| CN108631995A (en) * | 2017-03-24 | 2018-10-09 | 中兴通讯股份有限公司 | The determination method, apparatus and computer storage media of control channel search space |
| CN110492972A (en) * | 2018-05-14 | 2019-11-22 | 北京松果电子有限公司 | Blind examination control method, device, base station, user equipment and storage medium |
| CN111294150A (en) * | 2019-07-05 | 2020-06-16 | 北京展讯高科通信技术有限公司 | Physical downlink control channel blind detection method, user equipment and readable storage medium |
Non-Patent Citations (5)
| Title |
|---|
| FUJITSU: "R1-124129 "Search space configuration for localized ePDCCH"", 《3GPP TSG_RAN\WG1_RL1》 * |
| HUAWEI: "R2-1804016 "Updated text proposal on discussion [NR-AH1801#21][NR] 38.331 ASN.1 review part 3 –L2 params (Huawei)"", 《3GPP TSG_RAN\WG2_RL2》 * |
| SAMSUNG: "R1-1713613 " Search Space Design"", 《3GPP TSG_RAN\WG1_RL1》 * |
| VOLKER BRAUN等: ""5G NR Physical Downlink Control Channel: Design, Performance and Enhancements"", 《2019 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)》 * |
| 周游等: ""低复杂度PDCCH盲检测算法"", 《计算机应用研究》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113067670B (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109495234B (en) | Method and device for detecting physical downlink control channel | |
| CN109660315B (en) | PDCCH blind detection method and device based on DMRS, storage medium and user equipment | |
| US20180192409A1 (en) | Frequency spectrum resource allocation method and apparatus | |
| JP2021536179A (en) | Information determination method and device as well as storage medium | |
| JP2022111164A (en) | Method and apparatus for transmission of measurement reference signal | |
| WO2019114710A1 (en) | Reference signal transmission method and device | |
| CN114696962A (en) | Blind detection method, device, equipment and medium based on unknown RNTI | |
| CN113840327B (en) | LTE control channel resource mapping method and device | |
| CN109819475B (en) | Method and device for determining search space resources | |
| CN113067670B (en) | Method and device for determining starting position of MPDCCH (Multi-program control channel) search space | |
| CN114025382B (en) | Method and device for processing number of physical resource blocks in new air interface system | |
| JP7182642B2 (en) | Resource location determination method, terminal device and network device | |
| RU2742297C1 (en) | Method of indicating time intervals, terminal, network device and computer data medium | |
| EP3240327B1 (en) | Resource allocation method and device and information feedback method and device | |
| KR20200035150A (en) | Resource positioning method and apparatus, and resource determination method and apparatus | |
| US20220039069A1 (en) | Data sending and receiving method, device, system, terminal, base station, and storage medium | |
| CN102957494B (en) | Method for blind test calibration and related devices | |
| CN106664695A (en) | Method and device for configuring downlink demodulation reference signal (dmrs) port | |
| CN112219356B (en) | Data frame transmission method and device based on power line channel | |
| CN114071472A (en) | Resource allocation method and device, and communication equipment | |
| EP3416342B1 (en) | Pilot frequency sequence sending method and apparatus | |
| CN113347712B (en) | Frequency hopping method and device for uplink channel, storage medium and terminal | |
| CN108668300B (en) | Method and device for processing channel state information reference signal | |
| CN114900899B (en) | PDCCH resource allocation method, PDCCH resource allocation device, electronic equipment and storage medium | |
| CN115134046B (en) | Filtering method, device, equipment and medium for PDCCH blind detection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |