Patent Description:
In the conventional communication system, the resources used for mapping the downlink control channel are distributed in the whole control resource region at a fixed resource granularity for every aggregation level. However, this traditional mechanism of resource mapping limits the channel estimation performance and transmit diversity effect of the downlink control channel.

<NPL> relates to search space design for NR-PDCCH.

<NPL> relates to on CCE and PDCCH mapping.

In accordance with the present disclosure, a device and/or method is/are provided for forming a control resource set that includes a physical downlink control channel, and a plurality of resource element group bundles that include different quantities of resource element groups.

As another example, a device and/or method is/are provided for receiving a control resource set that includes a physical downlink control channel, and a plurality of resource element group bundles including different quantities of resource element groups.

While the techniques presented herein may be embodied in alternative forms, the particular embodiments illustrated in the drawings are only a few examples that are supplemental of the description provided herein. These embodiments are not to be interpreted in a limiting manner, such as limiting the claims appended hereto.

Subject matter will now be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific example embodiments. This description is not intended as an extensive or detailed discussion of known concepts. Details that are known generally to those of ordinary skill in the relevant art may have been omitted, or may be handled in summary fashion.

The following subject matter may be embodied in a variety of different forms, such as methods, devices, components, and/or systems. Accordingly, this subject matter is not intended to be construed as limited to any illustrative embodiments set forth herein as examples. Rather, the embodiments are provided herein merely to be illustrative. Such embodiments may, for example, take the form of hardware, software, firmware or any combination thereof.

According to the LTE system, a Physical Downlink Control Channel ("PDCCH") is transmitted over one or more logically continuous control channel elements ("CCEs"). Different numbers of logically continuous CCEs occupied by a PDCCH transmission correspond to a different aggregation levels ("ALs"). When the CCE aggregation level is low, the PDCCH capacity is large but needs to be demodulated under favorable channel conditions. When the CCE aggregation level is high, the capacity of the PDCCH is reduced, but the PDCCH can be reliably demodulated in poor channel environments.

The PDCCH in the LTE system performs channel estimation and demodulation of the control channel based on the cell-specific reference signal (referred to as CRS) and supports only the distributed PDCCH, which maps a PDCCH to a discrete resource element group (REG). Distributed PDCCH is mainly implemented by interleaving. The interleaving is the process how to map PDCCH data flow to discrete physical resources. The interleaving used in LTE is defined based on a specified size of matrix and follows following procedure: <NUM>) a PDCCH data flow is written in the matrix row by row; <NUM>) perform the inter-column permutation for the matrix based on a predefined pattern, an example of such predefined pattern being defined by the expression: <MAT>
where P(j) is the original column position of the j-th permuted column and <MAT> is the number of columns of the matrix; <NUM>) read out column by column from the inter-column permuted matrix. And then the interleaved PDCCH data flow is mapped to the physically continuous resources, which realize the PDCCH data flow mapping in the discrete physical resources. It should be noted that if the size of the PDCCH data flow is smaller than the size of the matrix, some dummy bits are padded in the front the PDCCH data flow to make the size of them are the same. Equivalently, the PDCCH data flow before interleaving can be understood as physical resource index and the PDCCH data flow after interleaving can understood as logical resource index, which means that physical index of the resource can be interleaved according to the above interleaving process, and the PDCCH data flow (original and not interleaved) is mapped to the logically continuous resources with logically continuous index.

In LTE, for all aggregation levels, the interleaved base units are either a REG, or a PDCCH data stream corresponding to a REG, and the interleaved resource ranges are consistent for different aggregation levels. But, in practice, this is not beneficial to the channel estimation performance and diversity gain of the downlink control channel, especially in the multibeam scenario. Therefore, the above-mentioned defects should be avoided in the design of the <NUM> communication system.

According to the new Radio Access Technology ("NR") in the <NUM> communication system, the physical downlink control channel in the NR system (Referred to as NR-PDCCH) is based on the demodulation reference signal (DMRS) for control channel estimation and demodulation, and supports both localized and distributed transmission types. Distributed transmission is supported through interleaving. In order to reduce the blind detection complexity and terminal power consumption, one or more control resource sets ("CORESET") are configured for a user equipment ("UE") such as a mobile phone, portable computer terminal, etc. The UE only receives the downlink control channel on the configured CORESET(s). A downlink control channel is associated with only one CORESET. Multiple CORESETs can be overlapped or partially overlapped with each other. A control resource set includes multiple REGs, and a REG is defined as a PRB during a symbol as explained in detail below. Also as explained below, an NR-PDCCH includes one or more CCEs, one of which includes six REGs. Within a CCE, including one or more REG bundles, each REG bundle has a size of <NUM> or <NUM> or <NUM> consecutive REGs. The product of the number of REG bundles contained in a CCE and the number of REGs contained in each REG bundle is equal to <NUM>. The REGs in a REG bundle can only use the same precoding. Different REG bundles allow the use of different precoding.

Distributed NR-PDCCH is mapped to discrete physical resources with the REG bundle (e.g., a plurality of REGs) as the base unit. The larger the size of REG bundle is, the better the channel estimation performance through the joint channel estimation can be achieved. The smaller the size of REG bundle is, the more diversity gain the PDCCH gets. Therefore, the size of the REG bundle needs to establish to balance the channel estimation performance and the diversity gain. For example, for high aggregation level control channels (e.g., aggregation levels <NUM>, <NUM>), which are usually used in cases where the channel environment is poor, it is advantageous to use a large (e.g., above a threshold as described below) REG bundle to improve the channel estimation performance and to compare the resources contained in the control channel of the large aggregation level. For a small aggregation-level control channel (e.g., aggregation levels <NUM>, <NUM>), the DMRS channel estimation performance is better in itself because of the better channel environment, so a small (e.g., below a threshold as described below) REG bundle can be used to achieve improved diversity gain. However, if the interleaving for different aggregation levels is based on the REG bundles with different sizes, candidates from different aggregation levels will overlap according to the traditional interleaving in LTE. For example, one candidate of lower AL would be partially overlapped with two candidates of higher AL. This is believed to result in more collisions between candidates at different aggregation levels, which means the PDCCH blocking probability would be raised. When the UE is blocked, such as when the resource corresponding to the candidate of the UE is occupied by or partially occupied by other users' candidates, the UE cannot be scheduled with the base station ("BS"). An example of such blocking is described below with reference to <FIG>.

On the other hand, the UE tries to receive the downlink control channel in a given search space by blind detection. A search space includes one or more aggregation levels, each corresponding to one or more downlink control channel candidates. Each candidate includes L CCEs, where L is the aggregation level. In order to reduce the complexity of channel estimation, the NR-PDCCH should support channel estimation reuse between candidates of different aggregation levels in a search space. For example, as shown in <FIG>, when the low aggregation level candidates are located under the resource of the high aggregation level candidates, the channel estimation for the candidates of low aggregation level can be reused for the candidates of high aggregation level, which reduces the complexity of the channel estimation at UE, and avoid a prolonged delay that would otherwise occur due to the channel estimation.

