JP7287540B2 - Method, terminal device and network device - Google Patents

Description

TECHNICAL FIELD Non-limiting exemplary embodiments of the present disclosure relate generally to the field of wireless communication technology, and more particularly to methods, devices and apparatus for resource allocation of controlled resource regions.

A new radio access system, also called NR system or NR network, is the next generation communication system. The Radio Access Network (RAN) #71 meeting of the Third Generation Partnership Project (3GPP) working group recognized work on NR systems. NR systems meet all usage, requirements and deployment scenarios defined in technical report TR38.913, including requirements such as enhanced mobile broadband, high capacity machine type communications, ultra-reliable and low latency communications. For the purpose of a single technology framework corresponding to , frequencies up to 100 Ghz are considered.

Recently, it has already been agreed that NR downlink (DL) resource allocation (RA) type 0 can be reused in NR systems, similar to resource allocation type 0 used in 3GPP Long Term Evolution (LTE) systems. However, the unit is six resource blocks (RB). On the other hand, if the control resource set (CORESET) is configured at least with UE-specific RRC signaling, there is no limit on the maximum number of segments for a given CORESET.

In Release 15, there is at most one active DL bandwidth part (BWP) and at most one active uplink (UL) BWP at a given time for one serving cell, and the number of DL RBs in the DL BWP is , 6 RB or not.

Furthermore, unlike the physical downlink control channel (PDCCH) in LTE systems, for minislot-based scheduling, the starting symbol of the CORESET can be placed anywhere within a slot that can collide with a synchronization signal (SS) block. can be a symbol.

Therefore, a new resource allocation for the control resource region in the NR system is required.

To this end, the present disclosure provides novel measures for resource allocation of controlled resource regions in wireless communication systems that mitigate or at least alleviate some of the problems in the prior art.

According to a first aspect of the present disclosure, a method is provided for resource allocation of control resource regions. The method may be performed in a network device, such as an eNB or other similar network device. The method determines resource units each including a predetermined number of resource blocks based on the available transmission resources, and distributes the resource blocks not included in the resource units to the available transmission resources to obtain the resource units. dividing the resource blocks included in the into a plurality of resource segments; allocating one or more of the determined resource units to the control resource region; and resource allocation information indicating the allocated one or more resource units. and sending the

According to a second aspect of the present disclosure, a method of determining resources allocated to a control resource region is provided. The method may be performed at a terminal device, such as a UE or other similar terminal device. The method includes: receiving resource allocation information indicating resources allocated to a control resource region; determining resource units each including a predetermined number of resource blocks based on available transmission resources; dividing the resource blocks contained in the resource unit into a plurality of resource segments by distributing the unallocated resource blocks to the available transmission resources; and based on the resource allocation information and the determined resource unit. , determining resource units allocated to the control resource region.

According to a third aspect of the disclosure, a network device is provided. The network device establishes resource units each including a predetermined number of resource blocks based on available transmission resources, distributes resource blocks not included in the resource units among the available transmission resources, and A processor can be provided that is configured to divide resource blocks included in the unit into a plurality of resource segments and assign one or more of the determined resource units to a control resource region. Also, the network device can further comprise a transceiver configured to transmit resource allocation information indicative of the one or more resource units allocated.

According to a fourth aspect of the disclosure, a terminal device is provided. The terminal device may comprise a transceiver configured to receive resource allocation information indicative of resources allocated to the control resource region. The terminal device determines resource units each including a predetermined number of resource blocks based on available transmission resources, distributes resource blocks not included in the resource units to the available transmission resources, further a processor configured to divide resource blocks included in the unit into a plurality of resource segments and determine resource units allocated to the control resource region based on the resource allocation information and the determined resource units; be prepared.

According to a fifth aspect of the disclosure, a network device is provided. This network device may comprise a processor and memory. The memory may be coupled to a processor having program code that, when executed by a processor, causes the network device to perform the method of the first aspect.

According to a sixth aspect of the disclosure, a terminal device is provided. This terminal device may comprise a processor and memory. The memory can be coupled to the processor, having program code that, when executed by the processor, causes the terminal node to perform the method of the second aspect.

According to a seventh aspect of the present disclosure, there is provided a computer readable storage medium having computer program code recorded thereon, said computer program code being executed to cause an apparatus to perform any of the embodiments of the first aspect. causes the operations of the method of

According to an eighth aspect of the present disclosure, there is provided a computer readable storage medium having computer program code recorded thereon, said computer program code, when executed, causing an apparatus to perform any of the embodiments of the second aspect. causes the operations of the method of

According to a ninth aspect of the present disclosure there is provided a computer program product comprising a computer readable storage medium according to the seventh aspect.

According to a tenth aspect of the present disclosure there is provided a computer program product comprising a computer readable storage medium according to the eighth aspect.

According to embodiments of the present disclosure, effective measures for resource allocation of control resource regions are provided.

