CN116195319A

CN116195319A - Scheduling method, device and memory for downlink control information

Info

Publication number: CN116195319A
Application number: CN202080103843.8A
Authority: CN
Inventors: 简·沙希德; 张京华; 生嘉
Original assignee: JRD Communication Shenzhen Ltd
Current assignee: JRD Communication Shenzhen Ltd
Priority date: 2020-10-16
Filing date: 2020-10-16
Publication date: 2023-05-30
Also published as: WO2022077501A1

Abstract

The invention discloses a downlink control information scheduling method, a device and a memory. The method comprises the following steps: acquiring an information set of a plurality of user equipments (S110), wherein the information set includes a plurality of delay margins, each of the plurality of delay margins corresponding to one of the plurality of UEs; allocating downlink control information of a plurality of user equipments to resources corresponding to at least one time unit in order of a plurality of delay margins from low to high (S120); and responsive to the downlink control information allocated to a first time unit of the at least one time unit being marked as blocked, reallocating the downlink control information marked as blocked to resources corresponding to a second time unit (S130).

Description

Scheduling method, device and memory for downlink control information

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a memory for scheduling downlink control information.

Background

Wireless communication systems and networks, such as the fifth generation (5G) mobile communication standard and technology, are well known. The 5G standards and techniques are defined by the 3G partnership project. However, the current wireless communication system still has a serious blocking problem in the process of scheduling the downlink control information.

Disclosure of Invention

The invention provides a scheduling method of downlink control information, which comprises the following steps: obtaining a set of information for a plurality of User Equipments (UEs), wherein the set of information includes a plurality of delay margins, each of the plurality of delay margins corresponding to one of the plurality of UEs; allocating downlink control information (downlink control information, DCI) of the plurality of UEs to resources corresponding to at least one time unit in the order of the plurality of delay margins from low to high; and reallocating, in response to at least one DCI allocated to a first time unit of the at least one time unit being marked as blocked, the at least one DCI marked as blocked to resources corresponding to a second time unit of the at least one time unit, wherein the second time unit follows the first time unit, a time interval between the first time unit and the second time unit meeting a delay tolerance requirement between corresponding UEs of the plurality of UEs.

The invention provides a downlink control information scheduling device, which comprises a processor and a communication circuit, wherein the processor is connected with the communication circuit; the processor is configured to execute instructions to implement the method as described above.

The invention provides a memory for storing instructions, which are executed to implement the above-described method.

Drawings

In order to further explain the technical solution of the embodiments of the present invention, the drawings required for describing the embodiments will be briefly introduced. It is apparent that the following drawings are merely some embodiments of the present invention. Other figures may be made by anyone skilled in the art without the inventive effort based on the following figures.

Fig. 1 is a schematic diagram of a wireless communication system or a wireless communication network according to an embodiment of the present invention.

Fig. 2 is a schematic diagram of the simulation result based on the first parameter set of the conference #102e according to the present invention.

Fig. 3 is a schematic diagram of the simulation result based on the second parameter set of the conference #102e according to the present invention.

Fig. 4 is a flowchart of a downlink control information scheduling method according to an embodiment of the present invention.

Fig. 5 is a flowchart of a downlink control information scheduling method according to another embodiment of the present invention.

Fig. 6 is a schematic diagram of grouping based on delay tolerance in the downlink control information scheduling method according to an embodiment of the present invention.

Fig. 7 is a schematic diagram of scheduling a subgroup based on group common downlink control information in a downlink control information scheduling method according to an embodiment of the present invention.

Fig. 8 is a schematic diagram illustrating blocking-free operation of a single-slot multi-subgroup in a downlink control information scheduling method according to an embodiment of the present invention.

Fig. 9 is a schematic diagram of blocking and reassigning subgroups with low and high delay margins in a downlink control information scheduling method according to an embodiment of the present invention.

Fig. 10 is a schematic diagram of blocking and reassigning user equipments in a subgroup in a downlink control information scheduling method according to an embodiment of the present invention.

Fig. 11 is a schematic structural diagram of a downlink control information scheduling apparatus according to an embodiment of the present invention.

Fig. 12 is a schematic diagram of a downlink control information scheduling memory according to an embodiment of the present invention.

Detailed Description

In order to enable those skilled in the art to better understand the technical scheme of the present invention, the following details of the downlink control information scheduling method, device and memory provided by the present invention are described in conjunction with the accompanying drawings and embodiments.

The term "user device" in this disclosure may include or represent any portable computing device for communication. In some embodiments of the described devices, methods, and systems, the applicable User Equipment (UE) may be a wired or wireless device, such as a mobile device, a mobile phone, a terminal, a smart phone, a portable computing device such as a notebook, a handheld device, a tablet, a netbook, a personal digital assistant, a music player, and other computing devices capable of wired or wireless communication. In addition, the UE may also be a reduced capability (RedCap) user equipment.

