# US 2022/0287070 A1 · Scheduling indication method and apparatus, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0287070 A1
- Document ID: US20220287070A1
- Status: Published application
- Kind: A1
- Application number: 17/633,172
- Filed: 2020-07-28
- Published: 2022-09-08
- Earliest claimed: 2019-08-05
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Youjun HU; Bo DAI; Weiwei YANG; Huiying FANG; Kun LIU; Luanjian BIAN
- Web page: https://patentgrep.com/patent/US20220287070A1

## CPC

- H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Provided are a scheduling indication method, a scheduling indication apparatus and a storage medium. The scheduling indication method includes: scheduling multiple shared channels through a single physical downlink control channel (PDCCH), where scheduling information is carried in the single PDCCH and is used to indicate scheduling for a process corresponding to each of the multiple shared channels, and the multiple shared channels include a physical uplink shared channel (PUSCH) and/or a physical downlink shared channel (PDSCH).

## Claims

### Claim 1

A scheduling indication method, comprising:
scheduling a plurality of shared channels through a single physical downlink control channel (PDCCH);
wherein scheduling information is carried in the single PDCCH, and is used to indicate scheduling for processes corresponding to the plurality of shared channels, the plurality of shared channels comprise at least one of a physical uplink shared channel (PUSCH) and a physical downlink shared channel (PDSCH).

### Claim 2 (depends on 1)

The method according to claim 1, wherein the scheduling information comprises process identification information and new data indication (NDI) information corresponding to processes.
wherein the process identification information is used to indicate index information of scheduled processes, or is used to indicate a start position of indexes of scheduled processes and process number information.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the scheduling information comprises information for indicating scheduling for a single process or for a plurality of processes, process identification information, and NDI information corresponding to processes.
wherein the process identification information is used to indicate index information of scheduled processes, or is used to indicate a start position of indexes of scheduled processes and process number information.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the scheduling information comprises process number identification information, process identification information and NDI information corresponding to processes, wherein the process number identification information is used to indicate that a number of currently scheduled processes is greater than a threshold z or a number of currently scheduled process is less than or equal to a threshold z, and the process identification information is used to indicate index information of scheduled processes, or a start position of indexes of scheduled processes and process number information.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the scheduling information comprises information for indicating scheduling for a hybrid transport or a non-hybrid transport, process identification information and NDI information corresponding to processes, wherein the non-hybrid transport scheduling refers to that scheduled processes correspond to same NDI information, and the hybrid transport scheduling refers to that the NDI information corresponding to the scheduled processes is not completely the same; the process identification information is used to indicate index information of scheduled processes, or a start position of indexes of scheduled processes and process number information.

### Claim 6 (depends on 2)

The method according to claim 2, wherein in a case where the maximum number of processes scheduled through downlink control information (DCI) is H, the scheduling information is X bits, and the scheduling information is used to indicate an index M of scheduling state.

### Claim 7 (depends on 6)

The method according to claim 6, wherein values of M are determined according to at least process identification information of currently scheduled processes and NDI information corresponding to the currently scheduled processes.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the value of M is determined according to at least process identification information of currently scheduled processes and NDI information corresponding to the currently scheduled processes, comprising:
the value of M is increased in accordance with the number of scheduled processes increasing;
or, the value of M is increased in accordance with a start position of scheduled processes increasing.

### Claim at position 9

9-12. (canceled)

### Claim 13 (depends on 3)

The method according to claim 3, wherein the scheduling information comprises 1 bit information for indicating scheduling for a single process or for a plurality of processes;
in a case where the 1 bit information indicates scheduling for a plurality of processes, j bits in X-1 bits are used to indicate NDI information corresponding to j processes, X-1-j bits in the X-1 bits are used to indicate process identification information, X is a number of bits of the scheduling information, and j is a number of currently scheduled processes.

### Claim 14 (depends on 13)