These and other features of the present disclosure will become apparent from the detailed description of embodiments illustrated in the embodiments made with reference to the accompanying drawings. In the drawings, the same or similar components are indicated by the same reference numerals
FIG. 1 schematically illustrates resource allocation type 0 in an LTE system. FIG. 2 schematically shows a flow chart of a resource allocation method for control resource regions in a wireless communication system according to an embodiment of the present disclosure. FIG. 3A schematically illustrates an example of partitioning RBs included in a resource unit with remaining RBs according to one embodiment of the present disclosure. FIG. 3B schematically illustrates another example of partitioning RBs included in a resource unit with remaining RBs according to an embodiment of the present disclosure. FIG. 3C schematically illustrates yet another example of partitioning RBs included in a resource unit with remaining RBs according to an embodiment of the present disclosure. FIG. 4 schematically shows an RBG size table in the LTE system. FIG. 5 schematically shows two examples of RBG size tables for CORESET according to one embodiment of the present disclosure. FIG. 6 schematically illustrates another example RBG size table for CORESET according to one embodiment of the present disclosure. FIG. 7 schematically illustrates yet another example of an RBG size table for CORESET according to one embodiment of the present disclosure. Figure 8 schematically shows the resources within the SS/PBCH block in the time domain. FIG. 9 schematically illustrates a collision situation that can occur between a one-symbol CORESET and an SS/PBCH block, according to one embodiment of the present disclosure. FIG. 10 schematically illustrates an example table of the number of RBs occupied in an SS/PBCH block in different collision cases, according to an embodiment of the present disclosure. FIG. 11 schematically illustrates an example of CORESET resource allocation in the time domain according to one embodiment of the disclosure. FIG. 12 schematically illustrates a possible collision situation between a 2-symbol CORESET and an SS/PBCH block, according to one embodiment of the present disclosure. FIG. 13 schematically illustrates an example table of the number of RBs occupied in an SS/PBCH block in different collision cases, according to an embodiment of the present disclosure. FIG. 14 schematically illustrates an example of CORESET resource allocation in the time domain according to one embodiment of the disclosure. FIG. 15 schematically illustrates a collision situation that can occur between a 3-symbol CORESET and an SS/PBCH block, according to one embodiment of the present disclosure. FIG. 16 schematically illustrates an example table of the number of RBs occupied in an SS/PBCH block in different collision cases, according to an embodiment of the present disclosure. FIG. 17 schematically illustrates an example of CORESET resource allocation in the time domain according to one embodiment of the disclosure. FIG. 18 schematically illustrates a flow chart of a method for determining resources allocated to a controlled resource region, according to an embodiment of the present disclosure; FIG. 19 schematically shows a block diagram of an apparatus for resource allocation of control resource regions in a wireless communication system according to one embodiment of the present disclosure. FIG. 20 schematically shows a block diagram of an apparatus for determining resources allocated to control resource regions in a wireless communication system according to an embodiment of the present disclosure. FIG. 21 shows apparatus 2110, which can be embodied in or included in a network node such as a gNB and a terminal device such as a UE described herein. 21 schematically shows a simplified block diagram of a device 2120. FIG.

Hereinafter, the measures provided in the present disclosure will be described in detail in embodiments with reference to the accompanying drawings. It should be understood that these embodiments are provided to enable those skilled in the art to better understand and practice the present disclosure, and are not intended to limit the scope of the present disclosure in any way.

In the accompanying drawings, various embodiments of the present disclosure are illustrated in block diagrams, flowcharts, and other diagrams. Each block of flowcharts or blocks may represent a module, program, or portion of code containing one or more executable instructions to implement a particular logic function, and is not required by this disclosure. Blocks are indicated by dashed lines. Moreover, although the blocks are shown in a particular sequence for performing method steps, in practice they do not necessarily follow the illustrated sequence exactly. For example, depending on the nature of the respective operations, they can be performed in reverse sequence or concurrently. Also, each block of the block diagrams and/or flowcharts, and combinations thereof, can be implemented by a dedicated hardware-based system that performs the specified functions/operations, or by a combination of dedicated hardware and computer instructions.

Generally, all terms used in the claims are to be interpreted according to their ordinary meaning in the technical field, unless explicitly defined otherwise herein. References to "one/the above/said [elements, devices, compositional parts, means, steps, etc.]" may be used to refer to any of the above, without excluding a plurality of devices, compositional parts, means, units, steps, etc., unless expressly stated otherwise. should be construed broadly to refer to at least one instance of an element, device, compositional part, means, unit, step, or the like. Furthermore, "a" as used herein is not intended to exclude multiple steps, units, modules, devices, objects, and the like.

Further, in the description of this disclosure, user equipment (UE) may refer to a terminal, mobile terminal (MT), subscriber station, portable subscriber station, mobile station (MS), or access terminal (AT). , UE, terminal, MT, SS, mobile subscriber station, MS, or AT, may be included. Further, in the description of this disclosure, the term "BS" may be used to refer to, for example, a NodeB (NodeB or NB), an evolved NodeB (eNodeB or eNB), a gNB (Next Generation NodeB), a radio header (RH), a remote radio head (RRH), relays, or low power nodes such as femto, pico, etc.

As an illustration, FIG. 1 shows a diagram of resource allocation (RA) type 0 in an LTE system. As shown in Figure 1, RA type 0 is used for DL resource allocation. In 10 MHz Downlink Control Information (DCI) Format 1, a 17-bit bitmap indicates resource allocation, each bit corresponding to a resource block group (RBG), as indicated by Bit2, Bit3, and Bit5 in FIG. , RBG is assigned or not. In an LTE system with a system bandwidth of 10 MHz, the system bandwidth contains 50 resource blocks, divided into 17 RBGs each containing 3 RBs (except the last RBG). The number of RBs in an RBG, also called RBG size, depends on the system bandwidth, ie the number of RBs. As can be seen from FIG. 1, the allocated resources may or may not be multiples of 6 RBs. In addition, the last RBG contains only 2 RBs, which also does not meet the requirement on units of 6 RBs for CORESET resource allocation in NR systems.

Accordingly, the present disclosure provides novel strategies for resource allocation of control resource regions that can mitigate or at least alleviate some of the problems in the prior art. The countermeasures provided in the present disclosure will be described in detail below, also with reference to FIGS. 2-21. It should be understood that the following embodiments are merely illustrative and do not limit the present disclosure.

FIG. 2 schematically illustrates a flow chart of a resource allocation method 200 for control resource regions in a wireless communication system according to an embodiment of the present disclosure. Method 200 can be performed in a network device, such as an eNB or other similar network device.

As shown in FIG. 2, at step 201, a network device may determine resource units based on available transmission resources. Each resource unit includes a predetermined number of resource blocks (eg, 6 RBs), and the resource blocks not included in the resource unit are distributed over the available transmission resources to replace the resource blocks included in the resource unit. It can be divided into multiple resource segments.