With reference to the drawings, the communication technique utilized by the present cellular communication system can be Orthogonal Frequency Division Multiplexing (OFDM). <FIG> illustrates a structure of time-frequency grid <NUM> of radio resources for transmitting data and control channels (e.g., PDCCH) in a downlink of a wireless communication system utilizing OFDM. In <FIG>, the horizontal axis denotes time t, and the vertical axis denotes frequency f. An OFDM symbol, arranged in columns <NUM> in <FIG>, is the smallest transmission unit on the time axis. A slot <NUM> includes NSY OFDM symbols. Although N is equal to <NUM> according to embodiments described herein for illustration purposes, the value of N according to some embodiments can be any integer value such as <NUM>, <NUM>, <NUM>, etc., depending on factors such as subcarrier spacing, for example. A subframe <NUM> includes two slots <NUM>. A slot <NUM> is approximately <NUM> in duration, and a subframe is approximately <NUM> in duration. A subcarrier, arranged in rows <NUM> in <FIG>, is the smallest transmission unit in the frequency domain, and the entire system transmission band includes NB subcarriers.

In the time-frequency grid <NUM>, a Resource Element ("RE") <NUM> is the basic unit indicated by the combination of a discrete OFDM symbol index and a discrete subcarrier index. The Resource Block ("RB") or Physical Resource Block <NUM> includes the <NUM> consecutive OFDM symbols in the time domain t in <FIG> and the NSC consecutive subcarriers in the frequency domain <NUM>. For some embodiments, the value of NSC can be any integer such as <NUM>, <NUM>, <NUM>, etc., but will be described herein as being equal to <NUM> for the sake of brevity and clarity. Accordingly, an RB <NUM> includes NSY×NSC Res, or <NUM> × <NUM> in the illustrated examples. An RB is the smallest unit that can be scheduled for transmission.

A portion of a subframe <NUM> is shown in <FIG>. Each REG <NUM> included in the PDCCH includes <NUM> consecutive REs (or <NUM> REs separated by a cell-specific reference signal ("RS") <NUM>) within the same OFDM symbol and the same resource block. In <FIG> there are two (<NUM>) REGs in the OFDM symbol <NUM>, the first slot of the subframe <NUM>, and there are <NUM> REGs in OFDM symbols <NUM>, <NUM> and <NUM>. Each CCE includes <NUM> REGs, which are distributed across OFDM symbols <NUM>, <NUM>, <NUM>, and optionally <NUM>, and the system bandwidth through interleaving to enable diversity and to mitigate interference.

