Communication method and communication device

Abstract

An embodiment of the present application provides a communication method and a communication device. The communication method includes: a terminal device receives a first parameter and a second parameter sent by a network device, the terminal device determines an initial slot for transmitting a physical uplink shared channel PUSCH with a configured grant according to the first parameter and the second parameter, and the terminal device performs transmitting the PUSCH with the configured grant according to the initial slot. The first parameter and the second parameter are any two of the following parameters: a quantity P of available slots in a configured grant periodicity, a quantity K of repetitions in a configured grant periodicity, and a quantity N of available slots in each repetition, where N is an integer equal to or greater than 2, and one transport block cyclic redundancy check code is carried in each repetition. This technical solution can reduce the complexity of the blind detection performed by the network device to a certain extent.

Description

[Technical Field]

[0001] TECHNICAL FIELD Embodiments of the present application relate to the field of communications, and more particularly to a communication method and a communication device.

[0002] This application claims priority to Chinese Patent Application No. CN202111160969.1, filed with the State Intellectual Property Administration of China on September 30, 2021, which is incorporated herein by reference in its entirety. [Background technology]

[0003] Currently, in the transmission of a physical uplink shared channel (PUSCH) with a configured grant, one PUSCH repetition is carried in one slot, and one transport block cyclic redundancy check code is carried in one slot. In a transmission period, the transmission of a PUSCH with a configured grant may start from a slot in which a repetition is configured and the redundancy version (RV) is 0. In this case, when receiving a PUSCH, the network device needs to determine a slot in which a repetition is configured and the UE device starts transmitting the PUSCH with the RV being 0.

[0004] To extend the uplink coverage, it may be considered that one PUSCH repetition is carried in multiple slots, from which one transport block cyclic redundancy check code is carried in multiple slots. In this new transmission mode, when the resource utilization efficiency and blind detection complexity of the network side device are considered, how to determine the initial slot for PUSCH transmission and how to set the RV corresponding to each PUSCH repetition become problems that need to be solved when the new PUSCH transmission mode is applied to the configured grant resource. Summary of the Invention

[0005] The embodiments of the present application provide a communication method and a communication device to reduce the complexity of blind detection by a network device.

[0006] According to a first aspect, a communication method is provided. A terminal device receives first and second parameters transmitted by a network device. The terminal device determines an initial slot for transmission of a physical uplink shared channel (PUSCH) with a configured grant based on the first and second parameters. The terminal device performs transmission of the PUSCH with the configured grant based on the initial slot. The first and second parameters are any two of: a number P of available slots in a configured grant periodicity; a number K of repetitions in the configured grant periodicity; and a number N of available slots in each repetition, where N is an integer greater than or equal to 2 and one transport block cyclic redundancy check code is carried in each repetition.

[0007] According to this embodiment of the present application, the network device sends the first parameter and the second parameter to the terminal device, and the terminal device can determine an initial slot for transmitting the PUSCH with the configured grant based on the first parameter and the second parameter, and perform the transmission of the PUSCH with the configured grant based on the initial slot, which helps reduce the complexity of blind detection by the network device.

[0008] In relation to the first aspect, in some implementations of the first aspect, the first parameter and the second parameter are carried by radio resource control (RRC) signaling, or the first parameter and the second parameter are carried by activation downlink control information (DCI), or the first parameter is carried by RRC signaling and the second parameter is carried by activation DCI, or the first parameter is carried by activation DCI and the second parameter is carried by RRC signaling.

[0009] In relation to the first aspect, in some implementations of the first aspect, when the first parameter is a number P of available slots in the configured grant periodicity and the second parameter is the number K of repetitions, the number P of available slots in the configured grant periodicity is an integer multiple of the number K of repetitions; or If the second parameter is the number N of available slots in each iteration, the number P of available slots in the configured grant periodicity is an integer multiple of the number N of available slots in each iteration.

[0010] Based on this embodiment of the present application, the number P of available slots in the configured grant periodicity can be an integer multiple of the number K of repetitions or the number N of available slots, which can reduce the complexity of determining the initial slot by the terminal device.

[0011] In relation to the first aspect, in some implementations of the first aspect, when the first parameter and the second parameter are the number of repetitions K and the number of available slots N in each repetition, the number of available slots in the configured grant periodicity is K*N.

[0012] In relation to the first aspect, in some implementations of the first aspect, the initial slot is an available slot that is within a configured grant period and is a distance of M*N1 available slots from a reference available slot, where M is an integer, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when the first parameter and the second parameter are the number P of available slots within the configured grant period and the number K of repetitions within the configured grant period. Alternatively, the initial slot is an available slot within a configured grant period and at a distance of M*N1-1 available slots from a reference available slot, where M is an integer, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when the first parameter and the second parameter are the number P of available slots in the configured grant period and the number K of repetitions in the configured grant period. Based on this embodiment of the present application, the position of the initial slot can be determined, which can reduce the complexity of performing blind detection by a network device.

[0013] In relation to the first aspect, in some implementations of the first aspect, when the first parameter and the second parameter are a number K of iterations in a configured grant periodicity and a number N of available slots in each iteration, or when the first parameter is a number P of available slots in the configured grant periodicity and the first parameter is an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is within the configured grant periodicity and is a distance of M*N1 available slots from the reference available slot.

[0014] Based on this embodiment of the present application, the position of the initial slot can be determined, which can reduce the complexity of performing blind detection by the network device.

[0015] In relation to the first aspect, in some implementations of the first aspect, when the first parameter is a quantity P of available slots in the configured grant periodicity and the first parameter is not an integer multiple of the second parameter: The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1 available slots from the reference available slot, where M is an integer; or the reference available slot is the last available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1-1 available slots from the reference available slot, where M is an integer greater than or equal to 1.

[0016] Based on this embodiment of the present application, the position of the initial slot can be determined, which can reduce the complexity of performing blind detection by the network device.

[0017] In relation to the first aspect, in some implementations of the first aspect, the reference available slot is preset, or the reference available slot is received by the terminal device from the network device.

[0018] It should be understood that in this embodiment of the present application, the reference available slot is pre-set, and it can be understood that the reference available slot is specified in the protocol.

[0019] In relation to the first aspect, in some implementations of the first aspect, the step of determining, by the terminal device, an initial slot for transmitting a PUSCH with a configured grant based on the first parameter and the second parameter includes:

[0020] That is, the terminal device determines the initial slot for transmission of the physical uplink shared channel (PUSCH) with the configured grant based on a redundancy version (RV) sequence, the first parameter, and the second parameter, where the redundancy version (RV) sequence is received by the terminal device from the network device.

[0021] Based on this embodiment of the present application, the terminal device can determine the initial slot based on the first parameter and the second parameter, and can determine the RV to be used in the initial slot based on the RV sequence.

[0022] In relation to the first aspect, in some implementations of the first aspect, M=A1*N2, where A1 is an integer greater than or equal to 0, and N2 is the minimum period of the RV.

[0023] In relation to the first aspect, in some implementations of the first aspect, one RV is used in one repetition, and the RVs in the RV sequence are used cyclically in all repetitions for transmitting the PUSCH with the configured grant.

[0024] With respect to the first aspect, in some implementations of the first aspect, the RV corresponding to the repetition carried in the initial slot is 0.

[0025] According to this embodiment of the present application, RV0 essentially includes all system bits, which can preliminarily increase the probability of successful decoding.

[0026] In relation to the first aspect, in some implementations of the first aspect, when the first parameter or the second parameter is the number K of repetitions in the configured grant periodicity, M is greater than or equal to 0 and less than or equal to K-1, and M is an integer, or when the first parameter and the second parameter are the number P of available slots in the configured grant periodicity and the number N of available slots in each repetition, M is greater than or equal to 0 and less than or equal to floor(P / N)-1, and M is an integer.

[0027] In relation to the first aspect, in some implementations of the first aspect, the step of performing transmission of the PUSCH with the configured grant based on the initial slot includes a step of encoding the PUSCH with the configured grant based on an RV corresponding to each repetition for transmission of the PUSCH with the configured grant from the repetition carried in the initial slot, and a step of performing transmission of the PUSCH with the configured grant based on a result of the encoding.

[0028] With respect to the first aspect, in some implementations of the first aspect, the RV corresponding to the repetition carried in the initial slot is 0.

[0029] In relation to the first aspect, in some implementations of the first aspect, the RV corresponding to the repetition carried in the initial slot is the Tth RV in the RV sequence, where T=floor(S / N)+1, and S is the sequence number of the initial slot among the available slots within the configured grant period.

[0030] This technical solution allows for the determination of the RV to be used in the initial slot.

[0031] In relation to the first aspect, in some implementations of the first aspect, when the RV corresponding to the repetition carried in the initial slot is not 0, the RV used in at least one of all repetitions for transmission of the PUSCH with the configured grant is 0.

[0032] According to this embodiment of the present application, RV0 basically includes all system bits, and other RVs may only include some system bits. If only other RVs are transmitted, decoding may fail. This technical solution can improve the probability of decoding in advance.

[0033] In relation to the first aspect, in some implementations of the first aspect, when the first parameter is a number P of available slots in the configured grant periodicity, the second parameter is a number N of available slots in each repetition, the first parameter is not an integer multiple of the second parameter, and the reference available slot is a first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last P-floor(P / N)*N available slots. Alternatively, the method may further include encoding the PUSCH with the configured grant based on a first RV and the number N of available slots, where the first RV is an RV corresponding to an repetition carried in the last P-floor(P / N)*N available slots, and transmitting the encoding result from front to back in the last P-floor(P / N)*N available slots.