Fig. 1 is a schematic diagram of a structure of a wireless communication system or network 100, including a core network 102 (or telecommunications infrastructure) that serves a plurality of network nodes 104a-104m (e.g., base stations, gnbs) of a plurality of wireless communication units 108a-108e (e.g., UEs) in cells 106a-106m. A plurality of network nodes 104a-104m are connected to the core network 102 via links. The link may be wired or wireless (e.g., a radio communication link, optical fiber, etc.). The core network 102 may include a plurality of core network nodes, network entities, application servers, or any other network or computing device that may communicate with one or more radio access networks including a plurality of network nodes 104a-104 m.

In some embodiments, the network nodes 104a-104m are base stations, such as, but not limited to, gNBs in 5G networks. Each of the plurality of network nodes 104a-104m (e.g., base stations) has coverage. For example, as shown in FIG. 1, for simplicity, coverage may refer to respective circular cells 106a-106m serving one or more UEs 108a-108 e. The UEs 108a-108e are capable of receiving services, such as voice, video, audio, or other communication services, from the wireless communication system 100.

The wireless communication system or network 100 may include or represent any one or more communication networks for communication between the UEs 108a-108e and other devices, content sources, or servers connected to the wireless communication system or network 100. The core network 102 may also include or represent links, couplings, or connections to form one or more communication networks, one or more network nodes, entities, elements, application servers, base stations, or other network devices of the wireless communication system or network 100. Links or couplings between network nodes may be wired or wireless (e.g., radio communication links, optical fibers, etc.). The wireless communication system or network 100 and the core network 102 may include: any suitable combination of core networks including network nodes or entities and radio access networks, base stations, access points, etc., that enable UEs 108a-108e, network nodes 104a-104m and core network 102 of wireless communication system 100, content sources, and/or other devices connected to wireless communication system or network 100 to communicate with each other.

In some embodiments of the described apparatus, methods, and systems, the applicable wireless communication network 100 may be at least one communication network or a combination thereof, including but not limited to one or more wired and/or wireless telecommunication networks, one or more core networks, one or more radio access networks, one or more computer networks, one or more data communication networks, the internet, a telephone network, a wireless network (e.g., wiMAX, WLAN, and/or Wi-Fi network based on the IEEE802.11 standard), by way of example only, or an internet protocol (Internet Protocol, IP) network, packet-switched network, or enhanced packet-switched network, IP multimedia subsystem. An (IMS) network or a communication network based on wireless, cellular or satellite technology, such as a mobile network, global system for mobile communications (GSM), GPRS network, wideband code division multiple access (W-CDMA), CDMA2000 or LTE/LTE-advanced communication network or any second, third, fourth or fifth generation and later type of communication network, etc.

As shown in fig. 1, the wireless communication system 100 may be a 5G communication network using cyclic prefix orthogonal frequency division multiplexing (cyclic prefix orthogonal frequency division multiplexing, CP-OFDM) techniques for downlink and uplink channel networks. The downlink may include one or more communication channels for transmitting data from one or more gNBs 104a-104m to one or more UEs 108a-108 e. Typically, the downlink channel is a communication channel for transmitting data, e.g., from the gNB 104a to the UE 108a.

Both the uplink and downlink of a 5G network are divided into radio frames (e.g., each frame may be 10 milliseconds in length). Each frame may be divided into a plurality of subframes. For example, each frame may include 10 subframes of equal length. Each subframe is composed of a plurality of slots (e.g., 2 slots) for transmitting data. In addition to the slots, a subframe may be sub-framed with a number of additional special fields or OFDM symbols, which may include downlink synchronization symbols, broadcast symbols, and/or uplink reference symbols.

Specifically, the physical downlink control channel (physical downlink control channel, PDCCH) carries downlink control information (downlink control information, DCI). The PDCCH candidates are transmitted in a control resource set (control resource sets, CORESET) spanning one, two or three consecutive OFDM symbols over a plurality of Resource Blocks (RBs). The PDCCH candidates are carried by 1, 2, 4, 8 or 16 control channel elements (control channel elements, CCEs). Each CCE includes 6 resource element groups (resource element group, REG), each REG being 12 resource elements (resource elements, REs) in an OFDM symbol.

In order to receive DCI, the UE needs to blindly decode potential PDCCH candidates that may be transmitted from the network using the PDCCH search space. The search space consists of a set of PDCCH candidates, where each candidate may occupy one or more CCEs. The number of CCEs used for PDCCH candidates refers to an aggregation level (aggregation level, AL), which may be 1, 2, 4, 8 or 16 in NR.

In the present invention, the number of Blind Decoding (BD) for the UE may be reduced to achieve power saving. Reducing the BD number is beneficial to relaxing the UE processing timeline. The time spent for PDCCH blind detection will be reduced and the PDSCH/PUSCH processing procedure may be more time consuming.

In some embodiments, the reduction of PDCCH BD may be performed by reducing the number of PDCCH candidates (i.e., from 36 to 18), thereby saving power for the UE.

Specifically, according to the UE power saving method in TR 38.840[3], it is used for the same slot scheduling. The reduction in the number of BDs results in a reduction in PDCCH power. The relationship between PDCCH candidates and the power of the UE can be modeled as equation 1.

P (α) ＝ α· Pt + (1 –α) · 0.7Pt (1)