As used herein, the term "resource unit" refers to the basic unit used in the resource allocation process, where the allocated resource can be multiple resource units, but only one of the resource units. cannot be only part. A resource unit as a basic unit may contain a predetermined number of resource blocks. For example, the predetermined number can be 6 to meet the CORESET resource allocation requirements in the NR system.

Also, the total number of resource blocks included in the bandwidth part (BWP) may not be a multiple of 6 RBs. For example, in a 10 MHz LTE system, the system bandwidth consists of 50 RBs and the last one RBG contains only 2 RBs. Furthermore, in NR systems, the maximum and minimum number of resource blocks are defined, while the number of RBs in BWP can be configured according to different cells. For example, the number of RBs in the BWP may be any number within the allowable range or any predetermined value within the allowable range. Therefore, the number of RBs in the BWP is likely not a multiple of 6 RBs. However, in the NR system, CORESET resource allocation is performed in units of 6 RBs, so RBGs having other numbers of RBs cannot be allocated to the control resource region.

To solve this problem, this disclosure proposes to exclude RBs that cannot form an RBG as required from resource allocation. That is, there may be some remaining RBs that are not included in any resource unit because they are not used for resource allocation. The RBs not included in the resource unit can be distributed over the available transmission resources to divide the resource blocks included in the resource unit into multiple resource segments. In other words, the RBs not included in those resource units are isolated from each other, rather than concentrated, dividing other RBs into multiple resource segments as dividers. In this way, frequency dispersion gain can be obtained.

ただし、

はＢＷＰにおける利用可能なＲＢの数を示す。リソースユニットに含まれていないｍ個のリソースブロックは、任意の適切な方法でＢＷＰ全体にわたって分散することができる。リソースユニットに含まれていないｍ個のリソースブロックは、利用可能な伝送リソースに均一に分散することが好ましい。即ち、リソースユニットに含まれていないｍ個のリソースブロックは、リソースユニットに含まれているＲＢを（ｍ＋１）個の等しい長さのセグメントに分割する仕切りとして利用可能である。 The number m of remaining RBs can be determined based on available transmission resources and a predetermined number of RBs contained in a resource unit. For example, m can be calculated by the following formula.

however,

denotes the number of available RBs in the BWP. The m resource blocks that are not included in resource units may be distributed across the BWP in any suitable manner. The m resource blocks not contained in a resource unit are preferably evenly distributed over the available transmission resources. That is, the m resource blocks not included in the resource unit can be used as dividers for dividing the RBs included in the resource unit into (m+1) equal length segments.

ただし、ｊは仕切りのシリアル番号を示し、Ｄｊは仕切りｊのインデックスを示し、

は切り捨て操作を示す。 In one embodiment of the present disclosure, the index Dj of partition j of the m remaining partitions can be determined as follows.

where j denotes the serial number of the partition, Dj denotes the index of the partition j,

indicates a truncation operation.

By way of illustration, FIG. 3A schematically illustrates an example of splitting RBs included in a resource unit with remaining RBs according to one embodiment of the present disclosure. As shown in FIG. 3A, for 50 RBs, there are 2 remaining RBs defined as RB16 and RB33, so the RBs contained in the resource unit are divided into 3 equal length segments. .

Note that for all possible RB numbers in the BWP, the above formula can determine the resource unit at the network device, although the disclosure is not so limited. It is also possible to configure several predetermined resource unit patterns for several predetermined RB numbers. In this case, when the network device obtains the RB number of the BWP, it can obtain the resource unit pattern without defining it with the above formula.

It is also possible to perform a circular shift operation on the index Dj or the starting resource block index in the BWP to obtain further frequency selection gain. The cyclic shift can be performed based on at least one of, eg, a radio network temporary identifier (RNTI), cell identifier (ID), subframe number, slot number, symbol index, and the like. By way of illustration, Figures 3B and 3C schematically illustrate two examples of cyclic shifts according to one embodiment of the present disclosure.

As shown in FIG. 3B, unlike FIG. 3A, the indices of the two remaining RBs are circularly shifted by four RBs, thereby changing the remaining RBs from RB16 and RB33 to RB20 and RB37. In FIG. 3C, instead of the indices of the two remaining RBs, the index of the starting RB of the PBW is circularly shifted backward by four RBs, and the index of the starting RB is changed from RB0 to RB46.

Returning to FIG. 2, at step 202 the network may allocate one or more of the determined resource units to the control resource region. In one embodiment of the present disclosure, resource allocation may be performed based on resource group size for the control resource region, and the resource group size is determined based on available transmission resources. In the LTE system, the RBG size depends on the system bandwidth, as shown in Table 7.1.6.1-1 of TS36.213 (see Figure 4). Therefore, in NR systems, resource allocation can also be based on resource group sizes that are determined based on available transmission resources. For example, by zooming in, the RBG size table shown in FIG. 4 can be modified.

FIG. 5 shows two examples of RBG size tables for CORESET according to one embodiment of the present disclosure. As shown in FIG. 5, the upper right table of FIG. 5 is obtained by enlarging the lower bound of the system bandwidth and the RBG size by a factor of 6. Alternatively, by increasing the upper limit of the system bandwidth and the RBG size by a factor of 6, the lower right table of FIG. 5 can be obtained. As shown in Table 4.4.2-1 of 3GPP TS 38.211, the upper limit of system bandwidth is 275 RB. Therefore, either of two tables can be used to determine the RBG size in the CORESET resource allocation. Note that the RBG size is the number of RBs in the RBG, but can also indicate the number of resource units in the RBG. In this case, there is no need to expand the RBG size in the table as shown in FIG.

