FIELD OF THE INVENTION
[0001] The present invention relates to control channels in communication network systems,
and in particular to control channel allocation and decoding e.g. in 3GPP (3
rd Generation Partnership Project) LTE (Long Term Evolution) network systems.
BACKGROUND OF THE INVENTION
[0002] LTE technology, for example, defines a packet radio system, where all channel allocations
are expected to happen in short periods of sub-frames. This is contrary to the older
3G systems, where dedicated signalling channels are necessary to be set up even for
packet traffic. It is also different from WLAN (Wireless Local Area Network) type
of allocations, where each IP (Internet Protocol) packet transmission contains a transport
header.
[0003] According to LTE technology, all allocations are signalled in Shared Control Channels,
which are present in first multi-carrier symbols of a sub-frame preceding multi-carrier
symbols of data channels. The control channels are separately coded. That is, a downlink
(or uplink) channel is divided into two separate parts, one for control and one for
data. The data part (PDSCH) carries downlink (or uplink) data for simultaneously scheduled
users, while the control part (PDCCH) carries (among others) allocation information
for the scheduled users.
SUMMARY OF THE INVENTION
[0004] The present invention provides methods and devices for reducing control channel decoding
complexity as defined in the appended claims. The invention may also be implemented
as computer program product.
[0005] According to the invention, a tree search for aggregated control channels is reduced
in a systematic way, which will obtain a significant reduction of the number of decoding
attempts at a UE (User Equipment) side, while still maintaining most of the scheduling
flexibility in an eNB (evolved Node B), i.e. system spectral efficiency versus UE
complexity trade-off is obtained.
[0006] According to the invention it is assumed that there will not be a large amount of
users having the same propagation conditions being scheduled at the same time. The
tree reduction is obtained by putting some limitations on the tree structure through
specifications.
[0007] The UE utilizes the tree structure to reduce the decoding complexity in order to
save power. According to an embodiment of the invention, power consumption in the
decoding/detection of an L1/L2 control channel can be reduced.
[0008] For the purpose of the present invention to be described herein below, it should
be noted that
- a user equipment may for example be any device by means of which a user may access
a communication network; this implies mobile as well as non-mobile devices and networks,
independent of the technology platform on which they are based;
- a user equipment can act as a client entity or as a server entity in terms of the
present invention, or may even have both functionalities integrated therein;
- method steps likely to be implemented as software code portions and being run using
a processor at one of the server / client entities are software code independent and
can be specified using any known or future developed programming language;
- method steps and/or devices likely to be implemented as hardware components at one
of the server / client entities are hardware independent and can be implemented using
any known or future developed hardware technology or any hybrids of these, such as
MOS, CMOS, BiCMOS, ECL, TTL, etc, using for example ASIC components or DSP components,
as an example;
- generally, any method step is suitable to be implemented as software or by hardware
without changing the idea of the present invention;
- devices can be implemented as individual devices, but this does not exclude that they
are implemented in a distributed fashion throughout the system, as long as the functionality
of the device is preserved.
[0009] The present invention is not limited to LTE network systems, but can be applied to
any other communication systems requiring dynamic and fast channel allocation, including
systems where there will be multiple code rates for the control channel.
BRIEF DESCRIPTION OF THE DRAWINGS
[0010]
Fig. 1 shows an example of a tree structure with three allocated nodes in different
levels of the tree.
Fig. 2 shows the three allocated nodes of Fig. 1 mapped to sub-carrier resources in
a distributed manner.
Fig. 3 shows a combination of control channel elements to create aggregated control
channel candidates.
Fig. 4 shows an example illustrating reduction of possible aggregation options for
control channel candidates according to an embodiment of the invention.
Fig. 5 shows a schematic block diagram illustrating functions of a user equipment
and a network device according to an embodiment of the invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0011] A Physical Downlink Shared Control Channel (PDSCCH) which carries (among others)
allocation information for simultaneously scheduled users of a communication network
system is arranged to a tree structure consisting of multiple control channel elements
as shown in Fig. 1. During decoding, a UE (User Equipment) will combine or aggregate
the control channel elements to create different code blocks or control channel candidates.
Each code block is called a control channel candidate as it potentially carries information
for one MAC (Medium Access Control) ID. The MAC ID is used by the UE or by a group
of UEs to detect the channel. At each level of the tree, each node represents a single
control channel of a code block. The number of the control channels at the lowest
level of the tree is determined by the system bandwidth and number of OFDM symbols
n available for the largest code blocks, as well as the size of the control channel
elements. In the example shown in Fig. 1, n=3. Any node of the tree, which is not
occupied by a control channel in this level, is available for the next level of the
tree as two control channels, each of which are half of the size of the control channel
at the parent node.
[0012] The system bandwidth consisting of a given number of sub-carrier resources may be
divided to an integer multiple of the largest control channels. A given node of the
tree i.e. a set of sub-carriers can consist of one control channel of the largest
code block, of up to two control channels of the second largest code blocks or up
to four control channels of the smallest code blocks.
[0013] Each control channel extends entirely over the first n OFDM symbols, which are available
for the control channels. The control channels may be distributed to the sub-carriers
over the system bandwidth to maximize the frequency diversity. For example, there
are 4 distributed sets of sub-carrier resources allocated per each code-block. This
is illustrated in Fig. 2.
[0014] In Fig. 1, three allocated nodes CB1, CB2, CB3 in different levels of the tree structure
are shown. Fig. 2 shows the three allocated nodes CB1, CB2, CB3 mapped to the sub-carrier
resources in a distributed manner. It should be noted that these mappings are only
examples, and that the mapping in general should provide frequency diversity by scattering
over the system bandwidth.
[0015] As each control channel has to be uniquely identified by a MAC ID, it can be combined
to CRC (Cyclic Redundancy Code) by partly masking CRC bits with the MAC-ID. As the
MAC ID is used for addressing both UE specific control channels and common control
channels, it is reasonable to define the MAC ID in a compatible way. Thus, reception
of any control channel is possible by filtering control channels with the respective
MAC ID. Error detection is available from the MAC ID masked CRC. The length of the
MAC ID is matched to the C-RNTI (Cell Radio Network Temporary Identifier) length.
[0016] A receiver, e.g. the UE, includes means to receive symbols of the Downlink Shared
Control Channel part of the sub-frame prior to reception and processing of the symbols
in the downlink and uplink Shared Data Channels. The receiver demodulates and decodes
the sub-carriers of the OFDM symbols in which the receiver may search for a set of
largest code blocks, e.g. CB1 of Fig. 1. As the Code Block is of known size and the
system bandwidth is known, the receiver knows an integer multiple of sub-carrier positions
to search for a CB1. The reception, whether correctly detected or not, may be recognized
by Cyclic Redundancy Check detector filtered by a receiver specific c-RNTI identity.
For every match of CRC, to which the c-RNTI of the UE does not match, the receiver
knows that the next higher level of tree is masked and not available. For every non-matched
CRC check, the UE will continue decoding code blocks (CB2) in the next higher level
of the tree searching for a match in two child nodes of the parent node. Further on,
for every non-matched CRC check, the UE will continue decoding code blocks (CB3) in
the next higher level of the tree searching for a match in two child nodes of the
parent node. The search continues until the UE has detected and correctly decoded
all control channels, intended for its reception.
[0017] In addition to search signalling entries with its own receiver specific c-RNTI, the
UE may have to search for common signalling entries by common identifiers.
[0018] The search in the tree may happen in any other order than from the lowest level node
towards the higher level nodes. Depending on the applied coding scheme, the receiver
may process the nodes from the highest level of nodes to the lower level of nodes.
Further on, the receiver may process the nodes in other arbitrary (or systematic)
order based on some measures e.g. SINR (Signal Interference and Noise Ratio) quality
of the candidate code block(s).
[0019] In the following it is assumed that only a single size of a node (i.e. control channel)
at the highest level of the tree structure (level 3 in Fig. 1) is defined for a given
bandwidth in a cell. The highest level node is referred to as "control channel element".
Aggregation of multiple control channel elements can be used to get larger payloads
and/or lower coding rate.
[0020] However, the aggregation of the control channel elements may require a large number
of decoding attempts from all the UEs that are listening for a possible allocation.
An example of a control channel aggregation is shown in Fig. 3.
[0021] From Fig. 3 it can be seen that an aggregation of even a relative low number of control
channel elements will result in a rather high number of decoding attempts for the
UEs listening for resource allocations, and each UE will listen for downlink allocations
as well as uplink allocations. In the example in Fig. 3, there are 6 control channel
elements, while the aggregation using a tree structure as shown in Fig. 1 results
in 10 potential control channel candidates. This is suboptimal regarding UE complexity,
as a UE will have to decode the full amount of control channel candidates even if
some of them are not scheduled.
[0022] In the following an embodiment of the invention will described in greater detail.
[0023] Fig. 4 shows a kind of flat tree structure arising from Fig. 3. Fig. 4 illustrates
potential control channel candidates for different aggregation possibilities (both
the white and grey areas). As can be seen from Fig. 4, there is a total of 24 control
channel elements (CCEs), which by default triggers 45 decoding attempts per link direction
(i.e. downlink/uplink) allocation. In other words, in aggregation level 1 the 24 control
channel elements each may form a control channel. In aggregation level 2, two control
channel elements may be aggregated to form a control channel, in aggregation level
4, four control channel elements may be aggregated to form a control channel, and
in aggregation level 8, eight control channel elements may be aggregated to form a
control channel.
[0024] According to an embodiment of the invention, the control channel structure shown
by the white and grey areas in Fig. 4 is put under limitations, such that only the
white aggregated control channel candidates are available for scheduling. With this
limitation, the number of decoding attempts is reduced to 15 (the grey areas are not
decoded in search for a control channel candidate), which corresponds to a reduction
by a factor of 3. In other words, there are four control channel candidates in aggregation
level 1, four control channel candidates in aggregation level 2, four control channel
candidates in aggregation level 4, and three control channel candidates in aggregation
level 8.
[0025] With the above limitation put on the tree structure, scheduling flexibility is not
reduced that much, based on the following arguments:
- If there is a lot of user equipments close to an eNB scheduling the control channels,
which user equipments require only aggregation level 1, the aggregated level 2 elements
with reduced power can be used to have more users due to the possibility of doing
power balancing; in the example shown in Fig. 4, 9 favourable conditioned users can
be scheduled using this approach. In other words, four control channels in aggregation
level 1, two control channels in aggregation level 2, two control channels in aggregation
level 4, and one control channel in aggregation level 8 can be scheduled.
- If a plurality of scheduled users is present at a cell edge (aggregation level 8),
additional users cannot be scheduled anyway due to limited number of available control
channel elements.
- As the difference between aggregation layers is a factor of 2 and when using power
balancing, to some extent there is flexibility to trade aggregation and power between
each other.
[0026] It should be noted that although the above description is given for an allocation
tree for single link direction, the invention is also valid for the case where two
trees, for uplink and downlink, respectively, are present.
[0027] Further, it should be noted that the number of possible control channels at each
layer is not important.
[0028] According to an embodiment of the invention, using an allocation rule, usage of the
smallest control channel on all control channel elements is prohibited, while at the
same time the smaller control channels are allowed to be combined to aggregated control
channels with better coverage.
[0029] With the above approach, the number of decoding attempts that is needed by each UE
can be reduced. The limitation of the tree is possible due to the frequency diversity
applied for all control channel elements, such that each CCE experiences same or similar
channel conditions.
[0030] Fig. 5 shows a schematic block diagram illustrating a user equipment 10 and a network
device 20, such as an eNB, according to an embodiment of the invention.
[0031] The user equipment 10 comprises a receiving/transmitting section 11 and a decoding
section 12. The receiving/transmitting section 11 receives symbols from the network
device 20, which comprises a receiving transmitting section 21 transmitting the symbols
and an allocation section 22.
[0032] The allocation section 22 allocates control channels represented by nodes of a tree
structure, each of the control channels comprising at least one control channel element
carrying information for a respective identifier used to detect a control channel
of the control channels, wherein the allocation is performed by limiting allocation
of highest level control channels of the control channels, the highest level control
channels being represented by nodes of the tree structure at a highest level of the
tree structure. For example, in Fig. 1 the highest level is shown by level 3. Referring
to Fig. 4, the highest level is represented by aggregation level 1.
[0033] The allocation section 22 may increase allocation of lower level control channels
of the control channels, the lower level control channels being represented by nodes
of the tree structure at lower levels of the tree structure. For example, in Fig.
1 the lower levels are shown by levels 2 and 1. Referring to Fig. 4, the lower levels
are represented by aggregation levels 2, 4 and 8.
[0034] The receiving/transmitting section 21 may transmit the allocated control channels
as symbols to user equipments including the user equipment 10, by distributing the
allocated control channels to sub-carriers over a system bandwidth.
[0035] The higher level control channels may be combined to the lower level control channels.
In other words, smaller control channels are allowed to be combined to aggregated
control channels with better coverage.
[0036] The allocation section 22 may increase allocation more the lower the level of the
tree structure.
[0037] The searching section 12 of the user equipment 10 searches for a control channel
by decoding control channels represented by nodes of a tree structure, by using an
identifier such as an MAC ID, CRC or c-RNTI, each of the control channels comprising
at least one control channel element carrying information for a respective identifier
used to detect a control channel of the control channels, wherein the searching section
12 limits the searching for highest level control channels of the control channels,
the highest level control channels being represented by nodes of the tree structure
at a highest level of the tree structure.
[0038] The searching section 12 may increase the searching for lower level control channels
of the control channels, the lower level control channels being represented by nodes
of the tree structure at lower levels of the tree structure.
[0039] The receiving/transmitting section 11 may receive the control channels as symbols
from the network device 20.
[0040] The searching section 11 may begin the searching with lowest level control channels
represented by nodes of the tree structure at a lowest level of the tree structure.
For example, in Fig. 1 the lowest level is shown by level 1. Referring to Fig. 4,
the lowest level is represented by aggregation level 8.
[0041] It is to be noted that the network device 20 and user equipment 10 shown in Fig.
5 may have further functionality for working e.g. as eNodeB and UE. Here the functions
of the network device and user equipment relevant for understanding the principles
of the invention are described using functional blocks as shown in Fig. 5. The arrangement
of the functional blocks of the network device and user equipment is not construed
to limit the invention, and the functions may be performed by one block or further
split into sub-blocks.
[0042] According to an embodiment of the invention, on a transmitting side, control channels
represented by nodes of a tree structure are allocated, each of the control channels
comprising at least one control channel element carrying information for a respective
identifier used to detect a control channel of the control channels. The allocation
is performed by limiting allocation of highest level control channels of the control
channels, the highest level control channels being represented by nodes of the tree
structure at a highest level of the tree structure. On a receiving side, a control
channel is searched for by decoding the allocated control channels, wherein the searching
is limited for the highest level control channels.
[0043] It is to be understood that the above description is illustrative of the invention
and is not to be construed as limiting the invention. Various modifications and applications
may occur to those skilled in the art without departing from the scope of the invention
as defined by the appended claims.
1. A method comprising:
allocating control channels represented by nodes of a tree structure, each of the
control channels comprising at least one control channel element carrying information
for a respective identifier used to detect a control channel of the control channels,
wherein the allocation is performed by limiting allocation of highest level control
channels of the control channels, the highest level control channels being represented
by nodes of the tree structure at a highest level of the tree structure.
2. The method of claim 1, comprising:
increasing allocation of lower level control channels of the control channels, the
lower level control channels being represented by nodes of the tree structure at lower
levels of the tree structure.
3. The method of claim 1 or 2, comprising:
transmitting the allocated control channels to user equipments by distributing the
allocated control channels to sub-carriers over a system bandwidth.
4. The method of claim 2, wherein the higher level control channels are combined to the
lower level control channels.
5. The method of claim 2, wherein the allocation is increased more the lower the level
of the tree structure.
6. A method comprising:
searching for a control channel by decoding control channels represented by nodes
of a tree structure, by using an identifier, each of the control channels comprising
at least one control channel element carrying information for a respective identifier
used to detect a control channel of the control channels,
wherein the searching is limited for highest level control channels of the control
channels, the highest level control channels being represented by nodes of the tree
structure at a highest level of the tree structure.
7. The method of claim 6, wherein the searching is increased for lower level control
channels of the control channels, the lower level control channels being represented
by nodes of the tree structure at lower levels of the tree structure.
8. The method of claim 6 or 7, wherein the control channels are received from a network
device.
9. The method of any one of claims 6 to 8, wherein the searching is performed beginning
with lowest level control channels represented by nodes of the tree structure at a
lowest level of the tree structure.
10. A device comprising:
an allocation unit configured to allocate control channels represented by nodes of
a tree structure, each of the control channels comprising at least one control channel
element carrying information for a respective identifier used to detect a control
channel of the control channels,
wherein the allocation unit is configured to limit allocation of highest level control
channels of the control channels, the highest level control channels being represented
by nodes of the tree structure at a highest level of the tree structure.
11. The device of claim 10, wherein the allocation unit is configured to increase allocation
of lower level control channels of the control channels, the lower level control channels
being represented by nodes of the tree structure at lower levels of the tree structure.
12. The device of claim 10 or 11, comprising:
a transmitting unit configured to transmit the allocated control channels to user
equipments by distributing the allocated control channels to sub-carriers over a system
bandwidth.
13. The device of any one of claims 10 to 12, wherein the device comprises an evolved
node B.
14. A device comprising:
a decoding unit configured to search for a control channel by decoding control channels
represented by nodes of a tree structure, by using an identifier, each of the control
channels comprising at least one control channel element carrying information for
a respective identifier used to detect a control channel of the control channels,
wherein the decoding unit is configured to limit searching for highest level control
channels of the control channels, the highest level control channels being represented
by nodes of the tree structure at a highest level of the tree structure.
15. The device of claim 14, wherein the decoding unit is configured to increase searching
for lower level control channels of the control channels, the lower level control
channels being represented by nodes of the tree structure at lower levels of the tree
structure.
16. The device of claim 14 or 15, comprising a receiving unit configured to receive the
control channels from a network device.
17. The device of any one of claims 14 to 16, wherein the device comprises a user equipment.
18. A computer program product including a program for a processing device, comprising
software code portions for performing the steps of any one of claims 1 to 13 when
the program is run on the processing device.
19. The computer program product according to claim 18, wherein the computer program product
comprises a computer-readable medium on which the software code portions are stored.
20. The computer program product according to claim 18, wherein the program is directly
loadable into an internal memory of the processing device.