Where α is the ratio of the number of PDCCH candidates to the maximum number of PDCCH candidates in the reference configuration (α > 0). Pt is the power of the time slot schedule when only PDCCH is present.

Furthermore, according to the energy saving assessment method in TR 38.380[3], the energy saving gain (power saving gain, PSG) of the proposed enhancement scheme can be estimated according to equation 2.

Wherein P is _baseline And P _enhancement The baseline average power and the average power of the proposed enhancement scheme, respectively.

The number of BDs is reduced to verify the effect of the power saving gain of the UE, and a calculation

simulation using equations

1 and 2 may be performed. Further, the simulation calculates the relationship between the energy saving gain and the reduced BD number based on the following agreed parameters of the conference #102 e. Specifically, two sets of parameters satisfying #102e are: FR1 (30 kHz SCS) 2 symbols PDCCH,36 BDs, maximum CCE number=56; FR2 (120 kHz SCS): 2 symbol PDCCH,20 BDs, maximum CCE number=32. The simulation results of the energy saving

gain using equations

1 and 2 are shown in fig. 2. The simulation results of the energy saving

gain using equations

1 and 2 are shown in fig. 3. It can be seen that reducing the number of blind decodes to half the maximum BD limit (i.e. from 36 to 18) can achieve a PDCCH (only) power saving gain of 15%. Further reduction of blind decoding attempts to 1 can achieve a power saving gain of 29.1% in the case of FR1 SCS 30KHz and 28.5% in the case of FR2 SCS 120 KHz. From this observation it can be concluded that the power saving gain is significantly improved when the number of blind decodes is reduced to half the maximum limit and also helps to relax the PDCCH processing timeline for the UE. In addition, since the number of BDs is reduced, more energy saving gain can be obtained, but too small number of BDs may limit flexibility of gNB scheduling and may severely increase blocking probability of UE PDCCH. Reducing BD by half (e.g., from 36 to 18) can achieve a 15% (FR 1) energy saving gain, but at the cost of increasing PDCCH blocking probability by a factor of 1.9.

The present invention improves the distribution and scheduling of DCIs for use in a wireless communication system. The DCI of the UE may be allocated to resources corresponding to at least one time unit in order of a plurality of delay margins from low to high. In response to too much DCI allocated to the first time unit causing blocking, the DCI marked as blocking may be reallocated to other time units meeting the delay tolerance requirements. Thus, on-time service of each UE can be ensured, and the probability of blocking PDCCH due to various causes such as BD degradation or excessive DCI can be reduced. Referring to fig. 4, fig. 4 is a flowchart of a downlink control information scheduling method according to an embodiment of the present invention. In an embodiment, a method for scheduling DCI may include the steps shown in fig. 4.

Step S110, acquiring information sets of a plurality of user equipments.

The information set includes a plurality of delay margins. Each of the plurality of delay margins corresponds to one of the plurality of UEs so as to allocate DCI of the UE to at least one time unit in an order of the plurality of delay margins from low to high.

In some embodiments, the network side (which may include the radio access network and the core network) may obtain UE-to-UE information as a network side to establish a connection with multiple UEs. The information is then stored for later retrieval when needed. For example, the UE may send its own information to the core network by including the information in a network attached storage (network attached storage, NAS) signaling message sent to the core network. The core network then informs the radio access network (radio access network, RAN) of the UE information. For example, the UE may send its own information to the RAN by including it in a radio resource control (radio resource control, RRC) connection setup message sent to the RAN. The RAN then informs the core network of the UE information in an initial UE context message.

Step S120: and distributing the downlink control information of the plurality of user equipment to resources corresponding to at least one time unit according to the sequence from low to high of the plurality of delay tolerance.

After obtaining the respective delay margins of the UEs, the DCI of the UE may be allocated to resources corresponding to at least one time unit in order of a plurality of delay margins from low to high to meet the delay margin requirement of each UE.

In some embodiments, the delay tolerance may refer to a delay tolerance time of the UE such that DCI of the UE may be allocated to resources corresponding to at least one time unit in order of the delay tolerance time from shortest to longest.

In some embodiments, the delay tolerance may indicate a delay tolerance level of the UE, which may be level 1, level 2 … …, for example. The higher delay margin represents a higher delay margin of the UE such that DCI of the UE may be allocated to resources corresponding to at least one time unit in order of the delay margin from low to high.

Specifically, the time unit for allocating the DCI of the UE with the lower delay tolerance may not be after the time unit for allocating the DCI of the UE with the higher delay tolerance, so that the DCI of the UE with the lower delay tolerance may be transmitted first to meet the delay tolerance requirement of each UE. It is understood that in the case where the DCI of the UE with lower delay tolerance and the DCI of the UE with higher delay tolerance both satisfy respective delay tolerance requirements, the time unit to which the DCI of the UE with lower delay tolerance is not excluded may be after the time unit to which the DCI of the UE with higher delay tolerance is allocated.

In some embodiments, the time units may be at least slots or subframes.

In response to the downlink control information allocated to the first time unit of the at least one time unit being marked as blocked, the downlink control information marked as blocked is reallocated to resources corresponding to the second time unit, step S130.