Furthermore, in NR systems, the maximum and minimum number of RBs may also differ for different types of subcarrier spacing. Therefore, it is possible to further modify the two tables shown in FIG. By way of illustration, FIG. 6 schematically illustrates another example of RBG sizes for a CORESET table according to one embodiment of the present disclosure. As shown in Figure 6, the lower and upper bounds are further modified by the maximum number of RBs as shown in Table 4.4.2-1 of 3GPP TS 38.211. That is, the upper limit on the first line is changed to 69, and the upper limit on the second line is changed to 138. 69 and 138 are the maximum number of RBs for subcarrier expansion factors μ=4 and μ=5, respectively.

In addition, a constant RBG size can be set for different numbers of RBs. For example, the RBG size can be the same as the number of RBs included in the resource unit. That is, the RBG size is the same as the resource unit size. FIG. 7 schematically shows yet another example of an RBG size table according to an embodiment of the present disclosure, where the RBG size is 6 for any number of RBs.

Any of the tables shown in FIGS. 5-7 establish the RBG size and allow the network device to allocate resource units to the CORESET according to the RBG size. It will be appreciated that using different RBG sizes reduces the overhead of resource allocation indication. The details will be described later.

Returning now to FIG. 2, at step 203, the network device may transmit resource allocation information indicating the allocated one or more resource units to the terminal device. The resource allocation information can use a bitmap as in the LTE system. However, unlike bitmaps in LTE systems, the number of bits may be smaller than the number of bits used in LTE systems. Furthermore, if different RBG sizes are used, different sized bitmaps can be used. In this case, each bit corresponds to an RBG rather than a resource unit. This further reduces the size of the bitmap when RGB contains more than 6 RGs.

Furthermore, as mentioned in the Background Art, the CORESET can collide with the Synchronization Signal (SS)/PBCH block. This disclosure further provides countermeasures to potential conflicts in resource allocation. As shown in step 204, the network device may determine the available transmission resources based on the transmission resources to be used for the bandwidth portion and the conflict situation between the control resource region and the SS blocks. That is, resources used for transmission of SS/PBCH blocks are not considered for transmission of the control resource region.

An SS/PBCH block consists of four symbols in the time domain, numbered from 0 to 3 in the SS/PBCH block, and a primary synchronization signal (PSS), a secondary synchronization signal (SSS) and a physical symbol. Broadcast channels (PBCH) occupy different symbols. As shown in FIG. 8, PSS and SSS occupy symbols 0 and 2, while PBCH occupies symbols 1 and 3. FIG.

Furthermore, for different subcarrier spacings, the possible starting positions of the SS/PBCH blocks are different. By way of illustration, OFDM symbols of candidate SS/PBCH blocks for different types of subcarrier spacing are briefly described.
- 15 KHz subcarrier spacing: the 1st OFDM symbol of the candidate SS/PBCH block has an index of {2,8}+14*n. For carrier frequencies up to 3 GHz, n=0,1.For carrier frequencies greater than 3 GHz and up to 6 GHz, n=0,1,2,3.
- 30 KHz subcarrier spacing: the 1st OFDM symbol of the candidate SS/PBCH block has an index of {4,8,16,20}+28*n. For carrier frequencies up to 3 GHz, n=0. For carrier frequencies greater than 3 GHz and up to 6 GHz, n=0,1.
- 60 KHz subcarrier spacing: the 1st OFDM symbol of the candidate SS/PBCH block has an index of {2,8}+14*n. For carrier frequencies up to 3 GHz, n=0,1.For carrier frequencies greater than 3 GHz and up to 6 GHz, n=0,1,2,3.
- 120 KHz subcarrier spacing: the 1st OFDM symbol of the candidate SS/PBCH block has an index of {4,8,16,20}+28*n. For carrier frequencies greater than 6 GHz and less than or equal to 6 GHz, n=0,1,2,3,5,6,7,8,10,11,12,13,15,16,17,18.
- 240 KHz subcarrier spacing: the 1st OFDM symbol of the candidate SS/PBCH block has an index of {8, 12, 16, 20, 32, 36, 40, 44} + 56*n. For carrier frequencies greater than 6 GHz, n=0,1,2,3,5,6,7,8.

In the following, the collision avoidance measures will be described using a subcarrier spacing of 15 KHz as an example. However, as one skilled in the art will appreciate, the present disclosure can be applied to any other subcarrier spacing in a similar manner. Collision avoidance measures when the CORESET occupies only one symbol will be described with reference to FIGS. 9-11.

As shown in FIG. 9, there are five collision situations for one symbol's CORESET. Case 1 is the situation where the CORESET is at symbol 0 in the SS/PBCH block and thus collides with the PSS. Case 2 is the situation where the CORESET is at symbol 1 in the SS/PBCH block and thus collides with the first PBCH. Case 3 is the situation where the CORESET is at symbol 2 in the SS/PBCH block and thus collides with SSS. Case 4 is the situation where the CORESET is at symbol 3 in the SS/PBCH block and thus collides with the second PBCH. Case 5 is the situation where no collision occurs between the CORESET and the SS/PBCH block. Different collision situations cause different frequency resources that may collide, and thus different RB resources that need to be avoided.

An embodiment of the present disclosure may provide a table listing the number of RB resources that need to be avoided in different collision cases. By way of illustration, FIG. 10 shows a table of the number of RB resources occupied by SS/PBCH blocks in different collision cases according to one embodiment of the present disclosure. As shown in FIG. 10, for case 2 or 4, ie, when the CORESET is within symbols 3, 5, 9, 11, the number of RBs occupied by the SS/PBCH block is 24. For case 1 or 3, ie, when the CORESET is in symbols 2, 4, 8, 10, the number of RBs occupied by the SS/PBCH block is 12. On the other hand, for other cases like case 5, i.e., when CORESET is within symbols 0, 1, 6, 7, 12, 13, no collisions occur, so the number of RBs occupied by the SS/PBCH block is is zero.

