Method for transmitting and receiving control information through PDCCH
Abstract
A method for decoding control information by a User Equipment, UE, comprising the procedure: monitoring a set of candidate physical downlink control channels (PDCCH) for control information received from a base station in a subframe k; in which the set of PDCCH candidates to be monitored are defined in terms of search spaces, in which the UE monitors a search space, from among the search spaces, at each of the aggregation levels, L, of 1 , 2, 4 and 8 control channel elements, CCE, in which the CCE is used for the transmission of control information, and characterized in that the search space is determined based on a Yk variable for the sub- plot k, in which Yk is defined by: Yk> = (A · Yk-1 + B) mod D, with A, B and D being constant default values; and decode the control information of the PDCCH.

Term
2 yearsto projected expiry
Projected expiry 11 September 2028, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
14 claims: 8 independent, 6 dependent
- 1ES 2 653 724 T3 REIVINDICACIONES 1. Un método para decodificar información de control por parte de un Equipo de Usuario, UE, comprendiendo el procedimiento:monitorizar un conjunto de canales de control de enlace descendente físicos (PDCCH) candidatos para información de control recibida desde una estación base en una sub-trama k;en el que el conjunto de PDCCH candidatos a monitorizar están definidos en términos de espacios de búsqueda, en el que el UE monitoriza un espacio de búsqueda, de entre los espacios de búsqueda, en cada uno de los niveles de agregación, L, de 1, 2, 4 y 8 elementos de canal de control, CCE, en el que el CCE se utiliza para la transmisión de la información de control, y caracterizado porque el espacio de búsqueda es determinado en base a una variable de Yk para la sub-trama k, en el que Yk está definida por: Yk = (A- Yk-1 + B) mod D, siendo A, B y D valores constantes predeterminados;y decodificar la información de control del PDCCH.
- 2El método de la reivindicación 1, en el que el número de PDCCH candidatos, C, es determinado en base al número de CCE, Ncce, dividido por el nivel de agregación, L.
- 3El método de la reivindicación 1 o 2, en el que la Y k para la sub-trama 0 es determinada como:Y0 = (A-Y-1 + B) mod D, y en el que la Y-1 corresponde al valor ID del UE.
- 4El método de la reivindicación 3, en el que el valor ID del UE comprende un Identificador Temporal de Red de Radio (RNTI) del UE.
- 5El método según se reivindica en una cualquiera de las reivindicaciones anteriores, en el que A y D son 39827 y 65537, respectivamente.
- 6El método según se reivindica en una cualquiera de las reivindicaciones anteriores, en el que los CCE de ‘L’ correspondientes a un primer PDCCH candidato de entre el conjunto de PDCCH candidatos del espacio de búsqueda en la sub-trama k están ubicados en posiciones determinadas por:L*{(Yk) mod (suelo(N/L))} + i, en el que i = 0,..., L-1.
- 7El método según se reivindica en una cualquiera de las reivindicaciones anteriores, en el que el valor constante de B es cero.
- 8Un equipo de usuario, UE, para decodificar información de control, comprendiendo el UE:un receptor configurado para recibir información de control a través de un canal de control de enlace descendente físico, PDCCH, desde una estación base en una sub-trama k;un decodificador configurado para monitorizar un conjunto de PDCCH candidatos para la información de control recibida desde la estación base, en el que el conjunto de PDCCH candidatos a monitorizar están definidos en términos de espacios de búsqueda, en el que el decodificador monitoriza un espacio de búsqueda, de entre los espacios de búsqueda, en cada uno de los niveles de agregación, L, de 1, 2, 4 y 8 elementos de canal de control, CCE, en el que el CCE se utiliza para la transmisión de la información de control, y caracterizado porque el espacio de búsqueda es determinado en base a una variable de Yk para la sub-trama k, en el que Yk está definida por: Yk = (A*Yk-1 + B) mod D, siendo A, B y D valores constantes predeterminados.
- 9El UE de la reivindicación 8, en el que el número de PDCCH candidatos, C, es determinado en base al número de CCE (N cce ) dividido por el nivel de agregación, L.
- 10El UE de la reivindicación 8 o 9, en el que la Yk para la sub-trama 0 es determinada como:Y0 = (A*Y-1 + B) mod D, y en el que la Y-1 corresponde al valor ID del UE.
- 11El UE de la reivindicación 10, en el que el valor ID del UE comprende un Identificador Temporal de Red de Radio, RNTI, del UE.
- 12El UE según se reivindica en una cualquiera de las reivindicaciones anteriores 9 a 11, en el que A y D son 39827 y 65537, respectivamente. ES 2 653 724 T3
- 13El UE según se reivindica en una cualquiera de las reivindicaciones anteriores 9 a 12, en el que los CCE de ‘L' correspondientes a un primer PDCCH candidato de entre el conjunto de PDCCH candidatos del espacio de búsqueda en la sub-trama k están ubicados en posiciones determinadas por:L*{(Y k ) mod (suelo(N/L))} + i, en el que i = 0,..., L-1.
- 14El UE según se reivindica en una cualquiera de las reivindicaciones anteriores 8 a 13, en el que el valor constante de B es cero.
Independent claims14
321 paragraphs in 31 sections, as filed
ES 2 653 724 T3
DESCRIPTION
Method of transmitting and receiving control information via PDCCH
Technical field
The present invention relates to mobile communication technologies and, more particularly, to a method for efficiently transmitting and receiving control information over a physical downlink control channel (PDCCH).
Background of the technique
The following description can be applied to various mobile communication methods. However, a description will be provided, particularly with reference to Third Generation Partnership Project (LTE 3GPP) Long Term Evolution technologies.
LTE 3GPP is a project to improve the UMTS mobile station standard to meet future technology development in the Third Generation Partnership Project (3GPP). LTE 3GPP has evolved to Release 8 which is an improved version of the 3GPP standard.
In the LTE 3GPP communication system, various channels are defined for uplink and downlink in the physical layer used in a real signal transmission. For example, a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), and a physical random access channel (PRACH) are defined as uplink physical channels, and a physical uplink shared channel is defined. physical downlink (PDSCH), a physical multicast channel (PMCH), a physical broadcast channel (PBCH), a physical control format indicator channel (PCFICH), a physical downlink control channel (PDCCH) and a physical hybrid ARQ indicator channel (HARQ) (PHICH) as downlink physical channels. In the following description, the word "physical" will be omitted for ease of explanation unless the omission causes confusion.
Between the various channels, the PDCCH serves to transmit scheduling assignment control information and other control information. In a cellular communication system in which a base station (or Node B) controls a plurality of user equipment (UE) or (mobile stations), multiple UEs can receive control information through a PDCCH transmitted from the base station . In this case, since there is a limit to the number of PDCCHs that the base station can transmit at the same time, the base station does not previously assign different PDCCHs to each UE but rather transmits control information through an arbitrary PDCCH to a UE arbitrary every time. Therefore, the UE determines whether or not the control information received via the PDCCH belongs to the UE based on a UE identifier included in the PDCCH. Each time, the UE performs a decoding on each of a plurality of PDCCHs (for a plurality of possible PDCCH formats) and receives, when it is determined that the PDCCH corresponds to the UE, control information included in the PDCCH and operates according to the control information.
However, the number of combinations of PDCCH regions for the transmission of control information can be large. Excessive UE throughput may be required for the UE to decode all PDCCH regions. Accordingly, it is necessary to limit the PDCCH regions to be decoded by each UE in order to reduce the number of times the UE performs a decoding and thus to reduce the power consumption of the UE.
Ericsson: PDCCH Blind Decoding - Offline Discussion Result, 20080211, no. R1-081101,11 February 2008 (2008-02-11), pages 1-7, XP002542364, refers to PDCCH blind decoding, in which a UE performs blind decoding of all possible PDCCH payloads for a aggregation level and a specific search space. As regards UE-specific search spaces, a starting point of a UE-specific search space can be determined by a hashing function, which is defined by: x = UE_ID * 16 + number_subframe; e Start = (K * x + L) rnod soil (# CCEs / aggregation_level), where K and L are different sufficiently large numbers for different aggregation levels and determined by the specification.
Technical problem
An object of the present invention conceived to solve the problem is based on providing a technology for efficiently transmitting and receiving control information through a physical downlink control channel (PDCCH).
ES 2 653 724 T3
Another object of the present invention conceived to solve the problem is based on providing a technology for effectively setting a different starting position of a search space for each UE in order to transmit and receive control information to and from each UE via a different search space.
Technical solution
At least one object is solved by the independent claims.
Effects can be achieved by providing a method for a user equipment (UE) to receive control information through a physical downlink control channel (PDCCH), including the method to receive control information from a base station through a PDCCH in control channel element aggregation (CCE) units, each including at least one CCE in a control region of a specific sub-frame; and decoding the received control information in units of search space in the specific subframe, in which a modulo operation is performed according to a first predetermined constant value (D) on an input value to calculate a first resulting value, and a modulo operation is performed according to a first predetermined variable value (C) defined by the equation of
C = ground (NccE / LccE) over a value that corresponds to the first resulting value calculated to calculate a second resulting value and the search space starts with an index position that corresponds to the second resulting value (where Ncce represents the total number of CCE in the specific subframe, and Lcce is the number of CCEs included in the CCE aggregation, and ground (x) is the largest integer that is equal to or less than x).
In another aspect of the present invention, herein is provided a method for a base station to transmit control information over a physical downlink control channel (PDCCH), the method including transmitting control information for a device. user (UE) via a PDCCH in control channel element aggregation units (CCE), each including at least one CCE in a control region of a specific sub-frame, wherein the control information for the specific UE is transmitted in units of search space in the specific subframe, and wherein a modulo operation is performed according to a first predetermined constant value (D) on an input value to calculate a first resulting value, and a modulo operation is performed according to a first predetermined variable value (C) defined by the equation of
C = ground (NCCE / LCCE) over a value that corresponds to the first resulting value calculated to calculate a second resulting value and the search space begins with an index position that corresponds to the second resulting value.
In the above methods, preferably, the first constant value (D) is predetermined to be greater than the first variable value (C).
Furthermore, it may be advantageous to set the input value for a "k + 1" -th subframe to correspond to the first resulting value for a "k" -th subframe, where "k" is a non-negative integer.
On the other hand, in the above methods, a UE identification information value can be used for the input value for a 1<sup>to</sup> sub-plot.
Furthermore, the resulting first value can be calculated by multiplying the input value by a second predetermined constant value (A), adding a third predetermined constant value (B), resulting in an intermediate value, and performing the modulo operation according to the first constant value (D) over the intermediate value.
In this case, preferably, the first constant value (D), the second constant value (A) and the third constant value (B) are 65537, 39827 and 0, respectively.
In one embodiment of the present invention, when the specific subframe is the "k" -th subframe, the first constant value is "D", and the first constant value is "C", the search space begins with a specific start position Zk in the “k” -th sub-frame, the specific start position Zk in the “k” -th sub-frame is set as an index position corresponding to a value determined by Zk = [( A-yk + B) mod D] mod C and yk = (A-yk-1 + B) mod D, where A and B indicate predetermined constant values and "k" indicates a sub-frame index.
In this case, the first constant value "D" can be 65537, and the default constant values "A" and "B" can be 39827 and 0, respectively.
ES 2 653 724 T3
In this case, the index position that corresponds to the determined value may correspond to a Start position of a CCE aggregation that corresponds to the determined value assuming that the indices are assigned by CCE aggregation.
Advantageous effects
According to the embodiments of the present invention described above, it is possible to efficiently transmit and receive control information through a physical downlink control channel (PDCCH).
Specifically, a different start position of a search space can be set for each UE so that control information can be transmitted and received to and from each UE through a different search space.
Description of the drawings
The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.
In the drawings:
Figure 1 illustrates an example of a CCE aggregation through which a PDCCH can be transmitted.
Figure 2 illustrates all the possible decoding regions that the UE has to try to decode taking into account the CCE aggregation level.
Figure 3 illustrates an example where two different UEs have different decoding regions with a specific CCE aggregation level condition.
Figure 4 illustrates the principle of a generator generating identification dependent scrambling numbers according to an embodiment of the present invention.
Figures 5 and 6 illustrate an example in which a part of a generator generated binary sequence is selected as the initial value according to an embodiment of the present invention.
Figure 7 illustrates a frame structure in the LTE 3GPP system to explain an example where a communication system operates at regular intervals.
Figures 8 and 9 illustrate a method for creating a start value used to generate a start position of a PDCCH search space using a UE ID and a sub-frame number according to an embodiment of the present invention.
Figure 10 illustrates an example where one of two UEs having different CCE aggregation levels does not receive a PDCCH destined for the UE due to a PDCCH destined for the other UE.
Figures 11 and 12 illustrate examples where a UE ID, a sub-frame number, and a CCE aggregation level are used to create an initial value in accordance with one embodiment of the present invention.
Figures 13 and 14 illustrate examples in which an initial value used to calculate a start position of a PDCCH search space is created using a UE ID and a CCE aggregation level in accordance with an embodiment of the present invention.
Figure 15 illustrates the concept of the number of hits used to determine performance when calculating parameter values according to an embodiment of the present invention.
Best mode
Reference will now be made in detail to the preferred embodiments of the present invention with reference to the accompanying drawings. The detailed description, which will be provided below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention, rather than to show the only embodiments that may be implemented in accordance with the invention. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, it will turn out
It is apparent to those skilled in the art that the present invention can be practiced without such specific details.
In some examples, known structures and devices are omitted or shown in block diagram form, focusing on important features of the structures and devices, so as not to hinder understanding of the concept of the present invention. The same reference numerals will be used throughout this specification to refer to the same or similar parts.
When a UE decodes all PDCCH regions, the complexity of the UE and battery consumption increase. Therefore, it is necessary to specify a PDCCH decoding region for each UE. To achieve this, it is necessary to study in more detail a resource space through which the PDCCH is transmitted.
A PDCCH can be transmitted through a CCE aggregation that includes one or more control channel elements (CCE). Furthermore, a plurality of PDCCHs can be transmitted in a sub-frame. In this case, the term "CCE" refers to a unit of resources for the transmission of control information, which is a unit that corresponds to a specific number of resource elements in the resource space. A detailed description of the SCC concept will be omitted herein as it is apparent to those skilled in the art.
PDCCH formats can be classified as follows according to the size of a CCE aggregation used for PDCCH transmission as described above.
TABLE 1
<td>PDCCH format</td><td>CCE number</td>
<td> 0</td><td> 1</td>
<td> 1</td><td> 2</td>
<td> 2</td><td> 4</td>
<td> 3</td><td> 8</td>
Figure 1 illustrates an example of a CCE aggregation through which a PDCCH can be transmitted.
The term "total number of CCEs" in Figure 1 refers to the number of CCEs included in a sub-frame. However, the number of CCEs included in a subframe may vary depending on the system requirements. In Figure 1, a reference number "100" indicates a format (PDCCH format 1 in Table 1) in which a PDCCH is transmitted through a CCE, a reference number "200" indicates a format (format of PDCCH 2 in Table 1) in which a PDCCH is transmitted through 2 CCEs, A reference number "300" indicates a format (PDCCH format 3 in Table 1) in which a PDCCH is transmitted over 4 CCEs and a reference number "400" indicates a format (PDCCH format 4 in the Table 1) in which a PDCCH is transmitted through 8 CCEs.
That is, as shown in Figure 1, the size of a CCE aggregation used to transmit a PDCCH may vary depending on the channel environments of each UE as shown in Figure 1. In the following description, the number of CCEs used to transmit a PDCCH will be referred to as the "CCE aggregation level". Therefore, when each UE decodes a PDCCH, the UE must determine the size of a decoding region for each CCE aggregation level.
Figure 2 illustrates all the possible decoding regions that the UE has to try to decode taking into account the CCE aggregation level.
The number of all possible decoding regions that a UE has to try to decode according to a CCE aggregation level set in the system may be too large as can be seen from Figure 2. Therefore, it is preferable to pre-set a region (a combination of CCE aggregations through which the base station may have transmitted a PDCCH to the UE), which the UE has to try to decode, so that each UE limits the number of times that the UE must decode in order to receive a PDCCH.
However, the following should be considered when limiting the PDCCH decoding region. If all the different UEs decode the same limited PDCCH decoding region, the base station must transmit PDCCH to all UEs only through the limited region. Therefore, the number of UEs that can be controlled simultaneously is restricted since the base station transmits PDCCH only through the limited region instead of using all available CCEs.
ES 2 653 724 T3
This restriction can be removed if different PDCCH decoding rules (or spaces) are assigned to different UEs. That is, the base station can more efficiently transmit PDCCH to multiple UEs as the number of UEs that do not have an overlapping PDCCH decoding line increases.
Figure 3 illustrates an example in which two different UEs have different decoding rules with a specific CCE aggregation level condition.
In the following description, a row that each UE has to Attempt to decode to receive a PDCCH is called a "lookup space". In the example of Figure 3, both a UE1 and a UE2 have an aggregation level of CCE 1 but have different decoding search spaces. That is, the base station can simultaneously transmit a PDCCH to the UE1 and UE2 since the decoding search spaces do not overlap as shown in Figure 3.
The following methods can be used to establish a different search space for each UE.
In the first method, a search space that has a different zero point (or ice position) and a predetermined number of CCEs arranged starting from the ice point is assigned to each UE so that each UE has a different search space.
In the second method, a search space that has a different ice point and a predetermined number of CCEs arranged at regular intervals starting from the ice point is assigned to each UE so that each UE has a different search space. .
These two methods are similar in that the overlapping PDCCH decoding row can be reduced if the search space of each UE has a different ice position. Accordingly, one embodiment of the present invention suggests establishing that different UE search spaces have different ice positions as described above to minimize the overlap of search spaces that UEs have to attempt to decode in order to receive a search. PDCCH. Reducing the overlap of the PDCCH decoding rules in this way increases the number of UEs to which the base station can simultaneously transmit Control Information through a schedule.
One embodiment of the present invention suggests using a UE Identification number, which allows mutual Identification of each UE, to generate a different ice position value for each UE as described above. It is preferable that as many different values (or numbers) as possible are generated for the UEs. Therefore, each generated value will be called an "Identification-dependent randomization number".
Figure 4 illustrates the principle of a generator generating ID-dependent randomization numbers according to an embodiment of the present invention.
Specifically, a generator 401 receives an input value x and generates an output value Zj or an output sequence Z according to a generation parameter set {Ko, Ko, ... Kl} from generator 401. Although the number of parameters used in the generator is L + 1 in the example of figure 4, the number and type of parameters used may vary and will be described in more detail in each embodiment of the present invention described below.
The value generated by generator 401 may be a binary sequence or it may be an integer value that converts all or part of the binary sequence to.
Figures 5 and 6 illustrate an example in which a part of a binary sequence generated by the generator is selected as the Initial value according to an embodiment of the present invention.
That is, as shown in FIG. 5, a binary value of length M for use as an Identification-dependent randomization number can be selected from a binary sequence of length P generated by generator 401 described above with reference to Figure 4. According to this embodiment, several Identification-dependent randomization numbers can be generated after generating a binary sequence from a specific Initial value. That is, as shown in Figure 6, partial non-overlapping binary sequences can be selected from the binary sequence generated by generator 401 and then various ID-dependent randomization numbers can be generated from the selected binary sequences. . Although X Identification-dependent randomization numbers are generated in the example of Figure 6, the present invention is not necessarily limited to this example.
When the binary sequence of length M selected to calculate a randomization number dependent on
Identification is represented by (Ϋ<sup>0</sup>· Y<sup>1</sup>- Y<sup>2</sup>..... Y<sup>M</sup>-<sup>1</sup>}, this can be used to convert the ID-dependent randomization number (i.e., the position information of the zero) to an integer value Z<sub>K</sub>.
ES 2 653 724 T3
MATHEMATICAL EXPRESSION 1
<img file="ES2653724T3_D0001.tif" />
modC 7 ^ k
<img file="ES2653724T3_D0002.tif" />
modC
Ml
Ml
<img file="ES2653724T3_D0003.tif" />
Ml
<img file="ES2653724T3_D0004.tif" />
In this case, a subscript "k" is assumed to represent a sub-frame index and "C" is defined as the number of canddata positions that can be used as zero positions. That is, the mathematical expression 1 represents that a binary sequence of specific length selected from a binary sequence generated by the generator is converted to an integer value and a modulo operation is applied to the integer value with the number of all possible Start "C" positions to generate a position value of zero.
Specifically, in one embodiment of the present invention, the "C" value for a PDCCH to be currently received may be set equal to a value obtained by dividing the total number of physical CCEs by an aggregation level of CCEs (eg, 1, 2, 4 or 8) which is the number of CCE aggregations that can be used to transmit a PDCCH. If the total number of physical CCEs that can be used for a PDCCH transmission is indivisible by the number of CCEs that belong to a PDCCH, the value "C" can be quantified to the number of possible candidate positions based on the above principle. Specifically, this embodiment suggests that the value "C" is obtained using the following equation.
MATH EXPRESSION 2
C = soil (NccE / LccE), where “soil (x)” represents a function to quantify “x” to the largest integer that is equal to or less than “x”, Ncce represents the total number of SCCs in a sub- specific frame, and Lcce is the number of CCEs that are used to transmit a PDCCH.
On the other hand, the generator 401 illustrated in FIG. 4 generates values having a period P. Therefore, in an embodiment of the present invention, it is taken into account that P identification-dependent randomization numbers are generated through a Value generated through an Initial input value. That is, Identification-dependent randomization numbers can be generated by performing binary sequence selection and integer conversion described above on a binary sequence generated through an interlinking. Alternatively, a total of P Identification-dependent randomization numbers such as {Zo, Zi, Z<sub>2</sub>, ..., Z<sub>P</sub>_i} from an Initial input value.
Communication systems generally work with pre-established synchronisms and with Intervals of a pre-established period.
Figure 7 illustrates a frame structure in the LTE 3GPP system to explain an example where a communication system operates at regular intervals.
Specifically, as shown in Figure 7, the communication system operates at Intervals of a period of "10 ms". In this case, the period "10 ms" can be called the radio frame. In this system, a radioelectric frame includes 10 sub-frames, each having a duration of "1 ms". Each subframe can have a structure that include 0.5 ms slots.
In the example shown in figure 7, when randomization effects are achieved using ID-dependent randomization numbers, the generated values can also be managed at Intervals of 10 ms since the system illustrated in figure 7 operates at Intervals of 10 ms. . That is, a system can be established in which an Identification-dependent randomization number is required for each sub-frame to generate a sequence that includes 10 numbers so that the same sequence is used every 10 ms period. Alternatively, the system may operate such that a value is generated 10 times each sub-frame in a radio frame and values are generated in the same way in a subsequent radio frame so that in reality the same number of randomization dependent on the frequency is generated. Identification at 10 ms Intervals.
ES 2 653 724 T3
Reference will now be made to a method in which a Home position is directly generated for use in searching PDCCH from an initial input value based on an identification number. A first embodiment is described below as a preferred embodiment of the present invention and the second to fourth embodiments are described as other embodiments that can be implemented according to a similar principle.
FIRST REALIZATION
This embodiment suggests that a value obtained by performing a first modulo operation of an input value of "x" with a predetermined constant value of "D" and then performing a second modulo operation of the resulting value with a variable value of "C" which corresponds to the number of candidate start positions that can be used as start positions, is used as the search space start position for a control information search.
Specifically, this embodiment suggests that a start position be determined in the following manner.
MATH EXPRESSION 3
Zk = [(A ^ y<sub>k</sub>+ B) mod D] mod C y0 = x, yk = (A-yk-1 + B) mod D k = 0.1<sub>1</sub>..., P-1
More specifically, this embodiment suggests that an initial value "x" is entered and then multiplied by "A" and that the sum of the initial value "x" multiplied by "A" and a constant "D" is applied an operation modulo with a "C" variable to generate a trailing integer as the start position value of a search space. The Zk value finally generated in mathematical expression 3 indicates a starting position of a PDCCH search space in a subframe corresponding to an index "k".
The following two methods can be used to calculate a search space start position of a different subframe from the subframe corresponding to the index "k".
In the first method, for each subframe, a different start value is entered to generate a start position value. That is, a different value such as x is entered sequentially<sub>0</sub>, x<sub>1</sub>, ... x<sub>k</sub>, ... as an initial value for each subframe having an index of k to calculate a starting position Zk of a search space of the subframe. In the second method, an intermediate value generated by entering a start value is used as the start value for the next subframe to generate a start position value. That is, a value of yk-1 for a subframe that has an index of k-1 is used as the input value for a subframe that has an index of k.
The above mathematical expression 3 according to this embodiment uses the second method. Specifically, as shown in mathematical expression 3, a value obtained by multiplying an intermediate value yk-1 by a predetermined constant "A", adding the intermediate value yk-1 multiplied by "A" to a constant "B", and then applying to the resulting value a modulo operation with a constant "D" is used as the initial value yk.
The value corresponding to the number of candidate start positions "C" as defined in mathematical expression 2 above can also be used in this embodiment.
In this embodiment, the purpose of performing a modulo operation with the value "C" defined as in mathematical expression 2 is to obtain an output value that is one of the candidate start positions. The following explains the reason to perform another modulo operation with "D" before modulo operation with "C" to obtain a value within a desired range.
Even when the values of "Ax + B" are different in mathematical expression 3, there is a high possibility that the corresponding final values obtained by performing a modulo operation of the values "Ax + B" with "C" are probably the same if the "C" value is small. The possibility of different values of “Ax + B” causing a collision can be reduced to produce the same final value through modulo operation with small value “C” by performing another modulo operation with predetermined constant “D ”. In this case, it is preferable that the predetermined constant "D" is set higher than the value "C" to reduce the possibility that different values of "Ax + B" will cause a collision as described above.
In this embodiment, it is assumed that the search space start position Zk finally obtained in the subframe corresponding to the index "k" indicates a corresponding index of the indices assigned to the aggregations of
ES 2 653 724 T3
CCEs that correspond to the CCE aggregation level. That is, when the CCE aggregation level is "2", the indices for CCE aggregations are assigned according to 2 CCE. Therefore, the Z value<sub>k</sub> obtained according to this embodiment Indicates a corresponding index of the assigned CCE aggregation indices as described above.
SECOND REALIZATION
Unlike the first embodiment, the search space ice position Z<sub>k</sub> finally obtained in the subframe that corresponds to the index "k" can indicate a corresponding CCE position based on an index assigned to each CCE instead of an index assigned to each CCE aggregation. That is, when the CCE aggregation level is "2", a CCE aggregation index can be assigned according to one CCE instead of according to 2 CCE. Accordingly, this embodiment suggests using a value calculated through the following equation as the ice position of a PDCCH search space with the same condition as in the first embodiment.
MATH EXPRESSION 4
Z<sub>k</sub>= LccE [(A and<sub>k</sub>+ B) mod D] mod C i = x, yk = (A y<sub>k</sub>-1 + B) mod D k = 0,1, ..., P-1
When the mathematical expression 4 is compared with the mathematical expression 3 according to the first embodiment, it can be seen that a Z value is obtained<sub>k</sub> final according to the mathematical expression 4 multiplying the Z value<sub>k</sub> final generated according to mathematical expression 3 by Lcce- That is, the value calculated according to mathematical expression 3 is multiplied by the number of CCE Lcce Included in an aggregation of CCE according to the level of aggregation of CCE to generate a value that can be used as The initial position of a search space that is also appropriate for a system where indexes are assigned according to a CCE.
THIRD REALIZATION
In mathematical expressions 3 and 4 above, k is assumed to start from "0". However, the index "k" can also be defined to start from "-1". In this case, the mathematical expressions 3 and 4 can be expressed as follows.
MATH EXPRESSION 5
Z, = (r<sub>t</sub>mod [jV<sub>rrf></sub>/ íJ)
- (¿• l'.JmodD
MATHEMATICAL EXPRESSION 6
Z, - £ · (/ * mod
T * «(Λ-i;.,) Mod D
In mathematical expressions 5 and 6, Yi = nRNTi ^ 0 and nRNTi are assumed to correspond to a UE ID.
Specifically, the mathematical expression 5 is a modification of the mathematical expression 3 with k starting from -1 and the mathematical expression 6 is a modification of the mathematical expression 4 with k starting from -1.
FOURTH REALIZATION
This embodiment suggests a second method for calculating an ice position of a PDCCH search space in which the following equation is used unlike those used in the first to third embodiments.
MATHEMATICAL EXPRESSION 7 Z<sub>k</sub> = ((A x<sub>k</sub> + B x<sub>k</sub><sup>2</sup>) mod D) mod C
ES 2 653 724 T3
That is, this embodiment suggests generating a Home position value using a quadratic generating equation as shown in mathematical expression 7 as an input value. In this case, the input value can be used both in the method in which a new value is entered for each generation of a subframe value and in the method in which a value generated in a kth generation is used as the value input for a k + 1-th generation.
On the other hand, a preferred embodiment of the present invention suggests that a number, which is 1 greater than the number greater than the initial value can have, (that is, a value that indicates the range of numbers that the initial value can have ), is used as the “D” value in mathematical expression 7.
In the above embodiments, it is assumed that the UE identification information is used as the initial input value. However, another aspect of the present invention suggests that the initial input value be used in various ways to allow efficient PDCCH transmission and detection.
The basic purpose of each embodiment of the present invention is to generate a different value for any specific identification number, which will also be called "ID" for short, and therefore it is preferable to select an initial value that maximizes the randomization effects according to the ID.
Since the purpose of each embodiment of the present invention is to confer PDCCH decoding region scrambling effects between UE and a base station and it is not necessary to take into account scrambling effects between base stations, ID values can be selected to identify UE, such as UE identification numbers (eg, a C-RTNI or a temporary RNTI), as initial values. Specifically, all of the following information items or combinations thereof can be used to create initial values.
1. EU ID
two. CCE Aggregation Level (LCCE)
3. Subframe number (or slot number)
According to the present invention, when a sequence is generated as an ID-dependent random number synchronously with the radio frame timings, Both the method in which a start position value is generated using a different initial value each sub-frame and the method in which a start position value is generated synchronously with the radio frame synchronisms and then can be used. a new ID dependent random number is generated using the generated start position value or intermediate value, as described above.
In the method in which an initial value is entered each sub-frame to generate an ID-dependent random number each sub-frame, the initial value must be changed each sub-frame and a different value must be generated for each UE and therefore , an initial value can be created using a UE ID and a sub-frame number (or a corresponding slot number). It is preferable that the initial value is created such that a number indicating the UE ID and a number indicating the sub-frame do not overlap when the initial value is expressed in binary form.
Figures 8 and 9 illustrate a method for creating a start value used to generate a start position of a PDCCH search space using a UE ID and a sub-frame number according to an embodiment of the present invention.
Specifically, as shown in Figure 8, when the initial value is expressed in binary form, the initial value can be created such that a 16-bit UE ID is placed in least significant bit positions by including a minus bit position. significant bit (LSB) of the binary value and a 4-bit subframe number is placed in most significant bit positions including a most significant bit (MSB) position. The initial value created in this way can be expressed as follows.
MATH EXPRESSION 8 {UE-ID} x 2<sup>0</sup> + {subframe #} x 2<sup>16</sup>
Also, as shown in Figure 9, when the initial value is expressed in binary form, the initial value can be created such that a UE ID is placed in most significant bit positions that include a most significant bit position ( MSB) of the binary value and a subframe number is placed in minus bit positions
ES 2 653 724 T3 significant including a least significant bit (LSB) position. In this case, the initial value can be expressed as follows.
MATH EXPRESSION 9 {UE-ID} x 2<sup>4</sup> + {subframe #} x 2<sup>0</sup>
It is preferable that, when a PDCCH decoding region is randomized, the scrambling effects of each CCE aggregation level are different since the same physical CCE can be used even when different CCE aggregation levels are employed.
Figure 10 illustrates an example where one of two UEs having different CCE aggregation levels does not receive a PDCCH destined for the UE due to a PDCCH destined for the other UE.
A problem can occur if the CCE region for PDCCH decoding is the same for all UEs even though their CCE aggregation levels are different. For example, if a PDCCH decoding region that corresponds to 8 CCE aggregates to transmit a PDCCH to a UE1 must also be used for a UE2 when transmitting the PDCCH to UE1 using the CCE aggregation of 8 CCEs, you may not be able to transmitting a PDCCH to the UE2 since a PDCCH decoding region for transmission to the UE2 is completely covered by the PDCCH using the added 8 CCEs.
To overcome this problem, one embodiment of the present invention suggests generating a different identification dependent randomization number for each level of CCE aggregation. Specifically, the embodiment of the present invention suggests that the information from each CCE aggregation level be incorporated into an initial value used to calculate a start position of a PDCCH search space. That is, a UE ID, a sub-frame number, and a CCE aggregation level can be used to create the initial value.
Figures 11 and 12 illustrate examples where a UE ID, a sub-frame number, and a CCE aggregation level are used to create an initial value in accordance with one embodiment of the present invention.
Specifically, Fig. 11 illustrates an example where the initial value includes a sub-frame number, a CCE aggregation level, and a UE ID in bit positions sequentially from the MSB position to the LSB position and Fig. 12 illustrates an example where the initial value includes a UE ID, a CCE aggregation level and a sub-frame number in bit positions sequentially from the MSB position to the LSB position. These information items can be arranged in any other order, as long as the initial value includes all information items.
Alternatively, when using the initial value generation methods of the first to fifth embodiments described above, an initial value that does not include any sub-frame number can be entered to generate sequences synchronously with the radio frame timings and then can use sequence values generated in each subframe one by one. In this case, the initial value can be created using a combination of the UE ID and the CCE aggregation level information since it is not necessary to incorporate the sub-frame information in the initial value.
Figures 13 and 14 illustrate examples in which an initial value used to calculate a start position of a PDCCH search space is created using a UE ID and a CCE aggregation level in accordance with an embodiment of the present invention.
Although the initial value includes a CCE aggregation level and a UE ID in bit positions sequentially from the MSB to the LSB in the example in Figure 13 and the initial value includes a CCE aggregation level and an ID of UEs in bit positions in reverse order In the example of FIG. 14, the CCE aggregation level and the UE ID can be arranged in any order.
On the other hand, another embodiment of the present invention suggests that each of the constant values A, B and D used in the first to fifth embodiments vary depending on the level of aggregation of CCE. Although the C value is represented by a function of the CCE aggregation level and therefore varies depending on the circumstances, the A, B, and D values are preset constants on the transmit and receive sides. However, in order to generate a different identification dependent randomization number pattern for each CCE aggregation level, the A, B and D values can be set to be different for each CCE aggregation level.
In a special embodiment, constant values can be used, which are fixed regardless of the CCE aggregation level, such as the A and D values used in the first to fourth embodiments while only the value
ES 2 653 724 T3
B is defined to be different for each level of CCE aggregation. This allows a finally obtained sequence to be different for each level of CCE aggregation without significantly changing the characteristics of the generated sequence.
Another possible method is to use only the UE ID as the initial value whereas constant, fixed values are especially used as values A, B and D in the first to fifth embodiments since the C value inherently varies according to the level of aggregation. by CCE. It is not necessary to define values A, B and D that vary according to the level of aggregation of CCE in the previous embodiments since a randomized value is generated to some extent through a modulo operation with the value D and the random number dependent on Finally obtained identification can vary through modulo operation with the C value varying according to the CCE aggregation level.
Reference will now be made in detail to parameter values of the generation equations to obtain a start position of a PDCCH search space according to the first to fifth embodiments described above.
Using a computer, the present inventor found some values of the generator parameters A, B and D that are good for each method. Good values are defined as follows and the present invention suggests the best parameter values for each search criteria described below.
A start position of a PDCCH decoding region to decode is obtained for each CCE aggregation level based on an identification dependent scrambling number. The PDCCH decoding region must be synchronized between the base station and the UEs and the period and timing of generation of an identification dependent scrambling number must also be synchronized between all UEs communicating with the base station. Therefore, the overlap of the PDCCH decoding regions can be minimized if the identification dependent scrambling numbers, which UEs having different UE IDs use each sub-frame, are different. This indicates that even though some identification dependent scrambling numbers are equal between identification dependent scrambling numbers generated with different UE IDs, scrambling effects can be achieved if the identification dependent scrambling numbers are different in only one sub-frame. in which a specific value is used.
In one embodiment of the present invention, the concept of "hit count" is defined as a criterion for determining performance based on each parameter value. Each of the UEs having different UE IDs generates identification dependent scrambling numbers synchronously with radio frames and compares the identification dependent scrambling numbers used in the sub-frames to determine the number of sub-frames they have used. the same value and records the determined number of sub-frames as "number of hits". Therefore, a distribution of the numbers of hits is measured with all other possible UE IDs for each UE ID that can be assigned and the distribution of the numbers of successes determined in a probabilistic way is established when using a specific generation method as a criterion for determining performance.
Figure 15 illustrates the hit count concept used to determine performance when calculating parameter values in accordance with an embodiment of the present invention.
That is, the embodiment of the present invention suggests that since 10 sub-frames are included in a radio frame in LTE 3GPP as shown in Figure 15, the number of possible hits for the sub-frame indices be determined. 0, 1, ..., 10 and the determined number of hits is used as the probability that UEs having two different UE IDs will use the same PDCCH decoding region (ie, as a criterion to determine performance).
On the other hand, an embodiment of the present invention suggests that a distribution map of (a) identification dependent randomization number (s) that can be generated from all the initial input values that can be generated depending on the generation method with specific A, B and D parameters, it is taken into consideration as the second criterion to determine the performance. The identification dependent randomization numbers generated using all the generation methods suggested in the present invention are between 0 and C-1. Therefore, the embodiment of the present invention suggests that a distribution of integer values between 0 and C-1 generated be measured for all the initial values that can be entered and then determine whether or not all the generated values are the same. uniformity possible and that the uniformity of the generated values is then used as a criterion for determining performance.
In this embodiment, the following performance indicators are selected from the performance results. When specific parameters are used in each generation method, the parameters are calculated and compared
ES 2 653 724 T3 following indicators. In this case, the average of the measured values is determined when the C value varies in an Interval from 96 to 3 for each of the Indicators.
1. Maximum number of hits
two. Average number of hits
3. Whether or not ID-dependent randomization numbers have been generated uniformly in an Interval from 0 to C-1
Four. Variance of probabilities that values between 0 and C-1 are generated to determine whether or not ID-dependent randomization numbers have been generated uniformly in an Interval from 0 to C-1
First, parameter values used in the method for generating an ice position of a PDCCH search space according to the first embodiment are described below with reference to the above description.
Various values can be used as constant values A, B and D which are predetermined and used on the transmitting and receiving sides in the generation method according to the first embodiment. Therefore, it is difficult to measure the performance of all possible values of A, B, and D using a computer. Therefore, values of A, B and D that generally exhibited high performance were first confirmed using a computer and a respective performance of specific combinations of A, B, and D was compared based on the confirmed values.
First, the results of the performance measurement using a computer showed that the D value exhibited the highest performance when it was similar to the maximum value that can be expressed by the Initial value x with A and B set at specific values. The results shown in Table 2 are part of the performance measurement results that indicate the probability that the sequences generated for different UE IDs using an Initial value created using only the UE ID according to the first embodiment will be the same in each subplot. The UE ID consists of 16 bits corresponding to 65536 (= 2<sup>16</sup>) values.
TABLE 2
<td colspan="4">Parameters</td><td colspan="11">Probability by number of hits</td>
<td>TO</td><td>B</td><td>c</td><td>D</td><td> 0</td><td> 1</td><td> 2</td><td> 3</td><td> 4</td><td> 5</td><td> 6</td><td> 7</td><td> 8</td><td> 9</td><td> 10</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 65536</td><td> 96,931%</td><td> 0,270%</td><td> 0.613%</td><td> 0.811%</td><td> 0.705%</td><td> 0,431%</td><td> 0,183%</td><td> 0,048%</td><td> 0.007%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 86</td><td> 65536</td><td> 89,560%</td><td> 9.404%</td><td> 0.926%</td><td> 0.088%</td><td> 0.021%</td><td> 0.002%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 76</td><td> 65536</td><td> 89,585%</td><td> 8,162%</td><td> 1,876%</td><td> 0.297%</td><td> 0.062%</td><td> 0.017%</td><td> 0.001%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 65536</td><td> 86,717%</td><td> 11,644%</td><td> 1,464%</td><td> 0.142%</td><td> 0.029%</td><td> 0.005%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 65536</td><td> 90.213%</td><td> 4.439%</td><td> 3.376%</td><td> 1.422%</td><td> 0.404%</td><td> 0,110%</td><td> 0.031%</td><td> 0,005%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 65536</td><td> 81,970%</td><td> 14,810</td><td> 2,822%</td><td> 0.333%</td><td> 0.053%</td><td> 0,012%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 65536</td><td> 82.624%</td><td> 9.787%</td><td> 5.402%</td><td> 1.699%</td><td> 0.384%</td><td> 0.086%</td><td> 0.018%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 65536</td><td> 72,397%</td><td> 18.821%</td><td> 7,045%</td><td> 1,460%</td><td> 0,234%</td><td> 0,039%</td><td> 0.004%</td><td> 0,000%</td><td>O.OOOffc</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 65536</td><td> 93,751%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 6.249%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 65536</td><td> 50,867%</td><td> 4,337%</td><td> 9,753%</td><td>13.OO6Í</td><td> 11.37994</td><td> 6,833%</td><td> 2,844%</td><td> 0,812%</td><td> 0.152%</td><td> 0.015%</td><td> 0,001%</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 65537</td><td> 90,078%</td><td> 9.459%</td><td> 0.444%</td><td> 0.018%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 86</td><td> 65537</td><td> 88,977%</td><td> 10.457%</td><td> 0,542%</td><td> 0.024%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 76</td><td> 65537</td><td> 87,601%</td><td> 11.686%</td><td> 0.681%</td><td> 0.031%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 65537</td><td> 85,830%</td><td> 13,248%</td><td> 0,879%</td><td> 0.043%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 65537</td><td> 83,471%</td><td> 15.281%</td><td> 1.182%</td><td> 0.065%</td><td> 0.001%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 65537</td><td> 80.216%</td><td> 17,964%</td><td> 1,705%</td><td> 0.112%</td><td> 0,004%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 65537</td><td> 75,410%</td><td> 21.668%</td><td> 2,684%</td><td> 0.225%</td><td> 0.013%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 65537</td><td> 67.471%</td><td> 27,239%</td><td> 4.709%</td><td> 0.536%</td><td> 0,045%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 65537</td><td> 52,355%</td><td> 35.182%</td><td> 10.360%</td><td> 1.846%</td><td> 0.241%</td><td> 0.016%</td><td> 0.001%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 65537</td><td> 16,152%</td><td> 32.305%</td><td> 29.049%</td><td>15,530i</td><td> 5.421%</td><td> 1.303%</td><td> 0.216%</td><td> 0,022%</td><td> 0.001%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 131071</td><td> 90,052%</td><td> 9,500%</td><td> 0,443%</td><td> 0,005%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 86</td><td> 131071</td><td> 88,956%</td><td> 10.484%</td><td> 0.552%</td><td> 0.008%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
ES 2 653 724 T3
<td> 4093</td><td> 7</td><td> 76</td><td> 131071</td><td> 87.603%</td><td> 11.667%</td><td> 0.714%</td><td> 0.015%</td><td> 0.001%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 131071</td><td> 85,669%</td><td> 13.150%</td><td> 0,959%</td><td> 0,022%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 131071</td><td> 83.506%</td><td> 15.186%</td><td> 1.268%</td><td> 0.039%</td><td> 0.001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 131071</td><td> 80,272%</td><td> 17.820%</td><td> 1,822%</td><td> 0,082%</td><td> 0,003%</td><td> 0,000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 131071</td><td> 75.448%</td><td> 21.532%</td><td> 2.839%</td><td> 0.173%</td><td> 0.008%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 131071</td><td> 67,563%</td><td> 26.983%</td><td> 4,938%</td><td> 0,478%</td><td> 0,035%</td><td> 0,002%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 131071</td><td> 52,421%</td><td> 34.996%</td><td> 10.518%</td><td> 1,826%</td><td> 0.218%</td><td> 0.002%</td><td> 0.001%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 131071</td><td> 16,152%</td><td> 32,303%</td><td> 29.064%</td><td> 15,505¾</td><td> 5,436%</td><td> 1.305%</td><td> 0,212%</td><td> 0,022%</td><td> 0.001%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 1048576</td><td> 96,933%</td><td> 0.273%</td><td> 0.608%</td><td> 0.810%</td><td> 0.705%</td><td> 0.423%</td><td> 0.181%</td><td> 0,056%</td><td> 0.011%</td><td> 0.001%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 1048576</td><td> 89.526%</td><td> 9.415%</td><td> 0.980%</td><td> 0.075%</td><td> 0.004%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 76</td><td> 1048576</td><td> 89,539%</td><td> 8.158%</td><td> 1.963%</td><td> 0.305%</td><td> 0.032%</td><td> 0.003%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 1048576</td><td> 86.711%</td><td> 11.603%</td><td> 1.538%</td><td> 0.135%</td><td> 0.011%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 1048576</td><td> 90,226%</td><td> 4.407%</td><td> 3.331%</td><td> 1.485%</td><td> 0.448%</td><td> 0.088%</td><td> 0.013%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 1048576</td><td> 81.991%</td><td> 14.739%</td><td> 2.868%</td><td> 0.363%</td><td> 0,037%</td><td> 0,002%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 1048576</td><td> 82.819%</td><td> 9.543%</td><td> 5.299%</td><td> 1.831%</td><td> 0.420%</td><td> 0.076%</td><td> 0.011%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 1048576</td><td> 72,450%</td><td> 18,720%</td><td> 7.031%</td><td> 1.552%</td><td> 0,226%</td><td> 0.020%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 1048576</td><td> 93.751%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 6.249%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 1048576</td><td> 50,673%</td><td> 4.339%</td><td> 9.758%</td><td> 12,995¾</td><td> 11.371¾</td><td> 6,828%</td><td> 2,852%</td><td> 0.815%</td><td> 0.152%</td><td> 0.016%</td><td> 0,001%</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 1048593</td><td> 90,946%</td><td> 7.811%</td><td> 1,145%</td><td> 0.089%</td><td> 0.007%</td><td> 0.001%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 1048593</td><td> 89,008%</td><td> 10,392%</td><td> 0.580%</td><td> 0,020%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 76</td><td> 1048593</td><td> 87,581%</td><td> 11.711%</td><td> 0.690%</td><td> 0,017%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 1048593</td><td> 87,595%</td><td> 9.980%</td><td> 2.141%</td><td> 0,265%</td><td> 0,019%</td><td> 0,001%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 1048593</td><td> 89.444%</td><td> 5.445%</td><td> 3.401%</td><td> 1.315%</td><td> 0.333%</td><td> 0.055%</td><td> 0.006%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 1048593</td><td> 95.658%</td><td> 0.043%</td><td> 0.191%</td><td> 0.509%</td><td> 0,891%</td><td> 1.070%</td><td> 0,892%</td><td> 0,510%</td><td> 0.190%</td><td> 0.041%</td><td> 0,004%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 1048593</td><td> 80,612%</td><td> 12.724%</td><td> 5.202%</td><td> 1.240%</td><td> 0.193%</td><td> 0.021%</td><td> 0.002%</td><td> 0,001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 1048593</td><td> 92,317%</td><td> 0.074%</td><td> 0.337%</td><td> 0.903%</td><td> 1.573%</td><td> 1,892%</td><td> 1.578%</td><td> 0,902%</td><td> 0.338%</td><td> 0.075%</td><td> 0,007%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 1048593</td><td> 52,396%</td><td> 35.073%</td><td> 10.456%</td><td> 1,826%</td><td> 0.225%</td><td> 0.022%</td><td> 0.002%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 1048593</td><td> 66.700%</td><td> 0.325%</td><td> 1.465%</td><td> 3.905%</td><td> 6.836%</td><td> 8,206%</td><td> 6.836%</td><td> 3.904%</td><td> 1.465%</td><td> 0.325%</td><td> 0.032%</td>
<td> 4093</td><td> 7</td><td> 96</td><td> 2097143</td><td> 90,048%</td><td> 9.514%</td><td> 0.425%</td><td> 0,012%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 86</td><td> 2097143</td><td> 88,997%</td><td> 10.412%</td><td> 0.572%</td><td> 0.019%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 76</td><td> 2097143</td><td> 87.614%</td><td> 11.655%</td><td> 0.704%</td><td> 0.027%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 66</td><td> 2097143</td><td> 85,845%</td><td> 13.210%</td><td> 0.911%</td><td> 0,034%</td><td> 0.001%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 56</td><td> 2097143</td><td> 83.487%</td><td> 15.250%</td><td> 1.200%</td><td> 0,063%</td><td> 0,001%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td>
<td> 4093</td><td> 7</td><td> 46</td><td> 2097143</td><td> 80,294%</td><td> 17.816%</td><td> 1.765%</td><td> 0,120%</td><td> 0,005%</td><td> 0.000%</td><td> 0,000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 36</td><td> 2097143</td><td> 75,434%</td><td> 21.612%</td><td> 2.724%</td><td> 0,217%</td><td> 0,013%</td><td> 0,000%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 26</td><td> 2097143</td><td> 67,573%</td><td> 26.986%</td><td> 4.897%</td><td> 0,512%</td><td> 0.031%</td><td> 0.001%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 16</td><td> 2097143</td><td> 52,462%</td><td> 34.907%</td><td> 10.552%</td><td> 1,859%</td><td> 0.206%</td><td> 0.014%</td><td> 0.000%</td><td> 0,000%</td><td> 0.000%</td><td> 0.000%</td><td> 0,000%</td>
<td> 4093</td><td> 7</td><td> 6</td><td> 2097143</td><td> 16,176%</td><td> 32.240%</td><td> 29.086%</td><td> 15,553¾</td><td> 5,420%</td><td> 1.280%</td><td> 0,216%</td><td> 0,027%</td><td> 0.002%</td><td> 0.000%</td><td> 0,000%</td>
As shown in table 2, the probability that a collision will occur (that is, that the UE IDs are equal) in the 10 sub-frames is 6.429% when the D value is equal to an initial value of 2<sup>16</sup> and the C value is 16. However, this phenomenon disappears when the D value is greater than 2<sup>16</sup>. It can be seen from table 2 that the phenomenon disappears when the D value is 65537 or 131071 which are greater than 2<sup>16</sup>. However, such poor performance results occur when a value much greater than 2 is selected<sup>16</sup> as value D. That is, such results occur when value D is 1048576 or 1048593. Although performance increases when value D is 2097143, performance is, on average, less than when using a value that is close to 2<sup>16</sup> and greater than 2<sup>16</sup> as value D.
Based on these facts, one embodiment of the present invention suggests that a prime number greater than 2<sup>N</sup> and less than 2<sup>N + 1</sup> is used as the value of parameter D when the initial value is expressed by N bits. Preferably, the smallest prime number greater than 2 is used<sup>N</sup> as parameter value D. Specifically, one embodiment suggests using a value of 2<sup>16</sup> + 1 as D value when N = 16, use a value of 2<sup>18</sup> + 3 as D value when N = 18 and a value of 2 is used<sup>22</sup> + 15 as the D value when N = 22. The reason why this embodiment suggests using the smallest prime number that meets the performance requirements as the D value is that the simplicity of the phenomenon increases, approaching that of normal phenomena, to as the D value decreases.
Accordingly, an embodiment of the present invention suggests using a value of 65537 as parameter D of the starting position generation equation according to the first embodiment of the present invention when it is assumed that the initial value for the generation equation is generated based on on a 16-bit UE ID.
On the other hand, to select a parameter value of B, a performance was measured using various values of A and various values of B with the D value set to a specific value. Such measurement results showed that the parameter B does not have any significant influence on the variance of the probabilistic distribution of generation of each value between 0 and C-1, the average number of collisions and the maximum number of collisions when the parameters D and A are cousins. Table 3 below shows part of the various performance measurement results.
ES 2 653 724 T3
TABLE 3
<td>TO</td><td>B</td><td>D</td><td>Generation probability variance for each number between 0 and C-1</td><td>Average number of hits</td><td>Maximum number of hits</td>
<td> 32789</td><td> 0</td><td> 1048567</td><td>8.29439756700E-04</td><td>1.31635866660E + 00</td><td> 6</td>
<td> 32789</td><td> 7</td><td> 1048567</td><td>8.29439750350E-04</td><td>1.31635868060E + 00</td><td> 6</td>
<td> 32789</td><td> 3821</td><td> 1048567</td><td>8.29439765480E-04</td><td>1.31635878580E + 00</td><td> 6</td>
<td> 33037</td><td> 0</td><td> 1048567</td><td>8.29439348280E-04</td><td>1.31635500230E + 00</td><td> 7</td>
<td> 33037</td><td> 7</td><td> 1048567</td><td>8.29439329360E-04</td><td>1.31635487980E + 00</td><td> 7</td>
<td> 33037</td><td> 3821</td><td> 1048567</td><td>8.29439315490E-04</td><td>1.31635479360E + 00</td><td> 7</td>
<td> 34421</td><td> 0</td><td> 1048567</td><td>8.29439612880E-04</td><td>1.31635698230E + 00</td><td> 10</td>
<td> 34421</td><td> 7</td><td> 1048567</td><td>8.29439589840E-04</td><td>1.31635668660E + 00</td><td> 10</td>
<td> 34421</td><td> 3821</td><td> 1048567</td><td>8.29439602550E-04</td><td>1.31635693940E + 00</td><td> 10</td>
<td>3S061</td><td> 0</td><td> 1048567</td><td>8.29439625390E-04</td><td>1.31635759420E + 00</td><td> 8</td>
<td> 36061</td><td> 7</td><td> 1048567</td><td>8.29439596140E-04</td><td>1.31635773990E + 00</td><td> 8</td>
<td> 36061</td><td> 3821</td><td> 1048567</td><td>8.29439654740E-04</td><td>1.31635777670E + 00</td><td> 8</td>
<td> 41189</td><td> 0</td><td> 1048567</td><td>8.29441337570E-04</td><td>1.31637294490E + 00</td><td> 6</td>
<td> 41189</td><td> 7</td><td> 1048567</td><td>8.29441321130E-04</td><td>1.31637275310E + 00</td><td> 6</td>
<td> 41189</td><td> 3821</td><td> 1048567</td><td>8.29441026210E-04</td><td>1.31637274940E + 00</td><td> 6</td>
<td> 43789</td><td> 0</td><td> 1048567</td><td>8.29675510000E-04</td><td>1.31860997820E + 00</td><td> 7</td>
<td> 43789</td><td> 7</td><td> 1048567</td><td>8.29674822710E-04</td><td>1.31859473170E + 00</td><td> 7</td>
<td> 43789</td><td> 3821</td><td> 1043567</td><td>8.29673565670E-04</td><td>1.31860202780E + 00</td><td> 7</td>
<td> 47653</td><td> 0</td><td> 1048567</td><td>8.29440200970E-04</td><td>1.31636344580E + 00</td><td> 8</td>
<td> 47653</td><td> 7</td><td> 1048567</td><td>8.29440320540E-04</td><td>1.31636344670E + 00</td><td> 8</td>
<td> 47653</td><td> 3821</td><td> 1048567</td><td>8.29440282120E-04</td><td>1.31636322130E + 00</td><td> 8</td>
Therefore, one embodiment of the present invention suggests setting the parameter values D and A to be prime and setting the parameter value B to a very low integer or 0. The computational complexity can be reduced when the value B is 0. or approaches 0.
Accordingly, a preferred embodiment of the present invention suggests setting the value of parameter B to "0" in the generation equation of the first embodiment.
On the other hand, to select a value of parameter A, performance was measured using an available prime number 15 less than value D while setting value B, which has been determined to have no significant influence on performance, to a specific value and the D value was set to a value that presented a high performance according to the Initial value. The following table 4 shows part of such performance measurement results.
ES 2 653 724 T3
TABLE 4
<td>TO</td><td>B</td><td>D</td><td>Generation probability variance for each number between 0 VC-1</td><td>Average number of hits</td><td>Maximum number of hits</td>
<td> 39827</td><td> 7</td><td> 65537</td><td>8.29439188640E-04</td><td>1.31635211090E + 00</td><td> 6</td>
<td> 34231</td><td> 7</td><td> 65537</td><td>8.29439188930E-04</td><td>1.31635211140E + 00</td><td> 6</td>
<td>4S889</td><td> 7</td><td> 65537</td><td>8.2343S1S9470E-04</td><td>1.31635211190E + 00</td><td> 6</td>
<td> 52289</td><td> 7</td><td> 65537</td><td>8.29439190000E-04</td><td>1.31635211190E + 00</td><td> 6</td>
<td> 55717</td><td> 7</td><td> 65537</td><td>8.2943S1S9710E-04</td><td>1.31635211190E + 00</td><td> 6</td>
<td> 53831</td><td> 7</td><td> 65537</td><td>8.29439189320E-04</td><td>1.31635211190E + 00</td><td> 6</td>
<td> 32993</td><td> 7</td><td> 65537</td><td>8.29439189850E-04</td><td>1.31635211230E + 00</td><td> 6</td>
<td> 50923</td><td> 7</td><td> 65537</td><td>8.29439190530E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 56131</td><td> 7</td><td> 65537</td><td>8.29439190290E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 60889</td><td> 7</td><td> 65537</td><td>8.29439190530E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 63601</td><td> 7</td><td> 65537</td><td>8.29439190390E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 53437</td><td> 7</td><td> 65537</td><td>8.2343S190780E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 40151</td><td> 7</td><td> 65537</td><td>8.29439190530E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 46831</td><td> 7</td><td> 65537</td><td>8.29439190190E-04</td><td>1.31635211280E + 00</td><td> 6</td>
<td> 36011</td><td> 7</td><td> 65537</td><td>8.29439190820E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 64747</td><td> 7</td><td> 65537</td><td>8.29439190630E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 39041</td><td> 7</td><td> 65537</td><td>8.29439190680E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 47509</td><td> 7</td><td> 65537</td><td>8.23433190820E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 34501</td><td> 7</td><td> 65537</td><td>8.29439191160E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 36821</td><td> 7</td><td> 65537</td><td>8.2343S190820E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 42061</td><td> 7</td><td> 65537</td><td>8.29439191210E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 34703</td><td> 7</td><td> 65537</td><td>8.29439190820E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 35863</td><td> 7</td><td> 65537</td><td>8.29439190730E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 47539</td><td> 7</td><td> 65537</td><td>8.29439190870E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 51767</td><td> 7</td><td> 65537</td><td>8.29439190820E-04</td><td>1.31635211330E + 00</td><td> 6</td>
<td> 40627</td><td> 7</td><td> 65537</td><td>3.29439191450E-C4</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 40883</td><td> 7</td><td> 65537</td><td>8.29439191450E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 41011</td><td> 7</td><td> 65537</td><td>8.29439191160E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 44483</td><td> 7</td><td> 65537</td><td>8.29439191310E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 45179</td><td> 7</td><td> 65537</td><td>8.29439191120E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 45523</td><td> 7</td><td> 65537</td><td>8.29439191210E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 58043</td><td> 7</td><td> 65537</td><td>8.29439191160E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 59083</td><td> 7</td><td> 65537</td><td>8.29439191450E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 64499</td><td> 7</td><td> 65537</td><td>8.29439191410E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 41521</td><td> 7</td><td> 65537</td><td>8.29439191210E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 42281</td><td> 7</td><td> 65537</td><td>8.29439191310E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 43577</td><td> 7</td><td> 65537</td><td>8.29439191210E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 45737</td><td> 7</td><td> 65537</td><td>8.29439191450E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 49481</td><td> 7</td><td> 65537</td><td>8.29439191500E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 57041</td><td> 7</td><td> 65537</td><td>8.29439191450E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 34877</td><td> 7</td><td> 65537</td><td>8.29439191410E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 41957</td><td> 7</td><td> 65537</td><td>8.29439191210E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 45389</td><td> 7</td><td> 65537</td><td>3.29439191410E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td> 61851</td><td> 7</td><td> 65537</td><td>8.29439191500E-04</td><td>1.31635211370E + 00</td><td> 6</td>
<td></td><td></td><td></td><td></td><td></td><td></td>
<td> 51977</td><td> 7</td><td> 65537</td><td>8.29439195530E-04</td><td>1.31635211740E + 00</td><td> 9</td>
<td> 61441</td><td> 7</td><td> 65537</td><td>8.29439193350E-04</td><td>1.31635211510E + 00</td><td> 9</td>
<td> 64513</td><td> 7</td><td> 65537</td><td>8.29439196010E-04</td><td>1.31635211790E + 00</td><td> 9</td>
<td> 65521</td><td> 7</td><td> 65537</td><td>8.29439192330E-04</td><td>1.31635211370E + 00</td><td> 9</td>
<td> 34607</td><td> 7</td><td> 65537</td><td>8.29439192670E-04</td><td>1.31635211510E + 00</td><td> 9</td>
<td> 53239</td><td> 7</td><td> 65537</td><td>8.29439196260E-C4</td><td>1.31635211840E + 00</td><td> 9</td>
<td> 63863</td><td> 7</td><td> 65537</td><td>8.29439194270E-04</td><td>1.31635211650E + 00</td><td> 9</td>
ES 2 653 724 T3
Table 4 shows first the values of "A" that present the lowest number of collisions and the remaining values are arranged in decreasing order of the average number of collisions. That is, the value of A located in the upper part of table 4 presents a high performance in terms of performance indicators. Therefore, one embodiment of the present invention suggests using one of the values written above the symbols in Table 4 as the A value. Particularly, a preferred embodiment of the present invention suggests using as A value a value of 39827 written at the top of table 4.
Accordingly, a preferred embodiment of the present invention suggests using the values of 39827, 0 and 65537, respectively, as values of parameters A, B and D of the generation equation according to the first embodiment of the present invention. However, when it is necessary to use other parameter values based on system requirements, values selected from those written in the following table can be used as parameter values A, B, and D.
TABLE 5
<td>TO</td><td>B</td><td>D</td>
<td> 39827,34231, 46889, 52289</td><td> 0, 1, 3, 5, 7</td><td> 2<sup>1O</sup>+1, 2<sup>1s</sup>+3, 2<sup>2U</sup>+7, 2^+15,</td>
The equations for calculating a starting position of a PDCCH search space according to the second to fourth embodiments are substantially identical to those of the first embodiment in terms of their meanings. Accordingly, the present invention suggests also using the values of 39827, 0 and 65537 respectively as values of parameters A, B and D in the second to fourth embodiments. In this case, the values written in Table 5 can be used as parameter values A, B and D when it is necessary to use parameter values other than 39827, 0 and 65537 according to system requirements.
The generation equation parameters used in the fifth embodiment of the present invention can also be determined similarly to the method described above. The present inventor also measured various performance criteria for the parameters of the generation equation of the fifth embodiment and suggests that the following combinations of parameters be used.
TABLE 6
<td>TO</td><td>B</td><td>D</td>
<td> 7</td><td> 16</td><td></td>
<td> 15</td><td> 32</td><td> 2<sup>2U</sup></td>
<td> 31</td><td> 64</td><td> 2<sup>2U</sup></td>
The detailed description of the preferred embodiments of the present invention has been provided to enable those skilled in the art to implement and practice the invention. Although the invention has been described with reference to preferred embodiments, those skilled in the art will appreciate that various modifications and variations can be made to the present invention without departing from the scope of the invention described in the appended claims.
Accordingly, the invention is not to be limited to the specific embodiments described herein, but should be granted the broadest scope in accordance with the principles and novel features disclosed herein.
Industrial applicability
The above embodiments can be applied not only to the LTE 3GPP system but also to various other systems that have to transmit a downlink control channel to each UE.
Contents31
18 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18
63 members in 13 offices
Priority claims15
| Document | Office | Kind | Date |
|---|---|---|---|
| 29576P | United States of America | – | |
| 2957608 | United States of America | P | |
| 2957608 | United States of America | P | |
| 37000P | United States of America | – | |
| 3700008 | United States of America | P | |
| 3700008 | United States of America | P | |
| 20080068633 | Republic of Korea | A | |
| 20080068633 | Republic of Korea | A | |
| 20080068633 | Republic of Korea | – | |
| 20080068633 | – | – | – |
| 29576P | – | – | – |
| 37000P | – | – | – |
| KR20080068633 | – | – | – |
| US20080029576P | – | – | – |
| US20080037000P | – | – | – |
Members63
| Document | Office | Kind | |
|---|---|---|---|
| US2009209247A1 | United States of America | A1 | |
| KR20090089770A | Republic of Korea | A | |
| EP2093953A2 | European Patent Office (EPO) | A2 | |
| CA2715980A1 | Canada | A1 | |
| CA2914887A1 | Canada | A1 | |
| CA3076173A1 | Canada | A1 | |
| WO2009104848A1 | World Intellectual Property Organization (WIPO) | A1 | |
| TW200937894A | Taiwan Province of China | A | |
| KR100943908B1 | Republic of Korea | B1 | |
| CN101946423A | China | A | |
| US7873004B2 | United States of America | B2 | |
| US2011077039A1 | United States of America | A1 | |
| US2011080888A1 | United States of America | A1 | |
| JP2011512769A | Japan | A | |
| EP2093953A3 | European Patent Office (EPO) | A3 | |
| US8014769B2 | United States of America | B2 | |
| US8019332B2 | United States of America | B2 | |
| US2011274005A1 | United States of America | A1 | |
| US2011274079A1 | United States of America | A1 | |
| EP2464065A2 | European Patent Office (EPO) | A2 | |
| US8213377B2 | United States of America | B2 | |
| EP2464065A3 | European Patent Office (EPO) | A3 | |
| US8270363B2 | United States of America | B2 | |
| TWI387238B | Taiwan Province of China | B | |
| US2013044605A1 | United States of America | A1 | |
| EP2093953B1 | European Patent Office (EPO) | B1 | |
| EP2592779A2 | European Patent Office (EPO) | A2 | |
| ES2406419T3 | Spain | T3 | |
| CN101946423B | China | B | |
| JP5291125B2 | Japan | B2 | |
| EP2592779A3 | European Patent Office (EPO) | A3 | |
| US8717904B2 | United States of America | B2 | |
| EP2464065B1 | European Patent Office (EPO) | B1 | |
| US2014219224A1 | United States of America | A1 | |
| ES2519767T3 | Spain | T3 | |
| EP2809026A1 | European Patent Office (EPO) | A1 | |
| HK1204729A1 | Hong Kong, China | A1 | |
| CA2715980C | Canada | C | |
| US9451605B2 | United States of America | B2 | |
| US2016381668A1 | United States of America | A1 | |
| EP2592779B1 | European Patent Office (EPO) | B1 | |
| US9814033B2 | United States of America | B2 | |
| US2018035414A1 | United States of America | A1 | |
| ES2653724T3This record | Spain | T3 | |
| NO2592779T3 | Norway | T3 | |
| EP3301849A1 | European Patent Office (EPO) | A1 | |
| PL2592779T3 | Poland | T3 | |
| US10123321B2 | United States of America | B2 | |
| US2019029008A1 | United States of America | A1 | |
| HK1253349A1 | Hong Kong, China | A1 | |
| EP3301849B1 | European Patent Office (EPO) | B1 | |
| EP3584986A1 | European Patent Office (EPO) | A1 | |
| PL3301849T3 | Poland | T3 | |
| ES2753801T3 | Spain | T3 | |
| US10624081B2 | United States of America | B2 | |
| HUE046840T2 | Hungary | T2 | |
| US2020229160A1 | United States of America | A1 | |
| CA2914887C | Canada | C | |
| US11032814B2 | United States of America | B2 | |
| US2021266884A1 | United States of America | A1 | |
| CA3076173C | Canada | C | |
| EP3584986B1 | European Patent Office (EPO) | B1 | |
| ES2960523T3 | Spain | T3 |
Numbers
- Publication
- 2653724
- Publication, DOCDB
- 2653724
- Publication, EPODOC
- ES2653724T
- Application
- 13154720
- Application, DOCDB
- 13154720
- Application, EPODOC
- ES20130154720T
Titles2
- Spanish
- Método para transmitir y recibir información de control a través de PDCCH
- English
- Method for transmitting and receiving control information through PDCCH
Classification
- CPC, 12
- H04L5/0007
- H04W72/23
- H04L5/0037
- H04L5/0053
- H04L27/2647
- H04L27/2666
- H04W48/12
- H04W88/02
- H04L27/2656
- H04L27/2626
- H04W88/08
- H04W24/08
- IPC, 4
- H04L5 00
- H04W48 12
- H04L27 26
- H04W88 02