After downlink control information of a plurality of user equipments is distributed to resources corresponding to at least one time unit according to a plurality of delay margins from low to high, DCI allocated to a first time unit may be excessive to cause blocking, and DCI marked as blocking may be reassigned to resources corresponding to a second time unit. The second time unit is subsequent to the first time unit. The time interval between the first time unit and the second time unit satisfies a delay tolerance requirement of the UE corresponding to DCI marked as blocking. UEs with higher delay tolerance have the property of more scheduling opportunities to update, thereby reducing blocking probability.

In an embodiment, DCI of a UE may be allocated to resources corresponding to at least one time unit in order of a plurality of delay margins from low to high. For a DCI allocated to a first time unit that is too many to cause blocking, the DCI marked as blocking may be reassigned to another time unit that meets the delay tolerance requirement. In this way, DCI of a UE with low delay margin can be preferentially transmitted. If the DCI of the UE is evaluated as blocked, the DCI may be retransmitted, thereby reducing the probability that the PDCCH is blocked due to the BD reduction.

In addition, the present invention divides UEs into at least two subgroups, and schedules all UEs of the corresponding subgroup with a group common DCI of each subgroup to reduce DCI overhead and improve spectrum efficiency, which is useful in IIoT use cases with small TBs because the UE density of each gNB is very high in IIoT and the size of TB is very small. In addition, the technical scheme of scheduling all UEs corresponding to the subgroup by using the group common DCI of the subgroup can be combined with the technical scheme of downlink control channel, and when the downlink control channel is marked as blocked, the downlink control channel is reassigned to the subgroup according to the order of low-to-high delay tolerance, so that the blocking probability is reduced and the cost of the DCI is reduced. Referring to fig. 5, fig. 5 is a flowchart of a downlink control information scheduling method according to another embodiment of the present invention. In an embodiment, a method for scheduling DCI may include the steps shown in fig. 5.

Step S210, acquiring information sets of a plurality of user equipments.

Information of UEs may be acquired first, and the UEs may be divided into at least two subgroups according to the information of the UEs, so that all UEs of the corresponding subgroup are scheduled using group common DCI of the subgroup.

In addition to delay tolerance, the information may include at least one of UE type, data rate, reliability, battery life, etc.

In some embodiments, the UE may be a reduced capability UE, and the reduced capability UE may be classified into three main types, which may be an industrial sensor, a video monitoring type device, or a wearable device, respectively, according to an application scenario of the reduced capability UE. The specific requirements for these three classes of UEs are shown in table 1.

Table 1: UE use case and requirement thereof

Step S220, dividing the plurality of user equipments into at least two subgroups according to the information set.

After obtaining the information about the UEs, the UEs may be divided into at least two subgroups for scheduling UEs within the subgroups based on the information about the UEs, including delay tolerance.

In some embodiments, UEs may be divided into at least two subgroups based on their respective delay margins. In case the delay tolerance refers to a delay tolerance level, UEs having the same delay tolerance level may be clustered into one subgroup. In addition, in the case where the delay tolerance level refers to a delay tolerance time, the delay tolerance time may be divided into several non-overlapping ranges, and UEs within the same range may be clustered into one subgroup. For example, as shown in fig. 6, the low delay tolerance subset includes those UEs with delay tolerance times less than 100 milliseconds (i.e., industrial wireless sensors, safety-related sensors, and eHealth-related sensors). The high delay tolerance subset includes those UEs (i.e., video surveillance and wearable devices) that have a delay tolerance time greater than 100 milliseconds.

In other embodiments, the plurality of UEs may also be divided into at least two subgroups in combination with consideration of information such as delay tolerance and UE type. For example, the plurality of UEs may be divided into a low delay tolerance and a high delay tolerance by the delay tolerance, and then the plurality of low delay tolerance UEs may be divided into a low delay tolerance industrial sensor sub-group, a low delay tolerance video monitoring sub-group, and a low delay tolerance wearable device sub-group by UE type. The plurality of high delay tolerant UEs may be divided into a high delay tolerant industrial sensor subgroup, a high delay tolerant video surveillance subgroup and a high delay tolerant wearable device subgroup.

In addition, the present invention may define and indicate different subgroups by reserved bit B in PDCCH.

In some embodiments, different subgroups may be indicated by different codes consisting of reserved bits B in the PDCCH, so that multiple codes may be selected by using fewer bits, each subgroup may use a unique code, facilitating the region subgroup. Theoretically this scheme could have m=2 groups B. In this scheme, assume that

Representing a low delay tolerance and a high delay tolerance subgroup. In other words, the first half of the M-code is associated with a low delay tolerance subset, while the second half of the M-code is associated with a high delay tolerance subset. For example, if 8 subgroups need to be configured, the base station will use b=3 from the reserved bits in the PDCCH and let m=8 codes, with the first 4 codes used to define the low delay tolerance subgroup and the remaining 4 codes used to define the high delay tolerance UE subgroup, as shown in table 2.

Table 2: code mapping indicated by the b=3 and m=8 subgroups