FIG. 11 schematically illustrates an example of CORESET resource allocation in the time domain according to one embodiment of the disclosure. As shown in FIG. 11, the SS/PBCH block can start at symbol 2 or symbol 8 in the subframe. In FIG. 11, CORESET1 is at symbol 6, so there is no collision, but CORESET2 and CORESET3 are at symbols 3 and 4, corresponding to cases 2 and 3. In FIG. In this case, the available transmission resources can be determined based on the transmission resources within the bandwidth portion and the conflict situation between the control resource region and the SS block using the table shown in FIG.

は、下式で算出できる。

だたし、

はＢＷＰの帯域幅（即ち、ＲＢの数）を示し、

は図１０に示すテーブルから取得できる、ＳＳ/ＰＢＣＨブロックが占めるＲＢの数を示す。 For example, for each of CORESETs 1 to 3, the network device refers to the table shown in FIG. 10 to determine the resources occupied by the SS/PBCH blocks, and removes the resources occupied by the SS/PBCH blocks from the BWP, CORESET can determine available transmission resources. For example, CORESET available resources in the frequency domain

can be calculated by the following formula.

but

denotes the BWP bandwidth (i.e. the number of RBs), and

indicates the number of RBs occupied by the SS/PBCH block, which can be obtained from the table shown in FIG.

Figures 12-15 schematically illustrate collision avoidance measures when a CORESET occupies two symbols. As shown in FIG. 12, for a CORESET of two symbols, there are six collision situations. Case 1 is the situation where the CORESET starts at the symbol before symbol 0 in the SS/PBCH block and therefore collides with the PSS only. Case 2 is a situation where the CORESET starts at symbol 0 in the SS/PBCH block and thus collides with both the PSS and the first PBCH. Case 3 is the situation where the CORESET starts at symbol 1 in the SS/PBCH block and thus collides with both the first PBCH and the SSS. Case 4 is the situation where the CORESET starts at symbol 2 in the SS/PBCH block and thus collides with both the SSS and the second PBCH. Case 5 is the situation where the CORESET starts at symbol 3 on the SS/PBCH, so it collides only with the second PBCH. Case 6 is the situation where no collision occurs between the CORESET and the SS/PBCH block.

Similarly, a table can be provided listing the number of RB resources occupied by SS/PBCH blocks in different collision cases. By way of illustration, FIG. 13 shows a table of the number of RB resources occupied by SS/PBCH blocks in different collision cases according to one embodiment of the present disclosure. As shown in FIG. 13, for Case 1, ie CORESET collides with PSS only, the number of RBs occupied by the SS/PBCH block is 12. For cases 2-5, ie when the CORESET collides with at least one PBCH, the number of RBs occupied by the SS/PBCH block is 24. For other cases without collisions, such as case 6, the number of RBs occupied by the SS/PBCH block is zero.

FIG. 14 schematically illustrates an example of CORESET resource allocation in the time domain according to one embodiment of the disclosure. As shown in FIG. 14, CORESET1 occupies symbols 9 and 10 and corresponds to case 3. Since CORESET2 occupies symbols 6 and 7, no collision occurs. CORESET3 occupies symbols 11 and 12 and corresponds to case 5. Similarly, for each of CORESETs 1 to 3, the network device refers to the table shown in FIG. 13 to determine the resources occupied by the SS/PBCH blocks and removes the resources occupied by the SS/PBCH blocks from the BWP. , CORESET can determine the available transmission resources.

Figures 15-17 schematically illustrate collision avoidance measures when the CORESET occupies three symbols. As shown in FIG. 15, for a CORESET of 3 symbols, there are 7 collision situations. Case 1 is the situation where the CORESET starts at the second symbol before symbol 0 in the SS/PBCH block, so it collides with the PSS only. Case 2 is a situation where the CORESET starts at the symbol immediately before symbol 0 in the SS/PBCH block, thus colliding with both the PSS and the first PBCH. Case 3 is a situation where the CORESET starts from symbol 0 in the SS/PBCH block and thus collides with the PSS, first PBCH and SSS. Case 4 is a situation where the CORESET starts from symbol 1 in the SS/PBCH block, so it collides with the 1st PBCH, SSS and 2nd PBCH. Case 5 is the situation where the CORESET starts at symbol 2 on SS/PBCH, so it collides with both SSS and the second PBCH. Case 6 is a situation where the CORESET starts at symbol 3 on the SS/PBCH, so it only collides with the 2nd PBCH. Case 7 is the situation where no collision occurs between the CORESET and the SS/PBCH block.

Similarly, a table can be provided listing the number of RB resources occupied by SS/PBCH blocks in different collision cases. By way of illustration, FIG. 16 shows a table of the number of RB resources occupied by SS/PBCH blocks in different collision cases according to one embodiment of the present disclosure. As shown in FIG. 16, for case 1, ie, when CORESET collides with PSS only, the number of RBs occupied by the SS/PBCH block is twelve. For cases 2-6, the CORESET collides with at least one PBCH, and the number of RBs occupied by the SS/PBCH block is 24. For other cases where collisions do not occur, such as case 6, the number of RBs occupied by the SS/PBCH block is zero.

FIG. 17 schematically illustrates an example of CORESET resource allocation in time frequency according to one embodiment of the present disclosure. As shown in FIG. 17, CORESET1 occupies symbols 6-8 and corresponds to case 1. CORESET2 occupies symbols 2-4 and corresponds to case 3. CORESET3 occupies symbols 7-9 and corresponds to case 2. Similarly, for each of CORESETs 1 to 3, the network device refers to the table shown in FIG. 13 to determine the resources occupied by the SS/PBCH blocks and removes the resources occupied by the SS/PBCH blocks from the BWP. , CORESET can determine the available transmission resources.