<FIG> shows an illustrative example of a PDCCH map <NUM>. Each PDCCH (numbered as #<NUM>, #<NUM>, #<NUM> and #<NUM>) in the map <NUM> is formed from a number of CCEs, individually numbered using the CCD Index in <FIG>. Each CCE includes nine (<NUM>) REGs, as shown in the enlarged view of CCE8. The REGs are distributed over the first three OFDM symbols in the illustrative example shown in <FIG>, and each REG is formed from four logically continuous Res in the same symbol.

The number of CCEs in a PDCCH is called its aggregation level, and may be <NUM>, <NUM>, <NUM>, or <NUM> consecutive CCEs (logically sequential). The total number of available CCEs is determined by the PCFICH configuration and the system bandwidth. Each PDCCH contains exactly one Downlink Control Information ("DCI"). For the illustrative example shown in <FIG>, PDCCH #<NUM> has an aggregation level of <NUM>, including just CCE <NUM>. PDCCH #<NUM> has an aggregation level of <NUM>, including CCE2 and CCE3. PDCCH #<NUM> has an aggregation level of <NUM>, including CCE4, CCE5, CCE6 and CCE7. And PDCCH #<NUM> has an aggregation level of <NUM>, including CCE8, CCE9, CCE10, CCE11, CCE12, CCE13, CCE14 and CCE15. A PDCCH with aggregation level n can optionally be restricted to starting only on a CCE having an index value that is a positive integer multiple of n. For example, a PDCCH with an aggregation level of <NUM> can only start on CCE index <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, etc..

The historical difficulty of interleaving PDCCHs having different aggregation levels is demonstrated with reference to <FIG>. In a CORESET for the PDCCH of aggregation level <NUM> ("AL4"), the REG bundle type <NUM> as the base resource unit for interleaving is comprised of <NUM> REGs, which corresponds to a CCE. For the PDCCH of aggregation level <NUM> ("AL2"), the REG bundle type <NUM> as the base resource unit for interleaving is comprised of <NUM> REGs, a CCE being formed by three (<NUM>) of the REG bundles of type <NUM>. The interleaving process for the two downlink control channels is performed in <FIG>. The interleaving technique is based on the interleaving technique of PDCCH in LTE. As can be seen from <FIG>, after the interleavingAL2's candidate <NUM> is overlapped with AL4's candidate <NUM> and candidate <NUM>. Therefore, when a UE's NR-PDCCH location is at candidate <NUM>, both candidate0 and candidate1 of AL4 cannot be used for transmission of other NR-PDCCHs. Thus, the NR-PDCCH of AL4 is said to be blocked, or, the block ratio increased, a condition that is not favorable for channel estimation reuse. For example, if a UE's search space is comprised of candidate <NUM> of AL4 and candidate <NUM> of AL4, the channel estimation of candidate <NUM> of AL2can not get only through the channel estimation reusing of the candidate <NUM> of AL4.

On the other hand, it is worth pointing out in <FIG> that if the search space of a UE is composed of AL4's candidate <NUM> and AL2's candidate <NUM>, since the corresponding resources of AL2's candidate <NUM> does not fully encompass the entire resource range of AL4's candidate <NUM>. In other words, AL4's candidate <NUM> is much "taller" than AL2's candidate <NUM>, so AL2's candidate <NUM> does not fully block AL4's candidate <NUM>.

In view of the above difficulties, the following description of how to implement the coexistence of REG bundles of different sizes in the same resource area (CORESET) is provided with reference to various embodiments, and can support DMRS reuse between candidates of different aggregation levels, resulting in a decrease in the blocking probability of the NR-PDCCH.

It is to be noted that the REG bundle index in the examples that follow can also be understood as an NR-PDCCH symbol stream (or NR-PDCCH data flow) index, and the order of the logical REG bundle index is the mapping order of the NR-PDCCH symbol stream. Further, the number of modulation symbols included in the NR-PDCCH symbol stream corresponding to one symbol stream index can be equal to the number of REs that can be used to transmit the NR-PDCCH symbol stream contained in a REG bundle.

The embodiments of the present disclosure may be arbitrarily combined. For example, when the ratio of the REG bundle size of the relatively large aggregation level and the REG bundle size of the relatively small aggregation level is <NUM>, using the method described in the following Example <NUM>, when the large aggregation level REG bundle and the small aggregation level REG bundle is <NUM>, the method described in the following Example <NUM> can used, and so on.

The use of "relatively large" or "large" herein is to be understood relative to the corresponding "relatively small" or "small" value used in the same example. For instance, a "relatively high aggregation level" must be greater than a certain threshold, such as the "relatively low aggregation level" used in the same example. Likewise, a "high aggregation level" is simply required to be greater than the "low aggregation level" described in the same example.

The "REGs have the same precoder" as described in the examples of the present disclosure means that the channels for these REGs are continuous or the UE can perform joint channel estimation on these REGs.

For the present example, a REG bundle with bundle size of <NUM> (one REG bundle including <NUM> REGs) coexists with a REG bundle with bundle sizes of <NUM> (one REG bundle including <NUM> REGs) and <NUM> (one REG bundle including <NUM> REGs). The present example will be described with reference to <FIG> and <FIG>.

Different resource ranges are for different REG bundle sizes for interleaving, different REG bundle sizes correspond to different aggregation levels. The larger REG bundle <NUM> has a resource range of the entire CORESET for interleaving. The smaller REG bundle <NUM> has a resource range of the resource corresponding to the candidates of the UE in the larger REG bundle (row referred to at <NUM>). In this way, it is possible to ensure that the low aggregation level candidates (cross-hatched members of row <NUM>) of the UE are within the resource range of the high aggregation level candidates (cross-hatched members of row <NUM>). As a result, the low aggregation level candidates <NUM> can reuse the channel estimation result of the high aggregation level candidates <NUM> and effectively avoid that more than one candidates of high AL <NUM> being blocked by one candidate of low aggregation level.

As shown in <FIG>, the interleaving of the NR-PDCCH can optionally be achieved by two levels of interleaving: (i) the first level of interleaving <NUM> being based on the first level of REG bundle (larger REG bundle <NUM>) within the first resource range, and (ii) the second level of interleaving <NUM> within the second resource range based on the second level of REG bundle (smaller REG bundle <NUM>). Wherein the first resource range for the larger REG bundle <NUM> can optionally be the entire CORESET and the second resource range for the smaller REG bundle <NUM> can be the resource of one or more of the candidates <NUM> of the UE corresponding to the first level of REG bundle.

In <FIG>, assume a CORESET with a total of <NUM> CCE, and two types of REG bundles, respectively: the first level (larger) REG bundle <NUM> and the second level (smaller) REG bundle <NUM>, where the first level REG bundle size is <NUM> REGs, and the second level REG bundle size is <NUM> REGs. The first level REG bundle <NUM> can be used for interleaving for NR-PDCCH of high aggregation level. The second level REG bundle <NUM> can be used for interleaving for NR-PDCCH of low aggregation level.

The process depicted in <FIG> involves a first level of interleaving <NUM>. The larger REG bundle <NUM> in the order (such as CORESET frequency domain from low to high order) indicated by the first level REG bundle physical index <NUM>. An example of the interleaving can involve a subblock interleaving. The result of the first level of interleaving is the reorganized resources of the larger REG bundle <NUM> into the order indicated by a first level REG bundle logical index <NUM>. A first level CCE index <NUM> reflects the first level REG bundle logical index <NUM> here because a larger REG bundle <NUM> and the CCE are of the same size. Accordingly, a REG bundle is a CCE, so the CCE index <NUM> and the REG bundle index <NUM> are the same.

After the first level interleaving <NUM>, the UE determines the resource range of candidates of high aggregation level for it. For example, the resource range of candidates of the high aggregation level determined in <FIG> is eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level, which corresponds to candidate <NUM> of high AL (AL8).

Within the resource range of high aggregation level determined above, the smaller REG bundle <NUM> is numbered in a defined order (for example, in the order of the frequency domain in the resource range of the high aggregation level determined above, from low to high). This ordering is referred to as the second-level REG bundle physical index <NUM>. The second-level REG bundle <NUM> is then subjected to interleaving, resulting in the interleaved order corresponding to the second level REG bundle logical index <NUM>. The formation of the second level CCE index <NUM> based on the second REG bundle having a size of three REGs, so every two consecutive logical second level REG bundles form a CCE. However, some embodiments can utilize a second REG bundle size that results in a CCE formed from more than two consecutive logical second level REG bundles.

For example, in <FIG>, the first level of interleaving <NUM> is performed as described above with reference to <FIG>. But, in <FIG>, formation of the second level CCE index is based on a second REG bundle <NUM> having a size of two REGs, instead of three REGs as shown in <FIG>. Thus, every three consecutive logical second level REG bundles forms a CCE in <FIG>.

It can be seen from <FIG> and <FIG> that all the candidates (cross hatched members of the row <NUM>, <NUM>) of the low aggregation level obtained by the above-mentioned method are located within the range of candidates <NUM> of the high aggregation level. Further, any one of the candidates <NUM> of low aggregation level can be located under the resource of a maximum of (e.g., centrally aligned with) one of the candidates <NUM> of high aggregation level. The low level aggregation level candidates <NUM>, <NUM> can support a smaller-sized REG bundle than the high aggregation level candidates, which improves flexibility of the resource granularity of a precoder used for directional beamforming.

For all or at least some of the embodiments discussed herein, it is to be noted that the interleaving techniques in the embodiments of the present disclosure may be any existing or developing interleaving techniques. The interleaving techniques may be the same, or different from those used by LTE system, and the size of the column permuting pattern can optionally utilize a value of permuting addresses other than <NUM>.

Further, prior to the first level of interleaving <NUM> or the second level of interleaving <NUM> in embodiments of the present disclosure, the REG bundles to be interleaved can be divided into N groups (N is an integer greater than <NUM>), and then interleaving the groups. If i is an integer greater than or equal to <NUM>, but less than N, the divided REG bundle i would contain the REG bundles whose index modulo to N is equal to i-<NUM>. The REG bundles within the group can optionally not be interleaved.

For Example <NUM>, REG bundle with bundle size of <NUM> coexists with REG bundle with bundle sizes of <NUM> and <NUM>. The present example will be described with reference to <FIG> and <FIG>.

Different resource ranges are for different REG bundle sizes for interleaving, different REG bundle sizes correspond to different aggregation levels. The larger REG bundle <NUM> has are source range of the entire CORESET for interleaving. The smaller REG bundle <NUM> has a resource rage of the resource corresponding to the candidates of the UE in the larger REG bundle <NUM>. In this way, it is possible to ensure that all, or at least one or a plurality of the small aggregation level candidates (cross hatched members of row <NUM>) of the UE is/are within the resource range of the large aggregation level candidates (cross hatched members of row <NUM>). Thus, the small aggregation level candidates <NUM> can reuse the channel estimation result of the large aggregation level candidates <NUM>, and effectively avoid that more than one candidates of high AL <NUM> being blocked by one candidate of low aggregation level.

As shown in <FIG>, the interleaving of the NR-PDCCH may be achieved by two-level interleaving: (i) the first level interleaving <NUM> being based on the first level (larger) REG bundle <NUM> within the first resource range, and (ii) the second level interleaving <NUM> within the second resource range based on the second level (smaller) REG bundle <NUM>. Optionally, the first level resource range can be the entire CORESET, and the second level resource range can be the resource range from which one or more of the candidates <NUM> of the UE corresponding to the first level of REG bundle are derived. Optionally, there are a plurality of second level resource ranges, where each of the second level resource ranges corresponds to the resource of one of the candidates of first level REG bundles.

In <FIG>, it is assumed that the CORESET includes a total of <NUM> CCE, and there are two REG bundles, respectively: (i) the first level (larger) REG bundle <NUM> and the second level (smaller) REG bundle <NUM>. The first level REG bundle size is <NUM> REGs, and the second level REG bundle size is <NUM> REGs. The first level REG bundle <NUM> can be used for interleaving for NR-PDCCH of high aggregation level. The second level REG bundle <NUM> can be used for interleaving for NR-PDCCH of low aggregation level.

As depicted in <FIG>, the first level of interleaving <NUM> interleaves the first REG bundle <NUM> in an order (such as CORESET frequency domain from low to high order) indicated by the first level REG bundle physical index <NUM> to obtain the first level REG bundle logical index <NUM>. A first level CCE index <NUM> reflects the first level REG bundle logical index <NUM> here because the larger REG bundle <NUM> and a CCE are the same size, so the REG bundle <NUM> is a CCE and, accordingly, the CCE index <NUM> and REG bundle index <NUM> are the same.

After the first level interleaving <NUM>, the UE determines the resource range of candidates <NUM> of high aggregation level. For example, the resource range of candidates <NUM> of high aggregation level determined in <FIG> that there are eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level (corresponding to candidate <NUM> and candidate <NUM> of high AL i.e. AL4).

Within the resource range of the high aggregation level determined, the smaller REG bundle <NUM> will be ordered (for example, in the order of the frequency domain in the resource range of the high aggregation level determined above, from low to high) to form a second-level REG bundle physical index <NUM>. The second-level REG bundles with the second-level REG bundle physical index <NUM> corresponding to each of the identified candidates <NUM> of high AL are interleaved in the resource of corresponding candidate. As shown in <FIG>, the second level REG bundle physical index <NUM> values between <NUM> and <NUM>, inclusive, are interleaved and the second level REGs with physical index values of <NUM> to <NUM>, inclusive, are also interleaved, optionally separate from the second level REGs with REG bundle physical index <NUM> values between <NUM> and <NUM>. The logical index <NUM> of the second-level REG bundle is obtained, and the second-level CCE index <NUM> is formed in the order of the logical index <NUM> of the second-level REG bundle. The pattern in <FIG>, is that the even-valued REG bundle index values <NUM> are halved to define the second level CCE index values. The odd-valued REG bundle index values <NUM> are also halved and rounded down to the nearest integer to define the second level CCE index values. Since the size of a second REG bundle <NUM> is three REGs, each two logically continuous second level REG bundles forms a CCE.

For embodiments such as those shown in <FIG>, it is assumed that there is CORESET with a total of <NUM> CCE, and two REG bundles, respectively: (i) the first level (larger) REG bundle <NUM>, and (ii) the second level (smaller) REG bundle <NUM>. The first level REG bundle <NUM> size is <NUM> REGs, and the second level REG bundle <NUM> size is <NUM> REGs. The first level REG bundle <NUM> can be used for interleaving for NR-PDCCH of high aggregation level. The second level REG bundle <NUM> is used for interleaving for NR-PDCCH of low aggregation level.

For such embodiments, the first level of interleaving <NUM> is performed as described above with reference to <FIG>, to obtain the larger REG bundle logical index <NUM>. In accordance with the order of the larger REG bundle logical index <NUM>, the order of the first level CCE index <NUM> is generated to match the order of the larger REG bundle logical index <NUM> because a first level REG bundle and a CCE are of the same size. Thus, a REG bundle amounts to a CCE in the present example.

After the first level interleaving <NUM>, the UE determines the resource range of candidates <NUM> of high aggregation level. For example, the resource range of candidates <NUM> for the high aggregation level determined in <FIG> was eight first-level CCEs, with the first level CCE0 as the starting position of high aggregation level candidates <NUM> corresponding to candidate <NUM> of AL8. But in <FIG>, there are eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level candidates <NUM> corresponding to candidate <NUM> and candidate <NUM> of AL4.

Within the resource range of the high aggregation level determined above, the smaller REG bundle <NUM> is arranged in a defined order (for example, within the frequency domain of the high aggregation level, from the low to high) to form a second-level REG bundle physical index <NUM>. According to the second-level REG bundle physical index <NUM>, index values <NUM>-<NUM>, inclusive, correspond to the high aggregation level candidates <NUM> with index value <NUM> "<NUM>", as identified above. According to the second-level REG bundle physical index <NUM>, index values <NUM>-<NUM>, inclusive, correspond to the high aggregation level candidates <NUM> with and index value <NUM> of "<NUM>", as identified above. The second-level REG bundle <NUM> is subjected to the second level of interleaving <NUM> to obtain the logical index values <NUM> for the smaller REG bundle <NUM>. Formation of the second level CCE index <NUM> is based on the smaller REG bundle <NUM> having a size of two REGs, so every three logically consecutive second-level REG bundles form a CCE in <FIG>.

It can be seen from <FIG> and <FIG> that all the candidates <NUM>, <NUM> of low aggregation level obtained by the above procedure are located within the range of the candidates <NUM>, <NUM> of the high aggregation level. Further, any one of the candidates <NUM>, <NUM> of low aggregation levels are located at a maximum of (e.g., approximately centrally aligned with) one candidate <NUM>, <NUM> in the resources of the high aggregation level. The low level aggregation level candidates <NUM>, <NUM> can support a smaller-sized REG bundle than the high aggregation level candidates <NUM>, <NUM>, which improves the resource granularity of a precoder used for directional beamforming.

For Example <NUM>, REG bundle with bundle size <NUM> coexists with REG bundle with bundle sizes <NUM> and <NUM>. The present example will be described with reference to <FIG> and <FIG>.

Different REG bundle sizes are for different aggregation levels, and in different resource range for interleaving optionally. A larger REG bundle <NUM> can have are source range of the entire CORESET for interleaving, and a small REG bundle <NUM> can have a resource range which includes the resources of one or more of the candidates of the UE corresponding to the larger REG bundle <NUM>. In this way, it is possible to ensure that the small aggregation level candidates (cross-hatched members of row <NUM>) of the UE are within the resource range of the large aggregation level candidates (cross-hatched members of row <NUM>). As a result, the small aggregation level candidates <NUM> can reuse the channel estimation result of the large aggregation level candidates <NUM> and effectively avoid that more than one high AL candidates corresponding to large REG bundle size being blocked by only one low AL candidate corresponding to small REG bundle size.

As shown in <FIG>, the distributed NR-PDCCH may be achieved by two-level interleaving: (i) the first level interleaving <NUM> being based on the first level REG bundle (larger REG bundle <NUM>) within the first resource range, and (ii) the second level interleaving <NUM> within the second resource range based on the second level REG bundle (smaller REG bundle <NUM>). Wherein the larger REG bundle <NUM> can optionally be the entire CORESET and the smaller REG bundle <NUM> can be the resource range from which one or more of the high AL candidates <NUM> of the UE corresponding to larger REG bundle are derived. Optionally, for second level interleaving, different interleaving schemes are used depending on different ratio of the first level REG bundle size and the second level REG bundle size. And further optionally, the different interleaving scheme means any one or more steps included in the process of the sub-block interleaving used in LTE, such as different column-permuted pattern(also called interleaving pattern) are used.

In <FIG>, assume a CORESET with a total of <NUM> CCE, and two REG bundles, respectively: the first level (larger) REG bundle <NUM> and the second level (smaller) REG bundle <NUM>. The first level REG bundle size is <NUM> REGs, and the second level REG bundle size is <NUM> REGs. The first level REG bundle <NUM> can be used for interleaving of NR-PDCCH with a high aggregation level. The second level REG bundle <NUM> can be used for interleaving of NR-PDCCH with a low aggregation level.

The process depicted in <FIG> involves a first level of interleaving <NUM>, where the larger REG bundle <NUM> in the order (such as CORESET frequency domain from low to high order) indicated by the first level REG bundle physical index <NUM>, for example. An example of the interleaving can involve sub-block interleaving based on a defined interleaving matrix. The result of the first level of interleaving is the reorganized resources of the larger REG bundle <NUM> into the order indicated by a first level REG bundle logical index <NUM>. A first level CCE index <NUM> reflects the first level REG bundle logical index <NUM> here because the larger REG bundle <NUM> and the CCE are of the same size. Accordingly, a REG bundle is a CCE, so the CCE index <NUM> and the REG bundle index <NUM> are the same.

After the first level interleaving <NUM>, the UE determines the range of candidates (cross hatched members of the row <NUM>) for the high aggregation level. For example, the range of candidates for the high aggregation level determined in <FIG> is eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level corresponding to candidate <NUM> of AL8. But in <FIG>, there are also eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level candidates <NUM> but corresponding candidate <NUM> and candidate <NUM> of AL4.

Within the resource range of the high aggregation level determined above, the smaller REG bundle <NUM> is numbered in a defined order (for example, in the order of the frequency domain in the resource range of the high aggregation level determined above, from low to high). This ordering is referred to as the second-level REG bundle physical index <NUM>. The second-level REG bundle physical index <NUM> is then subjected to the second level interleaving <NUM>, resulting in the interleaved order corresponding to the second level REG bundle logical index <NUM>. The formation of the second level CCE index <NUM> is based on the second REG bundle <NUM> having a size of three REGs, so every two logically consecutive second level REG bundles(which means two second level REG bundles with continuous second level REG bundle logical index) collectively form a CCE. However, some embodiments can utilize a second REG bundle size that results in a CCE formed from more than two logically consecutive second level REG bundles.

For example, in <FIG>, it is assumed that there is CORESET with a total of <NUM> CCE, and two REG bundles, respectively: (i) the first level (larger) REG bundle <NUM>, and (ii) the second level (smaller) REG bundle <NUM>. The first level REG bundle <NUM> size is <NUM> REGs, and the second level REG bundle size is <NUM> REGs. The first level REG bundle <NUM> can be used for interleaving of NR-PDCCH with high aggregation level. The second level REG bundle <NUM> can be used for interleaving of NR-PDCCH with low aggregation level.

After the first level interleaving <NUM>, the UE determines the resource range of candidates <NUM> of high aggregation level. For example, the resource range of high AL candidates <NUM> determined in <FIG> was eight first-level CCEs, with the first level CCE0 as the starting position of high aggregation level candidates <NUM> corresponding to candidate <NUM> of AL <NUM>. Likewise, in <FIG>, there are also eight first-level CCEs with the first level CCE0 as the starting position of the high aggregation level candidates <NUM> corresponding to candidate <NUM> of AL8.

Within the resource range of the high aggregation level determined above, the smaller REG bundle <NUM> is arranged in a defined order (for example, within the frequency domain of the high aggregation level, from the low to high) to form a second-level REG bundle physical index <NUM>. The second-level REG bundle <NUM> is subjected to a second level interleave <NUM> that uses a different interleaving scheme than that used for the first level interleave <NUM>. For example, the second level interleaving <NUM> can utilize a column-permuted pattern (also called interleaving pattern) such < <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>> which is different with the column-permuted pattern used for the first level interleaving, resulting in a logical index <NUM> of the second-level REG bundle. The second-level CCE index <NUM> is formed according to the logical index <NUM> of the second-level REG bundle. Since the size of a second REG bundle is <NUM> REGs, every three logically consecutive second-level REG bundles form a CCE.

It can be seen from <FIG> and <FIG> that all the candidates (cross hatched members of the row <NUM>, <NUM>) of the low aggregation level corresponding to larger REG bundle obtained by the above-mentioned method are located within the range of candidates <NUM>, <NUM> of the high aggregation level corresponding to small REG bundle. Further, any one of the candidates <NUM>, <NUM> of the low aggregation level corresponding to small REG bundle can be located at a maximum of (e.g., substantially centrally aligned with) one of the candidates <NUM>, <NUM> of the high aggregation level corresponding to larger REG bundle. The low level aggregation level candidates <NUM>, <NUM> can support a smaller-sized REG bundle than the high aggregation level candidates, which improves the resource granularity of a precoder used for directional beamforming.

For Example <NUM>, the REG bundle with bundle size <NUM> coexists with the REG with bundle size <NUM>. The present example will be described with reference to <FIG> and <FIG>.

Different REG bundle to CCE mappings (REG bundle to CCE mapping also called CCE indexing) are defined for different REG bundle sizes, and the different REG bundle sizes correspond to different aggregation levels, such as large REG bundle sizes corresponding to high aggregation levels, and small REG bundle sizes corresponding to a low aggregation level. In the present example, a CCE indexing establishes a mapping (or mapping pattern) between the REG bundle logical index and the CCE index. For small REG bundle, the CCE mapping results that all the small REG bundles within any one of the low AL candidates corresponding to small REG bundle is located in the same one high AL candidate corresponding to large REG bundle.

For the embodiments in <FIG>, it is assumed that there is a CORESET with a total of <NUM> CCEs, and two type of REG bundles, respectively: (i) an inter REG bundle <NUM>, which includes a size of <NUM> REGs, and (ii) an inner REG bundle <NUM>, which includes a size of <NUM> REGs. The inter REG bundle can be used to define CCE indexes for high aggregation levels. The inner REG bundle can be used to define CCE indexes for low aggregation levels.

For some embodiments, the inter REG bundle <NUM>, as a basic resource unit, can have a resource range of the entire CORESET for interleaving, the inter REG bundle is arranged in a defined order (for example, within the frequency domain of the high aggregation level, from the low to high) to form an inter REG bundle physical index. And by implying interleaving these inter REG bundle physical index, the interleaved inter REG bundle physical index is indicated as an inter REG bundle logical index. The inner REG bundle <NUM> of a UE is defined under the resources corresponding to the candidates selected for the UE within a subset of the inter REG bundle <NUM>.

CCE indexing <NUM> for high AL corresponding to the inter REG bundles is defined based on the inter REG bundle logical index <NUM> to create the accordingly order of the CCE index with the inter REG bundle logical index. The inter REG bundles can be mapped to the CCEs by assuming that a CCE contains M inter REG bundles <NUM>, every M logically consecutive inter REG bundles (that is, the logical index <NUM> is continuous for M inter REG bundles <NUM>) to form a CCE. The inter REG bundle index <NUM> is arranged from low to high corresponding to the CCE index <NUM> from low to high. The value of M is the ratio of inter (larger) REG bundle size to inner(small) REG bundle size. Here because the inter REG bundle size is <NUM> REGs, and a CCE also contains six REGs, the value of M is <NUM>, so a CCE amounts to an inter REG bundle <NUM>.

Each inter REG bundle <NUM> can be split into N inner REG bundles <NUM> conducted according to the logical index order of the inter REG bundle <NUM>. Thus, the N inner REG bundles collectively form a composite resource bundle that was split. N can be equal to the ratio of the inter REG bundle size to the inner REG bundle size, which is <NUM>/<NUM>, or <NUM> in the present example. The logical index <NUM> of the inner REG bundle <NUM> from low to high corresponds to the logical index of the inter REG bundle from low to high. When the inter REG bundle size is <NUM> REGs and the inner REG bundle size is <NUM> REGs, the value of N is <NUM>, and the logical index of the two inner REG bundles <NUM> corresponding to the inter REG bundle <NUM> of i is given by the formula <NUM> * <NUM> and <NUM> * i + <NUM>. In other words, for the first logical Inter REG bundle index value of i=<NUM> in <FIG>, the values of the two logic Inner REG bundle index values formed by splitting the resource corresponding to the Inter REG bundle index value of i=<NUM> into two separate resources are: <NUM>*<NUM> =<NUM>, and <NUM>*<NUM> +<NUM> =<NUM>. These first two logical inner REG bundle index values are reflected in <FIG>. As another example, for the second logical Inter REG bundle index value of i=<NUM>, the two corresponding logical inner REG bundle index values are <NUM>*<NUM>=<NUM>, and <NUM>*<NUM>+<NUM>=<NUM>, as shown in <FIG>.

<FIG> shows a technique for defining a CCE index <NUM> for low AL based on the logical inner REG bundle index <NUM> in accordance in a predefined manner. When the inter REG bundle size is <NUM> REGs and the inner REG bundle size is <NUM> REGs, the present technique defines the CCE index for the low aggregation level as follows:.

The result of the CCE mapping can be seen in <FIG>. Any candidate <NUM> of the low aggregation level contains the inner REG bundles <NUM> located in the same candidate <NUM> resources of the high aggregation level. As a result, this approach implements the coexistence of multiple REG bundles in the same CORESET, while reducing the blocking probability of the candidates of different AL corresponding to different REG bundle size.

For Example <NUM>, the REG bundle with bundle size <NUM> coexists with the REG bundle with bundle sizes <NUM> and <NUM>. The present example will be described with reference to <FIG> and <FIG>.

Different REG bundle to CCE mappings (REG bundle to CCE mapping also called CCE indexing) are difined for different REG bundle sizes and the different REG bundle sizes corresponding to different aggregation levels. For example, a large REG bundle size corresponds to a high aggregation level, and a small REG bundle size corresponds to a low aggregation level in the present example. Here the CCE indexing establishes a mapping (or mapping pattern) from the REG bundle logical index to the CCE index. For small REG bundle, the CCE mapping results that all the small REG bundles within any one of the low AL candidates corresponding to small REG bundle is located in the same one high AL candidate corresponding to large REG bundle.

In <FIG>, it is assumed that a CORESET is provided with a total of <NUM> CCE, and there are two types of REG bundles, respectively (i) an Inter REG bundle <NUM>, with a bundle size of <NUM> REGs, and (ii) an Inner REG bundle <NUM>, with a bundle size of two REGs. The Inter REG bundle <NUM> can be used to define the CCE index <NUM> for high aggregation levels, and the Inner REG bundle <NUM> can be used to define CCE indexes <NUM> for low aggregation levels.

The technique shown in <FIG> involves interleaving <NUM> the inter REG bundle <NUM> as the basic resource unit with the physical inter REG bundle index in the entire CORESET, to generate the resources corresponding to the logical REG bundle index <NUM>. Based on the logical inter REG bundle index <NUM>, the CCE index values <NUM> for high ALs can be defined according to a predefined process. The inter REG bundle can be mapped to the CCEs as is known in the art, by assuming that a CCE contains M inter REG bundles <NUM>, each of the M logically consecutive inter REG bundles (that is, the logical index is continuous over M inter REG bundles <NUM>) to form a CCE. The inter REG bundle index <NUM> is configured from low to high corresponding to the CCE index <NUM> from low to high. Because the inter REG bundle size is <NUM> REGs, and a CCE also contains <NUM> REGs, M has a value of <NUM>, so a CCE amounts to an inter REG bundle in the present example.

Each inter REG bundle <NUM> is split into N inner REG bundles according to the logical index order of the inter REG bundles <NUM>, where N is equal to the ratio of the inter REG bundle size and the inner REG bundle size. The logical inner REG bundle index <NUM> in ascending order, from low to high corresponds to the logical inter REG bundle index <NUM> in ascending order, from low to high. When the inter REG bundle size is <NUM> REGs and the inner REG bundle size is <NUM> REGs, the value of N is <NUM>, and the logical index values of the three inner REG bundles corresponding to the inter REG bundle index value of i is <NUM> * i, <NUM> * i + <NUM> and <NUM> * i + <NUM>. For example, for the second logical Inter REG bundle index value of i=<NUM>, the three corresponding logical inner REG bundle index values are <NUM>*<NUM>=<NUM>, <NUM>*<NUM>+<NUM>=<NUM>, and <NUM>*<NUM>+<NUM>=<NUM>, as shown in <FIG>.

Based on the inner REG bundle index in accordance with the technique for defining a CCE index for the low aggregation level(s) corresponding to the inner REG bundles, <FIG> shows a predefined mapping method between the inner REG bundle index <NUM> and the CCE index <NUM> for low aggregation level(s). In particular, the method involves:.

As another example explained with respect to <FIG>, assume a CORESET includes a total of <NUM> CCE, and there are two REG bundle, respectively: (i) Inter REG bundle having a size of <NUM> REGs, and (ii) Inner REG bundle, having a size of <NUM> REGs. The Inter REG bundle can be used to define CCE indexes for high aggregation levels. The Inner REG bundle can be used to define CCE index values for low aggregation levels.

The Inter REG bundle has an interleaved resource range of the entire CORESET. After the physical resources corresponding to the inter REG bundle logical index <NUM>, the inter REG bundle index order, in accordance with a predefined technique, is used to define a CCE index <NUM> for high ALs. The inter REG bundle to CCE is mapped in a conventional manner, by assuming that a CCE contains M inter REG bundles, every M logically consecutive inter REG bundles (that is, the logical index is continuous M inter REG bundles) forms a CCE, based on the inter REG bundle index from low to high corresponding to the CCE index from low to high. Here because the inter REG bundle size for the <NUM> REGs, a CCE also contains six REGs, M value of <NUM>, so a CCE amounts to an inter REG bundle.

Each inter REG bundle <NUM> is split into N inner REG bundles according to the logical order of the inter REG bundle index <NUM>, where N is equal to the ratio of the inter REG bundle size and the inner REG bundle size. And the logical inner REG bundle index <NUM>, from low to high corresponds to the logical inter REG bundle index <NUM>, from low to high. When the inter REG bundle size is <NUM> REGs and the inner REG bundle size is <NUM> REGs, the value of N is <NUM>, and the logical index of the two inner REG bundles corresponding to the inter REG bundle of i is <NUM> * i, and <NUM> * i + <NUM>.

Based on the inner REG bundle index <NUM> in accordance with a predefined process to define a CCE index <NUM> for low ALs. <FIG> shows the mapping between the inner REG bundle index <NUM> and the CCE index <NUM> for the low aggregation level, that is, the predefined process involves the following:.

As can be seen from <FIG> and <FIG>, the inner REG bundles contained in any one of the low aggregation levels are within the same candidate's resources of the high aggregation level. As a result, this approach implements the coexistence of multiple REG bundles in the same CORESET, while reducing the blocking probability of the candidates of different AL corresponding to different REG bundle size.

<FIG> presents a schematic architecture diagram <NUM> of a base station <NUM> (e.g., a network entity) that may utilize at least a portion of the techniques provided herein. Such a base station <NUM> may vary widely in configuration and/or capabilities, alone or in conjunction with other base stations, nodes, end units and/or servers, etc. in order to provide a service, such as at least some of one or more of the other disclosed techniques, scenarios, etc. For example, the base station <NUM> may connect one or more user equipment (UE) to a (e.g., wireless and/or wired) network (e.g., which may be connected and/or include one or more other base stations), such as Code Division Multiple Access (CDMA) networks, Time Division Multiple Access (TDMA) networks, Frequency Division Multiple Access (FDMA) networks, Orthogonal FDMA (OFDMA) networks, Single-Carrier FDMA (SC-FDMA) networks, etc. The network may implement a radio technology, such as Universal Terrestrial Radio Access (UTRA), CDMA2000, Global System for Mobile Communications (GSM), Evolved UTRA (E-UTRA), IEEE <NUM>, IEEE <NUM>, IEEE <NUM>, Flash-OFDM, etc. The BS and/or the UE may communicate using a standard, such as Long-Term Evolution (LTE), <NUM> New Radio (NR), etc..

The base station <NUM> may comprise one or more (e.g., hardware) processors <NUM> that process instructions. The one or more processors <NUM> may optionally include a plurality of cores; one or more coprocessors, such as a mathematics coprocessor or an integrated graphical processing unit (GPU); and/or one or more layers of local cache memory. The base station <NUM> may comprise memory <NUM> storing various forms of applications, such as an operating system <NUM>; one or more base station applications <NUM>; and/or various forms of data, such as a database <NUM> and/or a file system, etc. The base station <NUM> may comprise a variety of peripheral components, such as a wired and/or wireless network adapter <NUM> connectible to a local area network and/or wide area network; one or more storage components <NUM>, such as a hard disk drive, a solid-state storage device (SSD), a flash memory device, and/or a magnetic and/or optical disk reader; and/or other peripheral components.

The base station <NUM> may comprise a mainboard featuring one or more communication buses <NUM> that interconnect the processor <NUM>, the memory <NUM>, and/or various peripherals, using a variety of bus technologies, such as a variant of a serial or parallel AT Attachment (ATA) bus protocol; a Uniform Serial Bus (USB) protocol; and/or Small Computer System Interface (SCI) bus protocol. In a multibus scenario, a communication bus <NUM> may interconnect the base station <NUM> with at least one other server. Other components that may optionally be included with the base station <NUM> (though not shown in the schematic diagram <NUM> of <FIG>) include a display; a display adapter, such as a graphical processing unit (GPU); input peripherals, such as a keyboard and/or mouse; and/or a flash memory device that may store a basic input/output system (BIOS) routine that facilitates booting the base station <NUM> to a state of readiness, etc..

The base station <NUM> may operate in various physical enclosures, such as a desktop or tower, and/or may be integrated with a display as an "all-in-one" device. The base station <NUM> may be mounted horizontally and/or in a cabinet or rack, and/or may simply comprise an interconnected set of components. The base station <NUM> may comprise a dedicated and/or shared power supply <NUM> that supplies and/or regulates power for the other components. The base station <NUM> may provide power to and/or receive power from another base station and/or server and/or other devices. The base station <NUM> may comprise a shared and/or dedicated climate control unit <NUM> that regulates climate properties, such as temperature, humidity, and/or airflow. Many such base stations <NUM> may be configured and/or adapted to utilize at least a portion of the techniques presented herein.

<FIG> presents a schematic architecture diagram <NUM> of a user equipment (UE) <NUM> (e.g., a communication device) whereupon at least a portion of the techniques presented herein may be implemented. Such a UE <NUM> may vary widely in configuration and/or capabilities, in order to provide a variety of functionality to a user. The UE <NUM> may be provided in a variety of form factors, such as a mobile phone (e.g., a smartphone); a desktop or tower workstation; an "all-in-one" device integrated with a display <NUM>; a laptop, tablet, convertible tablet, or palmtop device; a wearable device, such as mountable in a headset, eyeglass, earpiece, and/or wristwatch, and/or integrated with an article of clothing; and/or a component of a piece of furniture, such as a tabletop, and/or of another device, such as a vehicle or residence. The UE <NUM> may serve the user in a variety of roles, such as a telephone, a workstation, kiosk, media player, gaming device, and/or appliance.

The UE <NUM> may comprise one or more (e.g., hardware) processors <NUM> that process instructions. The one or more processors <NUM> may optionally include a plurality of cores; one or more coprocessors, such as a mathematics coprocessor or an integrated graphical processing unit (GPU); and/or one or more layers of local cache memory. The UE <NUM> may comprise memory <NUM> storing various forms of applications, such as an operating system <NUM>; one or more user applications <NUM>, such as document applications, media applications, file and/or data access applications, communication applications, such as web browsers and/or email clients, utilities, and/or games; and/or drivers for various peripherals. The UE <NUM> may comprise a variety of peripheral components, such as a wired and/or wireless network adapter <NUM> connectible to a local area network and/or wide area network; one or more output components, such as a display <NUM> coupled with a display adapter (optionally including a graphical processing unit (GPU)), a sound adapter coupled with a speaker, and/or a printer; input devices for receiving input from the user, such as a keyboard <NUM>, a mouse, a microphone, a camera, and/or a touch-sensitive component of the display <NUM>; and/or environmental sensors, such as a GPS receiver <NUM> that detects the location, velocity, and/or acceleration of the UE <NUM>, a compass, accelerometer, and/or gyroscope that detects a physical orientation of the UE <NUM>. Other components that may optionally be included with the UE <NUM> (though not shown in the schematic architecture diagram <NUM> of <FIG>) include one or more storage components, such as a hard disk drive, a solid-state storage device (SSD), a flash memory device, and/or a magnetic and/or optical disk reader; a flash memory device that may store a basic input/output system (BIOS) routine that facilitates booting the UE <NUM> to a state of readiness; and/or a climate control unit that regulates climate properties, such as temperature, humidity, and airflow, etc..

The UE <NUM> may comprise a mainboard featuring one or more communication buses <NUM> that interconnect the processor <NUM>, the memory <NUM>, and/or various peripherals, using a variety of bus technologies, such as a variant of a serial or parallel AT Attachment (ATA) bus protocol; the Uniform Serial Bus (USB) protocol; and/or the Small Computer System Interface (SCI) bus protocol. The UE <NUM> may comprise a dedicated and/or shared power supply <NUM> that supplies and/or regulates power for other components, and/or a battery <NUM> that stores power for use while the UE <NUM> is not connected to a power source via the power supply <NUM>. The UE <NUM> may provide power to and/or receive power from other client devices.

<FIG> is an illustration of a scenario <NUM> involving an example non-transitory computer readable medium <NUM>. The non-transitory computer readable medium <NUM> may comprise processor-executable instructions <NUM> that when executed by a processor <NUM> cause performance (e.g., by the processor <NUM>) of at least some of the provisions herein. The non-transitory computer readable medium <NUM> may comprise a memory semiconductor (e.g., a semiconductor utilizing static random access memory (SRAM), dynamic random access memory (DRAM), and/or synchronous dynamic random access memory (SDRAM) technologies), a platter of a hard disk drives, a flash memory device, or a magnetic or optical disc (such as a compact disc (CD), digital versatile disc (DVD), and/or floppy disk). The example non-transitory computer readable medium <NUM> stores computer-readable data <NUM> that, when subjected to reading <NUM> by a reader <NUM> of a device <NUM> (e.g., a read head of a hard disk drive, or a read operation invoked on a solid-state storage device), express the processor-executable instructions <NUM>. In some embodiments, the processor-executable instructions <NUM>, when executed, cause performance of operations, such as at least some of the example method of <FIG>, for example. In some embodiments, the processor-executable instructions <NUM> are configured to cause implementation of a system and/or scenario, such as at least some of the exemplary system described herein.

As used in this application, "module," "system", "interface", and/or the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a controller and the controller can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers (e.g., nodes(s)).

Unless specified otherwise, "first," "second," and/or the like are not intended to imply a temporal aspect, a spatial aspect, an ordering, etc. Rather, such terms are merely used as identifiers, names, etc. for features, elements, items, etc. For example, a first object and a second object generally correspond to object A and object B or two different or two identical objects or the same object.

Moreover, "example," "illustrative embodiment," are used herein to mean serving as an instance, illustration, etc., and not necessarily as advantageous. As used herein, "or" is intended to mean an inclusive "or" rather than an exclusive "or". In addition, "a" and "an" as used in this application are generally be construed to mean "one or more" unless specified otherwise or clear from context to be directed to a singular form. Also, at least one of A and B and/or the like generally means A or B or both A and B. Furthermore, to the extent that "includes", "having", "has", "with", and/or variants thereof are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term "comprising".

Rather, the specific features and acts described above are disclosed as example forms of implementing at least some of the claims.

Furthermore, the claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer (e.g., node) to implement the disclosed subject matter. The term "article of manufacture" as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. Of course, many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.

Various operations of embodiments and/or examples are provided herein. The order in which some or all of the operations are described herein should not be construed as to imply that these operations are necessarily order dependent. Alternative ordering will be appreciated by one skilled in the art having the benefit of this description. Further, it will be understood that not all operations are necessarily present in each embodiment and/or example provided herein. Also, it will be understood that not all operations are necessary in some embodiments and/or examples.

Claim 1:
A method for wireless communication, the method performed by a communication device and comprising:
forming a first resource region of a plurality of resource regions, the first resource region comprising at least a first type of resource element group, REG, bundle and a second type REG bundle, wherein the first type and the second type of REG bundles comprise different sizes of resource element groups, wherein the first type and the second type of REG bundles correspond to candidates of different aggregation levels;
interleaving, using a first interleaving pattern, the first type of REG bundle in the first resource region;
interleaving the second type of REG bundle using a second interleaving pattern in a second resource region of the plurality of resource regions; and
performing, using the first resource region and the second resource region, control channel transmissions,
wherein the second interleaving pattern is based on a ratio of a size of the first type of REG bundle to a size of the second type of REG bundle.