Code M of B bits in PDCCH	Red Cap UE subgroup
		000	Low delay tolerance subgroup 0
100	Low delay tolerance subgroup 1
		010	Low delay tolerance subgroup 2
110	Low delay tolerance subgroup 3
		001	High delay tolerance subgroup 0
101	High delay tolerance subgroup 1
		011	High delay tolerance subgroup 2
111	High delay tolerance subgroup 3

In some embodiments, each bit in the PDCCH is mapped to a subgroup. Bit "1" is associated with the low delay tolerance subgroup and bit "0" is associated with the high delay tolerance subgroup. The scheme may use two mapping approaches, one-to-one mapping and one-to-many mapping.

One-to-one mapping: if the reserved B bits in the PDCCH are equal to or more than the UE subgroups, a one-to-one mapping may be used. For example, if b=8, 8 UE subgroups need to be configured, one bit corresponds to each UE subgroup. This method is effective only when the number of B bits reserved in the PDCCH is equal to or greater than the number of subgroups.

Many-to-one mapping: the second method is based on a mapping of one-to-many bitmaps. In this method, each reserved B bit in the PDCCH is associated to configure/indicate multiple subgroups. For example, if 8 subgroups need to be configured, the available reserved bits in the PDCCH are b=4, then each reserved bit in the PDCCH is associated with more than one subgroup. An illustration of this example is shown in table 3.

Table 3: many-to-one bitmap mapping schematics

Bit b=4 (1100)	8 subgroup configuration
		1	Low delay tolerance group 0, low delay tolerance group 1
1	Low delay tolerance group 2, low delay tolerance group 3
		0	High delay tolerance group 0, high delay tolerance group 1
0	High delay tolerance group 2, high delay tolerance group 3

In step S230: a delay tolerance for each of the at least two subgroups is determined based on a plurality of delay tolerances for a plurality of user devices.

After dividing the plurality of user equipments into at least two subgroups, determining a delay tolerance of each of the at least two subgroups based on a plurality of delay tolerances of the plurality of user equipments such that DCI of each UE is allocated to resources corresponding to time units according to the delay tolerance of each subgroup.

In some embodiments, the maximum, minimum, or average value of the delay tolerance of all UEs within a subset may be used as the delay tolerance of the subset, without limitation.

Step S240: a plurality of group common DCIs of at least two subgroups are allocated to resources corresponding to at least one time unit in order of delay margin of at least two subgroups from low to high.

After determining a delay tolerance for each of the at least two subgroups, a plurality of group common DCIs of the at least two subgroups are allocated to resources corresponding to the at least one time unit in an order of the delay tolerance of the at least two subgroups from low to high. The group common DCI of the subgroup is scheduled according to the delay tolerance requirement, so that the UE with low delay tolerance can be timely served.

Each of the plurality of group common DCIs includes DCIs for all UEs in the corresponding subgroup, and in order to enable subgroup-based UE scheduling, this section suggests using a group Generic (GC) -DCI method. In this method, a plurality of UEs within a subgroup obtain scheduling information for PDSCH/PUSCH from a plurality of bit blocks transmitted in the GC-DCI payload. For example, if the gNB needs to schedule N UEs in the subgroup, the gNB may send GC-DCI in the PDCCH, and the UEs within the subgroup may obtain their corresponding PDSCH/PUSCH scheduling information from the GC-DCI payload, as shown in fig. 7. The GC-DCI format may be the same size as the UE-specific DCI format, e.g., DCI format 1_x, the gnb may choose to schedule PDSCH reception or PUSCH transmission from the UE using the GC-DCI format. The method may be used for low and high delay tolerance subgroup scheduling. Furthermore, GC-DCI based subgroup scheduling reduces DCI overhead, which is very beneficial in IIoT use cases where TBs are small.

It will be appreciated that there may be three situations when step 240 is performed. Fig. 8, 9 and 10 illustrate three different cases of delay tolerance based subgroup scheduling and their impact on PDCCH blocking probability. Case 1 (fig. 8) assumes that all UEs within a subgroup successfully decode their PDCCH and that no subgroup or individual UE is blocked. Case 2 (fig. 9) assumes that some subgroups may be blocked due to limited slot resources and consider the next slot schedule according to their delay requirements. Case 3 (fig. 10) assumes that due to limited slot resources, some UEs may block within a subgroup and consider the next slot schedule based on their delay requirements by using UE-specific DCI.

Step S250: in response to at least one DCI allocated to a first time unit of the at least one time unit being marked as blocked, the at least one DCI marked as blocked is allocated to resources corresponding to a second time unit of the at least one time unit.

After the group common DCI of at least two subgroups is allocated to the resources corresponding to at least one time unit in order of delay margin from low to high, there may be a blockage due to too many group common DCIs allocated to the first time unit, as shown in fig. 9. There may also be a blockage in the first time unit caused by a DCI excess allocated to at least one UE in the group common DCI of the first time unit. The DCI marked as a blocked group common DCI or at least one UE in the group common DCI allocated to the first time unit may be reallocated and needs to meet a delay tolerance requirement. In this way, the group common DCI of the sub-group is allocated based on the delay margin of the sub-group, allowing the UE having the low delay margin sub-group to confirm its PDCCH as soon as possible based on the group common DCI of the sub-group to which the UE belongs. UEs with a high delay tolerance subgroup will also meet the delay tolerance requirement. UEs with high delay capacity have more reallocation opportunities, reducing blocking probability.