It should be noted that although conflict avoidance in resource allocation is proposed, conflict issues after resource allocation can also be addressed. In this case, the bandwidth of the BWP can be considered an available resource of the CORESET.

Also, a COREST that occupies more than one symbol is considered as a whole in resource allocation, although the disclosure is not so limited. In fact, a CORESET occupying two or three symbols can also be treated as two or three CORESETs each occupying one symbol. That is, resource allocation can be performed for each symbol of the CORESET.

Furthermore, in another embodiment of the present disclosure, in the resource allocation operation of step 202, the resource group size may be determined by further considering the conflict situation between the control resource region and the synchronization signal/physical broadcast channel block. can. In other words, the available transmission resources may be transmission resources determined based on the bandwidth of the BWP to be used and the collision situation of the control resource regions described with reference to FIGS. 9-17. .

The measures for resource allocation of the control resource area in the network device have been described above with reference to FIGS. Next, measures for resource determination of the control resource area in the terminal device will be described with reference to FIG.

FIG. 18 schematically shows a flow chart of a resource determination method for a control resource region in a wireless communication system according to an embodiment of the present disclosure. Method 1800 can be performed at a terminal device, eg, a UE or other similar terminal device.

As shown in FIG. 18, at step 1801, a terminal device may receive resource allocation information from a network device indicating resources allocated to a control resource region. The resource allocation information indicates resources allocated to the controlled resource region by the network device. As mentioned above, the resource allocation can take the form of a bitmap, with each bit indicating whether the corresponding RBG has been allocated to the terminal device.

Then, in step 1802, the terminal device may determine resource units based on available transmission resources, similar to network devices. A resource unit is a basic unit containing a predetermined number of resource blocks. Some resource blocks may not be included in a resource unit due to the fact that the total number of available transmission resources may not be a multiple of the predetermined number. The resource blocks not included in the resource unit can be distributed over the available transmission resources so that the resource blocks included in the resource unit can be divided into multiple resource segments.

In one embodiment of the present disclosure, resource blocks not included in resource units may be evenly distributed over the available transmission resources. In this way, a resource block included in a resource unit can be divided into multiple resource segments with equal length, as shown in FIG. 3A. Also, as shown in FIG. 3B, the indices of resource blocks that are not included in a resource unit can be further cyclically shifted. Alternatively, the starting resource block index of the available transmission resources can be circularly shifted, as shown in FIG. 3C. For details of resource unit determination, refer to the description with reference to FIGS. 3A-3C.

Note that the resource units can be determined at the terminal device for all possible RB numbers in the BWP, although the disclosure is not so limited. It is also possible to configure several predetermined resource unit patterns for several predetermined RB numbers. In this case, when the terminal device obtains the RB number of the BWP, it can obtain the resource unit pattern without defining it with the formula described herein.

ただし、

は切り捨て操作を示す。これにより、リソースユニットインデックスｎ_ｕｎｉｔは、０からｎ_ｕｎｉｔ－１までの番号を取ることができる。本開示の一実施形態では、リソースユニットのそれぞれには６つのＲＢが含まれ、リソースユニットのそれぞれについて、リソースブロックが残りＲＢである場合、この残りＲＢをスキップすることができる。例示として、割り当てられたリソースを確定する方法を以下に示す。

In one embodiment of the present disclosure, if the predetermined number of RBs is 6, the total number of resource units in the available resources can be calculated as follows.

however,

indicates a truncation operation. This allows the resource unit index n _unit to take numbers from 0 to n _unit −1. In one embodiment of the present disclosure, each resource unit includes 6 RBs, and for each resource unit, if a resource block is a remaining RB, this remaining RB can be skipped. By way of illustration, the method for determining the allocated resources is shown below.

In this way, the terminal device can obtain the RB index in the resource units that can be assigned to the CORESET.

Then, in step 1803, the terminal device may determine resource units allocated to the control resource region based on the resource allocation information and the determined resource units. After obtaining the determined resource units, the terminal device can utilize the indication included in the resource allocation information to determine which resource units among the determined resource units are allocated to the control resource region. . The resource allocation information can take the form of a bitmap, with each bit indicating whether the corresponding resource unit has been allocated to the control resource region. Accordingly, with such resource allocation information, the terminal device can easily grasp the resource units allocated to the control resource region.

The resource units allocated to the control resource region can be further determined based on the resource group size of the control resource region. The resource group size can be determined based on available transmission resources, eg, by the tables shown in any of FIGS. 5-7. Different resource group sizes may have different bits in the bitmap. For example, if the group size is 6, 1 bit indicates the corresponding 6-bit RBG allocation, and if the group size is 12, 1 bit indicates the corresponding 12-bit RBG allocation. Therefore, the resource group size can be used to determine the resource units allocated to the control resource region.

In addition, transmission resources that can be used by the control resource region can be determined in consideration of collision situations between the control resource region and the synchronization signal/physical broadcast channel block. The detailed operation of the available transmission resources in the network device is similar to that in the terminal device, so detailed description is omitted here. For details, reference can be made to the description with reference to FIGS.

The embodiment of determining the resources allocated to the control resource region has been briefly described above with reference to FIG. 18 . As for the operation in the terminal device, the description referring to FIGS. 2 to 17 can be referred to for the details of the operation in order to correspond to the operation in the terminal device.

FIG. 19 further schematically shows a block diagram of an apparatus for resource allocation of control resource regions in a wireless communication system according to an embodiment of the present disclosure. Apparatus 1900 may be implemented in a network device, such as an eNB or other similar network device.

As shown in FIG. 19, device 1900 includes resource unit determination module 1901 , resource allocation module 1902 and indication transmission module 1903 . A resource unit determination module 1901 determines a resource unit including a predetermined number of resource blocks based on available transmission resources, and distributes resource blocks not included in the resource unit to the available transmission resources. , to divide resource blocks included in a resource unit into a plurality of resource segments. Resource allocation module 1902 can be configured to allocate one or more of the determined resource units to the control resource region. The indication transmission module 1903 can be configured to transmit resource allocation information indicating one or more allocated resource units.