[0034] In this technical solution, the process of transmitting a PUSCH with a configured grant periodicity is simple when the PUSCH is not transmitted in the last available slot corresponding to less than one repetition, and resource utilization is improved when the PUSCH is transmitted in the last available slot corresponding to less than one repetition.

[0035] In relation to the first aspect, in some implementations of the first aspect, when the first parameter is a number P of available slots in the configured grant periodicity, the second parameter is a number K of repetitions in the configured grant periodicity, the first parameter is not an integer multiple of the second parameter, and the reference available slot is a first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in last P-floor(P / K)*K available slots. Alternatively, the method may further include encoding the PUSCH with the configured grant based on a first RV and the number N of available slots, where the first RV is an RV corresponding to a repetition carried in the last P-floor(P / K)*K available slots, and transmitting the encoding results from front to back in the last P-floor(P / K)*K available slots.

[0036] In this technical solution, the process of transmitting a PUSCH with a configured grant periodicity is simple when the PUSCH is not transmitted in the last available slot corresponding to less than one repetition, and resource utilization is improved when the PUSCH is transmitted in the last available slot corresponding to less than one repetition.

[0037] According to a second aspect, there is provided a communication device, comprising: a transceiver unit configured to receive first and second parameters transmitted by a network device; a processing unit configured to determine an initial slot for transmission of a physical uplink shared channel (PUSCH) with a configured grant based on the first parameter and the second parameter, where the processing unit is further configured to perform transmission of the PUSCH with the configured grant based on the initial slot.

[0038] In relation to the second aspect, in some implementations of the second aspect, the first parameter and the second parameter are carried by radio resource control (RRC) signaling, or the first parameter and the second parameter are carried by activation downlink control information (DCI), or the first parameter is carried by RRC signaling and the second parameter is carried by activation DCI, or the first parameter is carried by activation DCI and the second parameter is carried by RRC signaling.

[0039] In relation to the second aspect, in some implementations of the second aspect, when the first parameter is a number P of available slots in the configured grant periodicity, and the second parameter is the number K of repetitions, the number P of available slots in the configured grant periodicity is an integer multiple of the number K of repetitions; or If the second parameter is the number N of available slots in each iteration, the number P of available slots in the configured grant periodicity is an integer multiple of the number N of available slots in each iteration.

[0040] In relation to the second aspect, in some implementations of the second aspect, when the first parameter and the second parameter are the number of iterations K and the number of available slots N in each iteration, the number of available slots in the configured grant periodicity is K*N.

[0041] In relation to the second aspect, in some implementations of the second aspect, the initial slot is an available slot that is within a configured grant period and is a distance of M*N1 available slots from a reference available slot, where M is an integer, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when the first parameter and the second parameter are the number P of available slots within the configured grant period and the number K of repetitions within the configured grant period. Alternatively, the initial slot is an available slot that is within a configured grant period and is a distance of M*N1-1 available slots from a reference available slot, where M is an integer, and when the first parameter or the second parameter is the number N of available slots in each repetition, N1=N, and when the first parameter and the second parameter are the number P of available slots in the configured grant period and the number K of repetitions in the configured grant period, N1=floor(P / K) or N1=ceiling(P / K).

[0042] In relation to the second aspect, in some implementations of the second aspect, when the first parameter and the second parameter are a number K of iterations in a configured grant periodicity and a number N of available slots in each iteration, or when the first parameter is a number P of available slots in the configured grant periodicity and the first parameter is an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is within the configured grant periodicity and is a distance of M*N1 available slots from the reference available slot.

[0043] In relation to the second aspect, in some implementations of the second aspect, when the first parameter is a quantity P of available slots in the configured grant periodicity and the first parameter is not an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1 available slots from the reference available slot, where M is an integer; or the reference available slot is the last available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1-1 available slots from the reference available slot, where M is an integer greater than or equal to 1.

[0044] In relation to the second aspect, in some implementations of the second aspect, the reference available slot is preset, or the reference available slot is received by the terminal device from the network device.

[0045] In relation to the second aspect, in some implementations of the second aspect, the processing unit is specifically configured to determine an initial slot for transmission of a physical uplink shared channel (PUSCH) with the configured grant based on a redundancy version (RV) sequence, a first parameter, and a second parameter, where the redundancy version (RV) sequence is received by the terminal device from the network device.

[0046] With respect to the second aspect, in some implementations of the second aspect, M=A1*N2, where A1 is an integer greater than or equal to 0, and N2 is the minimum period of the RV.

[0047] In relation to the second aspect, in some implementations of the second aspect, one RV is used in one repetition, and the RVs in the RV sequence are used cyclically in all repetitions for transmitting the PUSCH with the configured grant.

[0048] With respect to the second aspect, in some implementations of the second aspect, the RV corresponding to the repetition carried in the initial slot is 0.

[0049] In relation to the second aspect, in some implementations of the second aspect, when the first parameter or the second parameter is the number K of repetitions in the configured grant periodicity, M is greater than or equal to 0 and less than or equal to K-1, and M is an integer, or when the first parameter and the second parameter are the number P of available slots in the configured grant periodicity and the number N of available slots in each repetition, M is greater than or equal to 0 and less than or equal to floor(P / N)-1, and M is an integer.

[0050] In relation to the second aspect, in some implementations of the second aspect, the processing unit is specifically configured to encode the PUSCH with the configured grant based on an RV corresponding to each repetition for transmission of the PUSCH with the configured grant from the repetition carried in the initial slot, and to perform transmission of the PUSCH with the configured grant based on a result of the encoding.

[0051] With respect to the second aspect, in some implementations of the second aspect, the RV corresponding to the repetition carried in the initial slot is 0.

[0052] In relation to the second aspect, in some implementations of the second aspect, the RV corresponding to the repetition carried in the initial slot is the Tth RV in the RV sequence, where T=floor(S / N)+1, and S is the sequence number of the initial slot among the available slots within the configured grant period.

[0053] In relation to the second aspect, in some implementations of the second aspect, when the RV corresponding to the repetition carried in the initial slot is not 0, the RV used in at least one of all repetitions for the transmission of the PUSCH with the configured grant is 0.

[0054] In relation to the second aspect, in some implementations of the second aspect, when the first parameter is a number P of available slots in the configured grant periodicity, the second parameter is a number N of available slots in each repetition, the first parameter is not an integer multiple of the second parameter, and the reference available slot is a first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last P-floor(P / N)*N available slots. Alternatively, the method may further include encoding the PUSCH with the configured grant based on a first RV and the number N of available slots, where the first RV is an RV corresponding to an repetition carried in the last P-floor(P / N)*N available slots, and transmitting the encoding result from front to back in the last P-floor(P / N)*N available slots.

[0055] In relation to the second aspect, in some implementations of the second aspect, when the first parameter is a number P of available slots in the configured grant periodicity, the second parameter is a number K of repetitions in the configured grant periodicity, the first parameter is not an integer multiple of the second parameter, and the reference available slot is a first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in last P-floor(P / K)*K available slots. Alternatively, the method may further include encoding the PUSCH with the configured grant based on a first RV and the number N of available slots, where the first RV is an RV corresponding to a repetition carried in the last P-floor(P / K)*K available slots, and transmitting the encoding results from front to back in the last P-floor(P / K)*K available slots.

[0056] According to a third aspect, there is provided a communication device comprising at least one processor coupled to at least one memory and configured to execute computer programs or instructions stored in the at least one memory, such that a communication method according to the first aspect and any one of its possible implementations is performed.

[0057] According to a fourth aspect, there is provided a chip comprising a processor and an interface circuit, the processor and the interface circuit being coupled to each other, the interface circuit being configured to communicate with another device, and signals being processed by the processor to thereby perform a communication method according to the first aspect and any one of its possible implementations.

[0058] According to a fifth aspect, there is provided a computer-readable storage medium having computer instructions stored thereon which, when executed on a computer, perform a communication method according to the first aspect and any one of its possible implementations.

[0059] According to a sixth aspect, there is provided a computer program product comprising computer program code which, when run on a computer, performs a communication method according to the first aspect and any one of its possible implementations. [Brief explanation of the drawings]

[0060] [Figure 1] FIG. 1 is a schematic diagram of the architecture of a communication system according to one embodiment of the present application. [Figure 2] FIG. 2 is a schematic diagram of an iterative type according to one embodiment of the present application. [Figure 3] FIG. 3 is a schematic diagram of another iteration type according to one embodiment of the present application. [Figure 4] FIG. 4 is a schematic diagram of a transport block over multiple slots according to one embodiment of the present application. [Figure 5] FIG. 5 is a schematic diagram of a time domain resource configuration according to one embodiment of the present application. [Figure 6] FIG. 6 is a schematic diagram of a redundancy version sequence according to one embodiment of the present application. [Figure 7] FIG. 7 is a schematic diagram of another redundancy version sequence according to one embodiment of the present application. [Figure 8] FIG. 8 is a schematic diagram of yet another redundancy version sequence according to one embodiment of the present application. [Figure 9] FIG. 9 is a schematic interaction diagram of a communication method according to one embodiment of the present application. [Figure 10]FIG. 10 is a schematic diagram of PUSCH transmission possibilities according to one embodiment of the present application. [Figure 11] FIG. 11 is a schematic diagram of another possibility for PUSCH transmission according to one embodiment of the present application. [Figure 12] FIG. 12 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application. [Figure 13] FIG. 13 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application. [Figure 14] FIG. 14 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application. [Figure 15] FIG. 15 is a schematic block diagram of a communication device according to one embodiment of the present application. DETAILED DESCRIPTION OF THE INVENTION