The base station may evaluate whether DCI allocated to each time unit is marked as blocked based at least on the blind decoding parameter of each of the plurality of UEs and the resource information of each of the at least one time unit. Specifically, the base station may determine the number of DCI or group common DCI that is most accommodated per time unit according to the blind decoding parameter of the UE and the resource information of the time unit. In the event that the number of DCIs or group common DCIs allocated to the time unit exceeds the maximum number of DCIs or group common DCIs that the time unit accommodates, additional minority DCIs or group common DCIs allocated to the time unit may be marked as blocked.

The blind decoding parameter includes at least one of a maximum number of physical downlink candidate control channels, a maximum number of control channel elements, and a number of blind decodes.

Tables 4 and 5 disclose the maximum number of physical downlink candidate control channels and the maximum number of control channel elements, respectively, within one time unit.

Table 4: DL BWP with SCS configuration for single serving cell, maximum number of PDCCH candidates monitored per slot

Table 5: DL BWP with SCS configuration for single serving cell, maximum non-overlapping CCE number per slot

Specifically, for the case shown in fig. 9, in step S250, the group common DCI allocated to the first time unit of the at least one time unit may be marked as blocked, and then the group common DCI marked as blocked is reallocated to the resource corresponding to the second time unit so that the base station may preferentially transmit DCI from the UE having low delay tolerance. In response to the DCI of the UE being evaluated as blocked, the DCI is re-transmitted, thereby reducing the probability that the PDCCH is blocked due to BD reduction.

For the case shown in fig. 10, in step S250, DCI allocated to at least one UE of a group common DCI of a first time unit among at least one time unit may be marked as blocked, and then DCI marked as blocked is reallocated to resources corresponding to a second time unit so that a base station may preferentially transmit DCI from a UE having a low delay tolerance. In response to the DCI of the UE being evaluated as blocking, the DCI is re-transmitted, thereby reducing PDCCH blocking probability due to BD reduction.

Step S260: after reallocating at least one DCI marked as blocked to resources corresponding to a second time unit of the at least one time unit, allocating a portion of the DCI allocated to the second time unit to resources corresponding to a third time unit in order of a delay tolerance in response to the number of DCIs allocated to the second time unit being greater than a preset threshold.

After DCI marked as blocking is distributed to the second time unit, in response to the number of DCIs distributed to the second time unit being larger than a preset threshold, partial DCIs distributed to the second time unit are distributed to resources corresponding to the third time unit according to the order of the delay tolerance from high to low, on-time service of the UE with low delay tolerance is guaranteed, and the probability of blocking of the PDCCH due to BD is reduced.

The third time unit is subsequent to the second time unit. The time interval between the second time unit and the third time unit satisfies the delay tolerance requirement of the corresponding UE. And after a part of DCI allocated to the second time unit is allocated to the resource corresponding to the third time unit, the number of DCIs allocated to the second time unit is smaller than or equal to a preset threshold value. The preset threshold of the second time unit may also be a maximum DCI number or a group common DCI unit in the second time unit determined based on the blind decoding parameter of each of the plurality of UEs and the resource information of each of the at least one time unit.

For example, performing step S240 as described above, i.e., allocating group common DCI of different subgroups to resources corresponding to at least one slot, and transmitting the respective groups common in the respective slots in order of delay margin of the subgroups from low to high, may result in three results.

In case 1, the maximum number of BD budgets in a single slot is reduced to half, i.e. 1/2×36=18, and the CCE limit remains unchanged, i.e. cce=56. The base station gNB first multiplexes the low delay tolerance subset for scheduling to ensure that it is serviced on time, then the high delay tolerance subset. In other words, the low delay tolerant subgroup multiplexes scheduling in slot N and the high delay tolerant subgroup multiplexes scheduling in slot n+1. Each subgroup of UEs may successfully decode the PDCCH and schedule to their corresponding PDSCH/PUSCH according to the group common DCI. An illustrative example of case 1 is shown in fig. 8. In this example, the base station gNB must schedule 8 subgroups, of which 4 are low delay tolerance subgroups and 4 are high delay tolerance subgroups, which have been created according to the method described above. The low delay tolerant sub-group is multiplexed in slot N and the high delay tolerant sub-group is multiplexed in slot N + 1. Each subgroup has its own group common DCI from which each subgroup UE may schedule PDSCH/PUSCH. In this example, we assume that slot N and slot n+1 resources are sufficient and that there is no UE subgroup or single UE blocking.

Case 2, the maximum number of BD budgets in a single slot is halved, i.e. 1/2×36=18; the CCE limit is the same as R15/r16 cce=56. The base station gNB first multiplexes the low delay tolerance subgroup to ensure that it is serviced on time, then the high delay tolerance subgroup, as in case 1. In other words, the low delay tolerant sub-group is multiplexed in slot N and the high delay tolerant sub-group is multiplexed in slot n+1. UEs with successful PDCCH decoding of the subgroup may be scheduled for PDSCH/PUSCH according to the group common DCI. In this case, it is assumed that there is a possibility that one subgroup is blocked due to the reduced BD or other resource limitation of the slot. In this case, the base station gNB will schedule the subgroup marked as blocked at the next time slot multiplex with the same rule, e.g. a low delay tolerance subgroup followed by a high delay tolerance subgroup. An illustrative example of case 2 is shown in fig. 9. In this example, the base station gNB must schedule 8 subgroups, of which 4 are low delay tolerance subgroups and 4 are high delay tolerance subgroups, which have been configured according to the method described above. The low delay tolerant subgroup multiplexes scheduling in slot N and the high delay tolerant subgroup multiplexes scheduling in slot n+1. It is assumed here that low delay tolerant subgroup 3 has a blocking in time slot N and high delay tolerant subgroup 3 has the potential to block in time slot N +1, as shown in figure 9. In this case, the base station gNB immediately multiplexes the low delay tolerance subgroup 3 (labeled as blocking) at time slot N+1 for scheduling to ensure punctuality of its service. High and low delay tolerance subgroup 3 (labeled blocking) may multiplex the schedule at slot n+2 or even slot n+3. Based on the delay tolerance, time slot N and time slot n+1 will never be marked as "blocked". The high delay tolerance gives more rescheduling opportunities for the blocked sub-groups, thereby reducing the blocking probability.

Case 3, the maximum number of BD budgets in a single slot is halved, i.e. 1/2×36=18; the CCE limit is the same as R15/r16 cce=56. The base station gNB first multiplexes the low delay tolerance subgroup to ensure that it is serviced on time, then the high delay tolerance subgroup, as in

cases

1 and 2. In other words, the low delay tolerant sub-group is multiplexed for scheduling in slot N, while the high delay tolerant sub-group is multiplexed for scheduling in slot n+1. UEs that successfully decode the sub-groups will be scheduled for PDSCH/PUSCH according to the group common DCI. In this case we assume that the UE is likely to block in the subgroup due to reduced BD or other resource limitations of the slot. In this case, the base station gNB will schedule the blocked UE again with the same rules in the next slot using the UE-specific DCI, e.g. the low delay tolerant UE follows the high delay tolerant UE first. An illustrative example of case 3 is shown in fig. 10. In this example, the base station gNB must schedule 8 subgroups, of which 4 are low delay tolerance subgroups and 4 are high delay tolerance subgroups, which have been configured according to the method described above. The low delay tolerant subgroup multiplexes scheduling in slot N and the high delay tolerant subgroup multiplexes scheduling in slot n+1. Here we assume that the possibility that some UEs of low delay tolerance subgroup 3 block in slot N and some UEs of high delay tolerance subgroup 3 block in slot n+1 is shown in fig. 10. In this case, the base station gNB will immediately schedule the low delay tolerant UE at slot n+1 by using the UE-specific DCI to ensure that it is serving on time, and the high delay tolerant UE may schedule the use of the UE-specific DCI at slot n+2 or even slot n+3. Based on the delay tolerance, time slot N and time slot n+1 will never be marked as "blocked". The high delay tolerance gives more rescheduling opportunities for the blocked sub-groups, thereby reducing the blocking probability.

Referring to fig. 11, fig. 11 is a schematic structural diagram of a downlink control information scheduling apparatus according to an embodiment of the present invention. The DCI scheduling apparatus 10 includes a processor 12 and a communication circuit 11; the processor 12 is connected to the communication circuit 11, and the processor 12 is configured to execute instructions to implement the above-described method of scheduling DCI.

The processor 12 may include one or more instances of processing circuitry, i.e., a central processing unit (Central Processing Unit, CPU), processing unit, processing circuit, processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), microprocessor, or other logic that processes instructions to be interpreted and executed. Thus, the expression "processor" as used herein may refer to a processing circuit comprising a plurality of processing circuits, such as any, some or all of the processing circuits listed above.

Referring to fig. 12, fig. 12 is a schematic diagram of a downlink control information scheduling memory according to an embodiment of the present invention. The memory stores instructions or program data 21 which, when executed, enable the implementation of the method proposed by the fourteenth embodiment of the paging method according to the present invention. The memory may be a read-only memory (ROM), a random access memory (random access memory, RAM), a flash memory, a hard disk, an optical disk, or the like.

It is to be understood that the apparatus and methods disclosed herein may also be embodied in other forms. Rather, the devices described are merely illustrative. For example, the partitioning of a module or unit is based entirely on logic functions, and thus other partitioning approaches are possible in practical implementations, such as combining or integrating multiple units or components into another system, or some functions may be omitted or not performed at all. In addition, the illustrated or discussed coupling, direct coupling, or communication connection may be implemented by some interface, device, or element, whether electrical, mechanical, or otherwise.

The separation units described may or may not be physically separated. The components shown as units may or may not be physical units and may reside in one location or be distributed across multiple networked units. Some or all of the units may be selectively employed according to actual needs to achieve the object of the present invention.

