Patent Application
20180152943
The present invention relates to a method for communicating in a network. More specifically, the present invention relates to communication between a primary station and a secondary station, in a telecommunication network, like a cellular telecommunication network (e.g. UMTS, UMTS LTE, GSM).
In a mobile network, as e.g. UMTS LTE, the downlink control channel PDCCH (Physical Downlink Control Channel) carries information such as resource allocation for uplink or downlink transmission. A PDCCH message can use 1, 2, 4 or 8 Channel Control Elements (CCEs or resource elements)—referred to as CCE aggregation levels 1, 2, 4 or 8.
A mobile station, like a UE in LTE, does not know in advance the location in CCE space of messages intended for it. In principle, the mobile station could attempt to blindly decode all the possible PDCCHs with different starting positions in the CCE space and thus receive any messages intended for that mobile station. However, if the CCE space is large the processing complexity is prohibitive. Therefore a more limited search is configured which consists of a number of search spaces.
A search space is a set of aggregated CCEs (with a certain aggregation level) within which a mobile station (or user equipment (UE) or secondary station) performs blind decoding of all PDCCH payloads possible for that aggregation level. Search spaces are defined per aggregation level; a secondary station thus can have up to four search spaces. For example, the search space of a UE for aggregation level 1 (referred to as 1-CCE) could consist of the CCEs indexed 3,4,5,6,7,8, while its search space for aggregation level 8 could consist of the two resource sets of aggregated CCEs consisting of the CCEs indexed by 1, 2, . . . 8 and 9, 10, . . . , 16, respectively. In this example, the UE thus performs six blind decodings for 1-CCEs and two blind decodings for 8-CCEs.
The LTE specification currently requires the UE to perform the following:
6 decoding attempts of 1-CCE aggregation
6 decoding attempts of 2-CCE aggregation
2 decoding attempts of 4-CCE aggregation
2 decoding attempts of 8-CCE aggregation
The larger aggregations are intended to be used for large messages, and/or small messages when a lower code rate is required, for example under bad channel conditions. However, restricting the search spaces to reduce processing complexity limits the availability of suitable aggregations for different conditions as conditions vary.
In order to reduce the required amount of signaling, it however needed to improve the current control channel, and more specifically for the grant of resources, either for uplink resources, i.e. from the User Equipment to the eNodeB or for downlink resources, i.e. from the eNodeB to the User Equipment.
It is an object of the invention to propose a method of communication which alleviates the above mentioned problem.
It is another object of the invention to provide a method enabling to improve the control channel scheme having search spaces, without causing more signalling or overhead.
In accordance with a first aspect of the invention, a method is proposed for communicating between a primary station and a plurality of secondary stations, comprising
the primary station providing a plurality of resource sets,
the primary station configuring a secondary station to search for a control channel on at least one of a plurality of search spaces each corresponding to a resource set, wherein at least part of one of the search spaces is used to transmit a control message to a secondary station, the control message being indicative of a resource allocated to the secondary station for transmitting to the primary station or receiving from the primary station data, and wherein the secondary station deduces from the part of the search space used for transmitting the control message an indication of the resource set from the plurality of resource sets within which the allocated resource is located.
In accordance with a second aspect of the invention, it is proposed a secondary station comprising means for communicating with a primary station, the secondary station comprising
control means for activating a search for a control channel on at least one of a plurality of search spaces each corresponding to a resource set, wherein at least part of one of the search spaces may be used to transmit a control message to the secondary station from the primary station, the control message being indicative of a resource allocated to the secondary station for transmitting to the primary station or receiving from the primary station data, and wherein the control means are arranged for deducing from the part of the search space used for transmitting the control message an indication of the resource set from the plurality of resource sets within which the allocated resource is located.
In accordance with a third aspect of the invention, it is proposed a primary station comprising means for communicating with a plurality of secondary stations, comprising
control means for providing a plurality of resource sets,
the control means being arranged for configuring a secondary station to search for a control channel on at least one of a plurality of search spaces each corresponding to a resource set, wherein at least part of one of the search spaces is used to transmit a control message to a secondary station, the control message being indicative of a resource allocated to the secondary station for transmitting to the primary station or receiving from the primary station data, and wherein the part of the search space used for transmitting the control message is selected to provide to the secondary station with an indication of the resource set from the plurality of resource sets within which the allocated resource is located.
Thus, the secondary station is able to deduce without additional signalling the location of an allocated resource. The message may contain all the remaining information required to fully specify the granted resource.
These and other aspects of the invention will be apparent from and will be elucidated with reference to the embodiments described hereinafter.
The present invention will now be described in more detail, by way of example, with reference to the accompanying drawing, wherein:
The present invention relates to a method for communicating in a network, like a cellular network. For instance, the network may be a UMTS network as depicted on
Referring to
The first embodiment of the invention provides an efficient scheme for signaling grant of resources, either uplink resources or downlink resources, which may be transmitted on multiple carriers for a communication system such as LTE or LTE Advanced.
In fact, in the first release of the LTE specifications (Rel-8), a single carrier of up to 20 MHz is used. A control signalling message on the Physical Downlink Control Channel (PDCCH) is used to signal allocations of transmission resources. Each User Equipment is configured with a search space within which to search for such signalling messages, in order to avoid having to decode every possible location in every subframe, which would result in a very large blind decoding overhead. However, in future extensions of LTE to multiple carriers, signalling will be needed to indicate resource allocations on each of the component carriers. It is desirable to avoid a significant increase in the number of blind decodes required. The current main option considered in 3GPP is to have separate PDCCHs for each Component Carrier (CC) where either:
It is therefore beneficial in either case for there to be a search space for PDCCH messages on each carrier (i.e. a set of possible locations for a PDCCH in each of which the UE attempts to decode a PDCCH (i.e. blind decoding).
However, the further details are not defined.
In general, it would be desirable for the UE to be able to receive a PDCCH on any of the CCs (and typically more than one PDCCH at the same time).
In order to avoid too great an increase in signal processing due to the total number of blind decodes, the search space on each carrier should be kept as small as possible.
Currently in Release 8, the position of the UE-specific search space for PDCCH for a given UE changes from subframe to subframe according to the following in TS36.213:
“The set of PDCCH candidates to monitor are defined in terms of search spaces, where a search space Sk(L) at aggregation level L ∈ {1,2,4,8} is defined by a set of PDCCH candidates. The CCEs corresponding to PDCCH candidate m of the search space Sk(L) are given by
L·{(Yk+m)mod└NCCE,k/L┘}+i
where Yk is defined below, i=0, L, L−1 and m=0, L, M(L)−1. M(L) is the number of PDCCH candidates to monitor in the given search space.
For the UE-specific search space Sk(L) at aggregation level L, the variable Yk is defined by
Y
k=(A·Yk−1)mod D
where Y−1=nRNTI ≠ 0, A=39827, D=65537 and k=└ns/2], ns is the slot number within a radio frame. The RNTI value used for nRNTI is defined in section 7.1 in downlink and section 8 in uplink.”
The RNTI value is specific to the UE, and the aggregation level is 1, 2, 4 or 8.
There is also a Common search space (starting at CCE zero) intended for broadcast control messages to a number of UEs.
If the UE-specific search space per carrier is reduced (as is likely to be required for the case of multiple carriers), then there is a significant probability that it will collide with either a part of the common search space or the search space of another UE. This may lead to blocking of the control channel, preventing the eNB scheduling the desired DL and/or UL transmissions and thus a loss of performance (e.g. throughput or QoS). A possible set of search spaces for additional carriers is given in the table below (on the assumption that there is no common search space on additional carriers) and which shows the possible PDCCH candidates monitored by a UE (Release 10, additional carriers only).
Providing two possible locations for PDCCH candidates allows for two PDDCHs to be sent to a UE in the same subframe, for example, one carrying an UL grant and the other a DL resource allocation.
Currently in Release 8 it is assumed that in FDD operation the Uplink and Downlink carriers are paired. This means that an UL grant transmitted using a PDCCH on a given Downlink carrier implicitly indicates a particular UL carrier. In the case of carrier aggregation, we can consider the following cases:
Several solutions inferring additional signalling have been searched by the applicants:
It seems likely that some UE-specific configuration (probably semi-static) would be needed to explicitly link UL carriers to DL carriers.
In accordance with a current definition of the invention, its first embodiment is based on the recognition that the carrier to which the UL grant or DL resource allocation applies may be indicated by the PDCCH location within the search space.
The first embodiment comprises a system like LTE, but with multiple carriers. To save processing power, each User Equipment monitors only a limited set of PDCCH locations on a given carrier (as a function of UE ID, subframe number, size of message, and amount of resource available for control channel signalling). On one carrier (the anchor carrier, carrier 0), with message size (aggregation level) is 1, the PDCCH search space size is 6 and the number of UL carriers is 5 and the number of DL carriers is also 5.
As an example, the relationship between PDCCH location (within the search space for that UE) and the particular carrier could be indicated as in the Table below.
The position of the PDCCH in a search space can be defined as the resource used within a search space. The space can be defined along at least two dimensions, like the components on a first axis, and the timeslots on a second axis. It is to be noted that some other parameters could be taken into account like the cell, if the invention is implemented in a multi cell co-operative system. In such a system, a plurality of antenna ports belonging to different cells are used simultaneously and in a cooperative manner.
Depending on the timeslot and/or the carrier (or other parameters) used for the transmission of the allocation grant, the secondary station can deduce an information on the resouce allocated, like a position in the resource sets, i.e. a carrier, or a timeslots or likewise.
The mapping between location and carrier could be configured by the network. As an example, to provide more scheduling flexibility on the anchor carrier (Carrier 0), not all carriers could be indicated by PDCCH on the anchor carrier. For example:
A second embodiment is like the first embodiment but has more component carriers in the UL (e.g. 5) and fewer in the DL (e.g. 2). In this case the mapping could be as follows on the additional carrier (carrier 1).
A third embodiment is like the first embodiment but with reduced PDCCH search space on the additional component carriers (i.e. non anchor carriers). Here the carrier is indicated as an offset with respect to the carrier on which the PDCCH appears. The table refers to non-anchor carriers (except for the last anchor carrier)
Note that the mapping can be configured so that UL and DL resources can be indicated on matching carriers in the same subframe. In one case this would be the same carrier as that carrying the PDCCH (and corresponding UL). In the other case this would be the next carrier.
For the last anchor carrier we could have:
A fourth embodiment is like the second embodiment, but with 5 carriers in UL and 3 carriers in DL. The search space on the non-anchor carriers is modified compared with the search space on the anchor carrier (carrier 0) but more blind decodings per carrier are allowed than in the third embodiment. For example on one additional carrier (Carrier 1) we could have:
On the other additional carrier (Carrier 2) we could have:
A fifth embodiment is like the third embodiment but where in order to give more flexibility the mapping between PDCCH position and carrier depends on the aggregation level. For aggregation level 1 we could have
For aggregation level 2 we could have
Part of the configuration of the mapping between PDDCH location may be fixed in the specification, for example as a default mapping in case no other mapping is signalled by higher layers.
Note that the PDCCH positions in the tables above are within the search space for a particular UE, which in general is located within a larger set of possible PDDCH locations
The invention may also be applied to indicate that the resources signalled in a PDCCH refer to another cell (which may or may not have the same carrier frequency as the carrier on which the PDCCH is transmitted).
As an example of an embodiment for this case, a system like LTE is configured so that the UE may receive one or more PDCCH from a serving cell (Cell 0) and such PDCCH may also indicate resources in another cell (cell 1).
In the table the entnes are arranged so that it is easy to signal an UL and DL resource in the same cell at the same time. In addition it would be possible, for example, for two PDCCHs to be transmitted indicating that the UE should receive PDSCH transmissions from both cells 0 and 1 at the same time.
The invention may be applicable to mobile telecommunication systems like UMTS LTE and UMTS LTE-Advanced.
In the present specification and claims the word “a” or “an” preceding an element does not exclude the presence of a plurality of such elements. Further, the word “comprising” does not exclude the presence of other elements or steps than those listed.
The inclusion of reference signs in parentheses in the claims is intended to aid understanding and is not intended to be limiting.
From reading the present disclosure, other modifications will be apparent to persons skilled in the art. Such modifications may involve other features which are already known in the art of radio communication.
| Number | Date | Country | Kind |
|---|---|---|---|
| 09163832.0 | Jun 2009 | EP | regional |
This application is a continuation of U.S. application Ser. No. 15/350,194, filed on Nov. 14, 2016, which is a continuation of U.S. application Ser. No. 13/380,113, filed Dec. 22, 2011 (now U.S. Pat. No. 9,497,005), which is the National Stage Entry of International Application No. PCT/IB2010/052673, filed Jun. 15, 2010, which claims the benefit of foreign application EP09163832.0 filed Jun. 25, 2009, all of which are incorporated herein by reference in their entirety.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15350194 | Nov 2016 | US |
| Child | 15882117 | US | |
| Parent | 13380113 | Dec 2011 | US |
| Child | 15350194 | US |
