WO2013139011A1 - Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante - Google Patents

Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante Download PDF

Info

Publication number
WO2013139011A1
WO2013139011A1 PCT/CN2012/072727 CN2012072727W WO2013139011A1 WO 2013139011 A1 WO2013139011 A1 WO 2013139011A1 CN 2012072727 W CN2012072727 W CN 2012072727W WO 2013139011 A1 WO2013139011 A1 WO 2013139011A1
Authority
WO
WIPO (PCT)
Prior art keywords
pdcch
cce
different
cces
candidate
Prior art date
Application number
PCT/CN2012/072727
Other languages
English (en)
Chinese (zh)
Inventor
王轶
张元涛
周华
Original Assignee
富士通株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 富士通株式会社 filed Critical 富士通株式会社
Priority to PCT/CN2012/072727 priority Critical patent/WO2013139011A1/fr
Priority to CN201280061630.9A priority patent/CN103988563B/zh
Publication of WO2013139011A1 publication Critical patent/WO2013139011A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows

Definitions

  • the present invention relates to a wireless communication technology, and more particularly to a mapping method and apparatus for a search space of a downlink control channel in an LTE (Long Term Evolution) / LTE-A (LTE-Advanced) system.
  • LTE Long Term Evolution
  • LTE-A Long Term Evolution-Advanced
  • ICIC Inter-Cell Interference Coordination
  • MBSFN Multicast Broadcast Single Frequency Network
  • Desired features include the ability to schedule frequency selection and the ability to mitigate inter-cell interference.
  • the E-PDCCH Enhanced-PDCCH, Enhanced PDCCH
  • a traditional PDSCH Physical Downlink Shared Channel
  • the UE blindly detects its E-PDCCH in the area allocated by the network side. This area can be semi-statically configured through high-level signaling or dynamically configured through Layer 1 signaling.
  • E-PDCCH there are mainly two mapping schemes, namely, local mapping and distributed mapping. For local mapping, it is desirable to obtain a frequency selective scheduling gain and a frequency selective beamforming gain, that is, an eNB (base station) can transmit an E-PDCCH on a subcarrier having a better channel response.
  • the search space includes a plurality of candidate locations with different Aggregation Levels, as shown in Table 1, for each of the aggregation levels, multiple candidate locations are configured.
  • Such as How to map multiple candidate locations onto the search space to obtain frequency selective scheduling gain or frequency diversity gain is very important for E-PDCCH.
  • C-RNTI Cell Radio Network Temporary Identifier
  • the starting point of the search space of each UE can be determined using the UE-specific parameters.
  • the parameter Y k is only related to the number of subframes and the C-RNTI, there is no guarantee that the search space includes subcarriers having good channel quality. Therefore, the frequency scheduling gain cannot be obtained.
  • the E-PDCCH resource In order for the UE to obtain the frequency scheduling gain, the E-PDCCH resource should be configured or dynamically configured through UE-specific high layer signaling. If the E-PDCCH resources are configured by higher layer signaling, it is important to design the search space to support at least one candidate location on the carrier with better channel quality. If the existing search space function is reused, multiple candidate locations are mapped onto adjacent subcarriers, for example, 4 candidate locations are mapped onto the same resource block, which may limit all candidate locations of the E-PDCCH to experience The same channel fading, therefore, the frequency scheduling gain cannot be obtained.
  • An object of the embodiments of the present invention is to provide a mapping method and apparatus for searching a downlink control channel to obtain a frequency selective scheduling gain.
  • a mapping plane of a search space of a downlink control channel includes:
  • Each candidate location of the PDCCH is mapped to a time-frequency resource corresponding to the search space by using a resource block (RB) as an interval.
  • RB resource block
  • a base station for performing mapping of a search space of a downlink control channel, where the base station includes:
  • a determining unit that determines a search space allocated for a downlink control channel (PDCCH) according to a resource allocation manner; and a mapping unit that maps each candidate location (candidate) of the PDCCH to the search space by using a resource block RB as an interval On the time-frequency resources.
  • PDCCH downlink control channel
  • a computer readable program wherein, when the program is executed in a base station, the program causes a computer to perform a mapping method of a search space of a downlink control channel described above in the base station .
  • a storage medium storing a computer readable program, wherein the computer readable program causes a computer to perform a mapping method of a search space of a downlink control channel described above in a base station.
  • the beneficial effects of the embodiments of the present invention are as follows:
  • the frequency selective scheduling gain is obtained by mapping different candidates of the PDCCH into different RBs, thereby improving the performance of the PDCCH.
  • FIG. 1 is a flowchart of a method for mapping a search space of a downlink control channel according to an embodiment of the present invention
  • Figure 3 is a schematic diagram of another embodiment of mapping using equation (1) or equation (2);
  • Figure 4 is a schematic diagram of one embodiment of mapping using equation (3);
  • Figure 5 is a schematic diagram of one embodiment of mapping using equation (4)
  • Figure 6 is a schematic diagram of one embodiment of mapping using equation (5);
  • FIG. 7 is a schematic diagram of the composition of a base station according to an embodiment of the present invention. detailed description
  • the embodiments of the present invention are PDCCH (hereinafter referred to as PDCCH or new PDCCH or E-PDCCH) transmitted in the PDSCH region in the LTE-A system.
  • PDCCH PDCCH
  • E-PDCCH E-PDCH
  • the mapping of the search space is described as an example, but it can be understood that the embodiment of the present invention is not limited to the above system, and is applicable to other systems or scenarios involving mapping of the search space of the PDCCH.
  • FIG. 1 is a flow chart of the method. Referring to Figure 1, the method includes:
  • Step 101 Determine a search space allocated for a downlink control channel (PDCCH) according to a resource allocation manner.
  • Step 102 Map, by using resource blocks (RBs), candidate locations of the PDCCH to the search space. On the time-frequency resources.
  • RBs resource blocks
  • the PDCCH is used to carry downlink control information (DCI, Downlink Control Information), and the control channel element (CCE, Control Channel Element) is configured as a minimum unit.
  • DCI Downlink Control Information
  • CCE Control Channel Element
  • one PDCCH may be L.
  • the CCE is composed of L. The value ranges from 1, 2, 4, and 8. It indicates the different aggregation levels of the PDCCH.
  • the L CCEs may be in the M w positions. Send on.
  • the resource allocation manner is, for example, typeO, typel, type2, etc., and according to different resource allocation manners, the search space allocated for the PDCCH may be determined.
  • the resource allocation method of type O six RBGs (Resource Block Groups) are allocated to the PDCCH.
  • the length of the RBG is different according to different system bandwidths, for example, the system bandwidth is 10 MHz, and the RBG size is 3.
  • the RBs are equivalent to allocating 18 RBs to the PDCCH.
  • three RBGs are allocated to the PDCCH. If the system bandwidth is 10 MHz and the RGB size is 3 RBs, it is equivalent to assigning 9 RBs to the PDCCH.
  • each RB is allocated to the PDCCH.
  • the resource allocation mode is configured by the system and can be reported to the user through high-level signaling.
  • Each RB may include multiple CCEs.
  • each RB includes four CCEs as an example.
  • resource allocation modes are only examples, and the embodiments of the present invention are not limited thereto.
  • new resource allocation modes such as the RB-level bitmap mode, may occur.
  • the method of the embodiment of the present invention can also be used in this resource allocation mode.
  • each candidate position of the E-PDCCH is mapped to the allocated E-PDCCH resource by using the step size of the newly defined unit (for example, in steps of RB) to obtain frequency selection.
  • Schedule the gain That is, different candidate locations of the PDCCH are allocated to different time-frequency resources as much as possible, and different parts of one candidate location are allocated to adjacent time-frequency resources.
  • the number M (RB) of RBs of the search space allocated for the PDCCH is not smaller than the number M w of candidate positions of the PDCCH, that is, ⁇ ( ⁇ ) ⁇ ( then each candidate location of the PDCCH ) Mapping to different RBs of time-frequency resources corresponding to the search space.
  • the first PDCCH in the M ( RB) candidate locations are mapped to different RBs of the time-frequency resource corresponding to the search space, and the remaining candidate locations are mapped to different RBs of the time-frequency resource corresponding to the search space according to the cyclic shift.
  • the number of candidate positions M (L ⁇ ) of the PDCCH is 6, and M (RB) ⁇ M (L) is satisfied, that is, the number of RBs allocated for the PDCCH is insufficient to drop all candidate positions of the PDCCH, and then 4 candidates are received first.
  • the locations are mapped into the four RBs, and the remaining two candidate locations are mapped into the first RB and the second RB according to the cyclic shift.
  • the starting point of the candidate position of the PDCCH may be located in the same RB, or may be located in different RBs.
  • the candidate locations of the PDCCH may be mapped to different CCE sequence numbers in different RBs, or may be mapped to the same CCE sequence number location in different RBs. That is, each candidate location of the PDCCH mapped to a different RB is the same or different in position of the CCEs on the different RBs.
  • the second candidate location of the PDCCH may be mapped to the fourth CCE of the second RB, or may be mapped to On the other CCEs of the second RB, for example, on the first CCE; for the same reason, the third candidate location of the PDCCH may be mapped to the fourth CCE of the third RB, or may be mapped to the third RB.
  • the fourth candidate location of the PDCCH may be mapped to the fourth CCE of the fourth RB, or may be mapped to other CCEs of the fourth RB, for example On the third CCE. And so on.
  • the case of the above “same” may be that the M (RB) candidate positions of the PDCCH have the same CCE position on each RB, and the remaining candidate positions are in the respective RBs.
  • the location of the CCE is the same.
  • the case of the above “different” may be that the M (RB) candidate positions of the PDCCH have different CCE positions on the respective RBs, and the remaining candidate positions have different CCE positions on the respective RBs.
  • the case of the above “same” may be that the positions of the CCEs on the respective RBs of the candidate positions of the PDCCH are the same.
  • the candidate positions of the number of CCEs included in one RB may be a group, and the candidate locations in the group have different CCE positions on the respective RBs, and may not be grouped.
  • Candidate location, its location on the CCE on each RB is not Same.
  • M (RB) is 8
  • M w is 6, and one RB includes 4 CCEs, and the positions of the first 4 candidate positions on 4 RBs are different, and the last 2 candidate positions cannot be divided into one group. Then the positions of the two candidate locations are different on the other two RBs.
  • CCEs Control Channel Elements
  • the candidate locations of the PDCCH are located in different RBs for different aggregation levels, and for different RBs, the candidate locations of the PDCCH are mapped to the same CCE sequence location in different RBs:
  • the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space may be determined according to the following formula:
  • the PDCCH can also be determined according to the following formula
  • N CCE — RB is the number of CCEs in an RB
  • X k is a UE-specific parameter configured by the upper layer, which is used to distinguish the starting position of different users in the E-PDCCH resource.
  • L 1
  • L 1
  • X k l
  • FIG. 2 is a schematic diagram of mapping of a search space of a PDCCH according to an embodiment of the present invention.
  • the mapping result shown in Fig. 2 can be realized.
  • the six candidate positions are mapped in the RB step to the four RBs corresponding to the physical time-frequency resource, and the number on the 10 MHz (50 RB) bandwidth shown in FIG. 2 is 0, 3. , 6, RB within RB.
  • the CCEs (candidate positions) numbered 2, 3, 4, and 5 are first mapped into different RBs, and then, according to the cyclic displacement, the numbers are 6, 7
  • the CCE (candidate location) is mapped to the corresponding RB, where the RB refers to the RB corresponding to the physical resource.
  • the CCE numbered 2 is mapped to the RB of the physical time-frequency resource numbered 0, and the CCE numbered 3 is mapped to the RB of the physical time-frequency resource number 3.
  • the CCE is mapped to the RB of the physical time-frequency resource number 6.
  • the CCE numbered 5 is mapped to the RB of the physical time-frequency resource number 48, and the number is 6 CCEs mapped to the physical time-frequency resource number.
  • the CCE numbered 7 is mapped into the RB of the physical time-frequency resource number 3.
  • each candidate location has the same location on the CCE in each RB.
  • the CCEs numbered 2, 3, 4, and 5 are mapped to the third CCE of each RB.
  • the CCEs numbered 6,7 are mapped to the 4th CCE of each RB.
  • the PDCCH is composed of 2 CCEs.
  • each candidate location corresponds to 2 CCEs.
  • X k 2
  • 12 CCEs (logical time-frequency resources) starting from the fifth CCE (numbered 4) correspond to 6 candidate locations of the PDCCH.
  • the six candidate locations are mapped into the four RBs corresponding to the physical time-frequency resources by using the RB step size, and the physical time-frequency resources corresponding to the number shown in FIG. 2 are 0, 3, 6, Within 48 RB.
  • the frequency resource is numbered 3 in RB)
  • M (RB) ⁇ M (L) is satisfied the numbers are (4, 5), (6, 7), (8, 9), (10, 11)
  • the CCE (candidate position) is mapped into different RBs, and the CCEs (candidate positions) numbered (12, 13) and (14, 15) are mapped into the corresponding RBs according to the cyclic displacement.
  • the position of the CCEs in each RB is the same for each candidate location, as shown in FIG. 2, the candidate locations are numbered (4, 5), (6, 7), (8, 9), (10, 11). Both the first and second CCEs occupying each RB, and the candidate positions numbered (12, 13) and (14, 15) are the 3rd and 4th CCEs occupying each RB.
  • the PDCCH is composed of 4 CCEs.
  • each candidate location corresponds to 4 CCEs.
  • X k 2
  • 8 CCEs starting from the ninth CCE 8 CCEs starting from the ninth CCE (numbered 8) correspond to 2 candidate locations of the PDCCH.
  • the two candidate locations are mapped into two RBs of the physical time-frequency resource in steps of RB.
  • the RBs (numbers 0, 3, 6, 48) corresponding to the physical time-frequency resources to which the candidate locations of the PDCCH are mapped are also exemplified, and the embodiment is not limited thereto.
  • the mapping of candidate positions of the PDCCH shown in Fig. 2 can be realized by the above formula (1) or formula (2), that is, the CCE to which each candidate position of the PDCCH is mapped can be determined.
  • the mapping of the formula (1) or the formula (2) at least one candidate position is allocated in each RB, and at most two candidate positions are allocated.
  • FIG. 3 is a schematic diagram of mapping of a search space of a PDCCH according to another embodiment of the present invention.
  • the mapping result shown in Fig. 3 can be realized.
  • N CCE 32, that is, eight RBs are allocated for the PDCCH, and a total of 32 CCEs are numbered from 0 to 31.
  • the 6 CCEs (candidate locations) of 6, 7, and 8 are mapped to the 6 RBs corresponding to the physical time-frequency resources, and the starting point of the candidate location (that is, the CCE of the number 3) is located in the first corresponding to the physical time-frequency resource.
  • the six candidate positions are mapped in the RB step to the eight RBs corresponding to the physical time-frequency resources. Since the starting points of the candidate positions are located in different RBs for different 1 ⁇ , the loop is followed.
  • the method of shifting, the first candidate location (CCE numbered 6,7) is mapped to the second RB (#2) corresponding to the physical time-frequency resource, and so on, numbered (8, 9),
  • the CCEs (candidate positions) of (10,11), (12,13), (14,15), and (16,17) are respectively mapped to the numbers corresponding to the physical time-frequency resources: #3, #4, #5, #6, #7 in the RB (CCE positions are the same, are the 3rd, 4th CCE).
  • the PDCCH is composed of 4 CCEs.
  • 8 CCEs starting from the thirteenth CCE correspond to 2 candidate locations of the PDCCH.
  • the two candidate locations are mapped to the two RBs corresponding to the physical time-frequency resource by using the RB step, and the starting point of the candidate location is mapped to the fourth RB corresponding to the physical time-frequency resource.
  • each candidate location corresponds to 4 CCEs, one candidate location fills the entire RB.
  • the RBs of numbers #1 ⁇ #6 are not necessarily continuous on the corresponding physical time-frequency resources, for example, may also be discretely distributed as shown in FIG. 2.
  • the consecutive numbers are given in Figure 3 to illustrate that the starting points of the candidate locations of the PDCCH are located in different RBs at different aggregation levels.
  • the same situation exists, for example, the first RB (#1), the second RB (#2), the third RB (#3), and the fourth called the physical time-frequency resource.
  • the RB (#4) and the like have the same meanings as the embodiment of Fig. 3 and will not be explained one by one.
  • the candidate locations of the PDCCH are located in the same RB for different aggregation levels, and for different RBs, the candidate locations of the PDCCH are mapped to the same CCE sequence location in different RBs:
  • the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space may be determined according to the following formula:
  • N CCE — RB is the number of CCEs in an RB
  • X k is a UE-specific parameter configured in a higher layer, which is used to distinguish different users.
  • FIG. 4 is a schematic diagram of mapping of a search space of a PDCCH according to an embodiment of the present invention.
  • the mapping result shown in Fig. 4 can be realized.
  • the starting point of the candidate position of the PDCCH is located in the same RB.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered 2 is mapped into the first RB of the physical time-frequency resource.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (4, 5) is also located in the first RB of the physical time-frequency resource.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (8, 9, 10, 11) is also located in the first RB of the physical time-frequency resource.
  • the candidate locations of the PDCCH are located in different RBs for different aggregation levels, and for different RBs, the candidate locations of the PDCCH are mapped to different CCE sequence numbers in different RBs:
  • the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space may be determined according to the following formula:
  • N CCE – RB is the number of CCEs in an RB
  • FIG. 5 is a schematic diagram of mapping of a search space of a PDCCH according to an embodiment of the present invention.
  • the mapping result shown in Fig. 5 can be realized.
  • the candidate positions of the PDCCH are mapped to different CCE sequence numbers.
  • the starting point of the candidate position of the PDCCH is located in different RBs, and for different RBs, the candidate positions of the PDCCH are mapped to different CCE sequence numbers. .
  • the starting point of the candidate position of the PDCCH that is, the CCE mapping numbered 2 Within the first RB of the physical time-frequency resource
  • the location of each candidate location of the PDCCH is different in each RB.
  • the CCE numbered 2 is located in the third CCE of the first RB of the physical time-frequency resource.
  • the location, the CCE numbered 3 is located at the fourth CCE location of the second RB of the physical time-frequency resource, and the CCE numbered 4 is located at the location of the first CCE of the third RB of the physical time-frequency resource, number
  • the CCE of 5 is located at the second CCE of the fourth RB of the physical time-frequency resource, and the CCEs numbered 6 and 7 are mapped according to the cyclic shift, and the CCE numbered 6 is located at the first of the physical time-frequency resources.
  • the location of the fourth CCE of the RB, the CCE numbered 7 is located at the location of the first CCE of the second RB of the physical time-frequency resource.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (4, 5) is located in the second RB of the physical time-frequency resource, however, each candidate position of the PDCCH is in each RB.
  • the location is different.
  • the CCE numbered (4, 5) is located at the first and second CCEs of the second RB of the physical time-frequency resource
  • the CCE numbered (6, 7) is located at the third RB of the physical time-frequency resource.
  • the location of the 3rd and 4th CCEs, the CCE numbered (8,9) is located at the 1st and 2nd CCEs of the fourth RB, and the CCE numbered (10, 11) is located at the physical time-frequency resource.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (8, 9, 10, 11) is located in the third RB of the physical time-frequency resource, since each candidate position corresponds to 4
  • the CCE corresponding to one candidate location has already occupied the entire RB, and there is no "the location of each candidate location of the PDCCH is different in each RB".
  • the candidate locations of the PDCCH are located in the same RB for different aggregation levels, and the candidate locations of the PDCCH are mapped to different CCE sequence numbers in different RBs for different RBs:
  • the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space may be determined according to the following formula:
  • N CCE RB is the number of CCEs in an RB
  • X k is a UE-specific parameter configured in a higher layer, which is A parameter used to distinguish the starting point positions of different users in the E-PDCCH resource, the meaning of which is as described above, and is not described here
  • i 0, ⁇ , L-1, L is the aggregation level
  • N CCE is The total number of CCEs configured by the E-PDCCH.
  • FIG. 6 is a schematic diagram of mapping of a search space of a PDCCH according to an embodiment of the present invention. This embodiment is based on
  • the start point of the candidate position of the PDCCH is located in the same RB, and for different RBs, the candidate positions of the PDCCH are mapped to different CCE sequence numbers. .
  • the candidate positions of the PDCCH are mapped to different CCE sequence numbers.
  • the starting point of the candidate position of the PDCCH is located in the same RB.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered 2 is mapped to the first RB of the physical time-frequency resource, and the positions of the candidate positions of the PDCCH in each RB are located. Similar to FIG. 5, the description is omitted here.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (4, 5) is also located in the first RB of the physical time-frequency resource, and each candidate position of the PDCCH is in each RB.
  • the position is similar to that of FIG. 5, and the description is omitted here.
  • the starting point of the candidate position of the PDCCH that is, the CCE numbered (8, 9, 10, 11) is also located in the first RB of the physical time-frequency resource.
  • the UE-specific parameters Xk are variable for different subframes. It can also be seen from the above embodiments that if the aggregation level is not greater than the number of control channel elements (CCEs) within each RB, that is, L ⁇ 4, all CCEs of one candidate location of the PDCCH are mapped to the same Within the RB.
  • CCEs control channel elements
  • the method of an embodiment may further comprise the following steps:
  • Step 103 RB configuration and RB within the search space allocated for the downlink control channel (PDCCH) The sequence number of the CCE is sent to the UE.
  • PDCCH downlink control channel
  • the transmission method is not limited.
  • the RB and/or CCE sequence number of the UE may be configured through higher layer signaling.
  • the method of the embodiment of the present invention maps different candidate locations of the PDCCH into different RBs, and obtains a frequency selective scheduling gain, thereby improving the transmission performance of the PDCCH.
  • the present invention also provides a base station, as described in the following embodiment 2.
  • the principle of the problem solved by the base station is similar to the mapping method of the search space of the downlink control channel of the embodiment 1. Therefore, the specific implementation may refer to the embodiment. The implementation of the method of 1 will not be repeated here.
  • the embodiment of the invention provides a base station for performing mapping of a search space of a downlink control channel.
  • FIG. 7 is a schematic diagram of the composition of the base station. Referring to FIG. 7, the base station includes:
  • a determining unit 701 which determines a search space allocated for a downlink control channel (PDCCH) according to a resource allocation manner;
  • the mapping unit 702 maps each candidate candidate of the PDCCH to the time-frequency resource corresponding to the search space by using the resource block RB as an interval.
  • the mapping unit 702 maps each candidate location of the PDCCH to a time-frequency corresponding to the search space when the number M (RB) of RBs of the search space allocated for the PDCCH is not less than the number M w of the candidate locations. Within the different RBs of the resource.
  • the mapping unit maps the start point of the candidate location of the PDCCH into a different RB or maps into the same RB.
  • the mapping unit maps each candidate location of the PDCCH to a location of a different CCE of each RB, or to a location of the same CCE of each RB.
  • the mapping unit maps a start point of a candidate location of the PDCCH to a different RB for different aggregation levels, and for different RBs, the mapping unit uses each candidate of the PDCCH
  • the mapping unit 702 may determine the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space according to the following formula:
  • N CCE — RB is the number of CCEs in an RB;
  • X k is a UE-specific parameter configured in a higher layer;
  • i 0, ⁇ , L1, L are aggregation levels, and
  • N CCE is the total number of CCEs configured for E-PDCCH .
  • the mapping unit maps a start point of a candidate location of the PDCCH to a different RB for different aggregation levels, and for different RBs, the mapping unit uses each candidate of the PDCCH
  • the mapping unit 702 may also determine the CCE of the mth candidate location of the PDCCH on the time-frequency resource corresponding to the search space according to the following formula:
  • N CCE — RB is the number of CCEs in an RB;
  • X k is a UE-specific parameter configured in a higher layer;
  • i 0, ⁇ , L1, L are aggregation levels, and
  • N CCE is the total number of CCEs configured for E-PDCCH .
  • the mapping unit maps a start point of a candidate location of the PDCCH to a different RB for different aggregation levels, and for different RBs, the mapping unit uses each candidate of the PDCCH
  • the mapping unit 702 may determine, according to the following formula, the CCEs of the mth candidate locations of the PDCCH on the time-frequency resources corresponding to the search space:
  • N CCE — RB is The number of CCEs in an RB;
  • X k is a UE-specific parameter configured in a higher layer;
  • N CCE is the total number of CCEs configured for the E-PDCCH.
  • the mapping unit maps a start point of a candidate location of the PDCCH to the same RB for different aggregation levels, and for different RBs, the mapping unit uses each candidate of the PDCCH
  • the mapping unit maps a start point of a candidate location of the PDCCH to the same RB for different aggregation levels, and for different RBs, the mapping unit uses each candidate of the PDCCH
  • the mapping unit 702 may determine, according to the following formula, the CCEs of the mth candidate locations of the PDCCH on the time-frequency resources corresponding to the search space:
  • N CCE — RB is the number of CCEs in an RB
  • X k is a UE-specific parameter configured in a higher layer
  • the aggregation level is not greater than the number of Control Channel Elements (CCEs) within each RB, all CCEs of one candidate location of the PDCCH are mapped into the same RB.
  • CCEs Control Channel Elements
  • the UE-specific parameters Xk are variable for different subframes.
  • the base station may further include:
  • the sending unit 703 sends the RB configuration of the search space allocated for the downlink control channel (PDCCH) and the sequence number of the CCE in the RB to the UE.
  • PDCCH downlink control channel
  • the base station of the present embodiment maps different candidate locations of the PDCCH to the corresponding RBs, and obtains a frequency selective scheduling gain, thereby improving the transmission performance of the PDCCH.
  • the embodiment of the present invention further provides a computer readable program, wherein when the program is executed in a base station, the program causes the computer to perform the mapping method of the search space of the downlink control channel described in Embodiment 1 in the base station .
  • the embodiment of the present invention further provides a storage medium storing a computer readable program, wherein the computer readable program causes a computer to perform a mapping method of a search space of a downlink control channel according to Embodiment 1 in a base station.
  • the above apparatus and method of the present invention may be implemented by hardware, or may be implemented by hardware in combination with software.
  • the present invention relates to a computer readable program that, when executed by a logic component, enables the logic component to implement the apparatus or components described above, or to cause the logic component to implement the various methods described above Or steps.
  • Logic components such as field programmable logic components, microprocessors, processors used in computers, and the like.
  • the invention also relates to A storage medium for storing the above programs, such as a hard disk, a magnetic disk, a compact disk, a DVD, a flash memory, or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Dans ses modes de réalisation, la présente invention se rapporte à un procédé et à un dispositif adaptés pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante (PDCCH). Le procédé selon l'invention consiste : à déterminer, sur la base d'un procédé d'allocation de ressources, un espace de recherche alloué à un PDCCH; et, séparées par un bloc de ressource (RB), à mettre en correspondance chaque position candidate (la candidate) du PDCCH par rapport à une ressource temps-fréquence correspondant à l'espace de recherche. Selon le procédé et le dispositif décrits dans les modes de réalisation de la présente invention, différentes candidates du PDCCH sont mises en correspondance par rapport à différents RB. Cela permet d'obtenir un gain de programmation avec sélectivité de fréquence, et d'améliorer ainsi les performances du PDCCH.
PCT/CN2012/072727 2012-03-21 2012-03-21 Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante WO2013139011A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2012/072727 WO2013139011A1 (fr) 2012-03-21 2012-03-21 Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante
CN201280061630.9A CN103988563B (zh) 2012-03-21 2012-03-21 下行控制信道的搜索空间的映射方法和装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/072727 WO2013139011A1 (fr) 2012-03-21 2012-03-21 Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante

Publications (1)

Publication Number Publication Date
WO2013139011A1 true WO2013139011A1 (fr) 2013-09-26

Family

ID=49221811

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/072727 WO2013139011A1 (fr) 2012-03-21 2012-03-21 Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante

Country Status (2)

Country Link
CN (1) CN103988563B (fr)
WO (1) WO2013139011A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020143286A1 (fr) * 2019-01-11 2020-07-16 中兴通讯股份有限公司 Procédé et dispositif pour une transmission de canal de commande de liaison descendante et support de stockage

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113115462A (zh) * 2016-08-11 2021-07-13 三星电子株式会社 下一代蜂窝网络中的数据传输的方法和装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102215507A (zh) * 2010-04-02 2011-10-12 中兴通讯股份有限公司 下行控制信道的检测方法和系统
US20110249633A1 (en) * 2010-04-07 2011-10-13 Samsung Electronics Co., Ltd. Method of transmitting and receiving control information based on spatial-multiplexing gain
US20110274066A1 (en) * 2008-11-04 2011-11-10 Nortel Networks Limited Providing a downlink control structure in a first carrier to indicate control information in a second, different carrier
CN102256358A (zh) * 2011-07-08 2011-11-23 电信科学技术研究院 一种数据传输和接收方法、装置及系统
CN102355732A (zh) * 2011-08-12 2012-02-15 电信科学技术研究院 一种下行控制信息传输方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8989208B2 (en) * 2009-04-30 2015-03-24 Qualcomm Incorporated PDCCH search space design for LTE-A multi-carrier operation
KR101868622B1 (ko) * 2010-06-17 2018-06-18 엘지전자 주식회사 R-pdcch 전송 및 수신 방법과 그 장치
CN102368871B (zh) * 2011-11-10 2014-06-04 电信科学技术研究院 一种pdcch资源的配置应用方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110274066A1 (en) * 2008-11-04 2011-11-10 Nortel Networks Limited Providing a downlink control structure in a first carrier to indicate control information in a second, different carrier
CN102215507A (zh) * 2010-04-02 2011-10-12 中兴通讯股份有限公司 下行控制信道的检测方法和系统
US20110249633A1 (en) * 2010-04-07 2011-10-13 Samsung Electronics Co., Ltd. Method of transmitting and receiving control information based on spatial-multiplexing gain
CN102256358A (zh) * 2011-07-08 2011-11-23 电信科学技术研究院 一种数据传输和接收方法、装置及系统
CN102355732A (zh) * 2011-08-12 2012-02-15 电信科学技术研究院 一种下行控制信息传输方法及装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020143286A1 (fr) * 2019-01-11 2020-07-16 中兴通讯股份有限公司 Procédé et dispositif pour une transmission de canal de commande de liaison descendante et support de stockage

Also Published As

Publication number Publication date
CN103988563A (zh) 2014-08-13
CN103988563B (zh) 2018-01-23

Similar Documents

Publication Publication Date Title
US11153860B2 (en) Uplink control channel resource allocation for an enhanced downlink control channel of a mobile communication system
US11683788B2 (en) System and method for data channel transmission and reception
TWI472251B (zh) 行動通訊系統中之用戶設備、基地台裝置、及安裝於其之積體電路、及其通訊方法
KR101636761B1 (ko) 제어 채널을 위한 탐색 공간 배열
CN102395206B (zh) 下行控制信息的传输方法和设备
US8031670B2 (en) Systems and methods for selecting the size of a control region of a downlink subframe
KR101767021B1 (ko) 물리적 다운링크 제어 채널의 검색 공간의 매핑 방법 및 장치
US20160338018A1 (en) Communication System
WO2016161917A1 (fr) Procédé et dispositif permettant de mettre en œuvre une allocation de ressources
US20130114517A1 (en) Inter-Cell Interference Coordination for E-PDCCH
WO2019052455A1 (fr) Procédé et dispositif de configuration de paramètre de canal de données
WO2013091414A1 (fr) Procédé, système et appareil de transmission d'informations
WO2015109846A1 (fr) Procédé et dispositif de transmission d'informations de commande
WO2018141180A1 (fr) Procédé de transmission d'informations de commande, procédé de réception, dispositif, station de base et terminal
TW201824908A (zh) 傳輸信息的方法、網絡設備和終端設備
WO2011127762A1 (fr) Procédé d'indication d'affectation de ressources, dispositif de station de base et équipement utilisateur
JP6209528B2 (ja) 下り制御チャネルのリソースマッピング方法及び装置
WO2017133340A1 (fr) Procédé et appareil pour déterminer un canal de commande de liaison descendante, terminal et station de base
CN109041243B (zh) 一种物理下行控制信道的发送方法、接收方法及相关设备
WO2013166980A1 (fr) Procédé de transmission de canal e-pdcch ainsi que procédé et appareil de détermination de ressources temps - fréquence
WO2013139011A1 (fr) Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante
WO2018126965A1 (fr) Procédé et appareil permettant de déterminer une ressource pour un signal de référence, et dispositif
JP6237820B2 (ja) 下り制御チャネルのリソースマッピング方法及び装置
US10587384B2 (en) System, method, and apparatus for selecting the size of a control region of a subframe based on data region load

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12872163

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12872163

Country of ref document: EP

Kind code of ref document: A1