In addition, the various functional units described herein may be integrated as one processing unit or may exist as multiple physically separate units, and two or more units may be integrated as one. The integrated units may be implemented by hardware or by software functional units.

The integrated units described above, if implemented as software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the necessary technical solutions or all or part of the technical solutions of the present invention may be embodied as a software product. The computer software product may be stored in a storage medium and may include a plurality of instructions that enable a computing device (e.g., personal computer, server, network device, etc.) or processor to perform all or part of the methods described herein. The storage medium may include a U-disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disk, etc. various media in which program codes may be stored.

The foregoing description is only of preferred embodiments of the invention and is not intended to limit the scope of the invention to these specific embodiments. Any equivalent structural or flow modifications or alterations of the present invention, or the direct or indirect application of the present invention to any other relevant field, fall within the scope of the present invention.

Claims

1. A method for scheduling downlink control information, comprising:

Obtaining an information set of a plurality of user equipments, UEs, wherein the information set comprises a plurality of delay margins, each of the plurality of delay margins corresponding to one of the plurality of UEs;

distributing downlink control information DCI of the plurality of UEs to resources corresponding to at least one time unit according to the sequence from low delay tolerance to high delay tolerance; and

in response to at least one DCI allocated to a first time unit of the at least one time unit being marked as blocked, reallocating the at least one DCI marked as blocked to resources corresponding to a second time unit of the at least one time unit, wherein the second time unit is subsequent to the first time unit, a time interval between the first time unit and the second time unit meeting delay tolerance requirements between corresponding UEs of the plurality of UEs.

2. The method as recited in claim 1, further comprising:

after reassigning the at least one DCI marked as blocked to the resources corresponding to the second time unit of the at least one time unit, in response to a number of DCIs assigned to the second time unit being greater than a preset threshold, assigning a portion of the DCIs assigned to the second time unit to resources corresponding to a third time unit in the order of the plurality of delay margins from low to high; wherein the third time unit follows the second time unit, a time interval between the second time unit and the third time unit meeting a delay tolerance requirement between corresponding ones of the plurality of UEs; after allocating a portion of the DCI allocated to the second time unit to the resource corresponding to the third time unit, the number of DCIs allocated to the second time unit is less than or equal to a preset threshold.

3. The method of claim 1, wherein obtaining the set of information for the plurality of UEs further comprises:

dividing the plurality of UEs into at least two subgroups based on the information set; and

determining a delay tolerance for each of the at least two subgroups based on the plurality of delay tolerances for the plurality of UEs;

allocating the DCI of the plurality of UEs to the resources corresponding to the at least one time unit in an order of the plurality of delay margins from low to high includes:

allocating a plurality of group common DCIs of the at least two subgroups to resources corresponding to the at least one time unit in an order of the delay margin of the at least two subgroups from low to high; wherein each of the plurality of group common DCIs includes DCIs for all UEs in the corresponding subset.

4. The method of claim 3, wherein, in response to the at least one DCI allocated to the first one of the at least one time unit being marked as blocked, reallocating the at least one DCI marked as blocked to the resources corresponding to the second one of the at least one time unit comprises:

In response to at least one set of common DCIs allocated to the first time unit of the at least one time unit being marked as blocked, reallocating the at least one set of common DCIs marked as blocked to the resources corresponding to the second time unit.

5. The method of claim 3, wherein, in response to the at least one DCI allocated to the first one of the at least one time unit being marked as blocked, reallocating the at least one DCI marked as blocked to the resources corresponding to the second one of the at least one time unit comprises:

responsive to at least one of the plurality of UEs being marked as blocked in at least one of at least one group common DCI allocated to the first one of the at least one time unit, reallocating the at least one DCI marked as blocked to the resource corresponding to the second time unit.

6. The method of claim 1, wherein in response to the at least one DCI allocated to the first one of the at least one time unit being marked as blocked, prior to reallocating the at least one DCI marked as blocked to the resources corresponding to the second one of the at least one time unit, the operations further comprise:

Based at least on the blind decoding parameter of each of the plurality of UEs and the resource information of each of the at least one time unit, it is assessed whether at least one DCI allocated to each of the at least one time unit is marked as blocked.

7. The method of claim 6, wherein the blind decoding parameters comprise at least one of a maximum number of physical downlink control channel candidates, a maximum number of control channel elements, and a number of blind decodes.

8. The method of claim 1, wherein the plurality of UEs are reduced capability user equipment.

9. The method of claim 1, wherein the at least one time unit is at least one slot or at least one subframe.

10. The downlink control information scheduling device is characterized by comprising a processor and a communication circuit, wherein the processor is connected with the communication circuit;

the processor is configured to execute instructions to implement a method for scheduling downlink control information, comprising:

obtaining an information set of a plurality of user equipments, UEs, wherein the information set includes a plurality of delay margins, each of the plurality of delay margins corresponding to one of the plurality of UEs;

11. A memory storing instructions, wherein execution of the instructions implements a method of scheduling downlink control information, comprising: :