The method according to claim 13, wherein in a case of X=10, the scheduling state indicated comprises one of:
in a case where a number of currently scheduled processes is 8, 1 bit, for process identification information, in 9 bits is indicated as x, and 8 bits for NDI correspond to 8 processes, the 8 process comprising x0x1x2x3x4x5x6x7;
in a case where a number of currently scheduled processes is 7, 2 bits for process identification information in the 9 bits are indicated as ˜x, x, and 7 bits for NDI correspond to 7 processes, the 7 processes comprising x0x1x2x3x4x5x6 or x1x2x3x4x5x6x7;
in a case where a number of currently scheduled processes is 6, 3 bits, for process identification information, in the 9 bits are indicated as ˜x, ˜x, x, and 6 bits for NDI correspond to 6 processes, the 6 processes comprising x0x1x2x3x4x5, x1x2x3x4x5x6 or x2x3x4x5x6x7;
in a case where a number of currently scheduled processes is 5, 4 bits, for process identification information, in the 9 bits are indicated as ˜x, ˜x, ˜x, x, and 5 bits for NDI correspond to 5 processes, the 5 processes comprising: x0x1x2x3x4, x1x2x3x4x5, x2x3x4x5x6 or x3x4x5x6x7;
in a case where a number of currently scheduled processes is 4, 5 bits, for process identification information, in the 9 bits are indicated as ˜x, ˜x, ˜x, ˜x, x, and 4 bits for NDI correspond to 4 processes, the 4 processes comprising: x0x1x2x3, x1x2x3x4, x2x3x4x5, x3x4x5x6 or x4x5x6x7;
in a case where a number of currently scheduled processes is 3, 6 bits, for process identification information, in the 9 bits are indicated as ˜x, ˜x, ˜x, ˜x, ˜x, x, and 3 bits for NDI correspond to 3 processes, the 3 processes comprising: x0x1x2, x1x2x3 , x2x3x4, x3x4x5, x4x5x6 or x55x6x7;
in a case where a number of currently scheduled processes is 2, 7 bits, for process identification information, in the 9 bits are indicated as ˜x, ˜x, ˜x, ˜x, ˜x, ˜x, x, or ˜x, ˜x, ˜x, ˜x, ˜x, ˜x, ˜x, and 2 bits for NDI correspond to 2 processes, the 2 processes comprising: x0x1, x1x2, x2x3, x3x4, x4x5, x5x6 or x6x7; and
wherein x , ∈ {0,1}, ˜x denotes a negative x, x0, x1, x2, x3, x4, x5, x6, x7 respectively correspond to NDI information corresponding to a process with a process identifier as 0, NDI information corresponding to a process with a process identifier as 1, NDI information corresponding to a process with a process identifier as 2, NDI information corresponding to a process with a process identifier as 3, NDI information corresponding to a process with a process identifier as 4, NDI information corresponding to a process with a process identifier as 5, NDI information corresponding to a process with a process identifier as 6, and NDI information corresponding to a process with a process identifier as 7, and each of x0, x1 , x2, x3, x4, x5, x6, x7 ∈ {0,1}.

### Claim 15 (depends on 13)

The method according to claim 13, wherein in a case where the maximum number of processes scheduled through DCI is 4, the scheduling information is 6 bits, wherein 5 bits in the 6 bits are used to indicate process identification information of scheduling for a plurality of processes and NDI information corresponding to processes, and the scheduling state indicated by the 5 bits comprises at least one of:
in a case where a number of currently scheduled processes is 4, 1 bit, for process identification information, in the 5 bits is indicated as x, 4 bits for NDI correspond to 4 processes, the 4 processes comprising x0x1x2x3;
in a case where, a number of currently scheduled processes is 3, 2 bits, for process identification information, in the 5 bits are indicated as ˜x, x, 3 bits for NDI correspond to 3 processes, the 3 processes comprising x0x1x2 or x1x2x3;
in a case where, a number of currently scheduled processes is 2, 3 bits, for process identification information, in the 5 bits are indicated as ˜x, ˜x ˜x or ˜x, ˜x, x, 2 bits for NDI correspond to 2 processes, the 2 processes comprising x0x1, x1x2 or x2x3;
wherein, x ∈ {0,1}, ˜x denotes negative x, x0, x1, x2 and x3 respectively correspond to NDI information corresponding to a process with a process identifier as 0, NDI information corresponding to a process with a process identifier as 1, NDI information corresponding to a process with a process identifier as 2 and NDI information corresponding to a process with a process identifier as 3, each of x0, x1, x2, x3 ∈ {0,1}.

### Claim 16 (depends on 3)

The method according to claim 3, wherein in a case where the scheduling information indicates scheduling for a plurality of process, the scheduling information further comprises information used to indicate scheduling for a hybrid transport scheduling or a non-hybrid transport scheduling; or, the scheduling information further comprises process number identification information, wherein the process number identification information is used to indicate that a number of currently scheduled processes is greater than a threshold z or a number of currently scheduled processes is less than or equal to the threshold z.

### Claim at position 14

17-28. (canceled)

### Claim 29 (depends on 1)

The method according to claim 1, further comprising:
indicating an MCS domain of the plurality of shared channels, wherein an MCS domain corresponding to a case of scheduling for the plurality of shared channels enabled is 2 bits less than an MCS domain corresponding to a case of scheduling for the plurality of shared channels disabled; and
indexes of the MCS domain corresponding to a case of scheduling for the plurality of shared channels enabled are selected from indexes of an MCS domain corresponding to a case of scheduling for the plurality of shared channels disabled, wherein a selection principle is IMCS=P*n+Q , P, Q and n are all integers, and IMCS is an integer with a value range from 0 to 15.

### Claim 30 (depends on 29)

The method according to claim 29, wherein
in a case of P=2, IMCS=2n+Q, Q is at least one of 1, 3, 5, 7, 9; or
in a case of P=3, IMCS=3n+Q , Q is at least one of −3, 0, 3, 6, 9; or
in a case of P=4, IMCS4n+Q, Q is at least one of −1, 3, 7; or,
in a case of P=5, Q is 0, IMCS=5n.

### Claim 31 (depends on 1)

The method according to claim 1, further comprising:
indicating a resource allocation domain of the plurality of shared channels; wherein in a case where a first mode is adopted, the resource allocation domain occupies 1 bit, and comprises a state in which the number of corresponding physical resource blocks (PRB) is 6 and a state in which the number of corresponding PRBs is 4.

### Claim at position 18

32-37. (canceled)

### Claim 38 (depends on 1)

The method according to claim 1, further comprising:
determining positions of gaps, wherein, a gap is inserted every first preset subframes, a number of the first preset subframes is determined according to an interleaving granularity of transport blocks (TB), a number of currently scheduled TBs, and a preset threshold value, and the number of the first preset subframes is calculated through the following formular:
G
*
N
T
⁢
B
*
⌈
Θ
G
*
N
T
⁢
B
⌉
,
or
⁢
⁢
G
*
N
T
⁢
B
*
⌊
Θ
G
*
N
T
⁢
B
⌋
;
wherein, G is the interleaving granularity, NTB represents a number of currently scheduled TBs, Θ is the preset threshold, ┌ ┐ is round up, and └ ┘ is round down.

### Claim 39 (depends on 1)

The method according to claim 1, further comprising:
determining positions of gaps, wherein a gap is inserted every second preset subframes, a number of the second preset subframes is determined according to a number of currently scheduled TBs, a number of repeat times of TBs, and a number of the inserted gaps, the number of the second preset subframes is calculated through the following formular:
N
T
⁢
B
*
R
2
n
,
wherein, NTB represents a number of currently scheduled TBs, R is a number of repeat times of TBs, n satisfies
2
n
-
1
≤
R
*
N
T
⁢
B
Θ
≤
2
n
+
1
-
1
,
is a preset threshold, the number of the inserted gaps is 2n−1, and n is an integer.

### Claim 40 (depends on 1)

The method according to claim 1, further comprising:
determining positions of gaps, wherein, a number of the inserted gaps is configured through a radio resource control (RRC) signal, and the positions of the gaps are obtained according to the configured number of the inserted gaps.

### Claim 41

A scheduling indication apparatus, comprising:
at least one processor, and
at least one memory,
wherein the at least one memory comprises at least one program instruction, and the at least one program instruction, when executed by the at least one processor, implements:
scheduling a plurality of shared channels through a single physical downlink control channel (PDCCH);
wherein the scheduling information is carried in the single PDCCH to indicate scheduling for processes corresponding to the plurality of shared channels, the plurality of shared channels comprise at least one of a physical uplink shared channel (PUSCH) and a physical downlink shared channel (PDSCH).

### Claim 42

A non-transitory computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements;
scheduling a plurality of shared channels through a single physical downlink control channel (PDCCH);
wherein the scheduling information is carried in the single PDCCH to indicate scheduling for processes corresponding to the plurality of shared channels, the plurality of shared channels comprise at least one of a physical uplink shared channel (PUSCH) and a physical downlink shared channel (PDSCH).
