MÉTODO DE COMUNICAÇÃO, APARELHO DE COMUNICAÇÕES, E MEIO DE ARMAZENAMENTO LEGÍVEL POR COMPUTADOR NÃO TRANSITÓRIO

Abstract

The present invention relates to a communication method, a network device, and a terminal device, wherein the method comprises: when the number of minimum programming time units of a programming case, on one side of the network, is s, and the network device and the terminal device use a first transmission mode to perform data transmission, the network device determines a desired programming rule from n programming rules, wherein the programming rule comprises at least one of the mapping relationships between the number of transport blocks t of that programming case, the t transport blocks, and the s minimum programming time units in that programming case, with the first transmission mode being a single-antenna transmission solution or a multi-antenna transmission solution; and the network device communicates with the terminal device according to the desired programming rule.The technical solution can select a suitable programming rule to adapt to different scenarios.

Description

A communication method, communications device, and computer-readable, non-transient storage medium.

[0001] This patent application claims priority to Chinese patent application no. 201710007992.4, filed with the Chinese Patent Office on January 5, 2017, and entitled COMMUNICATION METHOD, NETWORK SIDE DEVICE, AND TERMINAL DEVICE, which is incorporated by reference in its entirety herein. TECHNICAL FIELD

[0002] The present invention relates to the field of communications technologies and, more specifically, to a communication method, a network-side device and a terminal device. BACKGROUND

[0003] In the Long Term Evolution protocol, In LTE, data sent from a medium access control (MAC) layer to a physical layer is organized into a transport block (TB). A transport block corresponds to a data block that includes a protocol data unit (PDU), and the data block is sent within a transmission time interval (TTI). A hybrid automatic repeat request (HARQ) is retransmitted at each TTI. Only one transport block is processed in each HARQ process within a TTI.

[0004] A mapping relationship between a transport block and a minimum scaling unit, in a current protocol, is not applicable to all scenarios. Therefore, a scaling solution is needed to enable the relationship of Petition 870250017021, dated 28 / 02 / 2025, page 9 / 215 2 / 90 mapping, between the transport block and the minimum scheduling unit, can be flexibly applied to various scenarios. SUMMARY

[0005] The implementations of this request provide a communication method, a network-side device, and a terminal device, so that appropriate scheduling rules can be selected to adapt to different scenarios.

[0006] According to a first aspect, an embodiment of this patent application provides a method of communication, and the method includes: when a quantity of minimum scheduling time units, in a scheduling time, executed by a network-side device, is S, and the network-side device and a terminal device transmit data in a first transmission mode, determining, by the network-side device, a desired scheduling rule (target) from N scheduling rules, wherein the scheduling rule includes at least one of a quantity T of transport blocks, in a scheduling time, and a mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time, N is an integer equal to or greater than 2, T is an integer equal to or greater than 1, S is an integer equal to or greater than 1,The first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme; and communication occurs, via the network-side device, with the terminal device according to the desired scheduling rule. In the preceding technical solution, suitable scheduling rules can be selected to adapt to different scenarios. Furthermore, each minimum scheduling time unit can still carry several transport blocks in the frequency domain. According to the technical solution, Petition 870250017021, dated 28 / 02 / 2025, page 10 / 215 3 / 90 above, a requirement for a transport block, for flexible resource reuse, can be further satisfied. For example, using fewer resources in retransmission can usually avoid loss and improve spectral efficiency, or using more resources in retransmission can ensure latency and reliability.

[0007] With reference to the first aspect, in a first possible implementation of the first aspect, the determination, by the network-side device, of a desired scheduling rule from N scheduling rules includes: determining, by the network-side device, based on a correspondence between the parameter information and a scheduling rule, a scheduling rule corresponding to the parameter information determined in the N scheduling rules as the desired scheduling rule, wherein the parameter information includes at least one of a subcarrier spacing, used when the network-side device communicates with the terminal device, and of a number of symbols occupied by a minimum scheduling time unit, which are used when the network-side device communicates with the communications device.According to the preceding technical solution, the desired scheduling rule, determined by the network-side device, corresponds to the parameter information used when the network-side device communicates with the terminal device, so that the scheduling rule best adapts to a network environment in which the terminal device is located.

[0008] With reference to the first aspect, in a second possible implementation of the first aspect, the network-side device determines the radio resource information, and the network-side device determines, based on a match between the radio resource information and a scheduling rule, a Petition 870250017021, dated 28 / 02 / 2025, page 11 / 215 4 / 90 scheduling rule corresponding to the radio resource information determined in the N scheduling rules as the desired scheduling rule. According to the preceding technical solution, the desired scheduling rule, determined by the network-side device, corresponds to the current radio resource information, so that the scheduling rule best fits a current radio resource utilization situation.

[0009] With reference to the first aspect, in a third possible implementation of the first aspect, the network-side device determines a working status of the terminal device, and the network-side device determines, based on a correspondence between a working status of the terminal device and a scheduling rule, a scheduling rule corresponding to the determined working status of the terminal device in the N scheduling rules as the desired scheduling rule. According to the preceding technical solution, the desired scheduling rule, determined by the network-side device, corresponds to the working status of the terminal device, so that the scheduling rule best matches the working status of the terminal device.

[0010] With reference to the first aspect, in a fourth possible implementation of the first aspect, the network-side device determines the radio environment information, and the network-side device determines, based on a correspondence between the radio environment information and a scheduling rule, a scheduling rule corresponding to the radio environment information determined in the N scheduling rules as the desired scheduling rule. According to the preceding technical solution, the desired scheduling rule, determined by the network-side device, corresponds to a radio environment, Petition 870250017021, dated 28 / 02 / 2025, page 12 / 215 5 / 90 so that the scaling rule best suits a current radio environment.

[0011] With reference to any of the first aspect or possible implementations of the first aspect, in a fifth possible implementation of the first aspect, the mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time is: each of the T transport blocks is mapped into one of the S minimum scheduling time units; each of the T transport blocks is mapped into the S minimum scheduling time units; or each of the T transport blocks is mapped into the St units of consecutive minimum scheduling times in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S. In the preceding technical solution, a mapping relation between a transport block and a minimum scheduling time unit is determined according to a specific rule.The network-side device and the endpoint device can store or predefine the rule. In this case, the scheduling rule can include only a certain number of transport blocks in a scheduling time, and a corresponding number of minimum scheduling units, in which a transport block is mapped, can be obtained according to the preceding rule, or the scheduling rule can include only a certain number of minimum scheduling units, in which a transport block is mapped, and a corresponding number of transport blocks, in a scheduling time, can be obtained according to the preceding rule.

[0012] With reference to any of the first aspect or possible implementations of the first aspect, in a sixth possible implementation of the first aspect, the mapping relation between T Petition 870250017021, dated 28 / 02 / 2025, p. 13 / 215 6 / 90 transport blocks and S minimum scheduling time units in a scheduling time is: a first transport block in the T transport blocks is mapped to the a+b minimum scheduling time units, and each of the T transport blocks, except the first transport block, is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a x T + b; or a Tth transport block, in the T transport blocks, is mapped to the a+b minimum scheduling time units, and each of the T transport blocks, except the Tth transport block, is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a x T + b. In the preceding technical solution, a mapping relationship between a transport block and a minimum scheduling time unit is determined according to a specific rule.The network-side device and the endpoint device can store or predefine the rule. In this case, the scheduling rule can include only a certain number of transport blocks in a scheduling time, and a corresponding number of minimum scheduling units, in which a transport block is mapped, can be obtained according to the preceding rule, or the scheduling rule can include only a certain number of minimum scheduling units, in which a transport block is mapped, and a corresponding number of transport blocks, in a scheduling time, can be obtained according to the preceding rule.

[0013] With reference to any of the first aspect or possible implementations of the first aspect, in a seventh possible implementation of the first aspect, prior to communication by the network-side device with the terminal device, according to Petition 870250017021, dated 28 / 02 / 2025, p. 14 / 215 7 / 90 with the desired scheduling rule, the method also includes: sending, by the network-side device, the desired scheduling rule indication information to the terminal device, where the desired scheduling rule indication information is used to indicate the desired scheduling rule, determined by the network-side device. In this way, the network-side device can indicate the determined desired scheduling rule to the terminal device, so that the terminal device determines a scheduling rule that needs to be used.

[0014] With reference to the seventh possible implementation of the first aspect, in an eighth possible implementation of the first aspect, the desired scheduling rule indication information includes at least one of the following: a subcarrier spacing; a number of symbols occupied by a minimum scheduling time unit; a format of downlink control information; a modulation and encoding scheme; a cyclic redundancy check code; and a number of allocated resource blocks. According to the preceding technical solution, the network-side device can implicitly indicate the desired scheduling rule to the terminal device, and therefore no field indication is needed if newly introduced, or the content carried in an indication field, specified in an existing rule, need not change.

[0015] With reference to the seventh possible implementation of the first aspect, in a ninth possible implementation of the first aspect, the information indicating desired scheduling rules is carried in a control signal. According to the preceding technical solution, the network-side device can explicitly indicate the desired scheduling rule. Petition 870250017021, dated 28 / 02 / 2025, p. 15 / 215 8 / 90 to the terminal device, so that a scheduling rule, which needs to be used, can be indicated more explicitly to the terminal device.

[0016] According to a second aspect, an embodiment of this patent application provides a method of communication, and the method includes: when a terminal device and a network-side device transmit data in a first transmission mode, and a quantity of minimum scheduling time units, in a scheduling time, performed by the network-side device, is S, determining, by the terminal device, a desired scheduling rule, wherein the desired scheduling rule is one of N scheduling rules, the scheduling rule includes at least one of a quantity of T transport blocks, in a scheduling time, and a mapping relation between T transport blocks and S minimum scheduling time units, in a scheduling time, N is a positive integer equal to or greater than 2, T is a positive integer equal to or greater than 1, S is a positive integer equal to or greater than 1,The first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme; and it communicates, through the terminal device, with the network-side device according to the desired scheduling rule. In the preceding technical solution, suitable scheduling rules can be selected to adapt to different scenarios. Furthermore, each minimum scheduling time unit can still carry several transport blocks in the frequency domain. According to the preceding technical solution, a requirement for a transport block, for flexible resource reuse, can be additionally satisfied. For example, using fewer resources in retransmission can usually avoid loss and improve spectral efficiency, or, Petition 870250017021, dated 28 / 02 / 2025, page 16 / 215 9 / 90 Using more resources in retransmission can ensure latency and reliability.

[0017] With reference to the second aspect, in a first possible implementation of the second aspect, the determination, by the terminal device, of a desired scheduling rule includes: determining, by the terminal device, that the desired scheduling rule is a scheduling rule corresponding to the parameter information used when the terminal device communicates with the network-side device, wherein the parameter information includes at least one subcarrier spacing, used when the network-side device communicates with the terminal device, and a number of symbols occupied by each minimum scheduling time unit.According to the preceding technical solution, the desired scheduling rule, determined by the network-side device, corresponds to the parameter information used when the network-side device communicates with the terminal device, so that the scheduling rule best adapts to a network environment in which the terminal device is located.

[0018] With reference to the second aspect or the first possible implementation of the second aspect, in a second possible implementation of the second aspect, the determination, by the terminal device, of a desired scheduling rule includes: obtaining, by the terminal device, information from desired scheduling rule indications sent by the network-side device, wherein the desired scheduling rule indication information is used to indicate a scheduling rule determined by the network-side device; and determining, by the terminal device, the desired scheduling rule as the scheduling rule indicated by the rule indication information. Petition 870250017021, dated 28 / 02 / 2025, page 17 / 215 10 / 90 scaling desired. According to the preceding technical solution, the terminal device can determine, based on an indication from the network-side device, a scaling rule used when the terminal device communicates with the network-side device, so that a suitable scaling rule can be used for communication with the network-side device.

[0019] With reference to the second possible implementation of the second aspect, in a third possible implementation of the second aspect, the desired scheduling rule indication information includes at least one of the following: a subcarrier spacing; a number of symbols occupied by a minimum scheduling time unit; a format of downlink control information; a modulation and encoding scheme; a cyclic redundancy check code; and a number of allocated resource blocks. According to the preceding technical solution, the network-side device can implicitly indicate the desired scheduling rule to the terminal device, and therefore the content carried in an indication field, specified in an existing rule, need not change.

[0020] With reference to the third possible implementation of the second aspect, in a fourth possible implementation of the second aspect, the determination, by the terminal device, of the desired scheduling rule as the scheduling rule indicated by the desired scheduling rule indications information includes: determining, by the terminal device, based on a correspondence between the desired scheduling rule indications information and a scheduling rule, the scheduling rule corresponding to the indications information of Petition 870250017021, dated 28 / 02 / 2025, page 18 / 215 11 / 90 desired scheduling rules in the N scheduling rules as the desired scheduling rule. According to the preceding technical solution, the network-side device can implicitly indicate the desired scheduling rule to the terminal device, and therefore, the content carried in an indication field, specified in an existing rule, does not need to change.

[0021] With reference to the second possible implementation of the second aspect, in a fifth possible implementation of the second aspect, the obtaining, by the terminal device, of the desired scheduling rule indications sent by the network-side device includes: obtaining, by the terminal device, the desired scheduling rule indications from the received control signaling sent by the network-side device. According to the preceding technical solution, the network-side device can explicitly indicate the desired scheduling rule to the terminal device, so that a scheduling rule that needs to be used can be indicated more explicitly to the terminal device.

[0022] With reference to any of the second aspect or possible implementations of the second aspect, in a sixth possible implementation of the second aspect, the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time is: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; or each of the T transport blocks is mapped to the St units of consecutive minimum scheduling times in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S. In the technical solution Petition 870250017021, dated 28 / 02 / 2025, p. 19 / 215 In the preceding 12 / 90 model, a mapping relationship between a transport block and a minimum scheduling time unit is determined according to a specific rule. The network-side device and the terminal device can store or predefine the rule. In this case, the scheduling rule can include only a certain number of transport blocks in a scheduling time, and a corresponding number of minimum scheduling units, in which a transport block is mapped, can be obtained according to the preceding rule, or the scheduling rule can include only a certain number of minimum scheduling units, in which a transport block is mapped, and a corresponding number of transport blocks, in a scheduling time, can be obtained according to the preceding rule.

[0023] With reference to either of the second aspect or of the preceding possible implementations of the second aspect, in a seventh possible implementation of the second aspect, the mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time is: a first transport block in the T transport blocks is mapped to a+b minimum scheduling time units, and each of the T transport blocks, except the first transport block, is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a x T + b; or a Tth transport block, in the T transport blocks, is mapped to a+b minimum scheduling time units, and each of the T transport blocks, except the Tth transport block, is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a x T + b.In the preceding technical solution, a mapping relationship was established between a transport block and a unit. Petition 870250017021, dated 28 / 02 / 2025, page 20 / 215 The 13 / 90 minimum scheduling time is determined according to a specific rule. The network-side device and the terminal device can store or predefine the rule. In this case, the scheduling rule can include only a certain number of transport blocks in a scheduling time, and a corresponding number of minimum scheduling units, in which a transport block is mapped, can be obtained according to the preceding rule, or the scheduling rule can include only a certain number of minimum scheduling units, in which a transport block is mapped, and a corresponding number of transport blocks, in a scheduling time, can be obtained according to the preceding rule.

[0024] According to a third aspect, an embodiment of this patent application provides a network-side device, and the network-side device includes units for performing either of the first aspect or of the possible implementations of the first aspect.

[0025] According to a fourth aspect, an embodiment of this patent application provides a terminal device, and the terminal device includes units for performing either of the second aspect or possible implementations of the second aspect.

[0026] According to a fifth aspect, an embodiment of this patent application provides a network-side device. The network-side device includes a processor, a memory, and a transceiver. The memory is configured to implement the method in any one of the first aspect or of the possible implementations of the first aspect. The processor executes the instructions stored in memory and implements, in combination with a communications interface, the method in any one of the first aspect or of the Petition 870250017021, dated 28 / 02 / 2025, p. 21 / 215 14 / 90 possible implementations of the first aspect.

[0027] According to a sixth aspect, an implementation of this patent application provides a terminal device. The terminal device includes a processor, a memory, and a transceiver. The memory is configured to implement the method in any one of the second aspect or of the possible implementations of the second aspect. The processor executes the instructions stored in memory and implements, in combination with a communications interface, the method in any one of the second aspect or of the possible implementations of the second aspect.

[0028] According to a seventh aspect, an embodiment of this patent application provides a communication method, wherein the method comprises: when a quantity of minimum scheduling time units, in a scheduling time, executed by a network-side device, is S, and the network-side device and a terminal device transmit data in a first transmission mode, determining 101, by the network-side device, a desired scheduling rule of N scheduling rules, wherein the scheduling rule comprises at least one of a quantity T of transport blocks, in a scheduling time, and a mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time, N is an integer equal to or greater than 2, T is an integer equal to or greater than 1, S is an integer equal to or greater than 1,and the first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme, determine 102, by the terminal device, the desired scheduling rule, where the desired scheduling rule is one of N scheduling rules; and communicate 103, by the network-side device, with the device, Petition 870250017021, dated 28 / 02 / 2025, page 22 / 215 15 / 90 terminal according to the desired scaling rule.

[0029] According to an eighth aspect, an embodiment of this patent application provides a communications system. The communications system includes a network-side device and a terminal device, wherein the network-side device is configured to implement the method in any of the first aspect or possible implementations of the first aspect, and the terminal device is configured to implement the method in any of the second aspect or possible implementations of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 is a schematic flowchart of a communication method according to an embodiment of this patent application.

[0031] Figure 2 is a schematic diagram of a scheduling rule change in a transmission process.

[0032] Figure 3 is another schematic diagram of a scheduling rule change in a transmission process.

[0033] Figure 4 is a schematic diagram in which several transport blocks, in a scheduling time, are mapped to a minimum scheduling time unit.

[0034] Figure 5 is another schematic diagram in which several transport blocks, in a scheduling time, are mapped to a minimum scheduling time unit.

[0035] Figure 6 is a schematic diagram in which several transport blocks, in a scheduling time, are mapped to several minimum scheduling time units.

[0036] Figure 7 is another schematic diagram in which several transport blocks, in a scheduling time, are mapped to several minimum scheduling time units. Petition 870250017021, dated 28 / 02 / 2025, page 23 / 215 16 / 90

[0037] Figure 8 is a schematic diagram of a combination of time-division multiplexing and frequency-division multiplexing.

[0038] Figure 9 is a schematic diagram of a combination of time-division multiplexing and frequency-division multiplexing.

[0039] Figure 10 is a schematic transmission diagram of a transport block initially transmitted and a transport block retransmitted by frequency division multiplexing.

[0040] Figure 11 is a structural block diagram of a network-side device according to an embodiment of this patent application.

[0041] Figure 12 is a structural block diagram of a terminal device according to an embodiment of this patent application.

[0042] Figure 13 is a structural block diagram of a network-side device according to an embodiment of this patent application.

[0043] Figure 14 is a structural block diagram of a terminal device according to an embodiment of this patent application. DESCRIPTION OF THE ACCOMPLISHMENTS

[0044] The technical solutions in the embodiments of this patent application are described below, with reference to the attached drawings.

[0045] It should be understood that the technical solutions in the embodiments of this patent application can be applied to various communication systems, such as a Long Term Evolution (LTE) system, a frequency division duplex (FDD) LTE system, a system Petition 870250017021, dated 28 / 02 / 2025, page 24 / 215 LTE 17 / 90 time division duplex (TDD), a 4.5th generation (4.5G) network, a 5th generation (5G) network, and new radio (NR).

[0046] A terminal device in the technical solutions, in the embodiments of this patent application, may also be referred to as an access terminal, user equipment (UE), subscriber unit, mobile station, mobile console, remote station, mobile device, user terminal, terminal, wireless communications device, user agent or user apparatus, portable device having a wireless communication function, computing device or other processing device connected to a wireless modem, in-vehicle device, device for use, or a terminal device in a future 5G network. The terminal device may communicate with one or more core networks by use of a radio access network (RAN), or may access a distributed network in a self-organizing or free-lease manner.The terminal device may also access a wireless network in another way for communication, or the terminal device may directly perform wireless communication with another terminal device. This is not limited to the embodiments of this patent application.

[0047] A network-side device can be a Node B, an evolved Node B (eNB), a base station in a communications system, a base station in a future communications system, or similar.

[0048] A method of data transmission, provided in the embodiments of this patent application, can be applied to a downlink data transmission, or it can be applied to an uplink data transmission, or by being applied Petition 870250017021, dated 28 / 02 / 2025, p. 25 / 215 18 / 90 in a device-to-device (D2D) data transmission. For downlink data transmission, a sending device is a network-side device, and a corresponding receiving device is a terminal device. For uplink data transmission, a sending device is a terminal device, and a corresponding receiving device is a network-side device. For D2D data transmission, a sending device is a terminal device, and a corresponding receiving device is also a terminal device. This is not limited to the embodiments of this patent application.

[0049] The sending device and the receiving device, in the embodiments of this patent application, may be disposed on land and include an indoor or outdoor device, a portable device or a vehicle-mounted device, or may be disposed in water, or may be disposed in an aircraft, or in an airborne satellite.The terminal device, in the embodiments of this patent application, may be a mobile phone, a tablet computer, a computer with wireless transmission and reception capabilities, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal for industrial control, a wireless terminal for self-driving, a wireless terminal for remote medical telemedicine, a wireless terminal for a smart grid, a wireless terminal for transportation safety, a wireless terminal for a smart city, a wireless terminal for a smart home, or similar devices. The application scenario is not limited in the embodiments of this patent application.

[0050] Figure 1 is a schematic flowchart of a method of Petition 870250017021, dated 28 / 02 / 2025, page 26 / 215 19 / 90 communication in accordance with an embodiment of this patent application. 101. When a quantity of minimum scheduling time units, in a scheduling time performed by a network-side device, is S, and the network-side device and a terminal device transmit data in a first transmission mode, the network-side device determines a desired scheduling rule from N scheduling rules, wherein the scheduling rule includes at least one of a quantity T of transport blocks, in a scheduling time, and a mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time, N is a positive integer equal to or greater than 2, T is a positive integer equal to or greater than 1, S is a positive integer equal to or greater than 1, and the first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme.

[0051] The multiple antenna transmission scheme may be a transmission diversity transmission scheme, a spatial multiplexing transmission scheme, a multiple-input multiple-output (MIMO) transmission scheme, a coordinated multiple points transmission / reception (CoMP) transmission and reception scheme, a beamforming transmission scheme or similar, or it may be a multi-antenna port, layer, beam or classification configuration. The first transmission mode is a transmission mode determined by the network-side device. The first transmission mode may be any of the transmission modes (TM) 1 to 10 defined in an LTE system, or it may be another mode of Petition 870250017021, dated 28 / 02 / 2025, page 27 / 215 20 / 90 transmission (e.g., 5G). This is not limited to this embodiment of this patent application. The single-antenna transmission scheme or a non-spatial multiplexing transmission scheme is used as an example in the following embodiment, and the multiple-antenna transmission scheme or the non-spatial multiplexing transmission scheme can be similarly achieved.

[0052] The transport block may, in this case, be a transport block (TB) in the LTE protocol, or it may be a transmission unit having the same function in another communications system (e.g., 5G).

[0053] The minimum scaling time unit may, in this case, be a transmission time interval (TTI), a slot, a time-domain symbol, or a mini-slot including one or more time-domain symbols. The time-domain symbol may be an orthogonal frequency division multiplexing (OFDM) symbol, or it may be a single carrier frequency division multiple access (SC-FDMA) symbol. The time-domain symbol is referred to as a symbol below. 102. The terminal device determines the desired scheduling rule. 103. The network-side device communicates with the terminal device according to a desired scheduling rule. In this case, the communication can be either uplink or downlink.

[0054] Usually, a transport block requires several bits of control information, for example, a new data indicator (NDI), a redundancy version ( Petition 870250017021, dated 28 / 02 / 2025, p. 28 / 215 21 / 90 version, RV) and an indication of hybrid automatic repeat request (HARQ) feedback information. Therefore, a smaller number of transport blocks indicates fewer bits of control information needed and fewer corresponding control information headers. Furthermore, when a transport block is mapped to more minimum scheduling time units, the transmission time interval (TTI) of a transport block is longer, thus extending the uplink coverage area of ​​the terminal device. Optionally, when a transport block is mapped to multiple minimum scheduling time units, the transport block size (TBS) can be larger. In other words, the TBS can be directly proportional to the data of a minimum scheduling time unit.A greater coding gain can be obtained based on a larger TBS. When a transmitting end and a receiving end have the same processing latency, a longer TTI indicates a smaller number of HARQ processes, which are needed to maintain continuous transmission. A smaller number of transport blocks transmitted within the same time indicates fewer Medium Access Control (MAC) layer headers and Radio Link Control (RLC) layer headers, and fewer cyclic redundancy check (CRC) headers. Conversely, if the number of transport blocks transmitted within the same time is greater, the TTI of each transport block is shorter, and the one-way latency is lower. The selection of this scheduling rule in some scenarios (e.g., a high-speed motion scenario or a scenario...) Petition 870250017021, dated 28 / 02 / 2025, page 29 / 215 22 / 90 interference (overflow) can improve data transmission efficiency. Therefore, according to the method shown in Figure 1, appropriate scheduling rules can be selected to adapt to different scenarios. Furthermore, each minimum scheduling time unit can still drive several transport blocks in the frequency domain. According to the method shown in Figure 1, a requirement for a transport block for flexible resource reuse can also be satisfied. For example, using fewer resources in retransmission can usually avoid resource loss and improve spectral efficiency, or using more resources in retransmission can ensure latency and reliability.

[0055] When the scheduling rule includes the quantity T of transport blocks in a scheduling time, different scheduling rules in the N scheduling rules include different quantities of transport blocks in a scheduling time. In other words, the ratios between a quantity of transport blocks and a quantity of minimum scheduling time units in a scheduling time, determined according to different scheduling rules, may be different. When the scheduling rule includes the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time, the ratios between a quantity of transport blocks and a quantity of minimum scheduling time units in a scheduling time, indicated by different scheduling rules in the N scheduling rules, may also be different.In view of what has been presented above, the relationships of proportions, between a quantity of transport blocks and a quantity of time units of... Petition 870250017021, dated 28 / 02 / 2025, p. 30 / 215 23 / 90 minimum scaling, determined according to the N scaling rules, can be any two of the following: 1:1, 1:P, Q:P or Q:1, where both P and Q are positive integers, and P is different from Q.

[0056] Optionally, in some embodiments, the scheduling rule may also include at least one of the quantity T of transport blocks in a scheduling time, the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time, and a quantity of minimum scheduling time units in which a transport block is mapped in a scheduling time.

[0057] To help a person skilled in the art better understand the technical solutions in this patent application, the N scheduling rules by use of Table 1 are shown below. In the embodiment shown in Table 1, the minimum number of scheduling time units in a scheduling time is considered to be 4. Table 1 Scheduling rule sequence number | Quantity of transport blocks | Mapping relationship between a transport block and a minimum scheduling time unit | 1 | Ti~(Si, S2, S3, S4) | 2 | Ti~(Si, S2), T2~(S3, S4) | 3 | Ti~(Si), T2~(S2), T3~(S3), T4~(S4)

[0058] The scheduling rule shown in Table 1 includes the number of transport blocks in a scheduling time and the mapping relationship between T transport blocks and S minimum scheduling time units in a time of Petition 870250017021, dated 28 / 02 / 2025, p. 31 / 215 24 / 90 scheduling, where Ti~(Ss) represents that a t transport block in the T transport blocks is mapped to a seventh minimum scheduling time unit in the S minimum scheduling time units. For example, in the preceding scheduling rule 3, Ti~(Si) represents that a first transport block, in the four transport blocks, is mapped to a first minimum scheduling time unit in the four minimum scheduling time units. For another example, in the preceding scheduling rule 2, T2~(S3, S4) represents that a second transport block, in the two transport blocks, is mapped to a third minimum scheduling time unit and a fourth minimum scheduling time unit in the four minimum scheduling time units. The scheduling rule shown in Table i can be represented in another form.For example, the scheduling rule might include only the number of transport blocks in a scheduling time, or it might include only the mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time.

[0059] Table 2 shows another scaling rule. Table 2 Scheduling rule sequence number. Minimum number of scheduling time units in which a transport block is mapped. 1 1 2 2 3 3 4 4 5 5 Petition 870250017021, dated 28 / 02 / 2025, page 32 / 215 25 / 90 6 6 7 7 8 8

[0060] Table 3 shows another scaling rule. Table 3 Scheduling rule sequence number. Minimum number of scheduling time units in which a transport block is mapped. 1 1 2 2 3 4 4 8

[0061] The scheduling rules shown in Tables 2 and 3 include a number of minimum scheduling time units, in which each of the transport blocks is mapped to a scheduling time. The actual number T of transport blocks, in a scheduling time, and the mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time, can be determined according to the preceding rules and the number S of minimum scheduling time units, in a scheduling time. For example, if scheduling rule 2 is used, and the number S of minimum scheduling time units, in a scheduling time, is 4, it can be learned that the actual number T of transport blocks, in a scheduling time, is 2, and two TBs are respectively mapped to the first and second minimum scheduling time units and to the third and fourth minimum scheduling time units. Petition 870250017021, dated 28 / 02 / 2025, page 33 / 215 26 / 90 minimum scaling.

[0062] It should be understood that the preceding scheduling rule is merely intended to help a person skilled in the art to better understand a meaning of the scheduling rule, and no limitation is imposed on the scheduling rule. For example, the scheduling rule may be a subset, an extension, or a modification of the rule in the preceding table. For example, there may be only two scheduling rules in Table 1 in a real system, where one scheduling rule is that a transport block is mapped to S minimum scheduling time units (scheduling rule 1), and the other scheduling rule is that S transport blocks are mapped to S minimum scheduling time units (scheduling rule 3).

[0063] Optionally, in some embodiments, the network-side device may determine the parameter information used when the network-side device communicates with the terminal device, and then determine, based on a correspondence between the parameter information and a scheduling rule, a scheduling rule corresponding to the parameter information determined in the N scheduling rules as the desired scheduling rule. The parameter information may be a subcarrier spacing, used when the network-side device communicates with the communications device. Alternatively, the parameter information may be a quantity of a subcarrier spacing, used when the network-side device communicates with the terminal device, and a quantity of symbols occupied by a minimum scheduling time unit, which are used when the network-side device communicates with the terminal device. Petition 870250017021, dated 28 / 02 / 2025, page 34 / 215 27 / 90 communicates with the communications device.

[0064] Table 4 shows a correspondence between parameter information and a scheduling rule. The parameter information in Table 4 is a subcarrier spacing. Table 4 Subcarrier spacing Programming rule sequence number 15 kHz 3 30 kHz 2 60 Hz 1

[0065] A scheduling rule, represented by the scheduling rule sequence number shown in Table 4, is equal to the scheduling rule shown by the same sequence number shown in Table 1. For example, a scheduling rule whose scheduling rule sequence number is 3 in Table 1 is a scheduling rule whose scheduling rule sequence number is 3 in Table 1, to be specific, the quantity of transport blocks is 4, and T1~(S1), T2~(S2), T3~(S3) and T4~(S4).

[0066] Table 5 shows another correspondence between parameter information and a scheduling rule. The parameter information in Table 5 is a subcarrier spacing, and the scheduling rule is a number of minimum scheduling time units in which a transport block is mapped. Table 5 Subcarrier spacing: The minimum number of programming time units in which Petition 870250017021, dated 28 / 02 / 2025, page 35 / 215 28 / 90 A transport block is mapped as follows: 15 kHz 1, 30 kHz 1 or 2, 60 kHz 1, 2 or 4.

[0067] To avoid redundancy, Table 5 represents several embodiments in a table form. For example, in one embodiment, when the subcarrier spacing is 30 kHz, the number of minimum scaling time units in which a transport block is mapped is 1, and when the subcarrier spacing is 60 kHz, the number of minimum scaling time units in which a transport block is mapped is 2. In some other embodiments, when the subcarrier spacing is 30 kHz, the number of minimum scaling time units in which a transport block is mapped is 2, when the subcarrier spacing is 60 kHz, the number of minimum scaling time units in which a transport block is mapped is 4, and so on.

[0068] Table 6 shows another correspondence between parameter information and a scheduling rule. The parameter information in Table 6 is a number of symbols occupied by a minimum scheduling time unit. Table 6 Number of symbols occupied by a minimum programming time unit Number of programming rule sequences 14 3 7 2

[0069] Similar to Table 4, a scheduling rule, Petition 870250017021, dated 28 / 02 / 2025, page 36 / 215 29 / 90, represented by the number in the scheduling rule sequence shown in Table 6, is equal to the scheduling rule represented by the same number in the scheduling rule sequence in Table 1.

[0070] Table 7 shows another correspondence between parameter information and a scheduling rule. The transmission information in Table 7 is a subcarrier spacing and a number of symbols occupied by a minimum scheduling time unit. Table 7 Subcarrier spacing Minimum number of symbols occupied by a programming time unit Programming rule sequence number 15 kHz 14 3 30 kHz 7 2 60 kHz 7 1

[0071] Similar to Tables 4 and 6, a scheduling rule, represented by the number in the scheduling rule sequence shown in Table 7, is equal to a scheduling rule, represented by the same number in the scheduling rule sequence shown in Table 1.

[0072] Table 8 shows another correspondence between parameter information and a scheduling rule. The transmission information in Table 8 is a subcarrier spacing and a number of symbols occupied by a minimum scheduling time unit. Table 8 Spacing of the number of symbols. Number of subcarrier units occupied by a programming time unit. Minimum time in which a block... Petition 870250017021, dated 28 / 02 / 2025, page 37 / 215 30 / 90 Minimum transport scheduling is mapped: 15 kHz 14 1 15 kHz 7 1 or 2 30 kHz 14 1 or 2 30 kHz 7 1, 2 or 4 60 kHz 14 1, 2 or 4 60 kHz 7 1, 2, 4 or 8

[0073] Similar to Table 5, to avoid redundancy, the Table 8 represents various concretizations in a tabular form.

[0074] It should be understood that the preceding ranking rule is merely intended to help a person skilled in the art to better understand a meaning of the ranking rule, and no limitation is imposed on the ranking rule. For example, the ranking rule may be a subset, an extension, or a modification of the rule in the preceding table. For another example, a subcarrier spacing in 5G / NR can alternatively be 3.75 kHz, 7.5 kHz, 120 kHz, 240 kHz, 480 kHz, or 960 kHz, and the number of symbols occupied by a minimum scaling time unit can alternatively be 1, 2, 3, or 4. For another example, the number of minimum time units in a scaling time is not limited to S = 4 in Table 1, and can be any positive integer value, for example, S = 1, 2, 3, 5, 6, 7, or 8. Similar scaling rules can be defined or specified for these configurations, and the details will not be described in this case.

[0075] Furthermore, in some embodiments, the terminal device may only support one type of subcarrier spacing and a minimum number of symbols occupied by a scheduling unit of time. In this case, the terminal device may determine that the scheduling rule Petition 870250017021, dated 28 / 02 / 2025, page 38 / 215 The desired 31 / 90 is a scheduling rule corresponding to the subcarrier spacing and / or the number of symbols occupied by a minimum scheduling time unit, which is or are supported by the terminal.

[0076] Optionally, in some embodiments, if the duration of a minimum scaling time unit is shorter, the number of minimum scaling time units to which a transport block is mapped is greater. For example, when a subcarrier spacing is 15 kHz, and the number of OFDM symbols occupied by a minimum scaling time unit is 14, the duration of a minimum scaling time unit is 1 ms, and the number of minimum scaling time units to which a transport block is mapped is 1. When a transport block is mapped to fewer minimum scaling time units, a transport block TTI is shorter. A shorter TTI for each transport block indicates a lower one-way latency. In this way, a latency problem caused by an excessively long TTI can be avoided; for example, a one-way latency requirement of 4 ms in 5G eMBB is met.For another example, when a subcarrier spacing is 60 kHz, and the number of OFDM symbols occupied by a minimum scaling time unit is 7, the duration of a minimum scaling time unit is 0.125 ms, and the number of minimum scaling time units to which a transport block is mapped can be 4. When a transport block is mapped to more minimum scaling time units, the TTI of a transport block is longer. Thus, the coverage distance of the transport block is increased. When a transport block is mapped to multiple minimum scaling time units... Petition 870250017021, dated 28 / 02 / 2025, page 39 / 215 With a minimum 32 / 90 scheduling, a larger transport block can be transmitted, and a higher encoding gain can be achieved based on a larger TBS. When the transmitting end and the receiving end have the same processing latency, a longer TTI indicates, based on the same processing latency and the same transmission latency, a smaller number of HARQ processes that are needed to maintain continuous transmission. Furthermore, if the number of transport blocks scheduled within the same time is smaller, the MAC layer headers, the RLC layer headers, and the CRC headers can be reduced, and the control headers can be reduced even further (e.g., downlink control and HARQ feedback headers).

[0077] Optionally, in some other embodiments, the network-side device may further determine radio resource information. The network-side device determines, based on a match between the radio resource information and a scheduling rule, a scheduling rule corresponding to the radio resource information determined in the N scheduling rules as the desired scheduling rule. The radio resource information may be a number of resource blocks (RB) currently available to the network-side device, or a number of layers allocated to a codeword when multiple-input multiple-output (MIMO) communications are used. For example, for 5G / 4.5G, considering that a smaller scaling unit can be used (for example, the number of symbols occupied by a minimum scaling time unit can be 1 or 2), to transmit a larger TB. Petition 870250017021, dated 28 / 02 / 2025, page 40 / 215 33 / 90 a TB needs to be mapped to multiple minimum scaling time units. For another example, for a cell edge user with restricted energy spectrum density and fewer allocated resource blocks, when a transport block is mapped to multiple minimum scaling time units, coverage can be extended, and a larger transport block can be transmitted.

[0078] In this case, the N scheduling rules are considered to be the three scheduling rules shown in Table 1. If the number of RBSs available at the moment is less than a pre-established RB quantity threshold, the desired scheduling rule can be a scheduling rule in which the scheduling rule sequence number is 1, to be specific, a transport block is mapped to four minimum scheduling time units. When the number of RBs is relatively small, if a transport block is mapped to several minimum scheduling time units, a TBS can be increased. A greater encoding gain can be obtained based on a large TBS, and the headers of a MAC layer header and an RLC layer header and the CRC headers are reduced.Furthermore, in some embodiments, if the number of RBs available at the moment is greater than the first pre-established threshold of RB quantity, the desired scheduling rule may be a scheduling rule in which the number of the scheduling rule sequence is 3, to be specific, a transport block is mapped to a minimum scheduling time unit.

[0079] Optionally, in some other embodiments, the network-side device may also determine a working status of the terminal device. The network-side device Petition 870250017021, dated 28 / 02 / 2025, p. 41 / 215 34 / 90 determines, based on a match between a terminal device's working status and a scheduling rule, a scheduling rule corresponding to the determined working status of the terminal device in the N scheduling rules as the desired scheduling rule. The working status of the terminal device may include terminal device location information, for example, information indicating whether the terminal device is located on a cell edge or in a cell center, and whether coverage is limited. The working status of the terminal device may also include a terminal device movement speed, for example, whether the terminal device is in a high-speed movement state or in a low-speed movement state.The terminal device's working status can be recorded by the terminal device to the network-side device, or it can be obtained by the network-side device through measurement.

[0080] In this case, the N scheduling rules are considered to be the three scheduling rules shown in Table 1. If the terminal device is in a low-speed motion state, or is located at a cell edge, or is in a limited coverage scenario, the desired scheduling rule may be a scheduling rule whose scheduling rule sequence number is 1; specifically, a transport block is mapped to four minimum scheduling time units. In this way, a coverage area of ​​the terminal device can be extended. Furthermore, in some embodiments, if the terminal device is in a high-speed motion state, or is located at a cell center, or is in a scenario without coverage limitations, the desired scheduling rule may Petition 870250017021, dated 28 / 02 / 2025, page 42 / 215 35 / 90 being a scheduling rule whose scheduling rule sequence number is 3, to be specific, a transport block is mapped to a minimum scheduling time unit.

[0081] Optionally, in some other embodiments, the network-side device may further determine radio environment information. The network-side device determines, based on a match between the radio environment information and a scheduling rule, a scheduling rule corresponding to the radio environment information determined in the N scheduling rules as the desired scheduling rule. The radio environment information may be channel-related measurement information, or it may be information relating to the current network configuration or scheduling, for example, information about whether burst interference occurs in a neighboring cell, or information about whether there is an impact from ultra-reliable low-latency communications (URLLC) (e.g., resource preemption and punching).For example, a system bandwidth is usually divided into two parts: only an Enhanced Mobile Broadband (eMBB) service area, in which there is no impact from a URLLC service, and an eMBB and URLLC coexistence area, where the eMBB service in that area may be affected by the URLLC service. For the eMBB and URLLC coexistence area, a scheduling rule can be a scheduling rule whose scheduling rule sequence number is 3, shown in Table 1; to be specific, a transport block is mapped to a minimum scheduling time unit in order to best address the impact of URLLC.

[0082] It is considered that, in this case, the N rules of Petition 870250017021, dated 28 / 02 / 2025, page 43 / 215 36 / 90 scheduling are the three scheduling rules shown in Table 1. When overflow interference occurs in a neighboring cell or there is URLLC impact, the desired scheduling rule can be a scheduling rule whose scheduling rule sequence number is 3; to be specific, a transport block is mapped to one minimum scheduling time unit. When no overflow interference occurs in a neighboring cell or there is no URLLC impact, the desired scheduling rule can be a scheduling rule whose scheduling rule sequence number is 1; to be specific, a transport block is mapped to four minimum scheduling time units. When overflow interference occurs in a neighboring cell or there is URLLC impact, the overflow interference in the neighboring cell or the URLLC interference can affect data in only one minimum scheduling time unit.When a transport block is mapped to multiple minimum scaling time units, the various minimum scaling time units only have a corresponding piece of feedback information. Therefore, data in all scaled minimum scaling time units may need to be retransmitted. If a transport block is mapped to one minimum scaling time unit, each minimum scaling time unit has both control information and feedback information. Thus, only data in an affected minimum scaling time unit needs to be retransmitted, and there is a gain in spectral efficiency performance, resulting in better link performance. Furthermore, if each transport block is scaled to only one minimum scaling time unit, a collision conflict between eMBB and URLLC can be avoided by scaling. Petition 870250017021, dated 28 / 02 / 2025, page 44 / 215 37 / 90

[0083] In addition to determining the desired scheduling rule based on whether neighboring cell interference or URLLC interference occurs, the network-side device may select a desired scheduling rule based on another parameter or scenario that may reflect channel quality. Greater channel variation or greater deviation between channels, in different symbols or sub-bands, indicates a smaller number of minimum scheduling time units in which a transport block is mapped, and less channel variation or less deviation between channels, in different symbols or sub-bands, indicates a greater number of minimum scheduling time units in which a transport block is mapped.

[0084] Certainly, in some other embodiments, the network-side device may further determine the desired scheduling rule from the N scheduling rules, based on two or more pieces of information in the preceding information. For example, when a latency requirement is met and no interference occurs, a transport block may be mapped to multiple minimum scheduling time units, even in a core cell user scenario or in an unlimited coverage scenario.

[0085] Optionally, in some embodiments, before step 102, the network-side device may further send desired scheduling rule indications to the terminal device, wherein the desired scheduling rule indications are used to indicate the desired scheduling rule, determined by the network-side device. The determination of the desired scheduling rule by the terminal device includes: the terminal device determines the desired scheduling rule according to the indications information. Petition 870250017021, dated 28 / 02 / 2025, page 45 / 215 38 / 90 of desired escalation rules received.

[0086] It should be understood that the desired scheduling rule, determined by the network-side device, is a desired scheduling rule supported by the end device.

[0087] Optionally, in some embodiments, prior to step 101, the terminal device may send scheduling rule information to the network-side device, wherein the scheduling rule information is used to indicate a scheduling rule supported by the terminal device to the network-side device.

[0088] Optionally, the network-side device can send the desired scheduling rule indications information to the end device in an explicit or implicit manner.

[0089] Optionally, in some embodiments, the desired scheduling rule indication information includes at least one of the following: a subcarrier spacing; a number of symbols occupied by a minimum scheduling time unit; a downlink control information (DCI) format; a modulation and coding (MCS) scheme; a cyclic redundancy check code; and a number of allocated resource blocks.

[0090] For example, the terminal device can store, preset, or generate the correspondence between a subcarrier spacing and a scheduling rule shown in Table 4. If the network-side device currently configures or uses a subcarrier spacing of 15 kHz, the desired scheduling rule is a scheduling rule whose sequence number is 3, and the network-side device can indicate, in a Petition 870250017021, dated 28 / 02 / 2025, page 46 / 215 39 / 90 explicitly or implicitly, the network-side device uses a 15 kHz subcarrier spacing. Explicit notification includes notification of control signaling (e.g., a broadcast channel, a higher-layer signaling, or a physical-layer signaling), and implicit notification includes the determination of subcarrier spacing by blind detection of a broadcast channel, a synchronization channel, or similar, by a user. In this case, the terminal device can determine, based on the correspondence between a subcarrier spacing and a scheduling rule, the scheduling rule whose scheduling rule sequence number is 3, which is the desired scheduling rule.

[0091] For another example, the terminal device may store, predefine, or generate the correspondence between a number of symbols occupied by a minimum scheduling time unit and a scheduling rule shown in Table 6. If the network-side device currently configures or uses 14 symbols occupied by a minimum scheduling time unit, the desired scheduling rule is determined to be a scheduling rule whose sequence number is 3, and the network-side device may indicate that the terminal device uses the 14 symbols occupied by a minimum scheduling time unit. In this case, the terminal device may determine, based on the correspondence between a number of symbols occupied by a minimum scheduling time unit and a scheduling rule, the scheduling rule whose scheduling rule sequence number is 3 as the desired scheduling rule.

[0092] For another example, the terminal device can store, preset, or generate the correspondence shown in Table 7. If the Petition 870250017021, dated 28 / 02 / 2025, page 47 / 215 If a 40 / 90 network-side device currently configures or uses a subcarrier spacing of 15 kHz and 14 symbols occupied by a minimum scaling time unit, the desired scaling rule is determined to be a scaling rule whose sequence number is 3, and the network-side device can indicate that the terminal device uses the 15 kHz subcarrier spacing and the 14 symbols occupied by a minimum scaling time unit. In this case, the terminal device can determine, based on the correspondence between a number of symbols occupied by a minimum scaling time unit and a scaling rule, the scaling rule whose sequence number is 3 as the desired scaling rule.

[0093] For another example, the network-side device and the endpoint device can store, preset, or generate a match between a DCI format and a scheduling rule shown in Table 9. Table 9 DCI Format Programming Rule Sequence Number A 3 B 2 C 1

[0094] A, B, and C shown in Table 9 represent different DCI formats. If the desired scheduling rule, determined by the network-side device, is a scheduling rule whose sequence number is 3, the network-side device can use DCI format A. In this case, the terminal device can determine, based on the detected match between a DCI format and a scheduling rule, the scheduling rule whose number Petition 870250017021, dated 28 / 02 / 2025, page 48 / 215 41 / 90 of the scheduling rule sequence is 3, as the desired scheduling rule.

[0095] For another example, the network-side device and the terminal device can store, predefine, or generate a match between an MCS and a scheduling rule shown in Table 10. Table 10 MCS Index Programming Rule Sequence Number MCS1-MCS2 3 MCS3-MCS4 2 MCS5-MCS6 1

[0096] MCSi to MCSe, in Table 10, represent different MCS indices. If the network-side device configures or uses an MCS between MCSi and MCS2, the desired scheduling rule is determined to be a scheduling rule whose sequence number is 3, and the network-side device can indicate that an MCS used by the terminal device is a value between MCS1 and MCS2. In this case, the terminal device can determine, based on the correspondence between an MCS and a scheduling rule, the scheduling rule whose scheduling rule sequence number is 3 as the desired scheduling rule.

[0097] For another example, the network-side device and the endpoint device can store, preset, or generate a match between a CRC and a scheduling rule shown in Table 11. Table 11 CRC Programming rule sequence number CRC1 3 Petition 870250017021, dated 28 / 02 / 2025, page 49 / 215 42 / 90 CRC2 2 CRC3 1

[0098] CRC1, CRC2, and CRC3, in Table 11, represent three different CRCs. If the desired scheduling rule, determined by the network-side device, is a scheduling rule whose sequence number is 3, the network-side device can add a CRC from CRC1 to the DCI. In this case, after determining the CRC, the terminal device can determine, based on the correspondence between a CRC and a scheduling rule, the scheduling rule whose scheduling rule sequence number is 3 as the desired scheduling rule.

[0099] For another example, the network-side device and the terminal device can store, predefine, or generate a match between a number of RBs and a scheduling rule shown in Table 12. Table 12 Number of RBs Number of programming rule sequences RB ^ RB1 3 RB1 < RB < RB2 2 RB ^ RB2 1

[00100] As shown in Table 12, if a number of RBs configured or used by the network-side device is less than or equal to RB1, the desired scheduling rule is determined by sequence number 3, and the network-side device can indicate that a number of RBs used by the terminal device is equal to or less than RB1. In this case, the terminal device can determine, based on the correspondence between a number of RBs and a scheduling rule, the scheduling rule whose sequence number is 3. Petition 870250017021, dated 28 / 02 / 2025, page 50 / 215 43 / 90 of scheduling rules is 3, as the desired scheduling rule.

[00101] It should be understood that all preceding tables and correspondences are merely intended to assist a person skilled in the art to better understand this embodiment, and no limitation is imposed on the correspondence. For example, the correspondence may be a subset, an extension, or a modification of the correspondence in the preceding table. For example, in the preceding embodiments, the scaling rule in Table 1 is used as an example. An example of the use of the scaling rule in Table 2 or 3 is similar, and the details will not, in that case, be described again.

[00102] Optionally, in some embodiments, the desired scheduling rule information may correspond to a DCI search space location. It should be understood that by virtue of the search space in which the DCIs are located being only a common search space and a user search space, only two scheduling rules can be indicated by using the search space in which the DCIs are located. For example, if the network-side device determines that the desired scheduling rule is a scheduling rule whose sequence number is 3, and determines that the desired scheduling rule is a scheduling rule whose sequence number is 1, the DCIs can be conducted in the user search space. The end device can determine the desired scheduling rule based on the detected location of the DCIs.

[00103] It should be understood that in some embodiments, considering that only two scaling rules can be indicated by using the search space, in which the DCIs are Petition 870250017021, dated 28 / 02 / 2025, page 51 / 215 44 / 90 located, optionally, a remaining scaling rule can be indicated in another way, for example, by using a CRC or a number of RBs.

[00104] Optionally, in some embodiments, the desired scheduling rule information may correspond to a DCI resource location. It should be understood that the terminal device may determine the desired scheduling rule based on the detected DCI resource location (e.g., an RB number, a sub-band number, or a CCE number).

[00105] Optionally, in some other embodiments, the network-side device may send the desired scheduling rule indication information to the terminal device in an explicit manner. Specifically, the network-side device may send the desired scheduling rule indication information to the terminal device by using some fields in the control signaling. The control signaling may be a MAC layer control signaling or a physical layer control signaling.

[00106] Optionally, in some embodiments, a field used to indicate the desired scheduling rule (referred to as a desired scheduling rule indication field below) may be a newly added field in the control signaling. Using DCIs as an example, the desired scheduling rule indication field may be added to the DCIs. After determining the desired scheduling rule, the network-side device may adjust a value of the desired scheduling rule indication field to a value corresponding to the desired scheduling rule. After receiving the DCIs, the terminal device may determine the desired scheduling rule based on the Petition 870250017021, dated 28 / 02 / 2025, page 52 / 215 45 / 90 value of the desired scheduling rule indication field in DCI. Additionally, the desired scheduling rule can also be indicated by using a higher-layer signaling, such as MAC layer signaling or radio resource control (RRC) layer signaling.

[00107] Optionally, in some embodiments, the scheduling rule may include only the quantity T of transport blocks in a scheduling time. Furthermore, S may be exactly divided by the quantity T of transport blocks in a scheduling time. In this case, the mapping relation, between the T transport blocks and the S minimum scheduling time units, in a scheduling time, is: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; or each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S.Furthermore, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, and includes: a tth transport block in the T transport blocks, which is mapped from a ((t-1)xSt+1)th minimum scheduling time unit to a (St+1)th minimum scheduling time unit in the S minimum scheduling time units, where t = 1, ..., or T, St = S / T, ex is a multiplication sign.

[00108] For example, consider that the minimum number of scheduling time units in a scheduling time is 4. If the desired scheduling rule includes that Petition 870250017021, dated 28 / 02 / 2025, p. 53 / 215 46 / 90 If the number of transport blocks in a scheduling time is 2, the first transport block, in the two transport blocks, is mapped to a first minimum scheduling time unit and a second minimum scheduling time unit, and the second transport block, in the two transport blocks, is mapped to a third minimum scheduling time unit and a fourth minimum scheduling time unit. If the desired scheduling rule, determined by the terminal device, includes that the number of transport blocks in a scheduling time is 4, the terminal device can determine that the four transport blocks are respectively mapped to the four minimum scheduling time units.

[00109] The network-side device can store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. In this way, the network-side device can determine, based on the number of transport blocks in a scheduling time that is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, which is stored, predefined, or generated by the network-side device, a minimum scheduling time unit in which each transport block is mapped.

[00110] Similarly, the terminal device can also store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. The terminal device can determine, based on the number of transport blocks in a scheduling time, which is included in the scheduling rule. Petition 870250017021, dated 28 / 02 / 2025, page 54 / 215 47 / 90 desired, and in the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, which is stored, predefined or generated by the terminal device, a minimum scheduling time unit in which each transport block is mapped.

[00111] Optionally, in some other embodiments, each of the N scheduling rules may include only the number of minimum scheduling time units in which a transport block is mapped to a scheduling time. Furthermore, the number of minimum scheduling time units in which a transport block is mapped to a scheduling time that is included in each scheduling rule may be divided exactly by S.In this case, the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, is: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; or each of the T transport blocks is mapped to the St units of consecutive minimum scheduling times in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S. Furthermore, each of the T transport blocks is mapped to the St units of consecutive minimum scheduling times in the S minimum scheduling time units, where S = St χ T, and St is a positive integer greater than 1 and less than S.Furthermore, each of the T transport blocks is mapped to the St consecutive minimum scheduling time units in the S minimum scheduling time units, and includes: a tth transport block in the T transport blocks, which is mapped from a ((tPetition 870250017021, dated 02 / 28 / 2025, page 55 / 215. 48 / 90 1)xSt+1)th minimum scaling time unit to a (txSt)th minimum scaling time unit in S minimum scaling time units, where t = 1, ..., or T, and St = S / T.

[00112] For example, consider that the number of minimum scheduling time units in a scheduling time is 4. If the desired scheduling rule includes that the number of minimum scheduling time units in which a transport block is mapped in a scheduling time is 2, the number of transport blocks in a scheduling time is 2, a first transport block, in the two transport blocks, is mapped in a first minimum scheduling time unit and a second minimum scheduling time unit, and a second transport block, in the two transport blocks, is mapped in a third minimum scheduling time unit and a fourth minimum scheduling time unit.If the desired scheduling rule specifies that the number of minimum scheduling time units in which a transport block is mapped, in a scheduling time, is 4, the number of transport blocks in a scheduling time is 1, and the terminal device can determine that a transport block is mapped separately in the four minimum scheduling time units.

[00113] The network-side device can store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. In this way, the network-side device can determine, based on the number of minimum scheduling time units into which a transport block is mapped in a scheduling time, which is included in the rule of Petition 870250017021, dated 28 / 02 / 2025, page 56 / 215 49 / 90 desired scheduling, and in the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, which is stored, predefined or generated by the network-side device, the number of transport blocks, in a scheduling time, and a minimum scheduling time unit, in which each transport block is mapped.

[00114] Similarly, the terminal device can also store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. The terminal device can determine, based on the number of minimum scheduling time units in which a transport block is mapped in a scheduling time, which is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, which is stored, predefined, or generated by the terminal device, the number of transport blocks in a scheduling time, and a minimum scheduling time unit, in which each transport block is mapped.

[00115] Optionally, in some embodiments, each of the N scheduling rules may include only the quantity T of transport blocks in a scheduling time. In these embodiments, S may or may not be exactly divided by the quantity T of transport blocks in a scheduling time. Furthermore, in these embodiments, the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, is as follows: each of the T transport blocks is mapped to a Petition 870250017021, dated 28 / 02 / 2025, page 57 / 215 50 / 90 of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; if S / T is a positive integer greater than 1 and less than S, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S; or if S / T is not a positive integer, a first transport block in the T transport blocks is mapped to the a+b minimum scheduling time units, and each of the T transport blocks, except the first transport block, is mapped to one of the minimum scheduling time units, where both a and b are positive integers, b is less than T, and S = a x T + b.

[00116] Furthermore, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, and includes: a tth transport block in the T transport blocks, which is mapped from a ((t-1)xSt+1)th minimum scheduling time unit to a (txSt)th minimum scheduling time unit in the S minimum scheduling time units, where t = 1, ..., or T, and St = S / T.

[00117] For example, consider that the minimum scheduling time unit quantity in a scheduling time is 4. If the desired scheduling rule includes that the quantity of transport blocks in a scheduling time is 2, a first transport block, in the two transport blocks, is mapped to a first minimum scheduling time unit and a second minimum scheduling time unit, and a second transport block, in the two transport blocks, is mapped to a third minimum scheduling time unit. Petition 870250017021, dated 28 / 02 / 2025, page 58 / 215 51 / 90 minimum scheduling and to a fourth minimum scheduling time unit. If the desired scheduling rule includes that the number of transport blocks, in a scheduling time, is 3, a first transport block, in the three transport blocks, is mapped to a first minimum scheduling time unit and a second minimum scheduling time unit, and a second transport block and a third transport block, in the three transport blocks, are respectively mapped to a third minimum scheduling time unit and a fourth minimum scheduling time unit.

[00118] The network-side device can store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. In this way, the network-side device can determine, based on the number of transport blocks in a scheduling time that is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, which is stored, predefined, or generated by the network-side device, a minimum scheduling time unit in which each transport block is mapped.

[00119] Similarly, the terminal device can also store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. The terminal device can determine, based on the number of transport blocks in a scheduling time, which is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units, in Petition 870250017021, dated 28 / 02 / 2025, page 59 / 215 52 / 90 is a scheduling time, which is stored, predefined, or generated by the terminal device, a minimum scheduling time unit in which each transport block is mapped.

[00120] Optionally, in some embodiments, each of the N scheduling rules may include only the quantity T of transport blocks in a scheduling time. In these embodiments, S may or may not be exactly divided by the quantity T of transport blocks in a scheduling time. Furthermore, in these embodiments, the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, is as follows: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; if S / T is a positive integer greater than 1 and less than S, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, where S = St x T, and St is an integer greater than 1 and less than S;Or if S / T is not a positive integer, a Tth transport block in the T transport blocks is mapped to the a+b minimum scheduling time units, and each of the T transport blocks, except the Tth transport block, is mapped to one of the minimum scheduling time units, where both a and b are positive integers, b is less than T, and S = a x T + b.

[00121] Furthermore, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, and includes: a tth transport block in the T transport blocks, which is mapped from a ((t-1)xSt+1)th time unit of Petition 870250017021, dated 28 / 02 / 2025, p. 60 / 215 53 / 90 minimum scaling in a (txSt)th minimum scaling time unit in S minimum scaling time units, where t = 1, ..., or T, and St = S / T.

[00122] For example, consider that the number of minimum scheduling time units in a scheduling time is 4. If the desired scheduling rule includes that the number of transport blocks in a scheduling time is 2, a first transport block, in the two transport blocks, is mapped to a first minimum scheduling time unit and a second minimum scheduling time unit, and a second transport block, in the two transport blocks, is mapped to a third minimum scheduling time unit and a fourth minimum scheduling time unit.If the desired scheduling rule specifies that the number of transport blocks in a given scheduling time is 3, then a third transport block, within the three transport blocks, is mapped to a third minimum scheduling time unit and a fourth minimum scheduling time unit, and a first transport block and a second transport block, within the three transport blocks, are respectively mapped to a first minimum scheduling time unit and a second minimum scheduling time unit.

[00123] The network-side device can store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. In this way, the network-side device can determine, based on the number of transport blocks in a scheduling time, which is included in the desired scheduling rule, and the mapping relationship between the T blocks of Petition 870250017021, dated 28 / 02 / 2025, page 61 / 215 54 / 90 transport and the S minimum scheduling time units, in a scheduling time, which is stored, predefined or generated by the network-side device, a minimum scheduling time unit in which each transport block is mapped.

[00124] Similarly, the terminal device can also store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time. The terminal device can determine, based on the number of transport blocks in a scheduling time that is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, which is stored, predefined, or generated by the terminal device, a minimum scheduling time unit in which each transport block is mapped.

[00125] Optionally, in some embodiments, each of the N scheduling rules may include only the quantity T of transport blocks in a scheduling time. In these embodiments, S may or may not be exactly divided by the quantity T of transport blocks in a scheduling time. In these embodiments, the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, is as follows: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; if S / T is a positive integer greater than 1 and less than S, each of the T transport blocks is mapped to the consecutive St minimum scheduling time units in the S minimum scheduling time units, where S = St x T, and Petition 870250017021, dated 28 / 02 / 2025, page 62 / 215 55 / 90 St is an integer greater than 1 and less than S; or if S / T is not a positive integer, a first transport block, in the T transport blocks, is mapped to the a+b minimum scheduling time units, a Tth transport block, in the T transport blocks, is mapped to the a+c minimum scheduling time units, and each of the T transport blocks, except the first transport block, is mapped to one of the minimum scheduling time units, where a, b, and c are all positive integers, b+c is less than T, and S = axT + b + c. Furthermore, if (S-axT) can be divided exactly by 2, b is equal to c. If (S-axT) cannot be divided exactly by 2, the pre-established rule may also include b + c + 1, or the pre-established scheduling rule may also include c = b + 1.

[00126] For example, consider that the number of minimum scheduling time units in a scheduling time is 8. If the desired scheduling rule includes that the number of transport blocks in a scheduling time is 4, each of the four transport blocks is mapped to two minimum scheduling time units.If the desired scheduling rule specifies that the number of transport blocks in a given scheduling time is 3, then the first transport block, within the three transport blocks, is mapped to a first minimum scheduling time unit and a third minimum scheduling time unit; the second transport block, within the three transport blocks, is mapped to a fourth minimum scheduling time unit and a fifth minimum scheduling time unit; and the third transport block, within the three transport blocks, is mapped to a sixth minimum scheduling time unit and an eighth minimum scheduling time unit. The rule is considered to be... Petition 870250017021, dated 28 / 02 / 2025, page 63 / 215 56 / 90 The pre-established scheduling rule includes: if (S-axT) cannot be divided exactly by 2, b = c + 1. If the desired scheduling rule includes that the number of transport blocks, in a scheduling time, is 5, a first transport block, in the five transport blocks, is mapped to a first minimum scheduling time unit and a third minimum scheduling time unit, a second transport block to a fourth transport block, in the five transport blocks, are respectively mapped to a fourth minimum scheduling time unit and a sixth minimum scheduling time unit, and a fifth transport block, in the five transport blocks, is mapped to a seventh minimum scheduling time unit and an eighth minimum scheduling time unit. The pre-established rule is considered to include: if (S-axT) cannot be divided exactly by 2, c + b + 1.In this case, a first transport block, in the five transport blocks, is mapped to a first minimum scheduling time unit and a second minimum scheduling time unit; a second transport block, in the five transport blocks, is mapped separately to a second minimum scheduling time unit and a fifth minimum scheduling time unit; and a fifth transport block, in the five transport blocks, is mapped to a sixth minimum scheduling time unit and an eighth minimum scheduling time unit.

[00127] The network-side device can store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. In this way, the network-side device can determine, based on the number of transport blocks in a Petition 870250017021, dated 28 / 02 / 2025, p. 64 / 215 57 / 90 scheduling time, which is included in the desired scheduling rule, and in the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, which is stored, predefined or generated by the network-side device, a minimum scheduling time unit in which each transport block is mapped.

[00128] Similarly, the terminal device may also store, predefine or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time.The terminal device can determine, based on the number of transport blocks in a scheduling time that is included in the desired scheduling rule, and the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time that is stored, predefined, or generated by the terminal device, a minimum scheduling time unit in which each transport block is mapped.

[00129] Although the scheduling rule in the preceding embodiments may include only the quantity T of transport blocks in a scheduling time, or the quantity of minimum scheduling time units in which a transport block is mapped in a scheduling time, the scheduling rule may include the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time. It should be understood that when the scheduling rule includes the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, the terminal device and the network-side device may pre-store or predefine the mapping relationship between the T transport blocks and Petition 870250017021, dated 28 / 02 / 2025, page 65 / 215 58 / 90 as S minimum scheduling time units in a scheduling time, or it may not store or predefine the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time.

[00130] Furthermore, in some embodiments, each of the N scheduling rules may alternatively include only the mapping relation between the T transport blocks and the S minimum scheduling time units in a scheduling time.In this case, the terminal device can directly determine the mapping relationship between the T transport blocks and the S minimum scheduling time units, according to the desired transmission rule, without the need to store, predefine, or generate the mapping relationship between the T transport blocks and the S minimum scheduling time units, and determine, based on the number of transport blocks in a scheduling time and / or the number of minimum scheduling time units in which a transport block is mapped, in a scheduling time, which is or are included in the desired scheduling rule, a minimum scheduling time unit in which each transport block is mapped.

[00131] Optionally, in some other embodiments, the quantities of minimum scheduling time units in which the transport blocks are mapped may be equal or different, and a minimum scheduling time unit in which each transport block is mapped may be determined as necessary. In this case, the scheduling rule includes the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time.

[00132] For example, Table 13 shows another rule of Petition 870250017021, dated 28 / 02 / 2025, page 66 / 215 59 / 90 scaling. It is considered that a minimum number of scaling time units, in a scaling time, is 4 in Table 13. Table 13 Scheduling rule sequence number | Number of transport blocks | Mapping relationship between a transport block and a minimum scheduling time unit | 1 | 1 Ti~(Si, S2, S3, S4) | 2 | 2 Ti~(Si, S2), T2~(S3, S4) | 3 | 2 T1~(S1), T2~(S2, S3, S4) | 4 | 2 Ti~(Si, S2, S3), T2~(S4) | 5 | 3 Ti~(Si), T2~(S2), T3 (S3, S4) | 6 | 3 Ti~(Si), T2~(S2, S3), T3 (S4) | 7 | 3 Ti~(Si, S2), T2~(S3), T3 (S4) | 8 | 4 Ti~(Si), T2~(S2), T3 (S3), T4 (S4)

[00133] As shown in Table 13, when the number of transport blocks is 2, a transport block can be mapped to two minimum scheduling time units, or it can be mapped to three minimum scheduling time units, or one minimum scheduling time unit.

[00134] In this case, the scheduling rule may include the quantity T of transport blocks, in a scheduling time, and the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time, or it may include only the mapping relationship between the T transport blocks and the S minimum scheduling time units, in a scheduling time.

[00135] Optionally, in some embodiments, if the scheduling rule includes one or more pieces of information in Petition 870250017021, dated 28 / 02 / 2025, page 67 / 215 60 / 90 quantity T of transport blocks in a scheduling time, the quantity of minimum scheduling time units in which a transport block is mapped in a scheduling time, and the mapping ratio between T transport blocks and S minimum scheduling time units in a scheduling time, the desired scheduling rule indications information may include all the information included in the desired scheduling rule.

[00136] Specifically, the terminal device and the network-side device can store, predefine, or generate N scheduling rules, and each scheduling rule has a corresponding scheduling rule sequence number. In this case, the network-side device only needs to indicate a scheduling rule sequence number of the desired scheduling rule to the terminal device, and the terminal device can determine the specific scheduling rule information based on the scheduling rule sequence number. It should be understood that the network-side device and the terminal device store, predefine, or generate the same correspondence between a scheduling rule sequence number and a scheduling rule.

[00137] For example, using Table 13 as an example, both the end device and the network-side device can store, preset, or generate the correspondence between a scheduling rule sequence number and a scheduling rule shown in Table 13. The desired scheduling rule indication information only needs to indicate the scheduling rule sequence number corresponding to the desired scheduling rule.

[00138] Optionally, in some other embodiments, if the Petition 870250017021, dated 28 / 02 / 2025, page 68 / 215 61 / 90 scheduling rule include at least two pieces of information: the quantity T of transport blocks in a scheduling time, the quantity of minimum scheduling time units in which a transport block is mapped in a scheduling time, and the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time. The desired scheduling rule indications information may separately indicate at least the two pieces of information.

[00139] For example, the network-side device can indicate a transport block quantity in a scheduling time by using control information (i.e., a subcarrier spacing, a number of symbols occupied by each minimum scheduling time unit, a DCI format, an MCS, a cyclic redundancy check code, and a quantity of allocated transport blocks), and then indicate a mapping relationship between a transport block and a minimum scheduling time unit by using another field. For example, the network-side device can add some fields dedicated to control signaling to indicate the mapping relationship between a transport block and a minimum scheduling time unit. The network-side device can further indicate the mapping relationship between a transport block and a minimum scheduling time unit by using some redundant fields in the control signaling.

[00140] Using DCI as an example, in some domains in DCI, each transport block has a corresponding field. Consider that the number of scalable transport blocks in a given scheduling time is X, and the number of scheduled transport blocks in the scheduling rule is X. Petition 870250017021, dated 28 / 02 / 2025, page 69 / 215 If the desired 62 / 90 is Y (X is greater than Y, and both X and Y are positive integers), the fields corresponding to the XY transport blocks are redundant fields. In this case, the fields corresponding to the XY transport blocks can be used to indicate the desired scheduling rule. Furthermore, it should be understood that when the number of available transport blocks equals the number of transport blocks in the desired scheduling rule, there are no redundant transport blocks. In this case, there may be a default mapping relationship between a transport block and a minimum scheduling time unit. If the number of transport blocks in the desired scheduling rule equals the number of available transport blocks, the mapping relationship between a transport block and a minimum scheduling time unit is the default mapping relationship.

[00141] The maximum number of scalable transport blocks in a scheduling time is considered to be 4. If the number of scheduled transport blocks in a scheduling time is 2, the fields corresponding to the two remaining unscheduled transport blocks can be used to indicate the mapping relationship between a transport block and a minimum scheduling time unit. If the number of transport blocks in a scheduling time in the desired scheduling rule is 4, it can be determined that the mapping relationship between a transport block and a minimum scheduling time unit is the default mapping relationship; to be specific, a transport block is mapped to a minimum scheduling time unit.

[00142] Optionally, in some embodiments, a number of scaling units, in which each block of Petition 870250017021, dated 28 / 02 / 2025, page 70 / 215 63 / 90 transport is mapped, and can be related to an attribute of the transport block. The transport block attribute determines whether the transport block is an initially transmitted transport block or a retransmitted transport block. Flexible time-domain resource allocation for each transport block can allow each transport block to achieve a performance gain based on the amount of scaling resources required.

[00143] Optionally, in some embodiments, a scheduling rule for a retransmitted transport block is: each retransmitted transport block is mapped to a minimum scheduling time unit. Each initially transmitted transport block can be mapped to one or more minimum scheduling time units. Furthermore, the T transport blocks can include no more than one initially transmitted transport block. In this way, using fewer resources in retransmission can avoid loss to achieve a gain in throughput and a gain in spectral efficiency.

[00144] All transport blocks are considered retransmitted transport blocks, and each transport block is mapped to a minimum scheduling time unit. The T transport blocks are considered to include an initially transmitted transport block and T-1 transmitted transport blocks (T is not equal to 1), and the T-1 transport blocks are in a one-to-one correspondence with the first T-1 minimum scheduling time units in the S minimum scheduling time units, that is, a tth retransmitted transport block in the T-1 retransmitted transport blocks is mapped to a tth minimum scheduling time unit in the S minimum scheduling time units, where t = 1, ..., or T1. The initially transmitted transport block is mapped to a Petition 870250017021, dated 28 / 02 / 2025, p. 71 / 215 64 / 90 remaining transport block in S minimum scheduling time units. If the T transport blocks do not include a retransmitted transport block, T equals 1, and the T transport blocks are mapped to the S transport blocks.

[00145] For example, if T = 1 and S = 4, the T transport blocks may include an initially transmitted transport block, and the initially transmitted transport block is mapped onto the S minimum scheduling time units.

[00146] For another example, if T = 2 and S = 4, the T transport blocks may include an initially transmitted transport block and a retransmitted transport block. The retransmitted transport block is mapped to a first minimum scheduling time unit in the S minimum scheduling time units, and the initially transmitted transport block is mapped to a second minimum scheduling time unit and a fourth minimum scheduling time unit in the S minimum scheduling time units.

[00147] For another example, if T = 3 and S = 4, the T transport blocks may include an initially transmitted transport block and a retransmitted transport block. The retransmitted transport block is mapped to a first minimum scheduling time unit in the S minimum scheduling time units, and the initially transmitted transport block is mapped to a second minimum scheduling time unit and a fourth minimum scheduling time unit in the S minimum scheduling time units.

[00148] For another example, if T = 3 and S = 4, the T transport blocks may include a transmitted transport block. Petition 870250017021, dated 28 / 02 / 2025, page 72 / 215 65 / 90 initially and three retransmitted transport blocks, or the T transport blocks may include four retransmitted transport blocks. If the T transport blocks include one initially transmitted transport block and three retransmitted transport blocks, a first retransmitted transport block is mapped to a first minimum scheduling time unit in the S minimum scheduling time units, a second retransmitted transport block is mapped to a second minimum scheduling time unit in the S minimum scheduling time units, a third retransmitted transport block is mapped to a third minimum scheduling time unit in the S minimum scheduling time units, and the initially transmitted transport block is mapped to a fourth minimum scheduling time unit in the S minimum scheduling time units.If the T transport blocks include four retransmitted transport blocks, a first retransmitted transport block is mapped to a first minimum scheduling time unit in the S minimum scheduling time units, a second retransmitted transport block is mapped to a second minimum scheduling time unit in the S minimum scheduling time units, a third retransmitted transport block is mapped to a third minimum scheduling time unit in the S minimum scheduling time units, and a fourth retransmitted transport block is mapped to a fourth minimum scheduling time unit in the S minimum scheduling time units.

[00149] The network-side device can use a field corresponding to each transport block to indicate an attribute of the transport block to the terminal device. The terminal device can determine the mapping relationship between a transport block and Petition 870250017021, dated 28 / 02 / 2025, page 73 / 215 66 / 90 is a minimum scheduling time unit based on the transport block attribute. Specifically, DCIs can have T NDI bits, and each bit is used to indicate whether a transport block is a retransmitted transport block. For example, when a bit value is 1 or 0, or when a bit inversion occurs (this depends on the protocol, and in the following example, bit value 1 is considered to represent initial transmission, and bit value 0 represents retransmission), this indicates that a corresponding transport block is an initially transmitted transport block; otherwise, this indicates that a corresponding transport block is a retransmitted transport block. The terminal device can determine an attribute of each transport block based on the T bits, and determine, based on the attribute of each transport block, a minimum scheduling time unit to which each transport block is mapped.

[00150] For example, T = 4 and T bits are 001x, where x represents the bit value which can be 1 or 0. After reading the T bits, the terminal device can determine that a first transport block and a second transport block, in the four transport blocks, are retransmitted transport blocks, and a third transport block is an initially transmitted transport block. In this case, the terminal device can determine that the first two minimum scheduling time units, in the S minimum scheduling time units, are minimum scheduling time units in which the two retransmitted transport blocks are mapped, and a remaining minimum scheduling time unit in the S minimum scheduling time units is a minimum scheduling time unit in which the initially transmitted transport block is mapped. Petition 870250017021, dated 28 / 02 / 2025, page 74 / 215 67 / 90

[00151] Figure 2 is a schematic diagram of a scheduling rule change in a transmission process. Figure 2 shows six consecutive scheduling times. S1 to S24 shown in Figure 2 represent 24 minimum scheduling time units. The number of minimum scheduling time units in a scheduling time in Figure 2 is 4. In the six consecutive scheduling times, a transport or process block in the first five scheduling times is an initially transmitted transport block, and the number of transport blocks in each scheduling time is 1, which is defined as scheduling rule 1 in Table 1 (or scheduling rule 4 in Table 2).Specifically, a process 0 is mapped to minimum scheduling time units S1 to S4, a process 1 is mapped to minimum scheduling time units S5 to S8, a process 2 is mapped to minimum scheduling time units S9 to S12, a process 3 is mapped to minimum scheduling time units S13 to S16, and a process 4 is mapped to minimum scheduling time units S17 to S20, where each of the processes 0 to 4 is an initially transmitted transport block. After receiving a negative acknowledgment (NACK) indication sent by a receiving end device, a transmitting end device determines that a process or transport block needs to be retransmitted.As shown in Figure 2, the four transport blocks are scheduled in a sixth scheduling time, which is defined as scheduling rule 3 in Table 1 (or scheduling rule 1 in Table 2). The four transport blocks can be four retransmission processes (or referred to as retransmitted transport blocks), and the data. Petition 870250017021, dated 28 / 02 / 2025, p. 75 / 215 68 / 90 of the four retransmission processes are respectively mapped to four minimum scheduling time units. In other words, each process or transport block in the four retransmission processes, at the sixth scheduling time, is mapped to only one minimum scheduling time unit. Certainly, in some other embodiments, the four transport blocks, at the sixth scheduling time, may alternatively include one retransmitted transport block and one initially transmitted transport block. For example, one retransmitted transport block is mapped to a minimum scheduling time unit S21, and three initially transmitted transport blocks are respectively mapped to minimum scheduling time units S22 to S24. In some other embodiments, all four transport blocks, at the sixth scheduling time, may be initially transmitted transport blocks.In some other embodiments, they may be a transport block retransmitted in the first five scheduling times. It should be noted that the number of minimum scheduling time units, in each scheduling time, may change dynamically, and is not limited to 4.

[00152] Figure 3 is another schematic diagram of a scheduling rule change in a transmission process. Figure 6 shows six consecutive scheduling times. S1 to S24, shown in Figure 3, represent 24 minimum scheduling time units. The number of minimum scheduling time units in a scheduling time in Figure 3 is 4. In the six consecutive scheduling times, a transport block in the first of the 5 scheduling times is a transport block initially transmitted, and a number of blocks of Petition 870250017021, dated 28 / 02 / 2025, page 76 / 215 69 / 90 transport in each scheduling time is 1, which is defined as scheduling rule 1 in Table 1 (or scheduling rule 8 in Table 13). Specifically, a process 0 is mapped to minimum scheduling time units S1 to S4, a process 1 is mapped to minimum scheduling time units S5 to S8, a process 2 is mapped to minimum scheduling time units S9 to S12, a process 3 is mapped to minimum scheduling time units S13 to S16, and a process 4 is mapped to minimum scheduling time units S17 to S20, where each from process 0 to process 4 is an initially transmitted transport block. After receiving a NACK indication, sent by a receiving end device, a transmitting end device determines that a process or transport block needs to be retransmitted.In this case, two transport blocks are scheduled in a sixth scheduling time, which is defined as scheduling rule 3 in Table 13. The two transport blocks may be retransmission processes (or referred to as retransmitted transport blocks). A first retransmission process, in the two retransmission processes, is mapped to a minimum scheduling time unit S21, and the other retransmission process is mapped to three minimum scheduling time units S22 to S24. Certainly, in some other embodiments, the two transport blocks, in the sixth scheduling time, may alternatively include a retransmitted transport block and an initially transmitted transport block. For example, a retransmitted transport block is mapped to the minimum scheduling time unit S21, and an initially transmitted transport block is mapped to the minimum scheduling time units S22 to S24. In some others... Petition 870250017021, dated 28 / 02 / 2025, page 77 / 215 In 70 / 90 implementations, both transport blocks, at the sixth scheduling time, may be initially transmitted transport blocks. In some other implementations, there may be a retransmitted transport block in the first five scheduling times. It should be noted that the number of minimum scheduling time units, at each scheduling time, may change dynamically, and is not limited to 4.

[00153] Optionally, in some other embodiments, a mapping rule for a retransmitted transport block is: the number of minimum scheduling time units to which a retransmitted transport block can be mapped is greater than the number of minimum scheduling time units to which an initially transmitted transport block is mapped. In this way, communication latency can be reduced, and communication security can be guaranteed, so that a transport block can be successfully decoded as soon as possible.

[00154] Optionally, in some other embodiments, a mapping rule for a retransmitted transport block is: the number of minimum scheduling time units to which a retransmitted transport block can be mapped is equal to the number of minimum scheduling time units to which an initially transmitted transport block is mapped.

[00155] A network-side device can support three preceding mapping rules for retransmitted transport blocks, and perform switching between two mapping rules if necessary. In the preceding technical solution, the number of minimum scheduling time units in which a retransmitted transport block is mapped, and the number of minimum scheduling time units in which a transmitted transport block is mapped. Petition 870250017021, dated 28 / 02 / 2025, page 78 / 215 71 / 90 is initially mapped, and can be adjusted if necessary, so that a performance gain can be achieved.

[00156] In all previous embodiments, an example in which a minimum scaling time unit carries data from no more than one transport block is used. Considering a 5G bandwidth (such as equal to or greater than 80 MHz) and a limitation of a sampling quantity (such as 2,048) in fast Fourier transform, in this patent application, data from multiple transport blocks can also be transported in a minimum scaling time unit, to implement high broadband communication. The data from a transport block can be transported in one or more sub-bands. Similarly, multiple transport blocks are scaled by using a portion of the DCI, so that signaling headers can be reduced. For example, some domains can be shared by all transport blocks, and some domains can be specific to transport blocks.For example, an NDI domain can be a specific domain for each transport block. For another example, an MCS can be a value. For each transport block, a transport block MCS value is determined based on the MCS and an offset transport block MCS value. In view of the above, a quantity T of transport blocks, in a given scheduling time, can be greater than a minimum scheduling time unit, thus reducing the control headers.

[00157] Figure 4 is a schematic diagram in which several transport blocks, in a scheduling time, are mapped to a minimum scheduling time unit. As shown in Figure 4, a minimum scheduling time unit S1 and Petition 870250017021, dated 28 / 02 / 2025, page 79 / 215 72 / 90 four transport blocks are included in a scaling time. The four transport blocks, in a scaling time, are respectively mapped to four frequency domain features of the minimum scaling time unit in the frequency domain. The four frequency domain features may be consecutive or not, and the four frequency domain features may have different sizes.

[00158] Figure 5 is another schematic diagram in which several transport blocks, in a scheduling time, are mapped to a minimum scheduling time unit. As shown in Figure 5, a minimum scheduling time unit S1 and two transport blocks are included in a scheduling time. Each of the two transport blocks, in a scheduling time, is mapped to two frequency domain features of the minimum scheduling time unit in the frequency domain. The four frequency domain features may be consecutive or not, and the four frequency domain features may have the same size or may have different sizes.

[00159] For ease of description, a case in which a minimum scheduling time unit carries data from no more than one transport block is referred to as time-division multiplexing below; to be specific, all preceding embodiments are time-division multiplexing scenarios. A case in which a minimum scheduling time unit carries data from two or more transport blocks is referred to as frequency-division multiplexing. A specific embodiment of frequency-division multiplexing is similar to the preceding embodiment of time-division multiplexing, and the details are not described again in this case. Petition 870250017021, dated 28 / 02 / 2025, page 80 / 215 73 / 90

[00160] To facilitate understanding of the difference between frequency division multiplexing and time division multiplexing, time division multiplexing is described below with reference to Figures 6 and 7.

[00161] Figure 6 is a schematic diagram in which several transport blocks, in a scheduling time, are mapped to several minimum scheduling time units. As shown in Figure 6, four minimum scheduling time units S1 to S4 and four transport blocks are included in a scheduling time, and the four transport blocks are respectively mapped to the four minimum scheduling time units.

[00162] Figure 7 is another schematic diagram, in which several transport blocks, in a scheduling time, are mapped to the various minimum scheduling time units. As shown in Figure 7, four minimum scheduling time units S1 to S4 and two transport blocks are included in a scheduling time. The two transport blocks are mapped to the four minimum scheduling time units. Specifically, a first transport block, in the two transport blocks, is mapped to the minimum scheduling time units S1 and S2, and a second transport block, in the two transport blocks, is mapped to the minimum scheduling time units S3 and S4.

[00163] In some embodiments, time-division multiplexing can be combined with frequency-division multiplexing.

[00164] Figure 8 is a schematic diagram of a combination of time-division multiplexing and frequency-division multiplexing. As shown in Figure 8, two units Petition 870250017021, dated 28 / 02 / 2025, page 81 / 215 74 / 90 of minimum scheduling times S1 and S2 and two transport blocks are included in one scheduling time. The two transport blocks, in one scheduling time, are mapped separately to different frequency domains of the two minimum scheduling time units. It should be understood that in the embodiment shown in Figure 4, each of the two transport blocks, in one scheduling time, is mapped to the two minimum scheduling time units, in one scheduling time.

[00165] Figure 9 is a schematic diagram of a combination of time-division multiplexing and frequency-division multiplexing. As shown in Figure 9, three minimum scaling time units S1 to S3 and four transport blocks are included in one scaling time. A transport block 1 and a transport block 2, in the four transport blocks, are mapped separately to the different frequency domains of the minimum scaling time unit S1. A transport block 3 is mapped to the minimum scaling time units S2 and S3, and a frequency domain feature of a minimum scaling time unit, in which transport block 3 is mapped, is equal to a frequency domain feature of a minimum scaling time unit, in which transport block 1 is mapped.Similarly, a transport block 4 is mapped to the minimum scaling time units S2 and S3, and a frequency domain feature of a minimum scaling time unit, in which transport block 4 is mapped, is equal to a frequency domain feature of a minimum scaling time unit, in which transport block 2 is mapped. Furthermore, the two minimum scaling time units, in which... Petition 870250017021, dated 28 / 02 / 2025, page 82 / 215 The frequency domain features of the two minimum scheduling time units to which transport block 3 is mapped are the same as the two minimum scheduling time units to which transport block 4 is mapped. The frequency domain features of the two minimum scheduling time units to which transport block 3 is mapped are different from the frequency domain features of the two minimum scheduling time units to which transport block 4 is mapped.

[00166] Furthermore, in the combination of frequency division multiplexing and time division multiplexing, a mapping relationship, between the T transport blocks and the S minimum scheduling time units, in a scheduling time, in each frequency domain feature, is equal to a mapping relationship, between the T transport blocks and a minimum scheduling time unit, in a scheduling time, in a time division multiplexing scenario, and the details will not be described in this case.

[00167] Optionally, in some other embodiments, a time-division multiplexing method may be used for an initially transmitted transport block, and a frequency-division multiplexing method may be used for a retransmitted transport block.

[00168] Figure 10 is a schematic transmission diagram of an initially transmitted transport block and a transport block retransmitted by frequency division multiplexing. S1 to S6 in Figure 10 represent six minimum scheduling time units. As shown in Figure 10, in the six consecutive scheduling times, a transport block, in the first five scheduling times, is an initially transmitted transport block, and each transport block is mapped to a minimum scheduling time unit, which can be Petition 870250017021, dated 28 / 02 / 2025, page 83 / 215 76 / 90 is defined as a scheduling rule 1. Specifically, a process 0 is mapped to a minimum scheduling time unit S1, a process 1 is mapped to a minimum scheduling time unit S2, a process 2 is mapped to a minimum scheduling time unit S3, a process 3 is mapped to a minimum scheduling time unit S4, and a process 4 is mapped to a minimum scheduling time unit S5, where each process 0 to process 4 is a transport block initially transmitted. After receiving a NACK indication, sent by a receiving end device, a transmitting end device determines that a process or transport block needs to be retransmitted. In this case, two transport blocks are scheduled in a sixth scheduling time, which is defined as a scheduling rule 2.The two transport blocks can be retransmission processes (or referred to as retransmitted transport blocks), and the two retransmission processes are mapped to a minimum scheduling time unit S6, in a frequency division multiplexing manner. Certainly, in some other embodiments, the two transport blocks, included in the sixth scheduling time, can be a retransmitted transport block and an initially transmitted transport block. The retransmitted transport block and the initially transmitted transport block are mapped to the minimum scheduling time unit S6, in a frequency division multiplexing manner. Alternatively, both transport blocks are initially transmitted transport blocks. In some other embodiments, there may be a retransmitted transport block in the first five scheduling times.It should be noted that a quantity of minimum scaling time units, in. Petition 870250017021, dated 28 / 02 / 2025, page 84 / 215 77 / 90 each scaling time, can change dynamically, and is not limited to 1.

[00169] For ease of description, in the embodiments in Figures 2 to 10, only a resource occupied by a transport block is shown, but a resource occupied by a control signal is not shown.

[00170] It should be noted that a non-spatial multiplexing scenario is considered in all embodiments of this descriptive report, to be specific, a quantity of transport blocks, in a scheduling time, is for a configuration scenario in which only data of a codeword or a transport block is transported in a time and frequency resource. In this scenario, multiple transport blocks, in a scheduling time, can be mapped to multiple minimum scheduling time units in a time-division multiplexing manner, or multiple transport blocks, in a scheduling time, can be mapped to one minimum scheduling time unit in a frequency-division multiplexing manner.

[00171] Furthermore, all preceding embodiments are embodiments in which a transmission mode, determined by a network-side device, is a non-spatial multiplexing transmission mode. In other words, the mapping relationship between the T transport blocks and the S minimum scheduling time units in a scheduling time, the amount of transport block in a scheduling time, and the like in the preceding embodiments are all for the non-spatial multiplexing scenario. The non-spatial multiplexing transmission mode is a transmission mode in which only data from a codeword or a transport block is Petition 870250017021, dated 28 / 02 / 2025, page 85 / 215 78 / 90 transported in a time and frequency resource.

[00172] When the transmission mode, determined by the network-side device, is a spatial multiplexing mode, the data of Nc codewords or Nc transport blocks are considered to be transported in a time and frequency resource, where Nc is a positive integer equal to or greater than 2 (in this case, the transmission mode scenario is referred to as an Nc codewords or Nc streams scenario in this patent application, where Nc is a quantity of codewords, a quantity of processes, or a quantity of transport blocks in spatial multiplexing in a time and frequency resource). In this case, a total quantity of transport blocks in a scheduling time is Nc x T, and a quantity of transport blocks in each of the Nc codewords or in each of the Nc streams in a scheduling time is T. Similarly, a quantity of minimum scheduling time units in a scheduling time in this scenario is S.

[00173] In the preceding spatial multiplexing scenario, a mapping relationship between NcxT transport blocks and S minimum scheduling time units, in a scheduling time, is a mapping relationship between T transport blocks, in each of the Nc codewords or in each of the Nc streams, and S minimum scheduling time units in a scheduling time. The mapping relationship between T transport blocks, in each codeword or in each stream, and S minimum scheduling time units, in a scheduling time, is equal to the mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time, in the non-spatial multiplexing scenario. In other words, the mapping relationship between T blocks of Petition 870250017021, dated 28 / 02 / 2025, page 86 / 215 79 / 90 transport and S minimum scheduling time units, in a scheduling time, in the non-spatial multiplexing scenario is the mapping relationship between T transport blocks, in each codeword or in each stream, and S minimum scheduling time units, in a scheduling time, in the spatial multiplexing scenario. The quantity T of transport blocks, in a scheduling time, in the non-spatial multiplexing scenario, is the quantity T of transport blocks, in each codeword or in each stream, in a scheduling time, in the spatial multiplexing scenario.Therefore, for a specific concretization of the mapping relationship between T transport blocks, in each codeword or in each stream, and S minimum scheduling time units, refer to the specific concretization of the mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time, in the non-spatial multiplexing scenario, in all preceding concretizations. The details are not, in this case, described again.

[00174] Furthermore, the mapping relationships between T transport blocks, in any two codewords or any two streams, and S minimum scheduling time units, in a scheduling time, are equal in the spatial multiplexing scenario.

[00175] A method for determining a desired scheduling rule and a method for indicating a desired scheduling rule in the spatial multiplexing scenario are the same as those in the non-spatial multiplexing scenario. For details, refer to the preceding embodiment. The details are not described again in this case.

[00176] In addition, in some embodiments, the DCIs sent by the network-side device to the endpoint device include a Petition 870250017021, dated 28 / 02 / 2025, page 87 / 215 80 / 90 transport block process domain, and the transport block process domain is used to indicate a process number for each transport block in the T transport blocks. A transport block process domain length is w bits, the w bits can indicate Tx2w process numbers, and T represents a quantity of transport blocks in a scheduling time.

[00177] For example, when a transport block is mapped to a minimum scheduling time unit, it is considered that there are four minimum scheduling time units in a scheduling time, and a feedback processing latency is also four minimum scheduling time units. In this case, eight processes are required. DCIs can include a process domain of one-bit transport blocks. The terminal device can determine a process number as follows: P_Num = ix T + j (formula 1.1)

[00178] P_Num represents the process number, i represents a value from the transport block domain, T represents the number of transport blocks in a scheduling time, j = 1, ..., or T, i = 0 in a first scheduling time, and i = 1 in a second scheduling time. Thus, the terminal device can determine a process number for each transport block in each scheduling time by using formula 1.1. In the preceding technical solution, when eight processes need to be indicated, the length of an indication field, which is used to indicate a process number, can be reduced from 3 bits to 1 bit, so that the DCI headers can be reduced.

[00179] The preceding concretizations are merely intended to help a person skilled in the art to understand. Petition 870250017021, dated 28 / 02 / 2025, page 88 / 215 81 / 90 improve the technical solutions in the embodiments of this patent application, but are not intended to limit the technical solutions in the embodiments of this patent application. In a specific implementation process, a number of processes, a frame format, a number of minimum scheduling time units in a scheduling time, a number of resources required by a retransmitted transport block and a number of resources required by an initially transmitted transport block, if frequency domain resources are consecutive, a number of frequency domain resources in each scheduling time, a number of layers, a number of code words, a number of layers in which a code word is mapped, a number of streams, an antenna configuration, a transmission mode and the like may vary. This is not limited in this descriptive report.

[00180] Furthermore, the scenario discussed in the preceding embodiments is one in which the network-side device communicates with the end device. The preceding technical solutions can also be applied to device-to-device (D2D) communication.

[00181] D2D communication includes D2D communication, which is controlled by the network-side device (referred to below as type 1 D2D communication), and D2D communication, which is not controlled by the network-side device (referred to below as type 2 D2D communication).

[00182] In a first-type D2D communication scenario, the network-side device may be responsible for determining a desired scheduling rule from N scheduling rules, and indicating the desired scheduling rule to an end device, Petition 870250017021, dated 28 / 02 / 2025, p. 89 / 215 82 / 90 that performs D2D communication. In the first type of D2D communication scenario, one way of determining the desired scheduling rule by the network-side device is the same as the way of determining the desired scheduling rule by the network-side device in the scenario where the network-side device communicates with the terminal device. In the first type of D2D communication scenario, one way of indicating the desired scheduling rule by the network-side device is the same as the way of indicating the desired scheduling rule by the network-side device in the scenario where the network-side device communicates with the terminal device. The details are not described again in this case. The terminal device, which performs D2D communication, can perform communication according to the desired scheduling rule indicated by the network-side device.

[00183] In a second-type D2D communication scenario, a terminal device performing D2D communication may include a primary terminal device. The primary terminal device is responsible for determining a desired scheduling rule from the N scheduling rules, and for indicating the desired scheduling rule to another device performing D2D communication. In the second-type D2D communication scenario, one way of determining the desired scheduling rule by the primary terminal device is the same as the way of determining the desired scheduling rule by the network-side device, in the scenario where the network-side device communicates with the terminal device. In the second-type D2D communication scenario, one way of indicating the desired scheduling rule by the network-side device is the same as the way of indicating the desired scheduling rule by the network-side device. Petition 870250017021, dated 28 / 02 / 2025, pp. 90 / 215 83 / 90 network-side device, in the scenario where the network-side device communicates with the terminal device. The details are not described again in this case. The terminal device, which performs D2D communication, can perform communication according to the desired scheduling rule indicated by the network-side device.

[00184] Figure 11 is a structural block diagram of a network-side device, according to an embodiment of this patent application. As shown in Figure 11, a network-side device 1100 includes a processing unit 1101 and a communications unit 1102.

[00185] Processing unit 1101 is configured to: when a quantity of minimum scheduling time units, in a scheduling time, executed by network-side device 1100, is S, and network-side device 1100 and a terminal device transmit data in a first transmission mode, determine a desired scheduling rule from N scheduling rules, wherein the scheduling rule includes at least one of a quantity T of transport blocks, in a scheduling time, and a mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time, N is an integer equal to or greater than 2, T is an integer equal to or greater than 1, S is an integer equal to or greater than 1, and the first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme.

[00186] Communications unit 1102 is configured to communicate with the terminal device according to the desired scheduling rule.

[00187] For the operations and functions of processing unit 1101 and communications unit 1102 of Petition 870250017021, dated 28 / 02 / 2025, page 91 / 215 84 / 90 network-side device 1100, refer to the descriptions in the preceding method. To avoid repetition, the details are not described again in this case.

[00188] The processing unit 1101 can be implemented by a processor, and the communications unit 1102 can be implemented by a transceiver.

[00189] Figure 12 is a structural block diagram of a terminal device, according to an embodiment of this patent application. As shown in Figure 12, a terminal device 1200 includes a processing unit 1201 and a communications unit 1202.

[00190] Processing unit 1201 is configured to: when the terminal device and a network-side device 1200 transmit data in a first transmission mode, and a quantity of minimum scheduling time units, in a scheduling time, executed by the network-side device, is S, determine, by the terminal device, a desired scheduling rule, wherein the desired scheduling rule is one of N scheduling rules, the scheduling rule includes at least one of a quantity T of transport blocks, in a scheduling time, and a mapping relationship between T transport blocks and S minimum scheduling time units, in a scheduling time, N is a positive integer equal to or greater than 2, T is a positive integer equal to or greater than 1, S is a positive integer equal to or greater than 1,The first mode of transmission is either a single-antenna transmission scheme or a multiple-antenna transmission scheme.

[00191] Communications unit 1202 is configured to communicate with the network-side device according to the desired scheduling rule. Petition 870250017021, dated 28 / 02 / 2025, page 92 / 215 85 / 90

[00192] For operations and functions of processing unit 1201 and communications unit 1202 of terminal device 1200, refer to the descriptions in the preceding method. To avoid repetition, the details are not described again in this case.

[00193] The processing unit 1201 can be implemented by a processor, and the communications unit 1202 can be implemented by a transceiver.

[00194] Figure 13 is a structural block diagram of a network-side device according to an embodiment of this patent application. As shown in Figure 13, a network-side device 1300 includes a processor 1301, a memory 1302, and a transceiver 1303.

[00195] The components in the 1300 network-side device communicate with each other by using an internal connection path, to transmit a control signal and / or a data signal.

[00196] The methods described in the embodiments of this patent application can be applied to, or implemented by, the 1301 processor. The 1301 processor can be an integrated circuit chip and has a signal processing capability. In one implementation process, the steps of the preceding methods can be completed by using a hardware integrated logic circuit in the 1301 processor or by using a software instruction. The 1301 processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FGPA), another programmable logic device, a discrete gate, a transistor logic device, or a discrete hardware component. The 1301 processor can implement or execute the Petition 870250017021, dated 28 / 02 / 2025, p. 93 / 215 86 / 90 methods, steps, and logical block diagrams, which are described in the embodiments of this patent application. The general-purpose processor may be a microprocessor, or the processor may be any conventional or similar processor. The steps of the methods, described with reference to the embodiments of this patent application, may be directly executed and completed by a hardware decoding processor, or may be executed and completed by using a combination of hardware, in a decoding processor and software module. The software module may be located in a storage medium mature in the art, such as random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory, electrically erasable programmable memory, or a register. The storage medium is located in memory 1302.Processor 1301 reads an instruction from memory 1302 and completes, in combination with hardware in transceiver 1303, each step performed by the network-side device in the preceding method.

[00197] It should be understood that in addition to processor 1301, memory 1302, and transceiver 1303, shown in Figure 13, network-side device 1300 includes some necessary apparatus, such as an antenna, a cyclic prefix remover, and a fast Fourier transform processor. To avoid redundancy, the preceding apparatus are not shown in Figure 13.

[00198] Figure 14 is a structural block diagram of a terminal device according to an embodiment of this patent application. As shown in Figure 14, a terminal device 1400 includes a processor 1401, a memory 1420, and a transceiver. Petition 870250017021, dated 28 / 02 / 2025, page 94 / 215 87 / 90 1403.

[00199] The components in the 1400 terminal device communicate with each other by using an internal connection path, to transmit a control signal and / or a data signal.

[00200] The methods described in the embodiments of this patent application can be applied to, or implemented by, the 1401 processor. The 1401 processor can be an integrated circuit chip and has a signal processing capability. In one implementation process, the steps of the preceding methods can be completed by using a hardware integrated logic circuit in the 1401 processor or by using a software instruction. The 1401 processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FGPA), another programmable logic device, a discrete gate, a transistor logic device, or a discrete hardware component.The 1401 processor can implement or execute the methods, steps, and logical block diagrams described in the embodiments of this patent application. The general-purpose processor can be a microprocessor, or the processor can be any conventional or similar processor. The steps of the methods described with reference to the embodiments of this patent application can be directly executed and completed by a hardware decoding processor, or they can be executed and completed using a combination of hardware, in a decoding processor and a software module. The software module can be located in a storage medium mature in the art, such as random access memory (Random). Petition 870250017021, dated 28 / 02 / 2025, pp. 95 / 215 88 / 90 Access Memory (RAM), an instant memory, a read-only memory (ROM), a programmable read-only memory, an electrically erasable programmable memory, or a register. The storage medium is located in memory 1402. Processor 1401 reads an instruction from memory 1402 and completes, in combination with hardware in transceiver 1403, each step performed by the network-side device in the preceding method.

[00201] It should be understood that in addition to the processor 1401, the memory 1402 and the transceiver 1403, shown in Figure 14, the terminal device 1400 includes some necessary devices, such as an antenna, a monitor and an input device. To avoid redundancy, the preceding devices are not shown in Figure 14.

[00202] A person skilled in the art may be aware that, in combination with the examples described in the embodiments presented in this descriptive report, units and steps of algorithms can be implemented by electronic hardware or by a combination of computer software and computer hardware. Whether the functions are performed by hardware or software depends on particular applications and design limitations of the technical solutions. A person skilled in the art may use different methods to implement the described functions for each particular application, but it should be considered that the implementation may fall outside the scope of this patent application.

[00203] Those skilled in the art should clearly understand that, for the purpose of convenient and concise description, for a detailed working process of the preceding system, apparatus and unit, they should refer to a corresponding process in the embodiments of the preceding method, and the details are not Petition 870250017021, dated 28 / 02 / 2025, pp. 96 / 215 89 / 90 described, in this case, again.

[00204] In the various embodiments provided in this patent application, it should be understood that the system, apparatus, and method described may be implemented in other ways. For example, the apparatus embodiment described is merely an example. For example, the unit division is merely a logical function division, and may be another division in the actual implementation. For example, several units or components may be combined or integrated into another system, or some aspects may be ignored or not implemented. Furthermore, the mutual couplings or direct couplings or mutual or direct communication connections shown or discussed may be implemented by using some interfaces. Indirect couplings or communication connections between the apparatus or units may be implemented in electronic, mechanical, or other forms.

[00205] The units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one position, or may be distributed across multiple network units. Some or all of the units may be selected based on the actual requirements to achieve the objectives of the embodiments' solutions.

[00206] Furthermore, the functional units, in the embodiments of this patent application, may be integrated into a processing unit, or each of the units may exist physically on its own, or two or more units may be integrated into one unit.

[00207] When functions are implemented as a functional unit of software and sold or used as a standalone product, the functions can be stored in a medium of Petition 870250017021, dated 28 / 02 / 2025, page 97 / 215 90 / 90 computer-readable. Based on this understanding, the essential technical solutions for this patent application, or the part contributing to the prior art, or some of the technical solutions, can be implemented in the form of a software product. The computer software product is stored on a storage medium and includes various instructions to instruct a computer device (which may be a personal computer, a server, a network-side device, or the like) to execute all or some of the steps of the methods in the embodiments of this patent application. The preceding storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

[00208] The descriptions presented above are merely specific implementations of this patent application, but are not intended to limit the scope of protection of this patent application. Any variation or replacement easily devised by a person skilled in the art, within the technical scope described in this patent application, should fall within the scope of protection of this patent application. Therefore, the scope of protection of this patent application should remain the object for the scope of protection of the embodiments.

Claims

1. Communication method, characterized in that the method comprises: when a quantity of minimum scheduling time units in a scheduling time performed by a network-side device is S, and the network-side device and a terminal device transmit data in a first transmission mode, determining (101), by the network-side device, a target scheduling rule from N scheduling rules, wherein the scheduling rule comprises at least one of a quantity T of transport blocks in a scheduling time and a mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time, N is an integer equal to or greater than 2, T is an integer equal to or greater than 1, S is an integer equal to or greater than 1, and the first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme;and communicate (103), by the network-side device, with the terminal device according to the target scheduling rule, wherein the determination, by the network-side device, of a target scheduling rule from N scheduling rules comprises: determining, by the network-side device, based on a correspondence between parameter information and a scheduling rule, a scheduling rule corresponding to parameter information determined in the N scheduling rules as the target scheduling rule, wherein the parameter information comprises at least one of a subcarrier spacing used when the network-side device communicates with the terminal device and a number of symbols occupied by a minimum scheduling time unit that are used when the network-side device communicates with the terminal device.

2. A method according to claim 1, characterized in that the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time is: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; or each of the T transport blocks is mapped to consecutive St minimum scheduling time units in the S minimum scheduling time units, wherein S = St χ T, and St is an integer greater than 1 and less than S.

3. Method, according to claim 1, characterized in that the mapping relationship between T transport blocks and S minimum scheduling time units in a scheduling time is: a first transport block in the T transport blocks is mapped to a+b minimum scheduling time units, and each of the T transport blocks except the first transport block is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a χ T + b; or a Tth transport block in the T transport blocks is mapped to a+b minimum scheduling time units, and each of the T transport blocks except the Tth transport block is mapped to a minimum scheduling time unit, in Petition 870250017021, dated 28 / 02 / 2025, p. 100 / 215 3 / 7 where both a and b are positive integers, b is less than T, and S = a x T + b.

4. A method according to any one of claims 1 to 3, characterized in that, prior to communication by the network-side device with the terminal device according to the target scheduling rule, the method further comprises: sending, by the network-side device, target scheduling rule indication information to the terminal device, wherein the target scheduling rule indication information is used to indicate the target scheduling rule determined by the network-side device.

5. A method according to claim 4, characterized in that the target scheduling rule indication information comprises at least one of the following: a subcarrier spacing, a number of symbols occupied by a minimum scheduling time unit, a downlink control information format, a modulation and encoding scheme, a cyclic redundancy check code, and a number of allocated resource blocks.

6. Method, according to claim 4, characterized in that the information of target escalation rule indications is carried in control signaling.

7. Communication method, characterized in that the method comprises: when a terminal device and a network-side device transmit data in a first transmission mode, and a quantity of minimum scheduling time units in a scheduling time performed by the network-side device is S, determine (102), by the terminal device, a target scheduling rule, wherein the target scheduling rule is one among N scheduling rules, the scheduling rule comprises at least one among a quantity of T transport blocks in a scheduling time and a mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time, N is a positive integer equal to or greater than 2, T is a positive integer equal to or greater than 1, S is a positive integer equal to or greater than 1,and the first transmission mode is a single-antenna transmission scheme or a multi-antenna transmission scheme; and communicate (103), by the terminal device, with the network-side device according to the target scheduling rule; and, wherein the determination, by the terminal device, of a target scheduling rule comprises: determining, by the terminal device, that the target scheduling rule is a scheduling rule corresponding to parameter information used when the terminal device communicates with the network-side device, wherein the parameter information comprises at least one of a subcarrier spacing used when the network-side device communicates with the terminal device and a number of symbols occupied by each minimum scheduling time unit.

8. Method according to claim 7, characterized in that the determination, by the terminal device, of a target scheduling rule comprises: obtaining, by the terminal device, target scheduling rule indication information sent by the network-side device, wherein the target scheduling rule indication information is used to indicate a scheduling rule determined by the network-side device; and determining (102), by the terminal device, the target scheduling rule as the scheduling rule indicated by the target scheduling rule indication information.

9. A method according to claim 8, characterized in that the target scheduling rule indication information comprises at least one of the following: a subcarrier spacing, a number of symbols occupied by a minimum scheduling time unit, a downlink control information format, a modulation and encoding scheme; a cyclic redundancy check code, and a number of allocated resource blocks.

10. Method according to claim 9, characterized in that the determination, by the terminal device, of the target scheduling rule as the scheduling rule indicated by the target scheduling rule indication information comprises: determining, by the terminal device based on a correspondence between target scheduling rule indication information and a scheduling rule, the scheduling rule corresponding to the target scheduling rule indication information in the N scheduling rules as the target scheduling rule.

11. Method, according to claim 8, characterized in that the obtaining, by the terminal device, of target scheduling rule indications sent by the network-side device comprises: obtaining, by the terminal device, target scheduling rule indications from received control signaling sent by the network-side device.

12. A method according to any one of claims 7 to 11, characterized in that the mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time is: each of the T transport blocks is mapped to one of the S minimum scheduling time units; each of the T transport blocks is mapped to the S minimum scheduling time units; each of the T transport blocks is mapped to consecutive St minimum scheduling time units in the S minimum scheduling time units, wherein S = St χ T, and St is an integer greater than 1 and less than S.

13. A method according to any one of claims 7 to 11, characterized in that the mapping relation between T transport blocks and S minimum scheduling time units in a scheduling time is: a first transport block in the T transport blocks is mapped to a+b minimum scheduling time units, and each of the T transport blocks except the first transport block is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a χ T + b; or a Tth transport block in the T transport blocks is mapped to a+b minimum scheduling time units, and each of the T transport blocks except the Tth transport block is mapped to a minimum scheduling time unit, where both a and b are positive integers, b is less than T, and S = a χ T + b. Petition 870250017021, dated 28 / 02 / 2025, p. 104 / 215 7 / 7 14. Communication apparatus characterized in that it comprises means adapted for carrying out the method as defined in any one of claims 1 to 6 or carrying out the method as defined in any one of claims 7 to 13.

15. Non-transient computer-readable storage medium, characterized in that it is configured to store an instruction, wherein when the instruction is executed by a processor in an apparatus, it causes the apparatus to perform the method as defined in any one of claims 1 to 6 or claims 7 to 13.

Images