[0061] The following describes the technical solutions of the embodiments in this application with reference to the accompanying drawings.

[0062] The technical solutions of the embodiments of the present application are applied to various communication systems, such as a global system for mobile communications (GSM®) system, a code division multiple access (CDMA®) system, a wideband code division multiple access (WCDMA®) system, a general packet radio service (GPRS), a long term evolution (LTE) system, an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD) system, a universal mobile telecommunications system (UMTS), a worldwide interoperability for microwave access (WiMAX®) communication system, a fifth generation (5G) system, or a new radio (NR) system.

[0063] The terminal device in the embodiments of the present application may also refer to user equipment (UE), access terminal, subscriber unit, subscriber station, transferThe terminal equipment may be a mobile station (MS), a remote station, a remote terminal, a mobile device, a user terminal, a terminal, or a mobile terminal (MT), a wireless communication device, a user agent or user equipment, etc. Alternatively, the terminal equipment may be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device, another processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal equipment in a future 5G network, a terminal equipment in a future evolved public land mobile network (PLMN), etc. The terminal device may be a mobile phone, a tablet computer (Pad), a computer with wireless transmission and reception capabilities, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. This is not limited to the embodiments of the present application.

[0064] The network device in the embodiments of the present application may be a device configured to communicate with a terminal device. The network device may be a base transceiver station (BTS) in a global system for mobile communications (GSM) system or a code division multiple access (CDMA) system, a Node B (NB) in a wideband code division multiple access (WCDMA) system, an evolved Node B (eNB or eNodeB) in an LTE system, or a radio controller in a cloud radio access network (CRAN) scenario. Alternatively, the network device may be a relay station, an access point, an access node in a Wi-Fi system, an in-vehicle device, a wearable device, a network device in a 5G and 6G network, a network device in a future evolved PLMN, etc. This is not limited in the embodiments of the present application.

[0065] FIG. 1 is a schematic diagram of the architecture of a communication system according to one embodiment of the present application.

[0066] As shown in FIG. 1, the communication system may include a core network device 110, a radio access network device 120, and at least one terminal device 131 or 132. The terminal device 131 or 132 is wirelessly connected to the radio access network device 120, which is wirelessly or wiredly connected to the core network device 110. The core network device 110 and the radio access network device 120 may be separate physical devices, or the core network device's functionality and the radio access network device's logical functionality may be integrated into the same physical device, or some of the core network device's functionality and some of the radio access network device's functionality may be integrated into one physical device. The terminal device 131 or 132 may be located at a fixed location or may be mobile. FIG. 1 is merely a schematic diagram. The communication system may further include other network devices, such as a wireless relay device and a wireless backhaul device, which are not shown in FIG. 1. The quantities of core network devices, radio access network devices and terminal devices included in the mobile communication system are not limited in this embodiment of the present application.

[0067] The radio access network device and the terminal device include an indoor or outdoor device, a handheld device, or a vehicle-mounted device, and may be located on the ground, on the water, or on an airplane, a balloon, or a satellite in the air. The application scenarios of the radio access network device and the terminal device are not limited in the embodiments of the present application.

[0068] This embodiment of the present application is applicable to downlink signal transmission, uplink signal transmission, or device to device (D2D) signal transmission. For downlink signal transmission, the transmitting device is a radio access network device, and correspondingly, the receiving device is a terminal device. For uplink signal transmission, the transmitting device is a terminal device, and correspondingly, the receiving device is a radio access network device. For D2D signal transmission, the transmitting device is a terminal device, and correspondingly, the receiving device is also a terminal device. The signal transmission direction is not limited in the embodiment of the present application.

[0069] Communications between radio access network devices and terminal devices, and communications between terminal devices, may be performed using licensed spectrum, unlicensed spectrum, or both licensed and unlicensed spectrum. A spectrum below 6G, a spectrum above 6G, or both a spectrum below 6G and a spectrum above 6G may be used for communications between radio access network devices and terminal devices, and between terminal devices. The spectrum resources used by the radio access network devices and terminal devices are not limited in the embodiments of the present application.

[0070] In NR, there are generally several scheduling manners for the physical uplink shared channel (PUSCH):

[0071] Method 1:

[0072] The PUSCH is dynamically scheduled by an uplink grant in one downlink control information (DCI), where DCI is physical layer information.

[0073] In this case, the terminal device performs PUSCH transmission once after receiving uplink scheduling.

[0074] Method 2:

[0075] Configured grant (CG) type 1: Configured semi-persistently by using the higher layer information element configuredGrantConfig, which contains rrc-ConfiguredUplinkGrant, without receiving an uplink grant in the DCI.

[0076] In this case, some semi-persistent resources are configured in the upper layer. When the terminal device needs to transmit uplink data, the terminal device can perform PUSCH transmission by using these resources. Or, when the terminal device does not need to transmit uplink data, the terminal device does not perform PUSCH transmission.

[0077] Method 3:

[0078] Configured grant type 2: First, receive the higher layer information element ConfiguredUplinkGrant without including rrc-configuredGrantConfig, and then perform semi-persistent scheduling with the uplink grant in a valid activation DCI.

[0079] In this case, some semi-persistent resources are configured at higher layers and then deactivated by using physical layer signaling. During activation, when the terminal device needs to transmit uplink data, the terminal device may use these resources to perform PUSCH transmission. When the terminal device is not activated, these resources cannot be used.

[0080] One PUSCH may include multiple repetitions, and the repetitions transmit the same transport block (TB). The redundancy versions may be the same or different. One transport block cyclic redundancy check (TB CRC) code is carried in one repetition. In addition, the unit of rate matching is also a repetition. The technical solution of this application is specific to PUSCH transmission of a transport block on multiple slots.

[0081] FIG. 2 is a schematic diagram of an iterative type according to one embodiment of the present application.

[0082] As shown in Figure 2(a), when K repetitions (K=4) are configured, the K transmission opportunities correspond to K consecutive slots. One transmission opportunity in each slot may be used to transmit one repetition of a PUSCH, and the start symbol and duration of the transmission opportunities in a slot (pattern padding part in Figure 2) are the same.

[0083] In time division duplexing (TDD) mode, the transmission of a PUSCH repetition is canceled if any symbol in the resource corresponding to the PUSCH repetition is a downlink symbol, or if the time-frequency resource of the PUSCH overlaps with a canceled resource indicated by a cancellation indication (CI) or overlaps with a higher priority uplink channel / signaling. As shown in Figure 2(b), in the second repetition, resource A corresponding to the repetition is a downlink symbol, and the transmission of the second PUSCH repetition is canceled.

[0084] However, in some cases, it may not be possible to cancel the transmission in time. For example, as shown in (c) of Figure 2, when the second PUSCH repetition starts to be transmitted, the CI is analyzed at moment t0 and it is found that resource B overlaps. In this case, if the second PUSCH repetition is partially transmitted, only some of the PUSCH repetitions may be canceled.

[0085] From the above, it can be seen that in the repetition type, K repetitions for one PUSCH transmission are nominal repetitions. In other words, one PUSCH transmission corresponds to K slots, regardless of whether each of the K slots can be used to transmit a PUSCH repetition.

[0086] Then, in another iteration type, a concept of available slots is introduced. For the PUSCH scheduling scheme in the above-mentioned scheme 1, the K available slots may be determined based on a radio resource control (RRC) configuration and a scheduling DCI. For the PUSCH scheduling scheme in the above-mentioned scheme 2, the K available slots may be determined based on an RRC configuration. For the PUSCH scheduling scheme in the above-mentioned scheme 3, the K available slots may be determined based on an RRC configuration and an activation DCI.

[0087] As mentioned above, several reasons may result in the cancellation of repetitions for performing one PUSCH transmission. One type is determined based on the RRC configuration, and the second type is based on dynamic indication, i.e., triggered by a physical layer indication, e.g., CI. However, only RRC signaling may be considered to determine the available slots, and no other physical layer indication other than DCI scheduled by using PUSCH is considered.

[0088] 3 is a schematic diagram of another repetition type according to one embodiment of the present application. As shown in (a) of FIG. 3, in a slot corresponding to the second repetition, if a high priority uplink channel / signal transmission configured by using RRC overlaps with a PUSCH resource, the slot is not an available slot.

[0089] As shown in (b) of Figure 3, in the slot corresponding to the second iteration, if a high priority uplink channel / signal transmission indicated by using the physical layer overlaps with a PUSCH resource, the slot is still an available slot.

[0090] In the PUSCH transmission of a transport block over multiple slots, if K repetitions are configured, each repetition corresponds to N consecutive slots, and the K transmission occasions correspond to a total of N*K consecutive slots, and the starting symbol and duration of the available resources in each slot are the same. One TB CRC is carried in one repetition, i.e., one TB CRC is carried in N slots. This can reduce the signaling overhead of the TB CRC.

[0091] In addition, rate matching may also be performed in units of N slots, where it should be noted that the slots may be all slots or may be available slots.

[0092] 4 is a schematic diagram of a transport block over multiple slots according to an embodiment of the present application. As shown in FIG. 4, K repetitions (K=2) are configured, and each repetition can be understood as a transport block spanning multiple slots, and each repetition includes 4 available slots.

[0093] 5 is a schematic diagram of a time domain resource configuration according to an embodiment of the present application. As shown in FIG. 5, in the transmission of a PUSCH with a configured grant, the higher layer configured resource may include the following parameters:

[0094] Periodicity: Indicates the interval between two adjacent transmission opportunity groups. The minimum periodicity value is 2 symbols, and the maximum periodicity value can be 5120 slots.

[0095] The quantity of repetitions repK is the number of transmission opportunities included in each group of transmission opportunities, i.e., the number of repetitions, or it can be the number of slots or the number of available slots.

[0096] repK may be abbreviated as K, and values ​​of K may include {1, 2, 4, 8}, and values ​​that may be supported in the future may include {1, 2, 3, 4, 7, 8, 12, 16, 20, 24, 28, 32}, and it should be understood that K may alternatively be another value, which is not limited in this embodiment of the present application.

[0097] The upper layer parameter repK-RV indicates the redundancy version (RV) sequence used for the K repetition transmission. For the nth transmission opportunity in the K repetition transmission, the (mod(n-1, 4)+1)th value in the RV sequence is used, where n=1, 2, ..., K.

[0098] repK-RV has four cases: not constructed, constructed as {0,2,3,1}, constructed as {0,3,0,3}, and constructed as {0,0,0,0}.

[0099] If the higher layer parameter startingFromRV0 is set to off, the transport block may be transmitted only from the first transmission opportunity of the K repetitions. Otherwise, the transport block is transmitted as follows:

[0100] If K=1, the parameter repK_RV is not configured by using ConfiguredGrantConfig and the RV version sent is set to 0.

[0101] In the following, the transmission schemes of transport blocks in the remaining RV sequences will be described separately with reference to Figures 6 to 8.

[0102] If the RV sequence is configured as {0,2,3,1}, the initial transmission can only be performed at the first transmission opportunity of the K iterations. Figure 6 is a schematic diagram of a redundancy version sequence according to one embodiment of the present application.

[0103] For K=2, the RV used in the first iteration is 0 and the RV used in the second iteration is 3.

[0104] It should be understood that if each repetition contains N slots, the RVs used in the N slots are the same.

[0105] For K=4, the RV used in the first iteration is 0, the RV used in the second iteration is 3, the RV used in the third iteration is 3, and the RV used in the fourth iteration is 1.

[0106] It should be understood that if each repetition contains N slots, the RVs used in the N slots are the same.

[0107] For K=8, the RV used in the first iteration is 0, the RV used in the second iteration is 3, the RV used in the third iteration is 2, the RV used in the fourth iteration is 1, the RV used in the fifth iteration is 0, the RV used in the sixth iteration is 3, the RV used in the seventh iteration is 2, and the RV used in the eighth iteration is 1.

[0108] It should be understood that if each repetition contains N slots, the RVs used in the N slots are the same.

[0109] It should further be understood that if K is another value, for example, K=16, then 16 iterations may be used cyclically based on the RV sequence {0, 2, 3, 1}.

[0110] If the RV sequence is constructed as {0, 3, 0, 3}, the initial transmission may occur at any one of the transmission opportunities corresponding to K repetitions and corresponding to RV = 0. Figure 7 is a schematic diagram of another redundancy version sequence according to an embodiment of the present application.

[0111] For K=2, the RV used in the first iteration is 0 and the RV used in the second iteration is 3.

[0112] It should be understood that if each repetition contains N slots, the RVs used in the N slots are the same.

[0113] For K=4, the transmission state of the repetition may include the following two cases:

[0114] In one scheme, the initial transmission starts from the first iteration, where the RV used in the first iteration is 0, the RV used in the second iteration is 3, the RV used in the third iteration is 0, and the RV used in the fourth iteration is 3.

[0115] In the other scheme, the PUSCH is not transmitted in the first and second iterations, and the initial transmission starts from the third iteration, in which the RV used in the third iteration is 0 and the RV used in the fourth iteration is 3.

[0116] For K=8, the transmission state of the iterations may include the following four cases:

[0117] In the first scheme, the initial transmission starts from the first iteration, where the RV used in the first iteration is 0, the RV used in the second iteration is 3, the RV used in the third iteration is 0, the RV used in the fourth iteration is 3, the RV used in the fifth iteration is 0, the RV used in the sixth iteration is 3, the RV used in the seventh iteration is 0, and the RV used in the eighth iteration is 3.

[0118] In the second scheme, the PUSCH is not transmitted in the first and second iterations, and the initial transmission starts from the third iteration, where the RV used in the third iteration is 0, the RV used in the fourth iteration is 3, the RV used in the fifth iteration is 0, the RV used in the sixth iteration is 3, the RV used in the seventh iteration is 0, and the RV used in the eighth iteration is 3.

[0119] In the third scheme, the PUSCH is not transmitted from the first iteration to the fourth iteration, and the initial transmission starts from the fifth iteration, where the RV used in the fifth iteration is 0, the RV used in the sixth iteration is 3, the RV used in the seventh iteration is 0, and the RV used in the eighth iteration is 3.

[0120] In the fourth scheme, the PUSCH is not transmitted from the first iteration to the sixth iteration. The initial transmission starts from the seventh iteration, the RV used in the seventh iteration is 0, and the RV used in the eighth iteration is 3.

[0121] When the RV sequence is set as {0,0,0,0}, the initial transmission can occur at any one of the transmission opportunities corresponding to the K repetitions. However, when K=8, the initial transmission cannot occur at the last transmission opportunity. Figure 8 is a schematic diagram of yet another redundancy version sequence according to an embodiment of the present application.

[0122] When K=2, the transmission state of the repetition may include the following two cases:

[0123] In one scheme, the initial transmission starts from the first iteration, in which case the RV used in the first iteration is 0, and the RV used in the second iteration is 0.

[0124] In the other scheme, the PUSCH is not transmitted in the first iteration, in which case the RV used in the second iteration is 0.

[0125] When K=4, the transmission state of the iterations may include the following four cases:

[0126] In the first scheme, the initial transmission starts from the first iteration, in which the RVs used from the first iteration to the fourth iteration are all 0.

[0127] In the second scheme, the PUSCH is not transmitted in the first iteration, and the initial transmission starts from the second iteration, in which case the RVs used from the second iteration to the fourth iteration are all 0.

[0128] In the third scheme, the PUSCH is not transmitted in the first and second iterations, and the initial transmission starts from the third iteration, in which case the RV used in the third and fourth iterations is 0.

[0129] In the fourth scheme, the PUSCH is not transmitted from the first to third iterations, and the initial transmission starts from the fourth iteration. In this case, the RV used in the fourth iteration is 0.

[0130] For K=8, the transmission state of the iterations may include the following seven cases:

[0131] In the first scheme, the initial transmission starts from the first iteration, in which the RVs used from the first iteration to the eighth iteration are all 0.

[0132] In the second scheme, the PUSCH is not transmitted in the first iteration, and the initial transmission starts from the second iteration, in which the RVs used from the second iteration to the eighth iteration are all 0.

[0133] In the third scheme, the PUSCH is not transmitted in the first and second iterations, and the initial transmission starts from the third iteration, in which the RVs used from the third to eighth iterations are all 0.

[0134] In the fourth scheme, the PUSCH is not transmitted from the first to third iterations, and the initial transmission starts from the fourth iteration, in which the RVs used from the fourth to eighth iterations are all 0.

[0135] In the fifth scheme, the PUSCH is not transmitted from the first to fourth iterations, and the initial transmission starts from the fifth iteration. In this case, the RVs used from the fifth to eighth iterations are all 0.

[0136] In the sixth scheme, the PUSCH is not transmitted from the first iteration to the fifth iteration, and the initial transmission starts from the sixth iteration. In this case, the RVs used from the sixth iteration to the eighth iteration are all 0.

[0137] In the seventh scheme, the PUSCH is not transmitted from the first iteration to the sixth iteration, and the initial transmission starts from the seventh iteration. In this case, the RVs used in the seventh and eighth iterations are all zero.

[0138] For any RV sequence, there are three conditions for stopping repeated transmissions, and transmissions must be stopped the first time any one of the conditions is met. (1) K iterations were sent. (2) Transmission is performed at the last transmission opportunity of the K iterations within the periodicity. (3) The transmission is performed in the start symbol of another PUSCH in the same process that is scheduled by using DCI format 0_0 or 0_1.

[0139] As described above, if a terminal device needs to transmit data at a transmission opportunity, the terminal device may transmit data on the configured resources, or if the terminal device does not need to transmit data, the terminal device may not transmit data. Regardless of whether the terminal device transmits data or not, the network device needs to perform blind detection. The network device may configure parameters for different demodulation reference signals (DMRSs) of different terminal devices. In this way, the network device can monitor different DMRSs of different terminal devices and detect whether the terminal device transmits data at this transmission opportunity.

[0140] In addition, at a transmission opportunity, the transmission of the PUSCH with the configured grant can start from the iteration in which the RV is 0. In this case, when receiving the PUSCH, the network device needs to determine that the terminal device starts transmitting the PUSCH from the iteration in which the RV is 0. This increases the complexity of the blind detection performed by the network device.

[0141] Furthermore, when the network device determines whether data should be transmitted in a transmission opportunity by using DMRS, there may be no PUSCH transmission in one transmission opportunity, and the result of blind detection is that there is a PUSCH transmission; or, when there is a PUSCH transmission in one transmission opportunity, the result of blind detection is that there is no PUSCH transmission, and as a result, PUSCH reception performance is degraded.

[0142] To enhance uplink coverage, it may be considered that one PUSCH repetition is carried in multiple slots and one transport block cyclic redundancy check code is carried in multiple slots. In this new transmission mode, when the resource utilization efficiency of the network side device and the complexity of blind detection are considered, how to determine the initial slot for PUSCH transmission and how to set the RV corresponding to each PUSCH repetition become problems that need to be solved when the new PUSCH transmission mode is applied to the configured grant resource.

[0143] In view of this, the embodiments of the present application provide a communication method for reducing the complexity of blind detection performed by a network device and improving PUSCH reception performance.

[0144] 9 is a schematic interaction diagram of a communication method according to an embodiment of the present application. As shown in FIG. 9, the method may include steps 910 to 940.

[0145] 910: The network device sends a first parameter and a second parameter to the terminal device, where the first parameter and the second parameter are any two of the following parameters: a number P of available slots in a configured grant periodicity, a number K of repetitions in the configured grant periodicity, and a number N of available slots in each repetition, where N is an integer greater than or equal to 2, and where one transport block cyclic redundancy check (TB) CRC code is carried in each repetition.

[0146] It should be noted that available slots in this specification may be replaced with slots, in other words, there is no distinction as to whether a free slot is available or not.

[0147] It should be noted that the number N of available slots in each repetition means that each repetition is transmitted in N available slots.

[0148] For example, the first parameter is the number P of available slots in the configured grant periodicity and the second parameter is the number K of repetitions in the configured grant periodicity, or the first parameter is the number P of available slots in the configured grant periodicity and the second parameter is the number N of available slots in each repetition, or the first parameter is the number P of available slots in the configured grant periodicity and the second parameter is the number N of available slots in each repetition.

[0149] It should be understood that the first parameter and the second parameter may be carried by radio resource control (RRC) signaling, or the first parameter and the second parameter may be carried by activation downlink control information (DCI), or the first parameter may be carried by RRC signaling and the second parameter may be carried by activation DCI, or the first parameter may be carried by activation DCI and the second parameter may be carried by RRC signaling. This is not limited in this embodiment of the present application. When the first parameter and the second parameter are carried by RRC signaling and activation DCI, respectively, the network device may adjust the parameters based on a real-time transmission status, so that the scheduling flexibility of the network device is improved and further, the signaling overhead of the physical layer may be reduced.

[0150] It should be noted that the activation downlink control information DCI in this specification is the activation downlink control information for configured grant type 2 PUSCH transmission.

[0151] In some implementations, when the first parameter is a number P of available slots in the configured grant periodicity and the second parameter is a number K of repetitions, the number P of available slots in the configured grant periodicity is an integer multiple of the number K of repetitions; or If the second parameter is the number N of available slots in each iteration, then the number P of available slots in the configured grant periodicity is an integer multiple of the number N of available slots in each iteration.

[0152] The complexity of calculating the initial slots can be reduced when the number P of available slots in the configured grant periodicity is an integer multiple of the number K of iterations in the configured grant periodicity or an integer multiple of the number N of available slots included in each iteration.

[0153] In this case, the protocol may specify that the number P of available slots in the configured grant periodicity is an integer multiple of the number K of repetitions in the configured grant periodicity, or an integer multiple of the number N of available slots included in each repetition. When the number P of available slots in the configured grant periodicity is not an integer multiple of the number K of repetitions in the configured grant periodicity, or an integer multiple of the number N of available slots included in each repetition, the terminal device may consider the configuration unavailable.

[0154] In some other implementations, when the first and second parameters are the number of iterations K and the number of available slots N in each iteration, the number of available slots in the configured grant periodicity is K*N.

[0155] In this case, the quantity P of available slots in the configured grant periodicity can be obtained through calculation based on the first parameter and the second parameter, i.e., P=K*N.

[0156] 920: The terminal device determines an initial slot for transmitting a PUSCH with the configured grant based on the first parameter and the second parameter.

[0157] It should be understood that the initial slot is a slot in which the terminal device starts transmitting the PUSCH. The initial slot may be the first available slot in the configured grant periodicity, or the last available slot in the configured grant periodicity, or another available slot in the configured grant periodicity. This is not limited in this embodiment of the present application.

[0158] In a possible implementation, the initial slot is an available slot that is within the configured grant period and is a distance of M*N1 available slots from the reference available slot, where M is an integer, where N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when one of the first parameter and the second parameter is the number P of available slots within the configured grant period and the other is the number K of repetitions within the configured grant period. Alternatively, in a possible implementation, the initial slot is an available slot that is within the configured grant period and is a distance of M*N1 available slots from the reference available slot, where M is an integer greater than or equal to 1, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when one of the first parameter and the second parameter is the number P of available slots within the configured grant period and the other is the number K of repetitions within the configured grant period.

[0159] It should be noted that the initial slot being an available slot that is at a distance of M*N1 available slots from the reference available slot means that the difference between the sequence numbers of the available slots is M*N1, or the sequence number of the initial slot may be M*N1 greater than the sequence number of the reference available slot, or the sequence number of the reference available slot may be M*N1 greater than the sequence number of the initial slot.

[0160] The terminal device's determining, based on the first parameter and the second parameter, an initial slot for transmitting a physical uplink shared channel (PUSCH) with the configured grant includes:

[0161] The terminal device determines an initial slot for transmission of a physical uplink shared channel (PUSCH) with the configured grant based on a redundancy version (RV) sequence, a first parameter, and a second parameter, where the redundancy version (RV) sequence is received by the terminal device from the network device.

[0162] It should be understood that the terminal device may determine the initial slot based on the first parameter and the second parameter, and may determine the RV corresponding to the repetition carried in the initial slot based on the RV sequence.

[0163] It should be understood that the RV sequence may be received by the terminal device from the network device, such as {0,0,0,0}, {0,2,3,1}, {0,3,0,3}, etc.

[0164] 930: The terminal device performs transmission of a PUSCH with the configured grant based on the initial slot.

[0165] The terminal device transmits a PUSCH with a configured grant based on the initial slot, starting from the initial slot.

[0166] Specifically, the terminal device encodes the PUSCH with the configured grant based on the RV corresponding to each repetition of the transmission of the PUSCH with the configured grant from the repetition carried in the initial slot, and then performs the transmission of the PUSCH with the configured grant based on the encoding result.

[0167] Arbitrarily, the RV corresponding to the repetition carried in the initial slot is 0.

[0168] See, for example, Figure 10(a). Figure 10 is a schematic diagram of PUSCH transmission possibilities according to this embodiment of the present application. The number of repetitions K in the configured grant periodicity is 2, and the number of available slots N included in each repetition is 4. In this case, the available slots P in the configured grant periodicity is equal to K*N, which is also equal to 8, and the RV sequence is {0, 3, 0, 3}.

[0169] In possibility A, when the initial slot is the first slot among the available slots in the configured grant periodicity, the RV used for encoding in the first repetition, i.e., the first to fourth slots, is 0, and the RV used for encoding in the second repetition, i.e., the fifth to eighth slots, is 3. In this case, the terminal device may perform transmission of a PUSCH with a configured grant in the encoded repetition.

[0170] In possibility B, the initial slot is the 5th slot of the available slots in the configured grant periodicity, i.e., the PUSCH is not transmitted in the first iteration, and the RV used for encoding in the 5th to 8th slots is 0. In this case, the terminal device may perform transmission of the PUSCH with the configured grant in the second encoding iteration.

[0171] Optionally, one RV is used in one repetition, and the RVs in the RV sequence are used cyclically in all repetitions for transmission of the PUSCH with the configured grant.

[0172] For example, see (c) of Figure 10. The number of available slots P in the configured grant periodicity is 16, and the number of available slots N included in each repetition is 4. The number of repetitions K in the configured grant periodicity is 4, and the RV sequence is {0, 3, 0, 3}.

[0173] In possibility A, the initial slot is the first available slot among the available slots in the configured grant periodicity, and the RV used in the first to fourth available slots included in the first iteration is the same, i.e., RV is 0. The RV used in the second iteration is 3, the RV used in the third iteration is 0, and the RV used in the fourth iteration is 3. It should be understood that if the configured grant periodicity has more iterations, the RVs are used cyclically in the remaining iterations based on the RV sequence.

[0174] 940: The network device performs blind detection.

[0175] It should be understood that when performing blind detection, the network device may determine whether data should be transmitted on one configured scheduling grant by using DMRS starting from multiple possible initial slots. When it is determined that data should be transmitted in a possible initial slot, the repetition carried in the initial slot may be decoded based on the RV sequence.

[0176] For example, if data is transmitted in the initial slot and the network device determines that the RV corresponding to the repetition carried in the initial slot is 0, then RV0 may be directly used for decoding.

[0177] After receiving the PUSCH with the configured grant, the network device may determine an initial slot for transmission of the PUSCH, which may reduce the complexity of blind detection by the network device.

[0178] According to this embodiment of the present application, the network device sends the first parameter and the second parameter to the terminal device, and the terminal device can determine an initial slot for transmitting the PUSCH with the configured grant based on the first parameter and the second parameter, and perform the transmission of the PUSCH with the configured grant based on the initial slot, which helps reduce the complexity of blind detection by the network device.

[0179] Optionally, when the first parameter and the second parameter are a number K of iterations in a configured grant periodicity and a number N of available slots in each iteration, or when the first parameter is a number P of available slots in a configured grant periodicity and the first parameter is an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is within the configured grant periodicity and is a distance of M*N1 available slots from the reference available slot.

[0180] In one example, referring to Figure 10(a), a first parameter may be the number of repetitions K in the configured grant periodicity, where K = 2, and a second parameter may be the number of available slots N in each repetition, where N = 4.

[0181] M=0 corresponds to possibility A, where the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 0*4 available slots away from the reference available slot, i.e., the initial slot is the reference available slot, i.e., the first available slot among the available slots in the configured grant periodicity.

[0182] M=1 corresponds to possibility B, where the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 1*4 available slots away from the reference available slot, i.e., the initial slot is the 5th available slot.

[0183] In another example, see Figure 10(b). A first parameter may be the number P of available slots in the configured grant periodicity, where P = 16. And a second parameter may be the number N of available slots included in each repetition, where N = 4. In this case, the number P of available slots in the configured grant periodicity is an integer multiple of the number N of available slots in each repetition.

[0184] M=0 corresponds to possibility A, where the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 0*4 available slots away from the reference available slot, i.e., the initial slot is also the reference available slot, i.e., the first available slot among the available slots in the configured grant periodicity.

[0185] M=1 corresponds to possibility B, where the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 1*4 available slots away from the reference available slot, i.e., the initial slot is the 5th available slot.

[0186] M=2 corresponds to possibility C, the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 2*4 available slots away from the reference available slot, i.e., the initial slot is the 9th available slot.

[0187] M=3 corresponds to possibility D, where the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is 3*4 available slots away from the reference available slot, i.e., the initial slot is the 13th available slot.

[0188] Optionally, when the first parameter is a quantity P of available slots in a configured grant periodicity, and the first parameter is not an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot within the configured grant periodicity that is a distance of M*N1 available slots from the reference available slot, where M is an integer, or the reference available slot is the last available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot within the configured grant periodicity that is a distance of M*N1-1 available slots from the reference available slot, where M is an integer greater than or equal to 1.

[0189] It should be noted that the initial slot being an available slot that is at a distance of M*N1-1 available slots from the reference available slot means that the difference between the sequence numbers of the available slots is M*N1-1, or the sequence number of the initial slot can be M*N1-1 greater than the sequence number of the reference available slot, or the sequence number of the reference available slot can be M*N1-1 greater than the sequence number of the initial slot.

[0190] As an example, refer to Figure 11(a). Figure 11 is a schematic diagram of another possibility for PUSCH transmission according to one embodiment of the present application. The first parameter may be the number P of available slots in the configured grant periodicity, where P = 16, and the second parameter is the number N of available slots in each repetition, where N = 3. In this case, P is not an integer multiple of N, the reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N available slots from the reference available slot.

[0191] M=0 corresponds to possibility A, and the initial slot is the available slot that is within the configured grant period and is at a distance of 0*3 available slots from the reference available slot, i.e., the initial slot is the first available slot.

[0192] M=1 corresponds to possibility B, where the initial slot is the available slot that is within the configured grant period and is 1*3 available slots away from the reference available slot, i.e., the initial slot is the 4th available slot.

[0193] M=2 corresponds to possibility C, and the initial slot is the available slot that is within the configured grant period and is a distance of 2*3 available slots from the reference available slot, i.e., the initial slot is the 7th available slot.

[0194] M=3 corresponds to possibility D, and the initial slot is the available slot that is within the configured grant period and is 3*3 available slots away from the reference available slot, i.e., the initial slot is the 10th available slot.

[0195] M=4 corresponds to possibility E, and the initial slot is the available slot that is within the configured grant period and is a distance of 4*3 available slots from the reference available slot, i.e., the initial slot is the 13th available slot.

[0196] For another example, refer to (a) of Figure 12. Figure 12 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application. The first parameter may be the number P of available slots in the configured grant periodicity, where P = 16, and the second parameter may be the number N of available slots in each repetition, where N = 3. In this case, P is not an integer multiple of N, the reference available slot is the last available slot among the available slots in the configured grant periodicity, i.e., the 16th available slot, the initial slot is an available slot within the configured grant periodicity and at a distance of M*N-1 available slots from the reference available slot, and M is an integer greater than or equal to 1.

[0197] M=1 corresponds to possibility E, and the initial slot is the available slot that is within the configured grant period and is 1*3-1 available slots away from the reference available slot, i.e., the initial slot is the 14th available slot.

[0198] M=2 corresponds to possibility D, and the initial slot is the available slot that is within the configured grant period and is a distance of 2*3-1 available slots from the reference available slot, i.e., the initial slot is the 11th available slot.

[0199] M=3 corresponds to possibility C, and the initial slot is the available slot that is within the configured grant period and is 3*3-1 available slots away from the reference available slot, i.e., the initial slot is the 8th available slot.

[0200] M=4 corresponds to possibility B, where the initial slot is the available slot that is within the configured grant period and is 4*3-1 available slots away from the reference available slot, i.e., the initial slot is the 5th available slot.

[0201] M=5 corresponds to possibility A, and the initial slot is the available slot that is within the configured grant period and is 5*3-1 available slots away from the reference available slot, i.e., the initial slot is the second available slot.

[0202] Optionally, the reference available slot is preset or the reference available slot is received by the terminal device from the network device.

[0203] It should be understood that the reference available slot is pre-set, and it can be understood that the reference available slot is specified in the protocol.

[0204] Optionally, M=A1*N2, where A1 is an integer greater than or equal to 0, and N2 is the minimum period of the RV.

[0205] It should be understood that N2 is the minimum period of RV, and the minimum period is the distance between two adjacent identical RVs in the RV sequence. For example, when the RV sequence is {0,0,0,0}, the minimum period of RV is 1; when the RV sequence is {0,3,0,3}, the minimum period of RV is 2; and when the RV sequence is {0,3,2,1}, the minimum period of RV is 4.

[0206] For example, see Figure 10(c). The RV sequence is {0,3,0,3}, the minimum period N2 = 2, and M = A1 * 2. When A1 = 0, M = 0, and the initial slot is the available slot at a distance of 0 * 4 available slots from the reference available slot, i.e., the first available slot in the configured grant periodicity, corresponding to possibility A.

[0207] When A1=1 and M=1*2, the initial slot is the available slot that is 2*4 available slots away from the reference available slot, i.e., the 9th available slot in the configured grant periodicity, corresponding to possibility B.

[0208] Optionally, when the first parameter or the second parameter is the number K of iterations in the configured grant periodicity, M is greater than or equal to 0 and less than or equal to K−1, and M is an integer, or when the first parameter and the second parameter are the number P of available slots in the configured grant periodicity and the number N of available slots in each iteration, M is greater than or equal to 0 and less than or equal to floor(P / N)−1, and M is an integer.

[0209] Optionally, the RV corresponding to the repetition carried in the initial slot is 0.

[0210] For example, see (a) and (b) of Figure 12. The RV corresponding to the repetition carried in the initial slot is 0.

[0211] In this technical solution, when the RV corresponding to the repetition carried in the initial slot is 0, the probability of successful advance decoding can be improved if the transmission starts from RV0, since RV0 essentially contains all system bits.

[0212] Optionally, the RV corresponding to the repetition carried in the initial slot is the Tth (Tth) RV in the RV sequence, where T=floor(S / N)+1, and S is the sequence number of the initial slot among the available slots in the configured grant periodicity.

[0213] It should be understood that S may start from 0 and T may start from 1. All available slots in the configured grant periodicity are numbered from 0, where all available slots are all P available slots or all N*K available slots.

[0214] For example, Figure 13 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application: If the number P of available slots in the configured grant periodicity is 16 and the number N of available slots included in each repetition is 4, then the configured grant periodicity includes 4 repetitions and the RV sequence is {0, 3, 0, 3}.

[0215] For possibility A, if the initial slot is the first available slot within the configured grant period, T=floor(0 / 4)+1, and the RV corresponding to the first iteration in which the initial slot is located is the first RV in the RV sequence, i.e., RV is 0.

[0216] For possibility B, if the sequence number of the initial slot among the available slots in the configured grant period is 5, then T = floor(4 / 4) + 1 = 2, and the RV corresponding to the second iteration in which the initial slot is located is the second RV in the RV sequence, i.e., RV is 3.

[0217] Similarly, if the sequence number of the initial slot among the available slots in the configured grant period is 9, the third RV in which the initial slot is located is the third RV in the RV sequence, ie, RV is 0.

[0218] For example, FIG. 14 is a schematic diagram of yet another possibility for PUSCH transmission according to one embodiment of the present application.

[0219] For (a) of Figure 14, the reference available slot is the first available slot among the available slots in the configured grant period, the available slots P (P=16) in the configured grant period are not an integer multiple of the number of available slots N (N=3) included in the repetition, and the RV sequence is {0, 3, 0, 3}.

[0220] For possibility A, the initial slot is the first available slot in the configured grant periodicity, i.e., the sequence number of the initial slot among the available slots in the configured grant periodicity is 0. In this case, T=floor(0 / 3)+1, and the RV corresponding to the first iteration in which the available slot corresponding to the initial slot is located is the first RV in the RV sequence, i.e., RV is 0.

[0221] For possibility B, if the sequence number of the initial slot among the available slots in the configured grant period is 4, then T = floor(3 / 3) + 1 = 2, and the RV corresponding to the first iteration in which the available slot corresponding to the initial slot is located is the second RV in the RV sequence, i.e., RV is 3.

[0222] Similarly, for possibility C, the RV corresponding to the third iteration in which the initial slot is located is the third RV in the RV sequence, i.e., RV is 0. For possibility D, the RV corresponding to the fourth iteration in which the initial slot is located is the fourth RV in the RV sequence, i.e., RV is 3.

[0223] For (b) of Figure 14, the reference available slot is the last one of the available slots in the configured grant period, the available slots P (P=16) in the configured grant period are not an integer multiple of the number of available slots N (N=3) included in the repetition, and the RV sequence is {0, 3, 0, 3}.

[0224] For possibility A, the initial slot is the first available slot in the configured grant periodicity, i.e., the sequence number of the initial slot among the available slots in the configured grant periodicity is 1. In this case, T=floor(1 / 3)+1, and the RV corresponding to the first iteration in which the initial slot is located is the first RV in the RV sequence, i.e., RV is 0.

[0225] For possibility B, if the sequence number of the initial slot among the available slots in the configured grant period is 4, then T=floor(4 / 3)+1, and the RV corresponding to the first iteration in which the initial slot is located is the second RV in the RV sequence, i.e., RV is 3.

[0226] Similarly, possibilities C, D, and E can be calculated in the same manner as above. For the sake of brevity, the details will not be explained again.

[0227] It should be understood that the technical solutions in the embodiments of the present application are also applicable when P is another value, for example, when P is 20, 24, 28, 32, or another value. For details, please refer to the above related descriptions. For the sake of brevity, the details will not be described again.

[0228] In this technical solution, the RV corresponding to the repetition in which the initial slot is located can be determined based on the position of the initial slot, which can simplify the complexity of transmitting the PUSCH by the terminal device.

[0229] Optionally, when the RV corresponding to the repetition carried in the initial slot is not 0, the RV used in at least one of all repetitions for transmission of the PUSCH with the configured grant is 0.

[0230] See, for example, Figure 13. Possibility D does not exist.

[0231] RV0 basically includes all system bits, and the remaining RVs except RV0 may only include some system bits. If only other RVs are transmitted, decoding may fail. This technical solution can improve the possibility of decoding in advance.

[0232] In addition, when the RV corresponding to the repetition carried in the initial slot is not 0, it can be guaranteed that the RV used to transmit the PUSCH in the same available slot is the same in different possibilities, which can reduce the complexity of the blind detection performed by the network device.

[0233] Optionally, when the first parameter is a number P of available slots in a configured grant periodicity, the second parameter is a number N of available slots in each iteration, the first parameter is not an integer multiple of the second parameter, and the reference available slot is the first available slot of the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last Pfloor(P / N)*N available slots. Or, the method may include: performing encoding based on a first RV and a number N of available slots, where the first RV is the RV corresponding to the repetition carried in the last Pfloor(P / N)*N available slots; and transmitting the results of the encoding from front to back in the last Pfloor(P / N)*N available slots.

[0234] It should be noted that in this specification, transmitting the encoding results front to back in the last Pfloor(P / N)*N available slots means that transmission starts from the first available slot in the last Pfloor(P / N)*N available slots.

[0235] For example, see (a) of Figure 14. The first parameter may be the number P of available slots in the configured grant periodicity (P=16), and the second parameter may be the number N of available slots in each iteration (N=4). That is, the first parameter is not an integer multiple of the second parameter, and the reference available slot is the first available slot in the configured grant periodicity.

[0236] The last P-floor(P / N)*N=16-floor(16 / 3)*3=1 available slots are not used to transmit PUSCH.

[0237] Alternatively, the terminal device encodes the PUSCH with the configured grant based on the first RV and the number N of available slots. Here, the RV corresponding to the repetition carried in the last P-floor(P / N)*N=16-floor(16 / 3)*3=1 available slots is 3, i.e., the first RV is 3. In this case, the terminal device also encodes the PUSCH with the configured grant in the last available slot and transmits the encoding result in the last available slot. In this case, a portion of the content may be transmitted, resulting in efficient resource utilization and improved resource utilization. Optionally, when the first parameter is the number P of available slots in the configured grant periodicity and the second parameter is the number K of repetitions in the configured grant periodicity, the first parameter is not an integer multiple of the second parameter, and the reference available slot is the first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last Pfloor(P / K)*K available slots. Alternatively, the method may further comprise: encoding a PUSCH with the configured grant based on a first RV and a number N of available slots, where the first RV is the RV corresponding to a repetition carried in the last Pfloor(P / K)*K available slots; and transmitting the encoding results from front to back in the last Pfloor(P / K)*K available slots.

[0238] For technical solutions, please refer to the relevant descriptions above, and for the sake of brevity, the details will not be described again.

[0239] 15 is a schematic block diagram of a communication device according to one embodiment of the present application. As shown in FIG. 15, the communication device 1500 includes a transceiver unit 1510 and a processing unit 1520.

[0240] The transceiver unit 1510 is configured to receive first and second parameters transmitted by a network device. The processing unit 1520 is configured to determine an initial slot for transmission of a physical uplink shared channel (PUSCH) with the configured grant based on the first and second parameters. The processing unit 1520 is further configured to perform transmission of the PUSCH with the configured grant based on the initial slot. The first and second parameters are any two of the following parameters: a number P of available slots in a configured grant periodicity; a number K of repetitions in the configured grant periodicity; and a number N of available slots in each repetition, where N is an integer greater than or equal to 2, and one transport block cyclic redundancy check code is carried in each repetition.

[0241] Optionally, the first parameter and the second parameter are carried in radio resource control (RRC) signaling, or the first parameter and the second parameter are carried in activation downlink control information (DCI), or the first parameter is carried in RRC signaling and the second parameter is carried in activation DCI, or the first parameter is carried in activation DCI and the second parameter is carried in RRC signaling.

[0242] Optionally, when the first parameter is a number P of available slots in the configured grant periodicity, and the second parameter is a number K of repetitions, the number P of available slots in the configured grant periodicity is an integer multiple of the number K of repetitions; or If the second parameter is the number N of available slots in each iteration, the number P of available slots in the configured grant periodicity is an integer multiple of the number N of available slots in each iteration.

[0243] Optionally, when the first and second parameters are the number of iterations K and the number of available slots N in each iteration, the number of available slots in the configured grant periodicity is K*N.

[0244] Optionally, the initial slot is an available slot within the configured grant period and at a distance of M*N1 available slots from the reference available slot, where M is an integer, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when one of the first parameter and the second parameter is the number P of available slots within the configured grant period and the other is the number K of repetitions within the configured grant period. Alternatively, the initial slot is an available slot that is within a configured grant period and is a distance of M*N1-1 available slots from the reference available slot, where M is an integer, and N1=N when the first parameter or the second parameter is the number N of available slots in each repetition, and N1=floor(P / K) or N1=ceiling(P / K) when one of the first parameter and the second parameter is the number P of available slots in a configured grant period and the other is the number K of repetitions in a configured grant period.

[0245] Optionally, when the first parameter and the second parameter are a number K of iterations in a configured grant periodicity and a number N of available slots in each iteration, or when the first parameter is a number P of available slots in a configured grant periodicity and the first parameter is an integer multiple of the second parameter; The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is the available slot that is within the configured grant periodicity and is a distance of M*N1 available slots from the reference available slot.

[0246] Optionally, when the first parameter is a quantity P of available slots in a configured grant periodicity, and the first parameter is not an integer multiple of the second parameter, The reference available slot is the first available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1 available slots from the reference available slot, where M is an integer; or the reference available slot is the last available slot among the available slots in the configured grant periodicity, and the initial slot is an available slot that is within the configured grant period and is a distance of M*N1-1 available slots from the reference available slot, where M is an integer greater than or equal to 1.

[0247] Optionally, the reference available slot is pre-set or the reference available slot is received by the terminal device from the network device.

[0248] Optionally, the processing unit 1520 is specifically configured to determine an initial slot for transmission of a physical uplink shared channel (PUSCH) with the configured grant based on a redundancy version (RV) sequence, a first parameter, and a second parameter, where the redundancy version (RV) sequence is received by the terminal device from the network device.

[0249] Optionally, M=A1*N2, where A1 is an integer greater than or equal to 0, and N2 is the minimum period of the RV.

[0250] Optionally, one RV is used in one repetition, and the RVs in the RV sequence are used cyclically in all repetitions for transmission of the PUSCH with the configured grant.

[0251] Optionally, the RV corresponding to the repetition carried in the initial slot is 0.

[0252] Optionally, when the first parameter or the second parameter is the number K of repetitions in the configured grant periodicity, M is greater than or equal to 0 and less than or equal to K-1, and M is an integer; or when the first parameter and the second parameter are the number P of available slots in the configured grant periodicity and the number N of available slots in each repetition, M is greater than or equal to 0 and less than or equal to floor(P / N)-1, and M is an integer.

[0253] Optionally, the processing unit 1520 is configured to encode the PUSCH with the configured grant based on the RV corresponding to each repetition of the transmission of the PUSCH with the configured grant, specifically from the repetition carried in the initial slot, and to perform the transmission of the PUSCH with the configured grant based on the result of the encoding.

[0254] Optionally, the RV corresponding to the repetition carried in the initial slot is 0.

[0255] Optionally, the RV corresponding to the repetition carried in the initial slot is the Tth (Tth) RV in the RV sequence, where T=floor(S / N)+1, and S is the sequence number of the initial slot among the available slots within the configured grant period.

[0256] Optionally, when the first parameter is a number P of available slots in the configured grant periodicity, and the second parameter is a number N of available slots in each iteration, and the first parameter is not an integer multiple of the second parameter, and the reference available slot is the first available slot of the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last P-floor(P / N)*N available slots; or the processing unit 1520 further performs: encoding a PUSCH with the configured grant based on a first RV and a number N of available slots, where the first RV is an RV corresponding to a repetition carried in the last P-floor(P / N)*N available slots; and transmitting the encoding results from front to back in the last P-floor(P / N)*N available slots.

[0257] Optionally, when the first parameter is a number P of available slots in the configured grant periodicity, and the second parameter is a number K of repetitions in the configured grant periodicity, and the first parameter is not an integer multiple of the second parameter, and the reference available slot is the first available slot among the available slots in the configured grant periodicity, the PUSCH is not transmitted in the last P-floor(P / K)*K available slots; or the processing unit 1520 further encode the PUSCH with the configured grant based on a first RV and a number N of available slots, where the first RV is an RV corresponding to a repetition carried in the last P-floor(P / K)*K available slots; It is configured to transmit the encoding results from front to back in the last Pfloor(P / K)*K available slots.

[0258] An embodiment of the present application further provides a communication device including at least one processor, the at least one processor coupled to at least one memory, and the at least one processor configured to execute computer programs or instructions stored in the at least one memory, such that a communication method according to any one of the preceding embodiments is performed.

[0259] An embodiment of the present application further provides a chip, the chip comprising a processor and an interface circuit, the processor and the interface circuit being coupled to each other, the interface circuit being configured to communicate with another device, and signals being processed by the processor to thereby implement the communication method according to any one of the previous embodiments.

[0260] An embodiment of the present application further provides a computer-readable storage medium having computer instructions stored thereon, which, when executed on a computer, perform a communication method according to any one of the preceding embodiments.

[0261] An embodiment of the present application further provides a computer program product including computer program code, which, when executed on a computer, performs the communication method according to any one of the preceding embodiments.

[0262] Additionally, one embodiment of the present application further provides an apparatus. The apparatus may specifically be a chip, an assembly, or a module. The apparatus may include a processor and a memory interconnected. The memory is configured to store computer-executable instructions. When the apparatus operates, the processor may execute the computer-executable instructions stored in the memory to enable the chip to perform the method in the above-described method embodiment.

[0263] The communication device, the computer-readable storage medium, the computer program product, or the chip provided in the embodiments is configured to implement the corresponding method provided above. Therefore, for the beneficial effects that can be achieved by the communication device, the computer-readable storage medium, the computer program product, or the chip, please refer to the beneficial effects of the corresponding method provided above. The details will not be described again in this specification.

[0264] Those skilled in the art can recognize that, in combination with the examples described in the embodiments disclosed herein, the units and algorithm steps can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether a function is performed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but the implementation should not be considered beyond the scope of this application.

[0265] Those skilled in the art will clearly understand that for convenience of description, the detailed operation processes of the aforementioned systems, devices and units may refer to the corresponding processes in the aforementioned method embodiments, and the details will not be described again in this specification.

[0266] In some embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the described device embodiments are merely examples. For example, the division into units is merely a logical division of function, and actual implementation may be other divisions. For example, multiple units or assemblies may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the shown or described mutual couplings, or direct couplings, or communication connections may be implemented by using some interfaces. Indirect couplings or communication connections between devices or units may be implemented in electronic, mechanical, or other forms.

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

[0268] In addition, the functional units in the embodiments of the present application may be integrated into one processing unit, each of which may exist physically alone, or two or more units may be integrated into one unit.

[0269] When a function is implemented in the form of a software functional unit and sold or used as an independent product, the function may be stored in a computer-readable storage medium. Based on this understanding, essentially, the technical solution of the present application, or a portion of the technical solution, or a portion of the technical solution, may be implemented in the form of a software product. The software product is stored in a storage medium and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. The aforementioned storage medium includes any medium capable of storing 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.

[0270] The above description is merely a specific implementation of the present application, but is not intended to limit the scope of protection of the present application. Any variations or replacements that can be easily conceived by those skilled in the art within the technical scope disclosed in the present application shall fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be subject to the scope of protection of the claims.

Claims

1. A communication method implemented by a terminal device or a chip of said terminal device, comprising: receiving a first parameter and a second parameter transmitted by the network device; determining an initial slot for transmission of a Physical Uplink Shared Channel (PUSCH) with a configured grant based on the first parameter and the second parameter; and performing transmission of the PUSCH with the configured grant based on the initial slot; The first parameter and the second parameter are the number of iterations K in the constructed Grant periodicity, and the number N of available slots in each repetition, where N is an integer greater than or equal to 2, and one transport block cyclic redundancy check code is carried in each repetition; and The initial slot is an available slot that is within a configured grant period and is a distance of M*N1 available slots from a reference available slot, where M is an integer and N1=N; and the reference available slot is a first available slot among available slots in the configured grant periodicity. method.

2. the first parameter and the second parameter are carried in radio resource control (RRC) signaling, or the first parameter and the second parameter are carried in activation downlink control information DCI, or the first parameter is carried in RRC signaling and the second parameter is carried in an activation DCI, or the first parameter is carried in an activation DCI and the second parameter is carried in RRC signaling. The method of claim 1.

3. The number of available slots in the configured grant periodicity is K*N. The method of claim 1.

4. determining an initial slot for transmission of a PUSCH with a configured grant based on the first parameter and the second parameter, determining the initial slot for transmission of a Physical Uplink Shared Channel (PUSCH) with the configured grant based on a redundancy version RV sequence, the first parameter, and the second parameter, wherein the redundancy version RV sequence is received by the terminal device from the network device; The method of claim 1 , comprising:

5. M=A1*N2, A1 is an integer equal to or greater than 0, and N2 is the minimum period of the RV. The method of claim 4.

6. The RV corresponding to the repetition carried in the initial slot is 0. The method of claim 1.

7. 1. A communication method implemented by a network device or a chip of said network device, comprising: transmitting first and second parameters to a terminal device, the first and second parameters being used to determine an initial slot for transmission of a Physical Uplink Shared Channel (PUSCH) with the configured grant; detecting a transmission of the PUSCH with the configured grant based on the initial slot; The first parameter and the second parameter are the number of iterations K in the constructed Grant periodicity, the number N of available slots in each repetition, where N is an integer greater than or equal to 2, and one transport block cyclic redundancy check code is carried in each repetition; and The initial slot is an available slot that is within a configured grant period and is a distance of M*N1 available slots from a reference available slot, where M is an integer and N1=N; and the reference available slot is a first available slot among available slots in the configured grant periodicity. method.

8. The number of available slots in the configured grant periodicity is K*N. The method of claim 7.

9. The method further comprises: determining the initial slot for transmission of a Physical Uplink Shared Channel (PUSCH) with the configured grant based on a redundancy version RV sequence, the first parameter, and the second parameter, wherein the redundancy version RV sequence is transmitted from the network device to the terminal device; The method of claim 7, comprising:

10. M=A1*N2, A1 is an integer equal to or greater than 0, and N2 is the minimum period of the RV.

10. The method of claim 9.

11. The RV corresponding to the repetition carried in the initial slot is 0. The method of claim 7.

12. A communication device, a module configured to perform the method of any one of claims 1 to 6, Communication equipment.

13. 1. A communications device comprising at least one processor, the at least one processor is coupled to at least one memory; and The at least one processor is configured to execute computer programs or instructions stored in the at least one memory to perform the method of any one of claims 1 to 6. Communication equipment.

14. A chip, the chip includes a processor and an interface circuit; the processor and the interface circuit are coupled to each other; the interface circuitry is configured to communicate with another device; and The processor processes the signal to implement the method of any one of claims 1 to 6. Tips.

15. 1. A computer-readable storage medium, comprising: the storage medium stores computer programs or instructions; When the computer program or the instructions are executed by a communication device, the method according to any one of claims 1 to 6 is carried out. A computer-readable storage medium.

16. A communication device, a module configured to perform the method of any one of claims 7 to 11, Communication equipment.

17. A communication device comprising at least one processor, the at least one processor is coupled to at least one memory; and The at least one processor is configured to execute computer programs or instructions stored in the at least one memory to perform the method of any one of claims 7 to 11. Communication equipment.

18. A chip comprising: the chip includes a processor and an interface circuit; the processor and the interface circuit are coupled to each other; the interface circuitry is configured to communicate with another device; and The processor processes the signal to implement the method of any one of claims 7 to 11. Tips.

19. A computer-readable storage medium, comprising: the storage medium stores computer programs or instructions; When the computer program or the instructions are executed by a communication device, the method according to any one of claims 7 to 11 is carried out. A computer-readable storage medium.

Images