In one embodiment of the present disclosure, the apparatus may further comprise an available resource determination module 1904 . The available resource determination module 1904 determines the available transmission resources according to the transmission resources in the bandwidth part to be used and the conflict situation between the control resource region and the synchronization signal/physical broadcast channel block. can be configured.

In another embodiment of the present disclosure, resource blocks not included in resource units may be evenly distributed over the available transmission resources.

In yet another embodiment of the present disclosure, the resource unit determination module further cyclically shifts the index of the resource block not included in the resource unit, cyclically shifts the index of the starting resource block of the available transmission resource. may be configured to perform at least one of the following:

In yet another embodiment of the present disclosure, the resource allocation module 1902 further allocates one or more of the determined resource units based on the resource group size of the control resource region, and the resource group size determines the available transmission resources. may be configured to be determined based on

In yet another embodiment of the present disclosure, the resource group size may be determined by further considering collision situations between control resource regions and synchronization signals/physical broadcast channel blocks.

FIG. 20 schematically shows a block diagram of an apparatus for determining resources allocated to control resource regions in a wireless communication system according to an embodiment of the present disclosure. Apparatus 2000 can be implemented in a terminal device, eg, a UE or other similar terminal device.

As shown in FIG. 20, the device 2000 includes an indication receiving module 2001, a resource unit determination module 2002 and an allocation resource determination module 2003. As shown in FIG. The indication receiving module 2001 is configured to receive resource allocation information indicating resources allocated to the control resource region. A resource unit determination module 2002 determines resource units each including a predetermined number of resource blocks according to the available transmission resources, and distributing the resource blocks not included in the resource units to the available transmission resources. is configured to divide a resource block included in a resource unit into a plurality of resource segments. The allocation resource determination module 2003 is configured to determine resource units allocated to the control resource region based on the resource allocation information and the determined resource units.

In one embodiment of the present disclosure, apparatus 2000 may further comprise an available resource determination module 1904 . The available resource determination module 1904 determines the available transmission resources according to the transmission resources in the bandwidth part to be used and the conflict situation between the control resource region and the synchronization signal/physical broadcast channel block. may be configured.

In another embodiment of the present disclosure, resource blocks not included in resource units may be evenly distributed over the available transmission resources.

In another embodiment of the present disclosure, the resource unit determination module 2002 further circularly shifts the index of the resource block not included in the resource unit, circularly shifts the index of the starting resource block of the available transmission resource. may be configured to perform at least one of the following:

In yet another embodiment of the present disclosure, the allocation resource determination module 2003 further determines the resource units allocated to the control resource region based on the resource group size of the control resource region, and the resource group size is available. It may be configured to be determined based on transmission resources.

In yet another embodiment of the present disclosure, the resource group size may be determined by further considering collision situations between control resource regions and synchronization signals/physical broadcast channel blocks.

Apparatuses 1900 and 2000 have been briefly described above with reference to FIGS. It should be noted that the devices 1900 and 2000 may be configured to implement the functionality described with reference to Figures 2-18. Accordingly, reference may be made to the method steps described with reference to FIGS. 2-18 for details of the operation of the modules in these devices.

Also, components of devices 1900 and 2000 may be implemented in hardware, software, firmware, and/or any combination thereof. For example, components of apparatuses 1900 and 2000 may each be implemented in a circuit, processor, or any other suitable selection device.

Those skilled in the art can appreciate that the above examples are merely non-limiting illustrations, and that the present disclosure is not limited thereto. Various variations, additions, deletions, and modifications can be easily conceived by those skilled in the art from the teachings provided herein, and all of these variations, additions, deletions, and modifications fall within the protection scope of the present disclosure. included.

Additionally, in some embodiments of the present disclosure, devices 1900 and 2000 may comprise at least one processor. At least one processor suitable for use with embodiments of the present disclosure may illustratively comprise known or later developed general purpose and special purpose processors. Devices 1900 and 2000 may further comprise at least one memory. The at least one memory may comprise, for example, semiconductor memory devices such as RAM, ROM, EPROM, EEPROM, and flash memory devices. At least one memory may be used to store a program of computer-executable instructions. The programs can be written in high-level and/or low-level compilable or interpretable programming languages. According to embodiments, the computer-executable instructions may be configured by at least one processor to cause the devices 1900 and 2000 to operate according to at least the methods described with reference to FIGS. 2-18, respectively. .

FIG. 21 shows an apparatus 2110 that can be embodied as or included in a network node such as a gNB and a terminal device such as the UE described herein. 21 schematically shows a simplified block diagram of an apparatus 2120 that can be used.

Apparatus 2110 comprises at least one processor 2111 such as a data processor (DP) and at least one memory (MEM) 2112 coupled to processor 2111 . Device 2110 may further comprise transmitter TX and receiver RX 2113 operably coupled to processor 2111 and communicatively connected to device 2120 . MEM 2112 stores a program (PROG) 2114 . PROG 2114 , when executed by an associated processor 2111 , may contain instructions that cause device 2110 to operate in accordance with embodiments of the present disclosure, eg, method 200 . The combination of at least one processor 2111 and at least one MEM 2112 can form processing means 2115 implementing various embodiments of the present disclosure.

Device 2120 comprises at least one processor 2211 such as a DP and at least one MEM 2122 coupled to processor 2211 . Device 2120 may further comprise a suitable TX/RX 2123 operably coupled to processor 2211 and communicatively connected to device 2110 . MEM 2122 stores PROG 2124 . PROG 2124 , when executed by an associated processor 2211 , may contain instructions that cause device 2120 to operate in accordance with embodiments of the present disclosure, eg, method 1800 . The combination of at least one processor 2211 and at least one MEM 2122 can form processing means 2125 implementing various embodiments of the present disclosure.

Various embodiments of the present disclosure can be implemented in a computer program executable by one or more of processors 2111, 2211, software, firmware, hardware, or combinations thereof.

MEMs 2112 and 2122 may be of any type suitable for the local technology environment and include, as non-limiting examples, semiconductor-based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory and mobile It can be implemented in any suitable data storage technology such as memory.

Processors 2111 and 2211 may be of any type suitable for the local technology environment and are based on general purpose computers, special purpose computers, microprocessors, digital signal processors DSP, and multi-core processor architectures, as non-limiting examples. One or more of the processors can be included.

The present disclosure can also provide a carrier containing the computer program described above, the carrier being one of an electrical signal, an optical signal, a radio signal, or a computer-readable storage medium. The computer readable storage medium can be, for example, an optical compact disc or an electrical memory device such as RAM (random access memory), ROM (read only memory), flash memory, magnetic tape, CD-ROM, DVD, Blu-ray disc. good too.

The techniques described herein may be implemented by various means. For example, a device that implements one or more functions of the corresponding devices described in the embodiments comprises not only prior art means, but also means that implements one or more functions of the corresponding devices described in the embodiments. . Also, the apparatus may comprise separate means for each function or means adapted to perform more than one function. For example, these techniques may be implemented in hardware (one or more devices), firmware (one or more devices), software (one or more modules), or a combination thereof. With firmware or software, implementation can be through modules (eg, procedures, functions, and so on) that perform the functions described herein.

The exemplary embodiments of the present disclosure are described above with reference to block diagrams and flowchart illustrations of methods and apparatus. It should be noted that each block of the block diagrams and flowchart illustrations, and combinations of blocks in the block diagrams and flowchart illustrations, respectively, can be implemented by various means including computer program instructions. These computer program instructions are loaded into a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine such that the instructions executed on the computer or other programmable data processing apparatus Flowchart blocks or means for implementing the functionality set forth in the blocks may be formed.

Although this specification contains various specific implementation details, these details should not be construed as any limitations on the implementation or the claims, rather than specific implementation specific embodiments. should be construed as a description of the features. The features described in each embodiment described in this specification can also be implemented in combination in a single embodiment. Conversely, various features that are described in a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Further, although the above may describe and initially claim features to operate in a particular combination, one or more features from the claimed combination may be deleted from that combination. Alternatively, a claimed combination may be applied to subcombinations or variations of subcombinations.

It will be obvious to a person skilled in the art that as technology advances, the inventive concept can be implemented in various ways. The above-described embodiments are provided for illustrative purposes and do not limit the present disclosure. Also, modifications and changes can be made without departing from the spirit and scope of this disclosure, as will be readily apparent to those skilled in the art. These modifications and changes are also included within the scope of this disclosure and appended claims. The protection scope of the disclosure is defined by the appended claims.

Claims (16)

A method performed by a terminal device, comprising:
receiving resource allocation information for a control resource set (CORESET) in a bandwidth part (BWP);
receiving downlink control information based on the resource allocation information;
including
the resource allocation information indicates one or more resource units allocated for the CORESET;
the BWP further includes a plurality of resource blocks that are not for the CORESET;
the plurality of resource blocks divide the BWP into a plurality of resource segments;
Method. one or more resource units allocated for the CORESET do not overlap resource blocks for synchronization signals/physical broadcast channel blocks;
The method of claim 1. each of the one or more resource units includes a predetermined number of resource blocks;
wherein the predetermined number is 6;
The method of claim 1. the resource allocation information is indicated by a bitmap;
The method of claim 1. A method performed by a network device, comprising:
transmitting resource allocation information for a control resource set (CORESET) in a bandwidth part (BWP);
transmitting downlink control information based on the resource allocation information;
including
the resource allocation information indicates one or more resource units allocated for the CORESET;
the BWP further includes a plurality of resource blocks that are not for the CORESET;
the plurality of resource blocks divide the BWP into a plurality of resource segments;
Method. one or more resource units allocated for the CORESET do not overlap resource blocks for synchronization signals/physical broadcast channel blocks;
6. The method of claim 5. each of the one or more resource units includes a predetermined number of resource blocks;
wherein the predetermined number is 6;
6. The method of claim 5. the resource allocation information is indicated by a bitmap;
6. The method of claim 5. including a transceiver;
The transceiver receives resource allocation information for a control resource set (CORESET) in a bandwidth part (BWP) and receives downlink control information based on the resource allocation information;
the resource allocation information indicates one or more resource units allocated for the CORESET;
the BWP further includes a plurality of resource blocks that are not for the CORESET;
the plurality of resource blocks divide the BWP into a plurality of resource segments;
terminal device. one or more resource units allocated for the CORESET do not overlap resource blocks for synchronization signals/physical broadcast channel blocks;
The terminal device according to claim 9. each of the one or more resource units includes a predetermined number of resource blocks;
wherein the predetermined number is 6;
The terminal device according to claim 9. the resource allocation information is indicated by a bitmap;
The terminal device according to claim 9. including a transceiver;
said transceiver transmitting resource allocation information for a control resource set (CORESET) in a bandwidth part (BWP) and transmitting downlink control information based on said resource allocation information;
the resource allocation information indicates one or more resource units allocated for the CORESET;
the BWP further includes a plurality of resource blocks that are not for the CORESET;
the plurality of resource blocks divide the BWP into a plurality of resource segments;
network device. one or more resource units allocated for the CORESET do not overlap resource blocks for synchronization signals/physical broadcast channel blocks;
14. The network device of claim 13. each of the one or more resource units includes a predetermined number of resource blocks;
wherein the predetermined number is 6;
14. The network device of claim 13. the resource allocation information is indicated by a bitmap;
14. The network device of claim 13.

Images