CN102469048B - Method and system for determining a downlink control channel search space - Google Patents
Method and system for determining a downlink control channel search space Download PDFInfo
- Publication number
- CN102469048B CN102469048B CN201010551388.6A CN201010551388A CN102469048B CN 102469048 B CN102469048 B CN 102469048B CN 201010551388 A CN201010551388 A CN 201010551388A CN 102469048 B CN102469048 B CN 102469048B
- Authority
- CN
- China
- Prior art keywords
- offset
- base station
- offset value
- aggregation level
- pdcch
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
- H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/042—Public Land Mobile systems, e.g. cellular systems
- H04W84/047—Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and system for determining a relay physical downlink control channel search space, which includes a base station respectively setting an offset for an initial location of a search space corresponding to an aggregation level L. RN determining the search space corresponding to each aggregation level L according to the set offset when blind-detecting an R-PDCCH. By means of the invention in a communication system, which offers a method that how could a relay node search the downlink control channel which belongs to own. The invention is applicable to the relay node, so as to ensure that the relay node has a lower degree of complexity when blind-detecting a relay physical downlink control channel, and covers reserved RB as many as possible, thereby improving the efficiency of the whole system.
Description
Technical field
The present invention relates to relay mobile communication system blind Detecting technology, espespecially one determines the method and system of down control channel (R-PDCCH) search volume (SS).
Background technology
Because future wireless system or cellular system require to increase coverage, support higher rate transmission, this proposes new challenge to wireless communication technology.Meanwhile, the cost issues of system building and maintenance is more outstanding.Along with the increase of transmission rate and communication distance, the energy consumption issues of battery also becomes outstanding, and the radio communication in future will adopt higher frequency, and the pathloss attenuation caused thus will be more serious.In order to increase the coverage of high data rate, group mobility, casual network deployment, improve the throughput of cell edge, and provide service for the user in the covering leak of cellular system, introduce relaying (Relay) technology in wireless communication system, therefore relaying technique is regarded as a key technology of forth generation (4G) radio communication.
Long Term Evolution (LTE, Long Term Evolution) system, senior Long Term Evolution (LTE-A, LTE-Advanced) system and IMT-Advanced (IMT-Advanced, International MobileTelecommunication Advanced) system is all with based on OFDM (OFDM, OrthogonalFrequency Division Multiplexing) technology.
Ofdm system is the data mode of time-frequency two-dimensional.1 subframe (subframe) is made up of 2 time slots (slot), and time normal cyclic prefix (CP, Cyclic Prefix), each slot is made up of 7 OFDM symbol; During expansion CP, each slot is made up of 6 OFDM symbol.Wherein, down control channel (PDCCH, Physical Downlink Control Channel) is positioned in front 1 or 2 or 3 or 4 OFDM symbol of each subframe.
In LTE system, PDCCH is made up of several different part, and each part has its specific function.For convenience of description, the following describes several term and agreement:
1, Resource Unit (RE, Resource Element): minimum time/frequency source block, occupies 1 subcarrier in 1 OFDM symbol.
2, resource unit group (REG, Resource Element Group): according to the difference of reference symbol position in each OFDM symbol, 1 REG can be made up of 4 or 6 RE.
3, control information unit (CCE, Control Channel Element): by 36 RE, 9 REG compositions.The information comprised in CCE has: the descending scheduling authorization message (DL grant) of user and uplink scheduling authorization information (UL grant), and and system message (SI, System Information), Stochastic accessing (RA, Random Access) response, information that paging (Paging) is relevant.
4, Physical Resource Block (PRB, Physical Resource Block): time-domain is continuous 1 time slot frequency domain is continuous 12 subcarriers.
5, Physical Resource Block is to (PRB pair): time-domain is continuous 1 subframe, frequency domain is continuous 12 subcarriers.
6, polymerization grade (Aggregation level L) represents the combining form of CCE, namely PDCCH can only be made up of L CCE, wherein L ∈ { 1, 2, 4, 8}, that is, PDCCH can only by the combination of 1 CCE (representing with 1-CCE), the combination (representing with 2-CCE) of 2 CCE, the combination (representing with 4-CCE) of 4 CCE and the combination (representing with 8-CCE) of 8 CCE are formed, and above-mentioned 4 kinds of different combinations corresponding 4 kinds of different code rates respectively, namely the code rate of 1-CCE is 2/3, the code rate of 2-CCE is 1/3, the code rate of 4-CCE is 1/6, the code rate of 8-CCE is 1/12.
7, search volume (SS, Search Space): be made up of some groups of candidate control channels, UE monitors search volume, and carries out blind Detecting in search volume, to detect the down control channel relevant to oneself.
8, there are two types search volume: one is public search space (UE-common Search Space), i.e. the search volume that all will monitor of all UE, public search space carrying be and SI, RA responds and Paging is correlated with public information; Another kind is the special search volume (UE-specific SearchSpace) of UE, and what wherein carry is UE up-downgoing scheduling authorization information separately.
9, different CCE aggregation level has the number of its corresponding candidate control channel (PDCCHcandidate), is the maximum times of blind Detecting.Such as, under UE-specific Search Space: the candidate control channel of 1-CCE is 6, the number of times namely carrying out blind Detecting by 1 CCE mono-group is no more than 6 times; The PDCCH candidate number of 2-CCE is 6, and the number of times namely carrying out blind Detecting by 2 CCE mono-group is no more than 6 times; The PDCCH candidate number of 4-CCE is 2, and the number of times namely carrying out blind Detecting by 4 CCE mono-group is no more than 2 times; The PDCCH candidate number of 8-CCE is 2, and the number of times namely carrying out blind Detecting by 8 CCE mono-group is no more than 2 times.Under UE-common Search Space, the PDCCH candidate number of 4-CCE is 4, and the number of times namely carrying out blind Detecting by 4 CCE mono-group is no more than 4 times; The PDCCH candidate number of 8-CCE is 2, and the number of times namely carrying out blind Detecting by 8 CCE mono-group is no more than 2 times.
Fig. 1 is the Organization Chart of the mobile communication system of existing introducing RN, as shown in Figure 1, link between this base stations in mobile communication system (eNB) and RN is called repeated link (BL, Backhaul Link, also referred to as Un Link), user terminal (UE under RN and its coverage, User Equipment) between link be called access link (AL, Access Link, also referred to as Uu Link), link between UE under eNB and its coverage is referred to as the link (DL, Direct Link) that direct transfers.Concerning eNB, RN is just equivalent to a UE; Concerning UE, RN is just equivalent to eNB.
At present, when adopting relaying (inband relay) mode in band, namely Un Link and Uu Link uses identical frequency band, and in order to avoid the transmitting-receiving of RN self is disturbed, RN can not carry out the operation sending and receive in same frequency resource simultaneously.Fig. 2 is the frame structure schematic diagram of existing backhaul subframe, when RN sends Downlink Control Information to its subordinate UE, is can not receive the Downlink Control Information from eNB.Therefore, when downlink transfer, RN sends Downlink Control Information first in front 1 or 2 OFDM symbol the UE of its subordinate, then within a period of time, (as illustrated in the drawing interval gap) carries out the switching from being transmitted into reception, after having switched, OFDM symbol below receives the data from eNB, comprising down control channel (R-PDCCH, Relay Physical Downlink Control Channel) and Physical Downlink Shared Channel (R-PDSCH, Relay Physical Downlink Shared Channel), as shown in Figure 2, namely eNB is be carried on Physical Resource Block (PRB to the down control channel that RN sends, PhysicalResource Block) on.
In descending backhaul subframe, eNB semi-statically configures the transmission of one group of Resource Block (RB) for R-PDCCH by high level, comprising the information such as descending scheduling mandate (DL grant) and uplink scheduling authorization (UL grant) of RN.Fig. 3 is the position relationship schematic diagram of existing R-PDCCH and PDCCH, as shown in Figure 3, under normal CP, the PDCCH of UE before the 1st time slot, n (n≤3) individual OFDM symbol is transmitted, DL grant is only the 4th OFDM symbol in the original position of the 1st time slot, end position be the 7th OFDM symbol totally 4 OFDM symbol on transmit; UL grant only transmits in all available OFDM symbol of the 2nd time slot.
At present, how to determine R-PDCCH search volume, a hot issue in discussions in 3 gpp, the method of the existing R-PDCCH of determination search volume is roughly: DL grant and UL grant has independently R-PDCCH Search space, and the original position of the search volume that different aggregation level L is corresponding is all identical, be one group of Resource Block of semi-static distribution to the RB pair of the 1st in (RB pair).But, according to current design, if the original position of the search volume of all aggregation level is all from the 1st RB, probably there is the situation not covering all semi-static reserved RB pair, thus result in the reduction of blind detection efficiency.Based on this, the method for designing of a kind of R-PDCCH search volume that the present invention proposes can address this problem well.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method and system determining relay physical downlink control channel search space, can ensure in blind Detecting, cover all semi-static reserved RB pair as far as possible, thus improves blind detection efficiency.
For achieving the above object, technical scheme of the present invention is achieved in that
Determine a method of down control channel R-PDCCH search volume SS, comprise the following steps:
The original position of the search volume corresponding to polymerization grade aggregation level L that base station is often kind of control information unit arranges side-play amount respectively;
Via node RN, when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.
Before described RN blind Detecting R-PDCCH, the method also comprises:
Described RN judges whether that the offset value needing basis to set determines the search volume corresponding to often kind of aggregation level L, if so, continues to perform the step arranging side-play amount, or determines the step of search volume; Otherwise process ends, determines the search volume corresponding to described often kind of aggregation level L according to existing method.
The method also comprises: instruction RN in described base station, the need of when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.
The method also comprises: described base station utilizes high-level signaling that the described offset value set is informed RN.
The described side-play amount that arranges comprises:
Described base station is that the different RN that it covers arrange the special offset value of RN; Or all RN covered for it arrange unified identical offset value; Or the RN covered divides into groups, for each group arranges the identical offset value of respective unification respectively.
The described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, arrange side-play amount respectively, and the offset value corresponding to all aggregation level L is all identical.
The described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, arrange side-play amount respectively, and the offset value corresponding to different aggregation level L is all not identical.
The described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, side-play amount is set respectively, wherein, one or more offset values corresponding to aggregation level L are identical, and the offset value corresponding to remaining aggregationlevel L is different.
To make an appointment between described base station and RN the offset value of described setting.
The described side-play amount that arranges comprises:
Described aggregation level L and offset value are bound, and described base station and RN agreement: during L=1, offset=a; During L=2, offset=b; During L=4, offset=c; During L=8, offset=d, wherein, the value of a, b, c, d is positive integer.
The described side-play amount that arranges comprises:
By the value N of candidate R-PDCCH number
r-PDCCH candidatebind with described aggregation level L and side-play amount, and described base station and RN agreement:
Work as L=1, N
r-PDCCH candidatewhen=6, offset=a1; Work as L=1, N
r-PDCCH candidatewhen=8, offset=a2; Work as L=1, N
r-PDCCH candidatewhen=12, offset=a3; Work as L=1, N
r-PDCCH candidatewhen=16, offset=a4;
Work as L=2, N
r-PDCCH candidatewhen=4, offset=b1; Work as L=2, N
r-PDCCH candidatewhen=6, offset=b2; Work as L=2, N
r-PDCCH candidatewhen=8, offset=b3;
Work as L=4, N
r-PDCCH candidatewhen=2, offset=c1; Work as L=4, N
r-PDCCH candidatewhen=3, offset=c2; Work as L=4, N
r-PDCCH candidatewhen=4, offset=c3;
Work as L=8, N
r-PDCCH candidatewhen=1, offset=d1; Work as L=8, N
rP-DCCH candidatewhen=2, offset=d2;
Wherein, the value of a1 ~ a3, b1 ~ b3, c1 ~ c3, d1 ~ d3 is positive integer;
N
r-PDCCH candidate× L≤N
rB, N
rBrepresent the RB sum for carrying R-PDCCH.
Determine a system for relay physical downlink control channel search space, at least comprise base station and RN, wherein,
Base station, the original position for the search volume corresponding to often kind of aggregation level L arranges side-play amount respectively.
RN, for when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.
Described base station, also for utilizing high-level signaling that the offset value set is informed RN; Or,
Described base station, also for arranging offset value by making an appointment between RN.
Described base station, also for determining the instruction of the search volume corresponding to often kind of aggregation level L to the RN transmission offset value whether basis sets; Correspondingly,
Described RN, also for according to the instruction from base station, determines whether that the offset value needing basis to set determines the search volume corresponding to often kind of aggregation level L.
As can be seen from the technical scheme that the invention described above provides, the original position comprising the search volume of base station corresponding to often kind of aggregation levelL arranges side-play amount (offset) respectively, RN, when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.By the inventive method in the communication system introducing relaying technique, provide a kind of method how via node searches for the down control channel belonging to self.Be applicable to via node well, ensure that via node has lower complexity when blind Detecting down control channel, and covered all RB be reserved as much as possible, thus improve whole system efficiency.
Accompanying drawing explanation
Fig. 1 is the Organization Chart of the mobile communication system of existing introducing RN;
Fig. 2 is the frame structure schematic diagram of existing backhaul subframe;
Fig. 3 is the position relationship schematic diagram of existing R-PDCCH and PDCCH;
Fig. 4 is the flow chart of the method for determination relay physical downlink control channel search space of the present invention;
Fig. 5 is the composition structural representation of the system of determination relay physical downlink control channel search space of the present invention;
Fig. 6 is the schematic diagram of the first embodiment of the method for determination relay physical downlink control channel search space of the present invention;
Fig. 7 is the schematic diagram of the 3rd embodiment of the method for determination relay physical downlink control channel search space of the present invention;
Fig. 8 is the schematic diagram of the 4th embodiment of the method for determination relay physical downlink control channel search space of the present invention;
Fig. 9 is the schematic diagram of the 5th embodiment of the method for determination relay physical downlink control channel search space of the present invention.
Embodiment
Fig. 4 is the flow chart of the method for determination relay physical downlink control channel search space of the present invention, as shown in Figure 4, comprises the following steps:
Step 400: the original position of the search volume of base station corresponding to often kind of aggregation level L arranges side-play amount (offset) respectively.Wherein, the original position of the search volume corresponding to aggregation level L the 1st the RB pair that to be base station be in one group of RB pair of the semi-static distribution of RN.
Further, base station can utilize high-level signaling that the offset value set is informed RN; Or, make an appointment between base station and RN and offset value be set.Wherein,
When base station utilizes high-level signaling that the offset value set is informed RN, the different RN that base station can cover for it arrange special (RN-specific) offset value of RN; All RN that also can cover for it arrange unified offset value (identical offset value); RN can also be divided into groups, for each group arranges respective unified offset value (identical offset value) respectively.Particularly,
The method that side-play amount is set for: the original position of the search volume corresponding to often kind of aggregation level L of 1 RN of certain under base station coverage or certain several RN or all RN arranges a side-play amount respectively, and the offset value corresponding to all aggregation level L is all identical.Or,
The method that side-play amount is set for: the original position of the search volume corresponding to often kind of aggregation level L of 1 RN of certain under base station coverage or certain several RN or all RN arranges a side-play amount respectively, and the offset value corresponding to different aggregation level L is all not identical.Or,
The method that side-play amount is set for: the original position of the search volume corresponding to often kind of aggregation level L of 1 RN of certain under base station coverage or certain several RN or all RN arranges a side-play amount respectively, wherein, some offset value corresponding to aggregation level L is identical, and some offset value corresponding to aggregation levelL is different.It should be noted that, according to combined factors such as the sums of the channel conditions between self with each RN of its subordinate and semi-static one group of reserved RB pair, base station can determine that the offset value corresponding to which aggregation level L is identical, which offset value corresponding to aggregation level L is different.The concrete implementation method how to determine easily realizes for those skilled in the art, and relatively more flexible, the protection range be not intended to limit the present invention here.
When the offset value of described setting of making an appointment between base station and RN,
The method arranging side-play amount is: aggregation level L and offset value bound, and base station and RN appoint, during L=1, and offset=a; During L=2, offset=b; During L=4, offset=c; During L=8, offset=d, wherein the value of a, b, c, d is positive integer.Or,
The method arranging side-play amount is: by the value N of candidate R-PDCCH (R-PDCCH candidate) number
r-PDCCH candidatebind with aggregation level L and offset, and base station and RN appoint, as shown in table 1.Particularly:
Work as L=1, N
r-PDCCH candidatewhen=6, offset=a1; Work as L=1, N
r-PDCCH candidatewhen=8, offset=a2; Work as L=1, N
r-PDCCH candidatewhen=12, offset=a3; Work as L=1, N
r-PDCCH candidatewhen=16, offset=a4;
Work as L=2, N
r-PDCCH candidatewhen=4, offset=b1; Work as L=2, N
r-PDCCH candidatewhen=6, offset=b2; Work as L=2, N
r-PDCCH candidatewhen=8, offset=b3;
Work as L=4, N
r-PDCCH candidatewhen=2, offset=c1; Work as L=4, N
r-PDCCH candidatewhen=3, offset=c2; Work as L=4, N
r-PDCCH candidatewhen=4, offset=c3;
Work as L=8, N
r-PDCCH candidatewhen=1, offset=d1; Work as L=8, N
r-PDCCH candidatewhen=2, offset=d2.
Wherein, the value of a1 ~ a3, b1 ~ b3, c1 ~ c3, d1 ~ d3 is positive integer.
Table 1
In table 1, "×" symbol represents does not have this configuration, and namely during L=1, R-PDCCH candidate can not get 1,2,3 and 4; Other is so analogized.
In table 1, the value N of R-PDCCH candidate number
r-PDCCH candidatebe subject to the RB sum N for carrying R-PDCCH that base station is the semi-static configuration of RN
rBconstraint, i.e. demand fulfillment N
r-PDCCH candidate× L≤N
rB.That is, if base station is the RB sum N for carrying R-PDCCH of the semi-static configuration of RN
rB=10, so as L=1, R-PDCCH candidate can only get 6 and 8; As L=2, R-PDCCH candidate can only get 4; As L=4, R-PDCCH candidate can only get 2; As L=8, R-PDCCH candidate can only get 1.
Step 401:RN, when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.
Before step 400 or simultaneously, or after step 400, before step 401, the inventive method also comprises: RN judges whether that needs determine the search volume corresponding to often kind of aggregation level L according to the offset value set, and if so, continues to perform step 400 or step 401; Otherwise, terminate flow process of the present invention, determine the search volume corresponding to often kind of aggregation level L according to existing method.Particularly:
Base station can utilize high-level signaling or the alternate manner of 1 extra bit, instruction RN is the need of when blind Detecting R-PDCCH, the search volume corresponding to often kind of aggregation level L is determined, herein referred to as the need of carrying out offset operation according to the offset value set.Such as: base station, to RN instruction 0, represents that RN is without the need to carrying out offset operation; Base station, to RN instruction 1, represents that RN needs to carry out offset operation.Before step 400 or simultaneously, or after step 400, before step 401, the inventive method also comprises: RN acquiescence needs to carry out offset operation all the time.
The method also comprises: use the offset value set, determine the search volume of DL grant and the search volume of UL grant.
Corresponding the inventive method also provides a kind of system determining relay physical downlink control channel search space, at least comprises base station and RN, wherein,
Base station, the original position for the search volume corresponding to often kind of aggregation level L arranges side-play amount (offset) respectively.
RN, for when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set.
Wherein, base station is also for utilizing high-level signaling that the offset value set is informed RN; Or and make an appointment between RN to arrange offset value.
Base station, also for determining the instruction of the search volume corresponding to often kind of aggregationlevel L to the RN transmission offset value whether basis sets; Correspondingly, RN, also for according to the instruction from base station, determines whether that the offset value needing basis to set determines the search volume corresponding to often kind of aggregation level L.
Below in conjunction with several embodiment, the inventive method is described in detail.
Fig. 6 is the schematic diagram of the first embodiment of the method for determination relay physical downlink control channel search space of the present invention, in first embodiment, suppose that base station utilizes high-level signaling to be that all RN under it covers notify the offset value that sets, wherein, the offset value corresponding to different aggregation level L is identical; Suppose base station be its cover lower all RN semi-static be configured with 10 RB pair, for carrying R-PDCCH (comprising DL grant and UL grant), numbering and being respectively RB0, RB1 ..., RB9.Wherein, DL grant is carried on the 1st time slot of above-mentioned 10 RB pair, and UL grant is carried on the 2nd time slot of above-mentioned 10 RB pair.Above-mentioned 10 RB pair are logically continuous print, but can be physically continuous print, also can be discrete.
This base station is that original position that it covers the search volume corresponding to often kind of aggregation level L of lower all RN all arranges an identical offset value, and utilize high-level signaling semi-static notify that it covers all RN down.As shown in Figure 6, in the first embodiment, L={1, the original position of the search volume corresponding to 2,4,8} all offsets 1 RB relative to the 1st RB.
Under this base station coverage, all RN determine that in blind check process the process of search volume is as follows:
Detect from L=1, now offset value is k=1, and namely RN is from the 2nd RB of L=1 group RB, detects according to 1 RB mono-group, corresponding R-PDCCH candidate control channel is 6, and namely detect 6 times altogether, search volume is now: { RB1, RB2, RB3, RB4, RB5, RB6};
If RN does not detect the R-PDCCH matched with himself RN ID, then continue to detect from L=2, now offset value is k=1, namely RN is from the 2nd RB of L=2 group RB, detects according to 2 RB mono-group, and corresponding R-PDCCH candidate control channel is 4, namely detect 4 times altogether, search volume is now: { { RB1, RB2}, { RB3, RB4}, { RB5, RB6}, { RB7, RB8}};
If RN does not still detect and the R-PDCCH that himself RN ID matches, then continue to detect from L=4, now offset value is k=1, namely RN is from the 2nd RB of L=4 group RB, detects according to 4 RB mono-group, and corresponding R-PDCCH candidate control channel is 2, namely detect 2 times altogether, search volume is now: { { RB1, RB2, RB3, RB4}, { RB5, RB6, RB7, RB8}};
If RN does not detect the DL grant matched with himself RN ID yet, then continue to detect from L=8, now offset value is k=1, namely RN is from the 1st RB of L=8 group RB, detects according to 8 RB mono-group, and corresponding R-PDCCH candidate control channel is 1, namely detect 1 time altogether, search volume is now: { RB1, RB2, RB3, RB4, RB5, RB6, RB7, RB8}.
In the testing process of any one RB combining form in a first embodiment, if when detecting corresponding R-PDCCH (comprising DL grant or UL grant), then RN stops detecting.
In first embodiment, if base station is it cover under each RN special (RN-specific) offset value of RN is set respectively, and offset value corresponding to different aggregation level L is identical.For example, such as:
Base station utilizes the offset value of high-level signaling notice RN1 to be 1, then RN1 is when blind Detecting, and the original position of different aggregation level L offset by 1 RB relative to the 1st RB, i.e. blind check from the 2nd RB; Base station utilizes the offset value of high-level signaling notice RN2 to be 2, and namely RN2 is when blind Detecting, and the original position of different aggregation level L offset by 2 RB relative to the 1st RB, i.e. blind check from the 3rd RB; The rest may be inferred, no longer repeats here.
Or, if base station is it cover under RN group offset value is set respectively, and offset value corresponding to different aggregationlevel L is identical.For example, such as:
Base station utilizes the offset value of high-level signaling notice RN1, RN2 and RN3 to be 2, and namely RN1, RN2 and RN3 are when blind Detecting, and the original position of different aggregation level L offset by 2 RB relative to the 1st RB, i.e. blind check from the 3rd RB; Base station utilizes the offset value of high-level signaling notice RN4 and RN5 to be 4, and namely RN4 and RN5 is when blind Detecting, and the original position of different aggregation level L offset by 4 RB relative to the 1st RB, i.e. blind check from the 5th RB; The rest may be inferred, no longer repeats here.
Fig. 7 is the schematic diagram of the 3rd embodiment of the method for determination relay physical downlink control channel search space of the present invention, in 3rd embodiment, suppose that base station notifies the offset value set by high-level signaling, wherein, the offset value corresponding to different aggregation level L is all not identical.Suppose that base station is that RN is semi-static in advance and is configured with 10 RB pair, for carrying R-PDCCH (comprising DL grant and UL grant), numbering is respectively RB0, RB 1 ..., RB9.Wherein, DL grant is carried on the 1st time slot of described 10 RB pair, and UL grant is carried on the 2nd time slot of described 10 RB pair, and they adopt identical offset value.Above-mentioned 10 RB are logically continuous print, but it also can be discrete for can being physically continuous print.
The original position of the search volume of this base station corresponding to often kind of aggregation level L of all RN under its covering configures different offset values respectively relative to the 1st RB, and the notice RN utilizing high-level signaling semi-static.As shown in Figure 7, in the 3rd embodiment, L={1, the original position of the search volume corresponding to 2,4,8} offsets 4 RB, 0 RB, 1 RB and 2 RB respectively relative to the 1st RB.
Under this base station coverage, all RN determine that in blind check process the process of search volume is as follows:
Detect from L=1, now offset value is k=4, and namely RN is from the 5th RB of L=1 group RB, detects according to 1 RB mono-group, corresponding R-PDCCH candidate control channel is 6, and namely detect 6 times altogether, search volume is now: { RB4, RB5, RB6, RB7, RB8, RB9};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID, then continue to detect from L=2, now offset value is k=0, namely RN detects by 2 RB mono-group from the 1st RB of L=2 group RB, and corresponding R-PDCCH candidate control channel is 4, namely detects 4 times altogether, search volume is now: { { RB0, RB1}, { RB2, RB3}, { RB4, RB5}, { RB6, RB7}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=4, now offset value is k=1, namely RN is from the 2nd RB of L=4 group RB, detects according to 4 RB mono-group, and corresponding R-PDCCH candidate control channel is 2, namely detect 2 times altogether, search volume is now: { { RB1, RB2, RB3, RB4}, { RB5, RB6, RB7, RB8}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=8, now offset value is k=2, namely RN is from the 3rd RB of L=8 group RB, detects according to 8 RB mono-group, and corresponding R-PDCCH candidate control channel is 1, namely detect 1 time altogether, search volume size is now: { RB2, RB3, RB4, RB5, RB6, RB7, RB8, RB9}.
In the testing process of any one RB combining form in the third embodiment, if when detecting corresponding R-PDCCH (comprising DL grant or UL grant), then RN stops detecting.
In 3rd embodiment, if base station is it cover under each RN the offest value of RN-specific is set respectively, and offset value corresponding to different aggregation level L is all not identical.For example, such as:
Base station utilizes high-level signaling to notify RN1, L={1, and the original position of the search volume corresponding to 2,4,8} offsets 4,0,1 and 2 RB respectively relative to the 1st RB.RN1, when blind Detecting, detects according to the offset value of base station instruction; Base station utilizes high-level signaling to notify RN2, L={1, and the original position of the search volume corresponding to 2,4,8} offsets 2,0,3 and 1 RB respectively relative to the 1st RB.During RN2 blind Detecting, detect according to the offset value of base station instruction; The rest may be inferred, no longer repeats here.
Or, if base station is it cover under RN group offset value is set respectively, and offset value corresponding to different aggregationlevel L is all not identical.For example, such as:
Base station utilizes high-level signaling to notify RN1, RN2 and RN3, and L={1, the original position of the search volume corresponding to 2,4,8} offsets 4 RB, 0 RB, 1 RB and 2 RB respectively relative to the 1st RB.RN1, RN2 and RN3, when blind Detecting, detect according to the offset value of base station instruction; Base station utilizes high-level signaling to notify RN4 and RN5, L={1, and the original position of the search volume corresponding to 2,4,8} offsets 2 RB respectively relative to the 1st RB, 0 RB, 3 RB and 1 RB.RN4 and RN5, when blind Detecting, detects according to the offset value of base station instruction; The rest may be inferred, no longer repeats here.
Fig. 8 is the schematic diagram of the 4th embodiment of the method for determination relay physical downlink control channel search space of the present invention, in 4th embodiment, suppose that base station notifies described offset value by high-level signaling, the offset value that some aggregation levelL is corresponding is identical, and some offset value corresponding to aggregation level L is different.Suppose that base station is that RN is semi-static in advance and is configured with 16 RB pair, for carrying R-PDCCH (comprising DLgrant and UL grant), numbering is respectively RB0, RB1 ..., RB 15.Wherein, DL grant is carried on the 1st time slot of above-mentioned 16 RB pair, UL grant is carried on the 2nd time slot of above-mentioned 16 RB pair, and the offset value that some aggregation level L configures is identical, the offset value that some aggregationlevel L configures is different.Above-mentioned 16 RB are logically continuous print, but can be physically continuous print, also can be discrete.
The original position of the search volume of this base station corresponding to often kind of aggregation level L of certain 1 RN under its covering configures identical or different offset value respectively relative to the 1st RB, and the notice RN utilizing high-level signaling semi-static.As shown in Figure 8, in the 4th embodiment, L={1, the original position of the search volume corresponding to 2,4,8} offsets 2 RB respectively relative to the 1st RB, 4 RB, 0 RB and 0 RB.
Under this base station coverage, all RN determine that in blind check process the process of search volume is as follows:
Detect from L=1, now offset value is k=2, and namely RN is from the 3rd RB of L=1 group RB, detect according to 1 RB mono-group, corresponding R-PDCCH candidate control channel is 12, namely detects 12 times altogether, search volume is now: { RB2, RB3, RB4, RB5, RB6, RB7, RB8, RB9, RB10, RB11, RB12, RB13};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID, then continue to detect from L=2, now offset value is k=4, and namely RN is from the 5th RB of L=2 group RB, detects according to 2 RB mono-group, corresponding R-PDCCH candidate control channel is 6, namely detect 6 times altogether, search volume is now: { { RB4, RB5}, { RB6, RB7}, { RB8, RB9}, { RB 10, RB 11}, { RB 12, RB 13}, { RB 14, RB 15}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=4, now offset value is k=0, namely RN is from the 1st RB of L=4 group RB, detects according to 4 RB mono-group, and corresponding R-PDCCH candidate control channel is 4, namely detect 4 times altogether, search volume is now: { { RB0, RB1, RB2, RB3}, { RB4, RB5, RB6, RB7}, { RB8, RB9, RB10, RB11}, { RB12, RB13, RB14, RB15}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=8, now offset value is k=0, namely RN is from the 1st RB of L=8 group RB, detects according to 8 RB mono-group, and corresponding R-PDCCH candidate control channel is 2, namely detect 2 times altogether, search volume size is now: { { RB0, RB1, RB2, RB3, RB4, RB5, RB6, RB7}, { RB8, RB9, RB10, RB11, RB12, RB13, RB14, RB15}}.
In the testing process of any one RB combining form in the fourth embodiment, when detecting corresponding R-PDCCH (comprising DL grant or UL grant), then RN stops detecting.
Fig. 9 is the schematic diagram of the 5th embodiment of the method for determination relay physical downlink control channel search space of the present invention, in 5th embodiment, suppose aggregation level L and offset value to bind, base station is without using the semi-static notice offset value of high-level signaling.Supposing that base station is that RN is semi-static in advance and is configured with 12 RBpair, for carrying R-PDCCH (comprising DL grant and UL grant), being numbered RB0, RB1 ..., RB 11.Wherein, DL grant is carried on the 1st time slot of above-mentioned 12 RB pair, and UL grant is carried on the 2nd time slot of above-mentioned 12 RB pair, and above-mentioned 12 RB are logically continuous print, but can be physically continuous print, also can be discrete.
This base station and RN arrange in advance, and aggregation level L and offset is worth binding, as shown in Figure 9: during L=1, and offset value k=6; During L=2, offset value k=0; During L=4, offset value k=4; During L=8, offset value k=0.
Under this base station coverage, all RN determine that in blind check process the process of search volume is as follows:
Detect from L=1, now RN knows that offset value is 6, and namely RN is from the 7th RB of L=1 group RB, detects according to 1 RB mono-group, corresponding R-PDCCH candidate control channel is 6, and namely detect 6 times altogether, search volume is now: { RB6, RB7, RB8, RB9, RB10, RB11};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID, then continue to detect from L=2, now offset value is 0, namely RN is from the 1st RB of L=2 group RB, detects according to 2 RB mono-group, and corresponding R-PDCCH candidate control channel is 4, namely detect 4 times altogether, search volume is now: { { RB0, RB1}, { RB2, RB3}, { RB4, RB5}, { RB6, RB7}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=4, now offset value is 4, namely RN is from the 5th RB of L=4 group RB, detects according to 4 RB mono-group, and corresponding R-PDCCH candidate control channel is 2, namely detect 2 times altogether, search volume is now: { { RB4, RB5, RB6, RB7}, { RB8, RB9, RB10, RB11}};
If RN does not detect the R-PDCCH (comprising DL grant or UL grant) matched with himself RN ID yet, then continue to detect from L=8, now offset value is 0, namely RN is from the 1st RB of L=8 group RB, detects according to 8 RB mono-group, and corresponding R-PDCCH candidate control channel is 1, namely detect 1 time altogether, search volume size is now: { { RB0, RB1, RB2, RB3, RB4, RB5, RB6, RB7}}.
In the testing process of any one RB combining form in the 5th embodiment, when detecting corresponding R-PDCCH (comprising DL grant or UL grant), then RN stops detecting.
Especially, in the 5th embodiment, the offset value that each RN arranges RN-specific between base station and RN, can also be arranged, or arrange all RN and identical offset value is set, or the offset value of arranging some RN is identical, the offset value of some RN is not equal, and specific implementation repeats no more here.
6th embodiment, binds R-PDCCH candidate and aggregation level L and offset value, and base station and RN arrange without using the semi-static notice of high-level signaling.In 6th embodiment, suppose that base station is that RN is semi-static in advance and is configured with 15 RB pair, for carrying R-PDCCH (comprising DL grant and UL grant), numbering is respectively RB0, RB 1 ..., RB 14.Wherein, DL grant is carried on the 1st time slot of above-mentioned 15 RB pair, and UL grant is carried on the 2nd time slot of above-mentioned 15 RB pair.Above-mentioned 15 RB are logically continuous print, but can be physically continuous print, also can be discrete.
Such as: base station and RN arrange in advance, R-PDCCH candidate and aggregation levelL and offset value are bound, concrete offset value is as shown in table 2.Wherein, the value N of R-PDCCH candidate
r-PDCCH candidatebe subject to the RB sum N for carrying R-PDCCH that base station is the semi-static configuration of RN
rBconstraint, i.e. N
r-PDCCH candidate× L≤15.Therefore, as L=1, R-PDCCH candidate can only get 6,8 and 12; As L=2, R-PDCCH candidate can only get 4 and 6; As L=4, R-PDCCH candidate can only get 2 and 3; As L=8, R-PDCCH candidate can only get 1.Under this base station coverage concrete, all RN determine the process of search volume in blind check process, repeat no more here.
Table 2
For another example: to be that RN is semi-static be in advance configured with 8 RB pair in base station, and for carrying R-PDCCH (comprising DL grant and UL grant), numbering is respectively RB0, RB1 ..., RB7.Base station and RN arrange in advance, and R-PDCCH candidate and aggregation level L and offset value are bound, concrete offset value is as shown in table 3.Wherein, the value N of R-PDCCH candidate
r-PDCCH candidatebe subject to the RB sum N for carrying R-PDCCH that base station is the semi-static configuration of RN
rBconstraint, i.e. N
r-PDCCH candidate× L≤8.Therefore, as L=1, R-PDCCH candidate can only get 6 and 8; As L=2, R-PDCCH candidate can only get 4; As L=4, R-PDCCH candidate can only get 2; As L=8, R-PDCCH candidate can only get 1.Under this base station coverage concrete, all RN determine the process of search volume in blind check process, repeat no more here.
Table 3
The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention, and all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. determine a method of down control channel R-PDCCH search volume SS, it is characterized in that, comprise the following steps:
The original position of the search volume corresponding to polymerization grade aggregation level L that base station is often kind of control information unit arranges side-play amount respectively;
Via node RN, when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set; Wherein,
Described base station utilizes high-level signaling that the described offset value set is informed RN, or, the side-play amount offset value of described setting of making an appointment between described base station and RN.
2. method according to claim 1, is characterized in that, before described RN blind Detecting R-PDCCH, the method also comprises:
Described RN judges whether that the offset value needing basis to set determines the search volume corresponding to often kind of aggregation level L, if so, continues to perform the step arranging side-play amount, or determines the step of search volume; Otherwise process ends, determines the search volume corresponding to described often kind of aggregation level L according to existing method.
3. method according to claim 2, it is characterized in that, the method also comprises: instruction RN in described base station, the need of when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the side-play amount offset value set.
4. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
Described base station is that the different RN that it covers arrange the special offset value of RN; Or all RN covered for it arrange unified identical offset value; Or the RN covered divides into groups, for each group arranges the identical offset value of respective unification respectively.
5. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, arrange side-play amount respectively, and the offset value corresponding to all aggregation level L is all identical.
6. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, arrange side-play amount respectively, and the offset value corresponding to different aggregation level L is all not identical.
7. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
For the RN of under described base station coverage, or one or more RN, or the original position of the search volume corresponding to often kind of aggregation level L of all RN, side-play amount is set respectively, wherein, one or more side-play amount offset values corresponding to aggregation level L are identical, and the offset value corresponding to remaining aggregation level L is different.
8. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
Described aggregation level L and side-play amount offset value are bound, and described base station and RN agreement: during L=1, offset=a; During L=2, offset=b; During L=4, offset=c; During L=8, offset=d, wherein, the value of a, b, c, d is positive integer.
9. method according to claim 1 and 2, is characterized in that, the described side-play amount that arranges comprises:
By the value N of candidate R-PDCCH number
r-PDCCH candidatebind with described aggregation level L and side-play amount offset, and described base station and RN agreement:
Work as L=1, N
r-PDCCH candidatewhen=6, offset=a1; Work as L=1, N
r-PDCCH candidatewhen=8, offset=a2; Work as L=1, N
r-PDCCH candidatewhen=12, offset=a3; Work as L=1, N
r-PDCCH candidatewhen=16, offset=a4;
Work as L=2, N
r-PDCCH candidatewhen=4, offset=b1; Work as L=2, N
r-PDCCH candidatewhen=6, offset=b2; Work as L=2, N
r-PDCCH candidatewhen=8, offset=b3;
Work as L=4, N
r-PDCCH candidatewhen=2, offset=c1; Work as L=4, N
r-PDCCH candidatewhen=3, offset=c2; Work as L=4, N
r-PDCCH candidatewhen=4, offset=c3;
Work as L=8, N
r-PDCCH candidatewhen=1, offset=d1; Work as L=8, N
r-PDCCH candidatewhen=2, offset=d2;
Wherein, the value of a1 ~ a3, b1 ~ b3, c1 ~ c3, d1 ~ d3 is positive integer;
N
r-PDCCH candidate× L≤N
rB, N
rBrepresent the RB sum for carrying R-PDCCH.
10. determine a system for relay physical downlink control channel search space, it is characterized in that, at least comprise base station and RN, wherein,
Base station, the original position for the search volume corresponding to often kind of aggregation level L arranges side-play amount respectively;
RN, for when blind Detecting R-PDCCH, determines the search volume corresponding to often kind of aggregation level L according to the offset value set; Wherein,
Described base station, also for utilizing high-level signaling that the offset value set is informed RN; Or described base station, also for arranging side-play amount offset value by making an appointment between RN.
11. systems according to claim 10, is characterized in that,
Described base station, also for determining the instruction of the search volume corresponding to often kind of aggregation level L to the RN transmission offset value whether basis sets; Correspondingly,
Described RN, also for according to the instruction from base station, determines whether that the offset value needing basis to set determines the search volume corresponding to often kind of aggregation level L.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010551388.6A CN102469048B (en) | 2010-11-18 | 2010-11-18 | Method and system for determining a downlink control channel search space |
| PCT/CN2011/082170 WO2012065533A1 (en) | 2010-11-18 | 2011-11-14 | Method and system for determining relay physical downlink control channel search space |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010551388.6A CN102469048B (en) | 2010-11-18 | 2010-11-18 | Method and system for determining a downlink control channel search space |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102469048A CN102469048A (en) | 2012-05-23 |
| CN102469048B true CN102469048B (en) | 2015-04-01 |
Family
ID=46072233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010551388.6A Expired - Fee Related CN102469048B (en) | 2010-11-18 | 2010-11-18 | Method and system for determining a downlink control channel search space |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102469048B (en) |
| WO (1) | WO2012065533A1 (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104041161B (en) * | 2012-08-02 | 2018-01-02 | 华为技术有限公司 | Transmission, method of reseptance, base station and the user equipment of control channel |
| CN103684673B (en) | 2012-09-24 | 2018-11-16 | 中兴通讯股份有限公司 | A kind of method and apparatus for detecting control signaling and realizing control signaling detection |
| CN110034908B (en) * | 2012-09-26 | 2021-05-18 | 华为技术有限公司 | Control channel detection method and user equipment |
| CN109921888B (en) * | 2012-09-27 | 2022-05-24 | 华为技术有限公司 | Control channel candidate distribution method and device |
| CN103716274B (en) | 2012-09-29 | 2018-08-07 | 中兴通讯股份有限公司 | The transmission method and device of Downlink Control Information |
| CN109743147B (en) * | 2012-11-01 | 2023-12-08 | 华为技术有限公司 | Method and device for determining control channel search space |
| WO2017173775A1 (en) * | 2016-04-05 | 2017-10-12 | 华为技术有限公司 | A resource allocation method for a control channel |
| CN108282875B (en) * | 2017-01-06 | 2022-04-29 | 华为技术有限公司 | Data receiving and sending method and equipment |
| WO2018126453A1 (en) * | 2017-01-06 | 2018-07-12 | 广东欧珀移动通信有限公司 | Handover method, base station, and terminal |
| CN108631995B (en) * | 2017-03-24 | 2022-06-24 | 中兴通讯股份有限公司 | Method and device for determining control channel search space and computer storage medium |
| CN108809451A (en) * | 2017-05-05 | 2018-11-13 | 中国移动通信有限公司研究院 | A kind of the determination method and network element device of search space |
| CN109392151B (en) * | 2017-08-11 | 2023-04-18 | 维沃移动通信有限公司 | Method, device and system for determining PDCCH search space |
| WO2019028830A1 (en) * | 2017-08-11 | 2019-02-14 | Zte Corporation | Candidate control channel blind detection |
| CN109391430A (en) | 2017-08-11 | 2019-02-26 | 维沃移动通信有限公司 | PDCCH resource configuration determines method, network side equipment and user terminal |
| WO2019105434A1 (en) * | 2017-11-30 | 2019-06-06 | 华为技术有限公司 | Resource allocation method, terminal, and base station |
| US11271701B2 (en) * | 2018-01-12 | 2022-03-08 | Qualcomm Incorporated | Physical downlink control channel (PDCCH) monitoring with overlapping resources |
| CN110324883B (en) | 2018-03-28 | 2021-04-27 | 维沃移动通信有限公司 | Method for configuring physical downlink control channel, user equipment and network side equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2104294A2 (en) * | 2008-03-20 | 2009-09-23 | LG Electronics Inc. | Monitoring a control channel in a wireless communication system |
| CN101841892A (en) * | 2009-03-18 | 2010-09-22 | 中国移动通信集团公司 | Method, equipment and system for indicating and detecting PDCCH in a carrier aggregation system |
-
2010
- 2010-11-18 CN CN201010551388.6A patent/CN102469048B/en not_active Expired - Fee Related
-
2011
- 2011-11-14 WO PCT/CN2011/082170 patent/WO2012065533A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2104294A2 (en) * | 2008-03-20 | 2009-09-23 | LG Electronics Inc. | Monitoring a control channel in a wireless communication system |
| CN101841892A (en) * | 2009-03-18 | 2010-09-22 | 中国移动通信集团公司 | Method, equipment and system for indicating and detecting PDCCH in a carrier aggregation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102469048A (en) | 2012-05-23 |
| WO2012065533A1 (en) | 2012-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102469048B (en) | Method and system for determining a downlink control channel search space | |
| KR101410961B1 (en) | Method and device for detecting downlink control information | |
| CN102014503B (en) | Collocation method, detection method and device for relay system control channel | |
| CN102714532B (en) | Communication station, relay station, communication system, communication means and control method | |
| CN102215507B (en) | Method and system for detecting downlink control channel | |
| CN101882985B (en) | The indicating means that hybrid automatic repeat-request sends and base station thereof | |
| CN107306417B (en) | A kind of method and apparatus in the UE and base station of narrow-band mobile communication | |
| CN102238650A (en) | Transmission method and system of R-PDCCH (relay physical downlink control channel) | |
| CN101814944B (en) | Data transmission method, system and device | |
| CN102948111B (en) | Trunking method in radio communications system and node | |
| KR20100040646A (en) | Method for transmitting reference signals for relay node | |
| CN101909305B (en) | Method and device for transmission and indication of relay system | |
| CN106506424A (en) | The control channel transmission method of relaying return link | |
| CN102457910B (en) | Common search space mapping method of relay node (RN) and apparatus thereof | |
| CN102082642B (en) | Method, system and equipment for transmitting and detecting control signaling on backhaul link | |
| CN102201857B (en) | Control signaling transmission method, system and device for relay link | |
| CN102149202B (en) | Method and device for distributing uplink feedback resources | |
| CN102111214A (en) | Base station, relay node as well as notification method and system of configuration information of relay subframe | |
| CN101442357A (en) | Method and system for wireless transmission adopting Relay supported frame structure | |
| CN102006602B (en) | Method, system and device for transmitting cooperative data | |
| CN102378213B (en) | A kind of method and system detecting relay node downlink control channel | |
| CN102237979B (en) | Relay backhaul link control signal transmission method and device | |
| CN103313395A (en) | Method and device for realizing multi-user multiple input multiple output in relay transmission system | |
| CN103369693B (en) | Relaying coordinated scheduling method and device | |
| CN101932110B (en) | Relay link resource scheduling method, system and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180314 Address after: 518000, two 703A, COFCO business park, two Xian Xian Road, Xin'an, Shenzhen, Guangdong, Baoan District Patentee after: Shenzhen Fu Hai Sunshine Technology Co., Ltd. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Patentee before: ZTE Corporation |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150401 Termination date: 20191118 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |