Communication method and communication device

Abstract

The invention provides a communication method, the method is executed by a terminal device, and the method comprises the steps: obtaining the configuration information of a first configuration authorization CG, the configuration information of the first CG comprises the information of the period of the first CG, the information of the first CG opportunity is determined based on a first rounding value, the first rounding value is associated with the period of the first CG and a first rounding operation, and the first CG opportunity is determined based on the first rounding operation. The unit of the first rounding value is not a symbol. According to the technical scheme, under the condition that the CG period supports the non-integer period, the PUSCH time slot crossing condition can be avoided.

Description

Technical Field

[0001] The present application relates to the field of communications, and more specifically, to a communication method and a communication device. Background Art

[0002] Extended reality (XR) refers to all real and virtual combined environments and human-computer interactions generated by computer technology and wearable devices. It includes the following fields: virtual reality (AR), mixed reality (MR), augmented reality (VR), etc.

[0003] The XR service may be a periodic arrival service, and the period of the XR service may be a non-integer. In order to match the configured grant (CG) with the XR service, a non-integer CG period may be used.

[0004] When CG supports non-integer cycles, how to avoid the physical uplink shared channel (PUSCH) from crossing time slots becomes an urgent problem to be solved. Summary of the invention

[0005] The present application provides a communication method and a communication device, which can avoid the situation where PUSCH crosses time slots when the CG period supports non-integer periods. Further, it is helpful to reduce the implementation complexity and / or implementation cost of terminal equipment and / or network equipment.

[0006] In a first aspect, a communication method is provided, which is executed by a terminal device. The terminal device here may refer to the terminal device itself, or may refer to a processor, module, chip, or chip system in the terminal device that implements the method, and the method includes: obtaining configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; determining information about the timing of the first CG based on a first rounded value, the first rounded value being associated with the period of the first CG and a first rounding operation, and the unit of the first rounded value is not a symbol.

[0007] According to the technical solution provided in the present application, the terminal device obtains the configuration information of the first CG, and the configuration information of the first CG includes the information of the period of the first CG. The terminal device determines the information of the first CG timing based on the first rounded value, wherein the first rounded value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounded value is not a symbol. Based on the above technical solution, it is possible to avoid the situation where the PUSCH crosses time slots when the period of the CG is a non-integer. Furthermore, it is helpful to reduce the implementation complexity and / or implementation cost of the terminal device and / or network device.

[0008] In combination with the first aspect, in certain implementations of the first aspect, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG × N}; or, the first rounded value is F{the period of the first CG × N × X}; wherein N is a non-negative integer, F{} represents a first rounding operation, and X is the number of time slots contained in one millisecond or one subframe.

[0009] In combination with the first aspect, in certain implementations of the first aspect, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Y}; or, the first rounded value is F{the period of the first CG×N÷Z}; wherein N is a non-negative integer, F{} represents a first rounding operation, Y is the number of symbols contained in one millisecond or one subframe, and Z is the number of symbols contained in one time slot.

[0010] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y; wherein Y is the number of symbols contained in one millisecond or one subframe.

[0011] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG×N}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value×Y+(K-1)×Z; wherein Y is the number of symbols contained in one millisecond or one subframe, Z is the number of symbols contained in one time slot, K≥1, and K is an integer.

[0012] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N × X}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z; wherein Z is the number of symbols contained in a time slot.

[0013] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG×N×X}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value×Z+(K-1)×Z; wherein Z is the number of symbols contained in a time slot, K≥1, and K is an integer.

[0014] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N ÷ Y}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y; wherein Y is the number of symbols contained in one millisecond or one subframe.

[0015] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N ÷ Y}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y + (K-1) × Z; wherein Y is the number of symbols contained in one millisecond or one subframe, K ≥ 1, and K is an integer.

[0016] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N ÷ Z}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z; wherein Z is the number of symbols contained in a time slot.

[0017] In combination with the first aspect, in certain implementations of the first aspect, when the first rounded value is F{the period of the first CG × N ÷ Z}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z + (K-1) × Z; wherein Z is the number of symbols contained in a time slot, K ≥ 1, and K is an integer.

[0018] In combination with the first aspect, in certain implementations of the first aspect, the information of the first CG opportunity includes information of frames, time slots, and symbols.

[0019] In combination with the first aspect, in certain implementations of the first aspect, the first rounding value is associated with the period of the first CG, N, and the first rounding operation, where N≥0 and N is an integer.

[0020] In combination with the first aspect, in certain implementations of the first aspect, when the unit of the period of the first CG is millisecond or subframe, the first rounded value is F{the period of the first CG×N}; or, when the unit of the period of the first CG is symbol, the first rounded value is F{the period of the first CG×N÷Y}, where Y is the number of symbols contained in one millisecond or one subframe.

[0021] In combination with the first aspect, in certain implementations of the first aspect, when the unit of the period of the first CG is millisecond or subframe, the first rounded value is F{the period of the first CG×N×X}, where X is the number of time slots contained in one millisecond or one subframe; or, when the unit of the period of the first CG is symbol, the first rounded value is F{the period of the first CG×N÷Z}, where Z is the number of symbols contained in one time slot.

[0022] In combination with the first aspect, in certain implementations of the first aspect, the information determining the first CG opportunity based on the first rounded value includes: information determining the first CG opportunity based on the first rounded value ×X+(K-1), wherein X is the number of time slots contained in one millisecond or one subframe, K≥1, and K is an integer.

[0023] In combination with the first aspect, in certain implementations of the first aspect, information of the first CG timing is determined based on the first rounded value + (K-1), where K≥1 and K is an integer.

[0024] In combination with the first aspect, in certain implementations of the first aspect, the information of the first CG opportunity includes frame and time slot information, but does not include symbol information.

[0025] In combination with the first aspect, in certain implementations of the first aspect, the first CG opportunity is a CG opportunity in the Nth CG cycle, or the first CG opportunity is a CG opportunity in the N+1th CG cycle, where N≥0 and N is an integer.

[0026] In combination with the first aspect, in certain implementations of the first aspect, the first CG opportunity is the Kth CG opportunity in the Nth CG cycle, or the first CG opportunity is the Kth CG opportunity in the N+1th CG cycle, wherein N≥0, K≥1, and N and K are both integers.

[0027] In combination with the first aspect, in some implementations of the first aspect, the first rounding operation includes any one of the following operations: rounding up, rounding down, and rounding off.

[0028] In a second aspect, a communication method is provided, which is executed by a network device. The network device here can refer to the network device itself or a processor, module, chip, or chip system that implements the method in the network device. The method includes: sending configuration information of a first configuration authorization CG, the configuration information of the first CG includes information about the period of the first CG; determining information about the timing of the first CG based on a first rounded value, the first rounded value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounded value is not a symbol.

[0029] According to the technical solution of the present application, the network device sends the configuration information of the first CG to the terminal device, and the configuration information of the first CG includes the period information of the first CG. The first rounded value is associated with the period information of the first CG and the first rounding operation, and the unit of the first rounded value is not a symbol. The network device determines the information of the first CG timing based on the first rounded value. Based on the above technical solution, it is possible to avoid the situation where the PUSCH crosses time slots when the period of the CG is a non-integer. Furthermore, it is helpful to reduce the implementation complexity and / or implementation cost of the terminal device and / or network device.

[0030] In combination with the second aspect, in certain implementations of the second aspect, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG × N}; or, the first rounded value is F{the period of the first CG × N × X}; wherein N is a non-negative integer, F{} represents a first rounding operation, and X is the number of time slots contained in one millisecond or one subframe.

[0031] In combination with the second aspect, in certain implementations of the second aspect, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Y}; or, the first rounded value is F{the period of the first CG×N÷Z}; wherein N is a non-negative integer, F{} represents a first rounding operation, Y is the number of symbols contained in one millisecond or one subframe, and Z is the number of symbols contained in one time slot.

[0032] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y; wherein Y is the number of symbols contained in one millisecond or one subframe.

[0033] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG×N}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value×Y+(K-1)×Z; wherein Y is the number of symbols contained in one millisecond or one subframe, Z is the number of symbols contained in one time slot, K≥1, and K is an integer.

[0034] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N × X}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z; wherein Z is the number of symbols contained in a time slot.

[0035] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG×N×X}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value×Z+(K-1)×Z; wherein Z is the number of symbols contained in a time slot, K≥1, and K is an integer.

[0036] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N ÷ Y}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y; wherein Y is the number of symbols contained in one millisecond or one subframe.

[0037] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N ÷ Y}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Y + (K-1) × Z; wherein Y is the number of symbols contained in one millisecond or one subframe, K ≥ 1, and K is an integer.

[0038] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N ÷ Z}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z; wherein Z is the number of symbols contained in a time slot.

[0039] In combination with the second aspect, in certain implementations of the second aspect, when the first rounded value is F{the period of the first CG × N ÷ Z}, the information for determining the first CG timing based on the first rounded value includes: information for determining the first CG timing based on the first rounded value × Z + (K-1) × Z; wherein Z is the number of symbols contained in a time slot, K ≥ 1, and K is an integer.

[0040] In combination with the second aspect, in certain implementations of the second aspect, the information of the first CG opportunity includes information of frames, time slots and symbols.

[0041] In combination with the second aspect, in certain implementations of the second aspect, the first rounding value is associated with the period of the first CG, N and the first rounding operation, where N≥0 and N is an integer.

[0042] In combination with the second aspect, in certain implementations of the second aspect, when the unit of the period of the first CG is millisecond or subframe, the first rounded value is F{the period of the first CG × N}; or, when the unit of the period of the first CG is symbol, the first rounded value is F{the period of the first CG × N ÷ Y}, where Y is the number of symbols contained in one millisecond or one subframe.

[0043] In combination with the second aspect, in certain implementations of the second aspect, when the unit of the period of the first CG is millisecond or subframe, the first rounded value is F{the period of the first CG×N×X}, where X is the number of time slots contained in one millisecond or one subframe; or, when the unit of the period of the first CG is symbol, the first rounded value is F{the period of the first CG×N÷Z}, where Z is the number of symbols contained in one time slot.

[0044] In combination with the second aspect, in certain implementations of the second aspect, the information of determining the first CG opportunity based on the first rounded value includes: determining the information of the first CG opportunity based on the first rounded value ×X+(K-1), wherein X is the number of time slots contained in one millisecond or one subframe, K≥1, and K is an integer.

[0045] In combination with the second aspect, in certain implementations of the second aspect, the information of determining the first CG timing based on the first rounded value includes: information of determining the first CG timing based on the first rounded value + (K-1), where K≥1 and K is an integer.

[0046] In combination with the second aspect, in certain implementations of the second aspect, the information of the first CG opportunity includes frame and time slot information, but does not include symbol information.

[0047] In combination with the second aspect, in certain implementations of the second aspect, the first CG opportunity is a CG opportunity in the Nth CG cycle, or the first CG opportunity is a CG opportunity in the N+1th CG cycle, where N≥0 and N is an integer.

[0048] In combination with the second aspect, in certain implementations of the second aspect, the first CG opportunity is the Kth CG opportunity in the Nth CG cycle, or the first CG opportunity is the Kth CG opportunity in the N+1th CG cycle, wherein N≥0, K≥1, and N and K are both integers.

[0049] In combination with the second aspect, in some implementations of the second aspect, the first rounding operation includes any one of the following operations: rounding up, rounding down, and rounding off.

[0050] According to a third aspect, a communication method is provided, which is executed by a terminal device. The terminal device here may refer to the terminal device itself or to a processor, module, chip, or chip system that implements the method in the terminal device. The method includes: obtaining configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[0051] According to the technical solution provided in the present application, the terminal device obtains the configuration information of the first CG, and the configuration information of the first CG includes the information of the period of the first CG. The terminal device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the terminal device determines to offset the time domain position of the first CG opportunity. The ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot. Based on the above technical solution, it is possible to avoid the situation where PUSCH crosses time slots when the period of the CG is a non-integer. Furthermore, it is beneficial to reduce the implementation complexity and / or implementation cost of the terminal device and / or network device.

[0052] In combination with the third aspect, in certain implementations of the third aspect, the end position of the first CG opportunity after the offset is located in the first time slot, including: the end position of the first CG opportunity is located in the last symbol of the first time slot; or, the end position of the first CG opportunity is located at a symbol other than the last symbol in the first time slot.

[0053] In combination with the third aspect, in certain implementations of the third aspect, the starting position of the first CG opportunity after the offset is located in the second time slot, including: the starting position of the first CG opportunity after the offset is located in the first symbol of the second time slot; or, the starting position of the first CG opportunity after the offset is located in a symbol in the second time slot other than the first symbol.

[0054] In a fourth aspect, a communication method is provided, which is executed by a network device. The network device here may refer to the network device itself, or to a processor, module, chip, or chip system that implements the method in the network device. The method includes: sending configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[0055] According to the technical solution provided in the present application, the network device sends the configuration information of the first CG to the terminal device, and the configuration information of the first CG includes the information of the period of the first CG. The network device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the network device determines to offset the time domain position of the first CG opportunity. The ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot. Based on the above technical solution, it is possible to avoid the situation where PUSCH crosses time slots when the period of CG is non-integer. Furthermore, it is beneficial to reduce the implementation complexity and / or implementation cost of the network device and / or network device.

[0056] In combination with the fourth aspect, in certain implementations of the fourth aspect, the end position of the first CG opportunity after the offset is located in the first time slot, including: the end position of the first CG opportunity is located at the last symbol of the first time slot; or, the end position of the first CG opportunity is located at a symbol other than the last symbol in the first time slot.

[0057] In combination with the fourth aspect, in certain implementations of the fourth aspect, the starting position of the first CG opportunity after the offset is located in the second time slot, including: the starting position of the first CG opportunity after the offset is located in the first symbol of the second time slot; or, the starting position of the first CG opportunity after the offset is located in a symbol other than the first symbol in the second time slot.

[0058] In a fifth aspect, a communication method is provided, which is executed by a terminal device. The terminal device here may refer to the terminal device itself, or to a processor, module, chip, or chip system that implements the method in the terminal device. The method includes: obtaining configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity.

[0059] According to the technical solution provided in the present application, the terminal device obtains the configuration information of the first CG, and the configuration information of the first CG includes the information of the period of the first CG. The terminal device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the terminal device determines the time domain position of the first CG opportunity based on the second CG opportunity. Among them, the second CG opportunity is different from the first CG opportunity, and the starting position and the ending position of the first CG opportunity determined by the terminal device based on the second CG opportunity are located in the same time slot. Based on the above technical solution, it is possible to avoid the situation where PUSCH crosses time slots when the period of CG is non-integer. Furthermore, it is beneficial to reduce the implementation complexity and / or implementation cost of the terminal device and / or network equipment.

[0060] In combination with the fifth aspect, in certain implementations of the fifth aspect, the second CG opportunity is a CG opportunity in the Mth CG cycle, where M is equal to 0, or M is equal to 1.

[0061] In combination with the fifth aspect, in certain implementations of the fifth aspect, the second CG opportunity is a CG opportunity in the first N cycles of the CG cycle in which the first CG opportunity is located, where N≥1 and N is an integer.

[0062] In combination with the fifth aspect, in certain implementations of the fifth aspect, the information of the second CG opportunity includes the starting symbol included in the configuration information of the first CG.

[0063] In combination with the fifth aspect, in certain implementations of the fifth aspect, the information of the second CG opportunity includes the starting symbol of the second CG opportunity.

[0064] In combination with the fifth aspect, in certain implementations of the fifth aspect, the determining the time domain position of the first CG opportunity based on the information of the second CG opportunity includes: determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the first time slot, or determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the second time slot.

[0065] In a sixth aspect, a communication method is provided, which is executed by a network device. The network device here may refer to the network device itself, or may refer to a processor, module, chip, or chip system in the network device that implements the method. The method includes: sending configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity.

[0066] According to the technical solution provided in the present application, the network device sends the configuration information of the first CG to the terminal device, and the configuration information of the first CG includes the information of the period of the first CG. The network device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the network device determines the time domain position of the first CG opportunity based on the second CG opportunity. Among them, the second CG opportunity is different from the first CG opportunity, and the starting position and the ending position of the first CG opportunity determined by the network device based on the second CG opportunity are located in the same time slot. Based on the above technical solution, when the period of the CG is non-integer, the situation where PUSCH crosses time slots can be avoided. Furthermore, it is beneficial to reduce the implementation complexity and / or implementation cost of the network device and / or network device.

[0067] In combination with the sixth aspect, in certain implementations of the sixth aspect, the second CG opportunity is a CG opportunity in the Mth CG cycle, where M is equal to 0, or M is equal to 1.

[0068] In combination with the sixth aspect, in certain implementations of the sixth aspect, the second CG opportunity is a CG opportunity in the first N cycles of the CG cycle in which the first CG opportunity is located, where N≥1 and N is an integer.

[0069] In combination with the sixth aspect, in certain implementations of the sixth aspect, the information of the second CG opportunity includes the starting symbol included in the configuration information of the first CG.

[0070] In combination with the sixth aspect, in certain implementations of the sixth aspect, the information of the second CG opportunity includes the starting symbol of the second CG opportunity.

[0071] In combination with the sixth aspect, in certain implementations of the sixth aspect, the determining the time domain position of the first CG opportunity based on the information of the second CG opportunity includes: determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the first time slot, or determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the second time slot.

[0072] In the seventh aspect, a communication method is provided, which is executed by a terminal device. The terminal device here may refer to the terminal device itself, or may refer to a processor, module, chip, or chip system that implements the method in the terminal device, and the method includes: obtaining configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, ignoring the first CG opportunity; or, ignoring the part of the first CG opportunity in the first time slot; or, ignoring the part of the first CG opportunity in the second time slot.

[0073] According to the technical solution provided in the present application, the terminal device obtains the configuration information of the first CG, and the configuration information of the first CG includes the information of the period of the first CG. The terminal device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the terminal device ignores the first CG opportunity, or ignores the part of the first CG opportunity in the first time slot, or ignores the part of the first CG opportunity in the second time slot. Among them, ignoring the first CG opportunity can be understood as determining that the first CG opportunity is an invalid opportunity. That is, the terminal device does not send data on the ignored first CG opportunity. Based on the above technical solution, it is possible to avoid the situation where PUSCH crosses time slots when the period of CG is non-integer. Furthermore, it is conducive to reducing the implementation complexity and / or implementation cost of network devices and / or network devices.

[0074] In combination with the seventh aspect, in certain implementations of the seventh aspect, ignoring the first CG opportunity includes: determining that the first CG opportunity is an invalid CG opportunity.

[0075] In combination with the seventh aspect, in certain implementations of the seventh aspect, the period of the first CG is a non-integer.

[0076] In combination with the seventh aspect, in certain implementations of the seventh aspect, the first CG is associated with an extended reality XR service.

[0077] In an eighth aspect, a communication method is provided, which is executed by a network device. The network device here may refer to the network device itself, or may refer to a processor, module, chip, or chip system in the network device that implements the method, and the method includes: sending configuration information of a first configuration authorization CG, the configuration information of the first CG including information about the period of the first CG; if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, ignoring the first CG opportunity; or, ignoring the part of the first CG opportunity in the first time slot; or, ignoring the part of the first CG opportunity in the second time slot.

[0078] According to the technical solution provided in the present application, the network device sends the configuration information of the first CG to the terminal device, and the configuration information of the first CG includes the information of the period of the first CG. The network device determines the information of the first CG opportunity based on the configuration information of the first CG. If the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, the network device ignores the first CG opportunity, or ignores the part of the first CG opportunity in the first time slot, or ignores the part of the first CG opportunity in the second time slot. Among them, ignoring the first CG opportunity can be understood as determining that the first CG opportunity is an invalid opportunity. That is, the network device does not receive data on the ignored first CG opportunity. Based on the above technical solution, it is possible to avoid the situation where PUSCH crosses time slots when the period of CG is non-integer. Furthermore, it is conducive to reducing the implementation complexity and / or implementation cost of the network device and / or network device.

[0079] In combination with the eighth aspect, in certain implementations of the eighth aspect, ignoring the first CG opportunity includes: determining that the first CG opportunity is an invalid CG opportunity.

[0080] In combination with the eighth aspect, in certain implementations of the eighth aspect, the period of the first CG is a non-integer.

[0081] In combination with the eighth aspect, in certain implementations of the eighth aspect, the first CG is associated with an extended reality XR service.

[0082] In the ninth aspect, a communication device is provided, which includes a unit or module for executing the method in the first aspect or any possible implementation of the first aspect, or includes a unit or module for executing the method in the third aspect or any possible implementation of the third aspect, or includes a unit or module for executing the method in the fifth aspect or any possible implementation of the fifth aspect, or includes a unit or module for executing the method in the seventh aspect or any possible implementation of the seventh aspect.

[0083] In the ninth aspect, the communication device may be a terminal device, or a processor, module, chip, or chip system in the terminal device.

[0084] In the tenth aspect, a communication device is provided, which includes a unit or module for executing the method in the second aspect or any possible implementation of the second aspect, or includes a unit or module for executing the method in the fourth aspect or any possible implementation of the fourth aspect, or includes a unit or module for executing the method in the sixth aspect or any possible implementation of the sixth aspect, or includes a unit or module for executing the method in the eighth aspect or any possible implementation of the eighth aspect.

[0085] In the tenth aspect, the communication device may be a network device, or a processor, module, chip, or chip system in the network device.

[0086] In an eleventh aspect, a communication device is provided, comprising a processor, wherein the processor is configured to execute a method as in the first aspect or any aspect from the first to the eighth aspect or any possible implementation thereof.

[0087] In combination with the eleventh aspect, in certain implementations of the eleventh aspect, the communication device also includes a memory for storing computer programs or instructions; accordingly, the processor is used to execute the computer programs or instructions stored in the memory to implement a method as in the first aspect or any one of aspects one to eight or any possible implementation thereof.

[0088] In the eleventh aspect, the communication device may be a terminal device or a network device, or may be a processor, module, chip, or chip system in the terminal device or the network device.

[0089] In the twelfth aspect, a computer-readable storage medium is provided, which includes a computer program or instructions. When the computer program or the instructions are executed on a computer, the computer executes a method as in any one of the first to eighth aspects or any possible implementation thereof.

[0090] In the thirteenth aspect, a computer program product is provided, which includes instructions, which, when executed on a computer, cause the computer to execute a method from the first aspect or any possible implementation of the first aspect to a method for executing the eighth aspect or any possible implementation of the eighth aspect.

[0091] In a fourteenth aspect, a communication system is provided, comprising a terminal device for implementing the method in the first aspect or any possible implementation of the first aspect, and a network device for implementing the method in the second aspect or any possible implementation of the second aspect, or, comprising a terminal device for implementing the method in the third aspect or any possible implementation of the third aspect, and a network device for implementing the method in the fourth aspect or any possible implementation of the fourth aspect, or, comprising a terminal device for implementing the method in the fifth aspect or any possible implementation of the fifth aspect, and a network device for implementing the method in the sixth aspect or any possible implementation of the sixth aspect, or, comprising a terminal device for implementing the method in the seventh aspect or any possible implementation of the seventh aspect, and a network device for implementing the method in the eighth aspect or any possible implementation of the eighth aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0092] Figure 1 It is a schematic diagram of a communication system 100 to which an embodiment of the present application is applicable.

[0093] Figure 2 It is a schematic diagram of a network architecture 200 applicable to an embodiment of the present application.

[0094] Figure 3 It is a schematic diagram of the network architecture 300 used in the embodiment of the present application.

[0095] Figure 4 It is a schematic diagram of the structure of the GOP400 applicable to the embodiment of the present application.

[0096] Figure 5 It is a schematic diagram of a protocol stack 500 provided in an embodiment of the present application.

[0097] Figure 6 It is a schematic diagram of CG600 provided in an embodiment of the present application.

[0098] Figure 7 A schematic flow chart of a communication method 700 provided in an embodiment of the present application.

[0099] Figure 8 A schematic flow chart of a communication method 800 provided in accordance with yet another embodiment of the present application.

[0100] Fig. 9 A schematic diagram of the time domain position of the first CG opportunity illustrated in an embodiment of the present application.

[0101] Fig.10 A schematic diagram of the time domain position of the first CG opportunity after offset provided in an embodiment of the present application.

[0102] Fig.11A schematic flowchart of a communication method 1100 provided in accordance with yet another embodiment of the present application.

[0103] Fig.12 A schematic diagram of the time domain position of the first CG timing determined based on the second CG timing information provided in an embodiment of the present application.

[0104] Fig.13 A schematic flowchart of a communication method provided for yet another embodiment of the present application.

[0105] Fig.14 A schematic diagram of the time domain position of the first CG opportunity provided in yet another embodiment of the present application.

[0106] Fig.15 A schematic diagram of the time domain position of the first CG opportunity provided in yet another embodiment of the present application.

[0107] Fig.16 A schematic diagram of the time domain position of the first CG opportunity provided in yet another embodiment of the present application.

[0108] Fig.17 It is a schematic block diagram of a communication device 1700 according to an embodiment of the present application.

[0109] Fig.18 It is a schematic block diagram of a communication device 1800 according to an embodiment of the present application.

[0110] Fig.19 It is a schematic block diagram of a communication device 1900 according to an embodiment of the present application.

[0111] Fig. 20 It is a schematic block diagram of a communication device 2000 according to an embodiment of the present application.

[0112] Fig.21 It is a schematic block diagram of a communication device 2100 according to an embodiment of the present application. DETAILED DESCRIPTION

[0113] The technical solution in this application will be described below in conjunction with the accompanying drawings.

[0114] In the description of the embodiments of the present application, unless otherwise specified, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of the embodiments, unless otherwise specified, "multiple" means two or more.

[0115] In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products or devices.

[0116] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete way for easy understanding.

[0117] It should be understood that in the present application, "at least one (item)" refers to one or more. "Multiple" refers to two or more. "At least two (items)" refers to two or three and more than three. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b and (or) c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple. “When” and “if” both mean that corresponding measures will be taken under certain objective circumstances. It does not limit the time, nor does it require any judgment when it is implemented, nor does it mean that there are other limitations.

[0118] The technical solutions of the embodiments of the present application can be applied to various communication systems, for example: global system of mobile communication (GSM) system, code division multiple access (CDMA) system, wideband code division multiple access (WCDMA) system, general packet radio service (GPRS), long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) communication system, fifth generation (5G) system or new radio (NR), 5.5G, sixth generation (6G) system or future communication system, etc.

[0119] The terminal device involved in the embodiment of the present application is a device with a wireless transceiver function, which can be a fixed device or a mobile device, and can refer to a user device, an access terminal, a user unit, a user station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent or a user device. The terminal device can also be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a Wireless Local Loop (Wireless Local Loop, WLL) station, a personal digital assistant (personal digital assistant, PDA), a handheld device with a wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a 5G network or a terminal device in a public land mobile communication network (public land mobile network, PLMN) in the future evolution, etc. The terminal device can also be a handheld device (such as a mobile phone), a wearable device, a vehicle-mounted device, or a wireless device built into the above device (for example, a communication module, a modem, or a chip system, etc.). The terminal device is used to connect people, objects, machines, etc., and can be widely used in various scenarios, such as but not limited to the following scenarios: cellular communication, device-to-device communication (D2D), vehicle to everything (V2X), machine-to-machine / machine-type communications (M2M / MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, self-driving, remote medical, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, drone, robot and other scenarios. Among them, the terminal device can also be other devices, such as the first device, and it should be understood that the embodiments of the present application are not limited to this.

[0120] The network device in the embodiment of the present application may be a device for communicating with a terminal device, and the network device may be a base station (base transceiver station, BTS) in a GSM system or CDMA, or a base station (NodeB, NB) in a WCDMA system, or an evolutionary base station (eNB or eNodeB) in an LTE system, or a wireless controller in a cloud radio access network (CRAN) scenario, or the network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, and a network device in a future 5G network or a network device in a future evolved PLMN network. For example, the network device may include an access network device, and / or a core network device. The access network device is a device with a wireless transceiver function, which is used to communicate with a terminal device. The access network device includes but is not limited to a base station (BTS, Node B, eNodeB / eNB, or gNodeB / gNB) in the above-mentioned communication system, a transmission reception point (TRP), a base station of subsequent evolution of 3GPP, an access node in a WiFi system, a wireless relay node, a wireless backhaul node, etc. The base station can be: a macro base station, a micro base station, a pico base station, a small station, a relay station, etc. Multiple base stations can support the network of the same access technology mentioned above, or can support the network of different access technologies mentioned above. The base station may include one or more co-site or non-co-site transmission and receiving points. The network device can also be a wireless controller, a centralized unit (CU), and / or a distributed unit (DU) in a CRAN scenario. The network device can also be a server, a wearable device, or a vehicle-mounted device. For example, the network device in the V2X technology can be a road side unit (RSU). Among them, the network device can also be other devices, such as a second device. It should be understood that this application does not make specific limitations on this.

[0121] In an embodiment of the present application, a terminal device or a network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer. The hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and a memory (also called main memory). The operating system can be any one or more computer operating systems that implement business processing through a process, such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a windows operating system. The application layer includes applications such as a browser, an address book, a word processing software, and an instant messaging software. In addition, the embodiment of the present application does not specifically limit the specific structure of the execution subject of the method provided in the embodiment of the present application, as long as it can communicate according to the method provided in the embodiment of the present application by running a program that records the code of the method provided in the embodiment of the present application, for example, the execution subject of the method provided in the embodiment of the present application can be a terminal device or a network device, or a functional module, chip, or circuit in a terminal device or a network device that can call and execute a program.

[0122] The technical solution of the present application is further described in detail below in conjunction with the accompanying drawings.

[0123] Figure 1 FIG. 1 is a schematic diagram of a communication system 100 applicable to an embodiment of the present application. Figure 1 As shown, the terminal device 130 can access the wireless network to obtain services of the external network (such as the Internet) through the wireless network, or communicate with other devices through the wireless network, such as communicating with other terminal devices. The wireless network includes a radio access network (RAN) device 110 and / or a core network (CN) device 120, wherein the RAN device 110 is used to access the terminal device 130 to the wireless network, and the CN device 120 is used to manage the terminal device and provide a gateway for communicating with the external network.

[0124] It should be understood that Figure 1 The number of devices in the communication system 100 shown is for illustration only, and the embodiments of the present application are not limited thereto. In actual applications, the communication system 100 may further include more terminal devices 130, more RAN devices 110, and other devices.

[0125] It should also be understood that when the terminal device 130 communicates with other terminal devices (such as the terminal device 130), the technical solutions in the embodiments of the present application are also applicable.

[0126] Figure 2 Schematic diagram of a network architecture 200 applicable to an embodiment of the present application. Figure 2 As shown, the network architecture 200 includes CN equipment, RAN equipment and terminal equipment. The RAN equipment includes a baseband device and a radio frequency device, wherein the baseband device can be implemented by one node or multiple nodes, and the radio frequency device can be implemented independently from the baseband device, or integrated in the baseband device, or some functions are integrated independently and some functions are integrated in the baseband device. For example, in an LTE communication system, the RAN equipment (eNB) includes a baseband device and a radio frequency device, wherein the radio frequency device can be arranged remotely relative to the baseband device, for example, a remote radio unit (RRU) is a remote radio unit arranged relative to the BBU.

[0127] The communication between RAN equipment and terminal equipment follows a certain protocol layer structure. For example, the control plane protocol layer structure may include the functions of protocol layers such as the radio resource control (RRC) layer, the packet data convergence protocol (PDCP) layer, the radio link control (RLC) layer, the media access control (MAC) layer and the physical layer; the user plane protocol layer structure may include the functions of protocol layers such as the PDCP layer, the RLC layer, the MAC layer and the physical layer; in a possible implementation, a service data adaptation protocol (SDAP) layer may also be included above the PDCP layer.

[0128] The RAN device may implement the functions of the protocol layers such as RRC, PDCP, RLC and MAC by one node, or may implement the functions of these protocol layers by multiple nodes. For example, in an evolutionary structure, the RAN device may include a CU and a DU, and multiple DUs may be centrally controlled by one CU. Figure 2 As shown, CU and DU can be divided according to the protocol layers of the wireless network, for example, the functions of the PDCP layer and above protocol layers are set in the CU, and the functions of the protocol layers below the PDCP, such as the RLC layer and the MAC layer, are set in the DU.

[0129] This division of the protocol layer is only an example. It can also be divided in other protocol layers, such as dividing in the RLC layer, setting the functions of the RLC layer and the protocol layers above in the CU, and the functions of the protocol layers below the RLC layer in the DU; or dividing in a certain protocol layer, for example, setting some functions of the RLC layer and the functions of the protocol layers above the RLC layer in the CU, and setting the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer in the DU. In addition, it can also be divided in other ways, such as dividing by latency, setting the functions whose processing time needs to meet the latency requirements in the DU, and the functions that do not need to meet the latency requirements in the CU.

[0130] In addition, the radio frequency device can be independently integrated and not placed in the DU, or it can be integrated in the DU, or partly remotely located and partly integrated in the DU, without any limitation here.

[0131] Figure 3 Schematic diagram of a network architecture 300 applicable to an embodiment of the present application. Figure 2 The network architecture shown, Figure 3 The control plane (CP) and the user plane (UP) of the CU can also be separated and implemented by dividing them into different entities, namely, a control plane (CP) CU entity (i.e., a CU-CP entity) and a user plane (UP) CU entity (i.e., a CU-UP entity).

[0132] In the above network architecture, the signaling generated by the CU can be sent to the terminal device through the DU, or the signaling generated by the terminal device can be sent to the CU through the DU. The DU can directly encapsulate the signaling through the protocol layer and transparently transmit it to the terminal device or CU without parsing it. In the following embodiments, if the transmission of such signaling between the DU and the terminal device is involved, at this time, the sending or receiving of the signaling by the DU includes this scenario. For example, the signaling of the RRC or PDCP layer will eventually be processed as the signaling of the PHY layer and sent to the terminal device, or it will be converted from the received signaling of the PHY layer. Under this architecture, the signaling of the RRC or PDCP layer can also be considered to be sent by the DU, or sent by the DU and the RF loader.

[0133] Above Figure 1 , Figure 2 or Figure 3The network architecture shown can be applicable to communication systems of various radio access technologies (RAT), for example, it can be an LTE communication system, it can also be a 5G (or new radio (NR)) communication system, it can also be a transition system between an LTE communication system and a 5G communication system, the transition system can also be called a 4.5G communication system, and of course it can also be a future communication system. The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. It is known to those skilled in the art that with the evolution of the communication network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems. For example, the present application can be applicable to vehicle to everything (V2X) scenarios.

[0134] It should be understood that the above Figures 1 to 3 The network architecture shown is only an example of the present application and does not have any limiting effect on the embodiments of the present application. In particular, the embodiments of the present application can also be applied to other network architectures, for example, without distinguishing between base stations and core networks, that is, base stations and core networks can belong to the same network device, and the communication between the network device and the terminal device; or, the communication between terminal devices, etc.

[0135] In order to better understand the embodiments of the present application, before introducing the embodiments of the present application, a brief description of the terms involved in the present application is first given. It is understood that these explanations are intended to make the embodiments of the present application easier to understand and should not be regarded as limiting the scope of protection required by the embodiments of the present application.

[0136] 1. XR business:

[0137] XR can refer to various environments that combine reality and virtuality, as well as human-machine interactions, generated by computing technologies and wearable devices. It mainly includes virtual reality (VR), augmented reality (AR), and mixed reality (MR) and other virtual-reality interaction technologies. In order to enhance the experience of human interaction with the virtual world, XR services have strict requirements on bandwidth and latency. For example, XR can include cloud gaming.

[0138] For example, during downlink transmission, the server's encoder generates data content at a fixed frequency (e.g., 60 Hz or 120 Hz, etc.) and transmits it to the XR terminal via the core network and RAN. For example, during uplink transmission, the XR terminal can collect images through the built-in camera and continuously upload images of the current scene to the server at a specific frequency (e.g., 60 Hz or 120 Hz, etc.).

[0139] For example, XR services usually generate data periodically at a certain frame rate. For example, the business model for downlink XR services is roughly: AR / VR and cloud gaming. Among them, the AR / VR frame rate can be 60fps, that is, 60 frames of video images are generated per second, and one video frame appears approximately every 16.66ms. The AR / VR frame rate can also be 120fps, that is, 120 frames of video images are generated per second, and one video frame appears approximately every 8.33ms. The cloud gaming frame rate can be 60fps or 120fps, that is, 60 frames of video images are generated per second or 120 frames of video images per second. For example, the latency requirement of XR services may be 10ms, 30ms, etc.

[0140] Optionally, in an actual transmission system, data jitter may occur due to data encoding delay, network transmission delay, etc. For example, jitter may be considered to obey a truncated Gaussian distribution, with the truncation range being approximately [-4, 4] ms.

[0141] For example, the jitter may include uplink jitter and / or downlink jitter.

[0142] For example, for XR video services, images can be encoded in a group of pictures (GOP) encoding mode and / or a slice encoding mode during encoding. For example, for the slice encoding mode, a video frame may include an Islice and one or more P slices. For example, for the GOP encoding mode, a GOP may include an I frame, or a GOP includes an I frame and one or more P frames. Optionally, the GOP may also include B frames. Exemplarily, an I frame is an intra-coded frame (also referred to as an intra-coded frame, a key frame, an important frame, etc.), and an I frame is a reference frame for a P frame and / or a B frame, and has the characteristics of independent encoding and decoding. Exemplarily, a P frame is a forward prediction frame (also referred to as a forward prediction coded frame, a forward reference frame, a dependent frame, a non-key frame, etc.). When decoding a P frame, it is necessary to refer to the most recent I frame or P frame in front, and a P frame can be a reference frame for a subsequent P frame and / or B frame. Exemplarily, a B frame is a bi-directional interpolated prediction frame, which may also be called a dependent frame, a non-key frame, etc. When decoding a B frame, it is necessary to refer to the most recent I frame or P frame in the front, as well as the most recent P frame in the back. Exemplarily, an I frame is a complete picture, and a P frame records the changes relative to the I frame. Without an I frame, the P frame cannot be decoded, so the transmission priority of the I frame must be higher than that of the P frame. If an I frame fails to transmit during the transmission process (for example, it has not been successfully transmitted even if its delay requirement is met), even if the subsequent video frame that depends on the I frame (for example, a P frame) is transmitted successfully, correct decoding cannot be achieved on the receiving side.

[0143] Figure 4 Schematic diagram of the structure of GOP400 provided in the embodiment of the present application. Figure 4 As shown, one GOP sequence (eg, GOP#1 or GOP#2) includes one I frame and a plurality of P frames.

[0144] Exemplarily, a data burst may also be referred to as a data burst, which is a group of protocol data units (PDUs) generated and sent by an application in a short period of time (e.g., A set of data multiple PDUs generated and sent by the application in a short period of time).

[0145] Exemplarily, a PDU set may include one or more PDUs carrying the payload of one unit of information generated at the application level (e.g., A PDU Set is composed of one or more PDUs carrying the payload of one unit of information generated at the application level (e.g., a frame or video slice for XRM Services, as used in TR 26.926

[27] )). For example, a PDU set contains a frame or a slice. For example, a PDU set contains a frame or a slice.

[0146] For example, in some implementations, the application layer needs all PDUs in a PDU Set to use the corresponding unit of information, or the application layer needs all PDUs in a PDU Set to obtain (decode) or use the corresponding information unit. For example, in other implementations, when some PDUs are missing, the application layer can still recover all or part of the information unit (for example, In some implementations all PDUs in a PDU Set are needed by the application layer to use the corresponding unit of information. In other implementations, the application layer can still recover parts all or of the information unit, when some PDUs are missing).

[0147] Optionally, a data burst includes at least one PDU set.

[0148] For example, data burst 1 may be associated with one or more data bursts, and the one or more data bursts need to depend on data burst 1. If data burst 1 is discarded, the one or more data bursts may not be decoded. For example, PDU set 1 may be associated with one or more PDU sets, and the one or more PDU sets need to depend on PDU set 1. If PDU set 1 is discarded, the one or more PDU sets may not be decoded.

[0149] For example, the XR service may be a periodic arrival service. For example, the XR service may be a periodic arrival service with jitter. For example, the XR service requires low latency and low power consumption. For example, the period of the XR service is a non-integer. Among them, the period of the XR service is calculated based on the frame generation rate X (unit: fps). The period of the XR service is the inverse of the frame generation rate X. Typical values ​​of the frame generation rate X are 30fps, 60fps, 90fps, and 120fps. So the periods of the XR services are:

[0150] 30fps: (1 / 30fps)s=(1 / 30fps)×1000ms=1000 / 30ms=100 / 3ms≈33.3333ms

[0151] 60fps: (1 / 60fps)s=(1 / 60fps)×1000ms=1000 / 60ms=50 / 3ms≈16.6667ms

[0152] 90fps: (1 / 90fps)s=(1 / 90fps)×1000ms=1000 / 90ms=100 / 9ms≈11.1111ms

[0153] 120fps: (1 / 120fps)s=(1 / 120fps)×1000ms=1000 / 120ms=25 / 3ms≈8.3333ms

[0154] Optionally, the latency requirement for XR services is very short, for example, 30ms for UL.

[0155] For example, all data of a data burst may not be delivered from the APP side of the terminal device to the access stratum (AS) of the terminal device at the same time. It may take a certain amount of time, for example, 3ms or 5ms, to deliver all data from the APP side of the terminal device to the AS layer of the terminal device. This can be called the delay spread of the data burst.

[0156] Optionally, for XR services, the data volumes of different data bursts may be different. For example, the data volume of an I frame may be greater than the data volume of a P frame.

[0157] 2. NR protocol architecture:

[0158] The NR protocol architecture involved in the embodiments of the present application can be divided into a user plane protocol stack and a control plane protocol stack. Figure 5 Describe the above two protocol stacks in detail. Figure 5 It is a schematic diagram of a protocol stack 500 provided in an embodiment of the present application. Figure 5 (a) shows the user plane protocol stack, Figure 5 (b) in FIG. 4 shows the control plane protocol stack.

[0159] User plane protocol stack: The protocol suite used for user data transmission. Figure 5 As shown in (a), the user plane protocol stack may include five layers: PHY layer, MAC layer, RLC layer, PDCP layer and SDAP layer.

[0160] Control plane protocol stack architecture: the protocol cluster used for the system's control signaling transmission. Figure 5 As shown in (b), the control plane protocol stack may include a non-access-stratum (NAS), RRC, PDCP, RLC, MAC, and PHY layer.

[0161] For example, the PHY layer may be responsible for processing one or more of encoding and decoding, modulation and demodulation, multi-antenna mapping, and other physical layer functions. For example, the MAC layer may be responsible for one or more of hybrid automatic repeat request (HARQ), uplink scheduling, downlink scheduling, etc. For example, the RLC layer may be responsible for one or more of segmentation, reorganization, and retransmission processing. For example, the PDCP layer may be responsible for one or more of header compression / decompression, security (encryption function, integrity protection function), retransmission, and in-order delivery. For example, the RRC layer may be responsible for one or more of broadcasting, paging, RRC connection management, radio bearer control, mobility management, terminal device measurement reporting and control. For example, the NAS layer may be responsible for one or more of identity authentication, mobility management, security control, etc.

[0162] For the user plane protocol stack, the NR protocol stack has an additional SDAP layer compared to the LTE protocol stack. For the control plane protocol stack, the NR protocol stack is similar to the LTE protocol stack.

[0163] Optionally, in the embodiment of the present application, each layer in the protocol stack may also be replaced by an entity. For example, the PDCP layer may be replaced by a PDCP entity, and the SDAP layer may be replaced by an SDAP entity. A unified description is made here, and no further description is given later.

[0164] 3. Introduction to time units in NR:

[0165] In a communication system, time domain resources include: radio frames (also called system frames, or frames for short), subframes, time slots, and symbols (for example, orthogonal frequency division multiplexing (OFDM) symbols).

[0166] Among them, the duration of a frame is 10ms, and each frame can have a system frame number (SFN) (also referred to as a frame index). Exemplarily, the range of SFN is 0 to 1023, so the frame period is 1024×10ms=10240ms. In the 5G NR system, a group of frames with SFN of 0 to 1023 is called a superframe (e.g., hypersystem frame, or, hyper frame), that is, a superframe is equal to 1024 frames, which is equal to 10240ms. For example, each superframe can have a hyperframe number (H-SFN).

[0167] In addition, a frame contains 10 subframes, and the duration of each subframe is 1ms. A subframe can contain one or more time slots. It should be noted that when the sub-carrier space (SCS) is different, the number of time slots contained in each frame is different, the number of time slots contained in each subframe is also different, and the duration of each time slot is also different. The details are shown in Table 1A.

[0168] in, is the number of symbols contained in a time slot, is the number of time slots contained in a frame, is the number of time slots contained in a subframe, Δf = 2 u ·15 represents the subcarrier spacing, in kHz. Optionally, μ represents the index corresponding to the subcarrier spacing, which is used to indicate a subcarrier spacing.

[0169] Table 1A

[0170]

[0171] 4. Configured grant (CG)

[0172] For example, uplink resources may include dynamic grant (DG) and CG.

[0173] For example, DG is a resource that a network device dynamically schedules to a terminal device through downlink control information (DCI). In the uplink, a network device can dynamically allocate resources to a terminal device on a physical downlink control channel (PDCCH) (e.g., through a cell-radio network temporary identity (C-RNTI) or a configured scheduling-radio network temporary identity (CS-RNTI)). For example, when its downlink reception is enabled (e.g., when DRX is configured, this behavior is controlled by DRX), the terminal device monitors PDCCH to find possible uplink resources for uplink transmission.

[0174] For example, a CG is a resource that a network device configures to a terminal device. For example, a CG may include a type 1 CG and a type 2 CG.

[0175] For example, for type 1 CG, the network device can directly provide the configured uplink authorization (for example, which can be a periodic resource) to the terminal device through RRC signaling.

[0176] For example, for type 1 CG, the network device can indicate any one or more of the following CG-related items to the terminal device through RRC signaling: time reference frame (timeReferenceSFN), time domain offset (timeDomainOffset), periodicity (periodicity), time domain resource allocation (timeDomainAllocation). For example, timeDomainAllocation can indicate any one or more of the starting symbol S, length L, and PUSCH mapping type (PUSCH mapping type). For example, S is the starting symbol. For example, L is the number of symbols occupied by an uplink resource.

[0177] For example, for type 2 CG, the network device can configure the CG period for the terminal device through RRC signaling, and then activate the configured uplink authorization through the CS-RNTI encrypted PDCCH.

[0178] For example, the network device may indicate the periodicity of the CG to the terminal device via RRC signaling.

[0179] For example, the network device activates the type 2 CG through DCI, and the terminal device can determine the SFN start time 、slot start time and symbol start time , as well as S and L. For example, SFN start time 、slot start time and symbol start time They are respectively the SFN, slot and symbol of the first transmission opportunity of the PUSCH where the configured uplink grant is initialized or reinitialized (or, the starting SFN, starting slot and starting symbol).

[0180] Optionally, CG resources are periodic and suitable for periodic services. In this way, network devices do not need to schedule uplink resources for terminal devices through DCI every time. For a description of CG, see Figure 6 .

[0181] 5. CG Occasion

[0182] For example, the CG opportunity may be a resource unit. For example, a resource unit may include resources represented in the time domain and the frequency domain.

[0183] For example, the CG opportunity may be a PUSCH resource. For example, the CG opportunity may be a configured uplink grant.

[0184] For example, a CG opportunity may be a PUSCH resource. For example, a CG opportunity may be a configured uplink grant.

[0185] For example, the CG opportunity may be used for the terminal device to send uplink information. For example, the uplink information may include uplink data and / or uplink signaling. For example, the uplink signaling may include at least one of the following: signaling of the physical layer, control information of the medium access control (MAC) layer (e.g., MAC CE), control information of the RLC layer (e.g., control PDU), control information of the PDCP layer (e.g., control PDU), control information of the SDAP layer (e.g., controlPDU), signaling of the RRC layer, and signaling of the NAS layer.

[0186] 6. Calculation formula for CG occasion:

[0187] For example, for Type 1 CG, the Nth CG opportunity is located at (or appears at) symbol (or, SFN, slot, symbol) calculated according to the following formula:

[0188] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0189] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0190] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0191] +timeDomainOffset×numberOfSymbolsPerSlot+S+N×periodicity)

[0192] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (1-1)

[0193] For example, N≥0.

[0194] For example, numberOfSlotsPerFrame indicates the number of time slots contained in a frame.

[0195] For example, numberOfSymbolsPerSlot indicates the number of symbols contained in a time slot.

[0196] For example, slot number in the frame indicates an index of a time slot, or an index of a time slot in a frame (or a frame corresponding to a SFN).

[0197] For example, in an embodiment of the present application, the index may include / be replaced by: number, or, number.

[0198] For example, symbol number in the slot represents the index of a symbol or the index of a symbol in a time slot (or, the time slot corresponding to slot number in the frame).

[0199] For example, when the sub-carrier space (SCS) is different, the value range of slot number in the frame is also different. For example, when numberOfSymbolsPerSlot is different, the value range of symbol number in the slot is also different. For details, see Table 1B. For example, symbol 10 may correspond to symbol A, symbol 11 may correspond to symbol B, symbol 12 may correspond to symbol C, and symbol 13 may correspond to symbol D.

[0200] Table 1B

[0201]

[0202] For example, timeReferenceSFN indicates a SFN used to determine the offset of a resource in the time domain. For example, timeReferenceSFN may be 0 or 512.

[0203] For example, timeDomainOffset indicates the offset of the resource in the time domain relative to SFN=timeReferenceSFN. For example, the unit of timeDomainOffset is slot.

[0204] For example, S represents the index of the starting symbol.

[0205] For example, periodicity represents the period of CG. For example, the unit of periodicity is symbol.

[0206] For example, for Type 2 CG, the Nth CG opportunity is located at (or appears at) symbol (or, SFN, slot, symbol) calculated according to the following formula:

[0207] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0208] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0209] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0210] +slot start time×numberOfSymbolsPerSlot+symbol start time )+N×periodicity]

[0211] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (1-2)

[0212] For example, N≥0.

[0213] For example, numberOfSlotsPerFrame indicates the number of time slots contained in a frame.

[0214] For example, numberOfSymbolsPerSlot indicates the number of symbols contained in a time slot.

[0215] For example, slot number in the frame indicates an index of a time slot, or an index of a time slot in a frame (or a frame corresponding to a SFN).

[0216] For example, symbol number in the slot represents the index of a symbol or the index of a symbol in a time slot (or, the time slot corresponding to slot number in the frame).

[0217] For example, SFN start time Indicates the starting SFN, or the SFN of the first transmission opportunity of the PUSCH where the configured uplink grant is initialized or reinitialized (or the starting SFN).

[0218] For example, slot start time Indicates the starting slot, or the slot and symbol (or the starting slot) of the first transmission opportunity of the PUSCH where the configured uplink grant is initialized or reinitialized.

[0219] For example, symbol start time Indicates the starting symbol, or the symbol of the first transmission opportunity (or the starting symbol) of the PUSCH for which the configured uplink grant is initialized or reinitialized.

[0220] For example, periodicity represents the period of CG. For example, the unit of periodicity is symbol.

[0221] It should be noted that the above formula calculation can be performed by the network device, or by the terminal device, or by both the network device and the terminal device. Exemplarily, the position of the CG opportunity (or, CG occasion) can be calculated by the MAC entity of the network device, or by the MAC entity of the terminal device. It should be understood that the embodiments of the present application are not limited to this.

[0222] For example, the period of CG supported by different subcarrier spacings SCS may be different. For example, Table 2 shows the CG periods corresponding to 5 subcarrier spacings.

[0223] Table 2 CG periods corresponding to different subcarrier spacings

[0224] Subcarrier spacing (KHz) CG cycle (symbol) 15 2, 7, or (1-640)*14 30 2, 7, or (1-1280)*14 60 (regular CP length) 2, 7, or (1-2560)*14 60 (extended CP length) 2, 6, or (1 to 2560)*12 120 2, 7, or (1-5120)*14

[0225] For example, the S and L configured by the network device will ensure that a PUSCH resource does not span a time slot, for example, the sum of S and L will not exceed 14 or 12. Exemplarily, Tables 3 and 4 are possible configuration information of PUSCH time domain resource allocation.

[0226] Table 3 Default PUSCH time domain resource allocation information for normal CP

[0227]

[0228] Table 4 Default PUSCH time domain resource allocation information for extended CP

[0229]

[0230] Figure 6 is a schematic diagram of a CG provided in an embodiment of the present application. For example, a CG may be as follows Figure 6 (a), a CG cycle contains a CG opportunity. For example, a block is a CG opportunity. For example, a CG may be as follows Figure 6 (b) A CG cycle contains multiple CG opportunities.

[0231] For example, CG resources can also be applied to XR services. However, since the amount of data in each data burst of XR services is uncertain, the network device can configure a CG containing multiple CG opportunities in a CG cycle for the terminal device for XR services. For example, multiple CG opportunities in a CG cycle can correspond to different HARQ process IDs, or multiple CG opportunities in a CG cycle can be used to transmit different MAC PDUs.

[0232] Optionally, the configuration of CG may match the XR service, for example, one CG cycle may correspond to one databurst.

[0233] Optionally, in order to match CG and XR services, there are two methods:

[0234] Method 1: CG supports non-integer periods. For example, the period of CG is equal to the period of XR service. For example, a set of CG is configured to match the XR service with a period of 50 / 3 milliseconds, where the period of the CG is 50 / 3 milliseconds.

[0235] Method 2: Configure multiple CGs, and the period of each CG is an integer. For example, configure 3 CGs to match XR services with a period of 50 / 3 milliseconds, where the period of the 3 CGs is 50 milliseconds. For example, configure 9 CGs to match XR services with a period of 100 / 9 milliseconds, where the period of the 9 CGs is 100 milliseconds.

[0236] If the CG period is non-integer, a more direct method for calculating the CG timing is to directly add a rounding operation to the right side of the existing CG timing calculation formula (Formula 1-1 and / or Formula 1-2) to perform symbol granularity rounding. For example, the CG timing information (e.g., SFN, slot, symbol) can be calculated according to the following formula (2-1) and / or formula (2-2).

[0237] For example, for Type 1 CG, the Nth CG opportunity / the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) is located at (or, appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula:

[0238]

[0239] For example, for Type 2 CG, the Nth CG opportunity / the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) is located at (or, appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula:

[0240]

[0241] Among them, Ceil{} in formula (2-1) and formula (2-2) can also be floor{} or round{}, indicating "rounding operation F{}". In addition, the rounding operation F{} is not limited to the rounding positions shown in the above formula (2-1) and formula (2-2), but the rounding operation will at least include "N×periodicity".

[0242] Since the CG period (or the period of the XR service) is not an integer multiple of the time slot, for example, the CG period is 50 / 3ms, 100 / 3ms, etc., if the symbol granularity is rounded directly on the right side of the equal sign (for example, using the above formula (2-1) or formula (2-2)), the CG moments in different CG periods calculated by the terminal device may have different positions in different time slots, and some CG moments may span time slots.

[0243] For example, the following description is made using the CG period of 50 / 3ms. Assume that SCS=15kHz, normal CP, and frame generation rate X is 60fps. At this time, CG period=50 / 3ms, timeDomainOffset=0, and timeDomainAllocation=2 (for example, S=0, L=10).

[0244] Then, the information of the CG timing, for example (SFN, slot, symbol), is calculated according to the above formula (2-1) or formula (2-2). As shown in Table 5, Table 5 is the information of the CG timing.

[0245] Table 5 CG timing information

[0246]

[0247] Specifically, taking Type 2 CG as an example, the time domain position (for example, the starting position and the ending position) of the CG opportunity in the Nth CG cycle can be calculated according to the above formula (2-2), where N≥0.

[0248] Assume that the network device indicates SFN start time =0, slot start time =0,symbol start time =0, starting symbol S=0, L=10. According to formula (2-2), the starting position (SFN, slot, symbol) of the CG opportunity in the 0th CG cycle is (0,0,0). That is, the starting frame number SFN of the CG opportunity in the 0th CG cycle is 0, the starting time slot Slot=0, and the starting symbol Symbol=0. Further, according to L=10 indicated by the base station, the ending position (SFN, slot, symbol) of the CG opportunity in the 0th CG cycle is further determined to be (0,0,9).

[0249] Similarly, according to formula (2-2), the starting position (SFN, slot, symbol) of the CG opportunity in the first CG cycle is calculated to be (1, 6, 9), that is, the starting frame number SFN of the CG opportunity in the first CG cycle is 1, the starting time slot Slot is 6, and the starting symbol Symbol is 9. Furthermore, according to L=10 indicated by the base station, the ending position (SFN, slot, symbol) of the CG opportunity in the first CG cycle is further determined to be (1, 7, 4). It can be seen that the CG opportunity in the first CG cycle spans time slots.

[0250] Similarly, according to formula (2-2), the starting position (SFN, slot, symbol) of the CG opportunity in the second CG cycle is calculated to be (3, 3, 4), that is, the starting frame number SFN of the CG opportunity in the second CG cycle is 3, the starting time slot Slot is 3, and the starting symbol Symbol is 4. Furthermore, according to L=10 indicated by the base station, the ending position (SFN, slot, symbol) of the CG opportunity in the second CG cycle is further determined to be (3, 3, 13). It can be seen that the CG opportunity in the second CG cycle does not cross time slots.

[0251] Similarly, according to formula (2-2), the starting position (SFN, slot, symbol) of the CG opportunity in the third CG cycle is calculated to be (5, 0, 0), that is, the starting frame number SFN of the CG opportunity in the third CG cycle is 5, the starting time slot Slot is 0, and the starting symbol Symbol is 0. Furthermore, according to L=10 indicated by the base station, the ending position (SFN, slot, symbol) of the CG opportunity in the third CG cycle is further determined to be (5, 0, 9). It can be seen that the CG opportunity in the third CG cycle does not cross time slots.

[0252] In summary, when the unit of the rounded value obtained after the rounding operation is a symbol, the information of the CG timing in different CG cycles can be calculated according to the above formula (2-1) or formula (2-2). As shown in Table 5, the CG timing in some CG cycles may cross time slots.

[0253] In addition, it should be noted that what is shown in Table 5 is only an example of a possible situation. Exemplarily, for the case where the CG period is 50 / 3ms, 25 / 3ms, 100 / 3ms, and the subcarrier spacing SCS=15kHz, the position of the CG opportunity in the time slot in other CG periods is compared with the position of the CG opportunity in the time slot in the 0th CG period, and the maximum number of symbols offset by the CG opportunity is 10 symbols. Optionally, for the case where the CG period is 100 / 9ms and the subcarrier spacing SCS=15kHz, the position of the CG opportunity in the time slot in other CG periods is compared with the position of the CG opportunity in the time slot in the 0th CG period, and the maximum number of symbols offset by the CG opportunity is 13 symbols.

[0254] For example, for the CG periods of 50 / 3ms, 25 / 3ms, and 100 / 3ms, when the SCS is 15kHz, the values ​​of the non-integer slots in different CG periods are 1 / 3ms and 2 / 3ms, respectively. The positions of the CG opportunities in the time slots in other CG periods are staggered / offset by 10 symbols and 5 symbols, respectively, compared to the positions of the CG opportunities in the time slots in the 0th CG period.

[0255] For example, when the CG period is 100 / 9ms and the SCS is 15kHz, the values ​​of non-integer slots in different CG periods are 1 / 9ms, 2 / 9ms, 3 / 9ms, 4 / 9ms, 5 / 9ms, 6 / 9ms, 7 / 9ms, and 8 / 9ms, respectively. The positions of CG opportunities in time slots in other CG periods are staggered / offset by 2, 4, 5, 7, 8, 10, 11, and 13 symbols compared to the positions of CG opportunities in time slots in the 0th CG period.

[0256] For example, for CG periods of 50 / 3ms, 25 / 3ms, and 100 / 3ms, when the SCS is 30kHz, the values ​​of non-integer slots in different CG periods are 1 / 3ms and 2 / 3-1 / 2ms=1 / 6, respectively. The positions of CG opportunities in time slots in other CG periods are staggered / offset by 10 symbols and 3 symbols, respectively, compared to the positions of CG opportunities in time slots in the 0th CG period.

[0257] For example, when the CG period is 100 / 9ms and the SCS is 15kHz, the values ​​of non-integer slots in different CG periods are 1 / 9ms, 2 / 9ms, 3 / 9ms, 4 / 9ms, 5 / 9-1 / 2ms=1 / 18, 6 / 9-1 / 2ms=1 / 6, 7 / 9-1 / 2ms=5 / 18, 8 / 9-1 / 2ms=7 / 18, and the positions of CG opportunities in the time slots in other CG periods are staggered / offset by 2, 4, 5, 7, 1, 3, 4, and 6 symbols respectively compared to the positions of CG opportunities in the time slots in the 0th CG period.

[0258] If the above problem is left to the configuration of the network device to solve, the configuration of the network device may be very limited. For example, for the case where the CG period is 100 / 9ms, the network device may only be configured with S=0 and L=1. This may result in a large number of time slots (or CG opportunities) in a CG period to transmit the data of a period of the XR service, and this may also cause the problem of insufficient HARQ process ID. Therefore, this problem cannot be solved by limiting the configuration of the network device.

[0259] The technical problem solved by this application is: if the period of CG is non-integer, how to avoid the situation where PUSCH crosses time slots has become a problem that needs to be solved urgently.

[0260] Based on this, the present application aims to provide a communication method that can avoid the occurrence of PUSCH crossing time slots when the CG period is a non-integer.

[0261] For example, PUSCH across time slots may also include / be replaced by: TB processing over multiple slots for PUSCH.

[0262] The communication method 700 provided by the present application is described in detail below in conjunction with specific embodiments. Figure 7 As shown, Figure 7 A schematic flowchart of a communication method provided in an embodiment of the present application, the method includes at least the following steps.

[0263] S710, the terminal device obtains the configuration information of the first CG.

[0264] For example, the terminal device obtains the configuration information of the first CG may include / be replaced by: the terminal device receives the configuration information of the first CG.

[0265] For example, accordingly, the network device sends the configuration information of the first CG to the terminal device.

[0266] For example, the configuration information of the first CG may include information of the period of the first CG.

[0267] Optionally, the period of the first CG is a non-integer or fraction. Optionally, the period of the first CG is a rational number. For example, the period of the first CG is 50 / 3ms or 25 / 3ms or 100 / 3ms or 100 / 9ms.

[0268] Optionally, the first CG is associated with the XR service.

[0269] Optionally, the first CG is associated with the XR service and may include / be replaced by: the first CG / first CG timing satisfies the LCP mapping restrictions of the XR-related LCH.

[0270] Optionally, the configuration information of the first CG may include other information in addition to the period information of the first CG.

[0271] Optionally, for different CG types, such as Type1 CG and Type2 CG, the configuration information of the first CG can be different or the same without restriction.

[0272] For example, the configuration information of the first CG of Type 1 CG may include, but is not limited to, any one or more of time reference frame (timeReferenceSFN), time domain offset (timeDomainOffset), period (periodicity), time domain resource allocation (timeDomainAllocation), starting symbol S, and length L. For example, timeDomainAllocation may indicate any one or more of starting symbol S, length L, and PUSCH mapping type. For example, S is the starting symbol. For example, L is the number of symbols occupied by an uplink resource.

[0273] For example, the configuration information of the first CG of Type 2 CG may include but is not limited to SFN start time 、slot start time 、symbol start time , periodicity, or length L.

[0274] For example, the relevant description of the configuration information of the first CG can be referred to the above, and for the sake of simplicity, it will not be repeated here. In addition, the configuration information of the first CG may also be different from that described above, and it should be understood that this application does not limit this.

[0275] S720, the terminal device determines the information of the first CG opportunity based on the first rounded value.

[0276] Optionally, S730, the network device determines information of the first CG opportunity based on the first rounded value.

[0277] Optionally, the first rounding value is associated with the period of the first CG and the first rounding operation.

[0278] For example, the unit of the first rounded value is not a symbol. Optionally, the unit of the first rounded value is milliseconds or subframes or time slots.

[0279] For example, information for determining the timing of the first CG based on the first rounded value may include / be replaced by: determining the timing of the first CG based on the period of the first CG (or, configuration information of the first CG) and the first rounding operation.

[0280] Optionally, the first rounding operation may include any one of the following operations: rounding up, rounding down, and rounding to the nearest integer. It should be understood that the embodiment of the present application does not limit this.

[0281] Optionally, in one possible implementation, the information of the first CG opportunity includes information of the frame, time slot and symbol of the first CG opportunity.

[0282] For example, the information on the frame, time slot and symbol of the first CG opportunity may include / be replaced by: the information on the frame, time slot and symbol where the first CG opportunity is located, or the information on the starting frame, starting time slot and starting symbol of the first CG opportunity, or the information on the frame, time slot and symbol at the starting position of the first CG opportunity, or the information on the frame, time slot and symbol where the starting position of the first CG opportunity is located.

[0283] The method for determining the first CG timing based on the first rounded value in an embodiment of the present application is described in detail below.

[0284] Optionally, in a possible implementation, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG×N}.

[0285] Optionally, information determining the first CG timing based on the first rounded value may include / be replaced by: information determining the first CG timing based on F{period of the first CG×N}.

[0286] For example, N≥0, or N≥1, or N>1. For example, N is an integer.

[0287] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0288] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N} is milliseconds or subframes.

[0289] Optionally, when the first rounded value is F{the period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×Y.

[0290] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×Y.

[0291] For example, the period of the first CG is periodicity. For ease of understanding, in the formulas appearing below, periodicity is uniformly used to replace the period of the first CG for description.

[0292] For example, Y is the number of symbols contained in one millisecond or one subframe.

[0293] Optionally, “×Y” may include / replaced by: / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot, or, ÷10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot.

[0294] Optionally, “Y” may include / be replaced by: numberOfSlotsPerFrame×numberOfSymbolsPerSlot / 10, or, numberOfSlotsPerFrame×numberOfSymbolsPerSlot÷10.

[0295] For example, numberOfSlotsPerFrame indicates the number of time slots contained in a frame.

[0296] For example, numberOfSymbolsPerSlot indicates the number of symbols contained in a time slot.

[0297] For example, 10 may include / be replaced by Q. For example, Q is greater than 0. For example, Q is the number of subframes included in a frame.

[0298] For example, if the first CG is Type 1 CG, the first CG timing or the CG timing in the Nth CG cycle (or, the first CG timing in the Nth CG cycle) or the CG timing in the N+1th CG cycle (or, the first CG timing in the N+1th CG cycle) is located at (or appears at) symbol (or, SFN, slot, symbol) calculated according to the following formula (3-1): [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0299] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0300] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0301] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N}×Y)

[0302] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (3-1)

[0303] For example, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) may include / be replaced by: the starting position of the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle).

[0304] Optionally, formula (3-1) can be equal to / replaced by formula (3-2).

[0305] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0306] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0307] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0308] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0309] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (3-2)

[0310] For example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=50 / 3ms, timeDomainAllocation=0, S=0, L=10, SCS=15kHz. Then, according to formula (3-1) or (3-2), the information of the CG timing in the Nth CG cycle can be calculated. As shown in Table 6, Table 6 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0311] Table 6 Information on CG timing in different CG cycles

[0312]

[0313] For example, as shown in Table 6, according to formula (3-1) or (3-2), when N=0, the information of the CG timing in the 0th CG cycle is calculated, when N=1, the information of the CG timing in the 1st CG cycle is calculated, and when N=2, the information of the CG timing in the 2nd CG cycle is calculated, and so on, the information of the CG timing in the Nth CG cycle can be calculated.

[0314] For example, it can be seen from Table 6 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (3-1) or (3-2) will not cross time slots.

[0315] For example, if the first CG is a Type2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (4-1):

[0316] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0317] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0318] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0319] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N}×Y]

[0320] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (4-1)

[0321] Optionally, formula (4-1) can be equal to / replaced by formula (4-2).

[0322] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0323] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0324] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0325] +slot start time×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot]

[0326] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (4-2)

[0327] For example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity = 50 / 3ms, S = 0, L = 10. Then, according to formula (4-1) or (4-2), the information of the CG timing in the Nth CG period can be calculated. As shown in Table 8, Table 8 shows the information of the CG timing in different CG periods. For example, N = 0, 1, 2.

[0328] Table 8 Information on CG timing in different CG cycles

[0329]

[0330] For example, as shown in Table 8, according to formula (4-1) or (4-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0331] For example, it can be seen from Table 8 that the CG opportunities in the 0th CG cycle to the 3rd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (4-1) or (4-2) will not cross time slots.

[0332] Optionally, when the first rounded value is F{the period of the first CG×N}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×Y+(K-1)×Z.

[0333] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×Y+(K-1)×Z.

[0334] For example, Z is the number of symbols contained in a time slot. Optionally, Z can be expressed as numberOfSymbolsPerSlot.

[0335] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0336] For example, K ≥ 1. For example, K is an integer.

[0337] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (3-3):

[0338] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0339] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0340] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0341] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N}×Y+(K-1)×Z)

[0342] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (3-3)

[0343] For example, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle may include / be replaced by: the starting position of the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle.

[0344] Optionally, formula (3-3) can be equal to / replaced by formula (3-4).

[0345] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0346] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0347] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0348] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot)

[0349] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (3-4)

[0350] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=50 / 3ms, timeDomainAllocation=0, S=0, L=10, SCS=15kHz. The information of the Kth CG opportunity in the first CG period is calculated according to formula (3-3) or (3-4). As shown in Table 7, Table 7 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1,2,3.

[0351] Table 7 Information of the Kth CG opportunity in the first CG cycle

[0352]

[0353] For example, as shown in Table 7, according to formula (3-3) or (3-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0354] For example, it can be seen from Table 7 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (3-3) or (3-4) will not cross time slots.

[0355] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (4-3):

[0356] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0357] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0358] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0359] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N}×Y+(K-1)×Z]

[0360] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (4-3)

[0361] Optionally, formula (4-3) can be equivalent to / replaced by formula (4-4).

[0362] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0363] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0364] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0365] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot]

[0366] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (4-4)

[0367] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=50 / 3ms, S=0, L=10. The information of the Kth CG opportunity in the first CG period is calculated according to formula (4-3) or (4-4). As shown in Table 9, Table 9 shows the information of the Kth CG opportunity in the first CG period. For example, N=1. For example, K=1,2,3.

[0368] Table 9 Information of the Kth CG opportunity in the first CG cycle

[0369]

[0370] For example, as shown in Table 9, according to formula (4-3) or (4-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0371] For example, it can be seen from Table 9 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (4-3) or (4-4) will not cross time slots.

[0372] Optionally, in another possible implementation, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{period of the first CG×N×X}.

[0373] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N×X}.

[0374] For example, X is the number of time slots included in one millisecond or one subframe.

[0375] Optionally, "×X" may include / replaced by: / 10×numberOfSlotsPerFrame, or, ÷10×numberOfSlotsPerFrame.

[0376] Optionally, "X" may include / be replaced by: numberOfSlotsPerFrame / 10, or, numberOfSlotsPerFrame÷10.

[0377] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0378] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG×N×X} is the time slot.

[0379] Optionally, when the first rounded value is F{the period of the first CG×N×X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N×X}×Z.

[0380] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N×X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N×X}×Z.

[0381] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (5-1):

[0382] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0383] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0384] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0385] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N×X}×Z)

[0386] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (5-1)

[0387] Optionally, formula (5-1) can be equal to / replaced by formula (5-2).

[0388] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0389] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0390] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0391] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity / 10×numberOfSlotsPerFrame)×numberOfSymbolsPerSlot)

[0392] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (5-2)

[0393] For example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=50 / 3ms, timeDomainAllocation=0, S=0, L=10. Then, the information of the CG timing in the Nth CG cycle is calculated according to formula (5-1) or (5-2). As shown in Table 10, Table 10 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0394] Table 10 Information on CG timing in different CG cycles

[0395]

[0396] For example, as shown in Table 10, according to formula (5-1) or (5-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0397] For example, it can be seen from Table 10 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (5-1) or (5-2) will not cross time slots.

[0398] For example, if the first CG is a Type2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (6-1):

[0399] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0400] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0401] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0402] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N×X}×Z]

[0403] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (6-1)

[0404] Optionally, formula (6-1) can be equivalent to / replaced by formula (6-2).

[0405] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0406] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0407] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0408] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity / 10×numberOfSlotsPerFrame)×numberOfSymbolsPerSlot]

[0409] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (6-2)

[0410] For example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity = 50 / 3ms, S = 0, L = 10. Then, according to formula (6-1) or (6-2), the information of the CG timing in the Nth CG period can be calculated. As shown in Table 12, Table 12 shows the information of the CG timing in different CG periods. For example, N = 0, 1, 2.

[0411] Table 12 Information on CG timing in different CG cycles

[0412]

[0413] For example, as shown in Table 12, according to formula (6-1) or (6-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing of the Nth CG cycle can be calculated.

[0414] For example, it can be seen from Table 12 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (6-1) or (6-2) will not cross time slots.

[0415] Optionally, when the first rounded value is F{the period of the first CG×N×X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N×X}×Z+(K-1)×Z.

[0416] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N×X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N×X}×Z+(K-1)×Z.

[0417] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0418] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (5-3):

[0419] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0420] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0421] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0422] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N×X}×Z+(K-1)×Z)

[0423] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (5-3)

[0424] Optionally, formula (5-3) can be equal to / replaced by formula (5-4).

[0425] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0426] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0427] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0428] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity / 10×numberOfSlotsPerFrame)×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot)

[0429] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (5-4)

[0430] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the periodicity of the first CG=50 / 3ms, timeDomainAllocation=0, S=0, L=10. According to formula (5-3) or (5-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 11, Table 11 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1, 2, 3.

[0431] Table 11 Information of the Kth CG opportunity in the first CG cycle

[0432]

[0433] For example, as shown in Table 11, according to formula (5-3) or (5-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0434] For example, it can be seen from Table 11 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (5-3) or (5-4) will not cross time slots.

[0435] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (6-3):

[0436] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0437] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0438] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0439] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N×X}×Z+(K-1)×Z]

[0440] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (6-3)

[0441] Optionally, formula (6-3) can be equivalent to / replaced by formula (6-4).

[0442] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0443] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0444] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0445] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity / 10×numberOfSlotsPerFrame)×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot]

[0446] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (6-4)

[0447] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=50 / 3ms, S=0, L=10. The information of the Kth CG opportunity in the first CG period is calculated according to formula (6-3) or (6-4). As shown in Table 13, Table 13 shows the information of the Kth CG opportunity in the first CG period. For example, N=1. For example, K=1,2,3.

[0448] Table 13 Information of the Kth CG opportunity in the first CG cycle

[0449]

[0450] For example, as shown in Table 13, according to formula (6-3) or (6-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0451] For example, it can be seen from Table 13 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (6-3) or (6-4) will not cross time slots.

[0452] Optionally, in another possible implementation, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Y}.

[0453] Optionally, “÷Y” may include / be replaced by: ×10 / numberOfSlotsPerFrame / numberOfSymbolsPerSlot, or, ×10÷numberOfSlotsPerFrame÷numberOfSymbolsPerSlot.

[0454] Optionally, the information for determining the first CG timing based on the first rounded value may include / be replaced by: information for determining the first CG timing based on F{the period of the first CG×N÷Y}.

[0455] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0456] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N÷Y} is milliseconds.

[0457] Optionally, when the first rounded value is F{the period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Y}×Y.

[0458] Optionally, when the unit of the period of the first CG is symbol and the first rounded value is F{period of the first CG×N÷Y}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Y}×Y.

[0459] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (7-1):

[0460] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0461] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0462] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0463] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷Y}×Y)

[0464] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (7-1)

[0465] Optionally, formula (7-1) can be equivalent to / replaced by the following formula (7-2).

[0466] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0467] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0468] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0469] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0470] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (7-2)

[0471] For example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10, SCS=15kHz. Then, according to formula (7-1) or (7-2), the information of the CG timing in the Nth CG cycle can be calculated. As shown in Table 14, Table 14 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0472] Table 14 Information on CG timing in different CG cycles

[0473]

[0474] For example, as shown in Table 14, according to formula (7-1) or (7-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing of the Nth CG cycle can be calculated.

[0475] For example, it can be seen from Table 14 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (7-1) or (7-2) will not cross time slots.

[0476] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (8-1):

[0477] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0478] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0479] [(SFN start time×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0480] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷Y}×Y]

[0481] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (8-1)

[0482] Optionally, formula (8-1) can be equivalent to / replaced by formula (8-2).

[0483] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0484] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0485] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0486] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot]

[0487] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (8-2)

[0488] For example, SFN start time =0, slot starttime =0, symbol start time =0, the period of the first CG periodicity=14×50 / 3symbol, S=0, L=10. Then, according to formula (4-1) or (8-2), the information of the CG timing of the Nth CG period can be calculated. As shown in Table 16, Table 16 shows the information of the CG timing in different CG periods. For example, N=0, 1, 2.

[0489] Table 16 Information on CG timing in different CG cycles

[0490]

[0491] For example, as shown in Table 16, according to formula (8-1) or (8-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0492] For example, it can be seen from Table 16 that the CG opportunities in the 0th CG cycle to the 3rd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (8-1) or (8-2) will not cross time slots.

[0493] Optionally, when the first rounded value is F{the period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Y}×Y+(K-1)×Z.

[0494] Optionally, when the unit of the period of the first CG is symbol and the first rounded value is F{period of the first CG×N÷Y}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Y}×Y+(K-1)×Z.

[0495] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0496] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (7-3):

[0497] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0498] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0499] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0500] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷Y}×Y+(K-1)×Z)

[0501] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (7-3)

[0502] Optionally, formula (7-3) can be equal to / replaced by formula (7-4).

[0503] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0504] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0505] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0506] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot)

[0507] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (7-4)

[0508] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10, SCS=15kHz. According to formula (7-3) or (7-3), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 15, Table 15 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1, 2, 3.

[0509] Table 15 Information of the Kth CG opportunity in the first CG cycle

[0510]

[0511] For example, as shown in Table 15, according to formula (7-3) or (7-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing of the Nth CG cycle can be calculated.

[0512] For example, it can be seen from Table 15 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (7-3) or (7-4) will not cross time slots.

[0513] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (8-3):

[0514] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0515] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0516] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0517] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷Y}×Y+(K-1)×Z]

[0518] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (8-3)

[0519] Optionally, formula (8-3) can be equal to / replaced by formula (8-4).

[0520] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0521] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0522] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0523] +slot starttime ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot]

[0524] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (8-4)

[0525] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=14×50 / 3symbol, S=0, L=10. According to formula (8-3) or (8-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 17, Table 17 shows the information of the Kth CG opportunity in the first CG period. For example, N=1. For example, K=1, 2, 3.

[0526] Table 17 Information of the Kth CG opportunity in the first CG cycle

[0527]

[0528] For example, as shown in Table 17, according to formula (8-3) or (8-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0529] For example, it can be seen from Table 17 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is milliseconds or subframes, the CG opportunities in the CG cycle calculated according to formula (8-3) or (8-4) will not cross time slots.

[0530] Optionally, in another possible implementation, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Z}.

[0531] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Z}.

[0532] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0533] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG × N÷Z} is the time slot.

[0534] Optionally, when the first rounded value is F{the period of the first CG×N÷Z}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Z}×Z.

[0535] Optionally, when the unit of the period of the first CG is symbol and the first rounded value is F{period of the first CG×N÷Z}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Z}×Z.

[0536] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (9-1):

[0537] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0538] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0539] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0540] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷Z}×Z)

[0541] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (9-1)

[0542] Optionally, formula (9-1) can be equivalent to / replaced by formula (9-2).

[0543] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0544] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0545] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0546] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity÷numberOfSymbolsPerSlot)×numberOfSymbolsPerSlot)

[0547] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (9-2)

[0548] For example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10. Then, the information of the CG timing in the Nth CG cycle is calculated according to formula (9-1) or (9-2). As shown in Table 18, Table 18 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0549] Table 18 Information on CG timing in different CG cycles

[0550]

[0551] For example, as shown in Table 18, according to formula (9-1) or (9-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0552] For example, it can be seen from Table 18 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (9-1) or (9-2) will not cross time slots.

[0553] For example, if the first CG is a Type2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or, appears in) the symbol (or, SFN, slot, symbol) calculated according to the following formula (10-1):

[0554] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0555] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0556] [(SFN start time×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0557] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷Z}×Z]

[0558] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (10-1)

[0559] Optionally, formula (10-1) can be equal to / replaced by formula (10-2).

[0560] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0561] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0562] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0563] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot)×numberOfSymbolsPerSlot]

[0564] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (10-2)

[0565] For example, if SFN start time =0, slot start time =0, symbol start time=0, the period of the first CG periodicity=14×50 / 3symbol, S=0, L=10. According to formula (10-1) or (10-2), the information of the CG timing in the Nth CG period can be calculated. As shown in Table 20, Table 20 shows the information of the CG timing in different CG periods. For example, N=0, 1, 2.

[0566] Table 20 Information on CG timing in different CG cycles

[0567]

[0568] For example, as shown in Table 20, according to formula (10-1) or (10-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing of the Nth CG cycle can be calculated.

[0569] For example, it can be seen from Table 20 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (10-1) or (10-2) will not cross time slots.

[0570] Optionally, when the first rounded value is F{the period of the first CG×N÷Z}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Z}×Z+(K-1)×Z.

[0571] Optionally, when the unit of the period of the first CG is symbol and the first rounded value is F{period of the first CG×N÷Z}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Z}×Z+(K-1)×Z.

[0572] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0573] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (9-3):

[0574] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0575] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0576] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0577] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷Z}×Z+(K-1)×Z)

[0578] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (9-3)

[0579] Optionally, formula (9-3) can be equivalent to / replaced by formula (9-4).

[0580] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0581] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0582] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0583] +timeDomainOffset×numberOfSymbolsPerSlot+S+ceil(N×periodicity÷numberOfSymbolsPerSlot)×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot)

[0584] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (9-4)

[0585] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10. According to formula (9-3) or (9-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 19, Table 19 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1, 2, 3.

[0586] Table 19 Information of the Kth CG opportunity in the first CG cycle

[0587]

[0588] For example, as shown in Table 19, according to formula (9-3) or (9-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0589] For example, it can be seen from Table 19 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (9-3) or (9-4) will not cross time slots.

[0590] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (10-3):

[0591] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0592] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0593] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0594] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷Z}×Z+(K-1)×Z]

[0595] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (10-3)

[0596] Optionally, formula (10-3) can be equal to / replaced by formula (10-4).

[0597] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0598] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0599] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0600] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot)×numberOfSymbolsPerSlot+(X-1)×numberOfSymbolsPerSlot]

[0601] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (10-4)

[0602] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=14×50 / 3symbol, S=0, L=10. According to formula (10-3) or (10-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 21, Table 21 shows the information of the Kth CG opportunity in the first CG period. For example, N=1. For example, K=1, 2, 3.

[0603] Table 21 Information of the Kth CG opportunity in the first CG cycle

[0604]

[0605] For example, as shown in Table 21, according to formula (10-3) or (10-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0606] For example, it can be seen from Table 21 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (10-3) or (10-4) will not cross time slots.

[0607] Optionally, in another possible implementation, when the unit of the period of the first CG is a time slot, the first rounded value is F{period of the first CG×N÷X}.

[0608] Optionally, "÷X" may include / be replaced by: ×10 / numberOfSlotsPerFrame, or, ×10÷numberOfSlotsPerFrame.

[0609] Optionally, the information for determining the first CG timing based on the first rounded value may include / be replaced by: information for determining the first CG timing based on F{the period of the first CG×N÷X}.

[0610] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0611] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N÷X} is milliseconds or subframes.

[0612] Optionally, when the first rounded value is F{the period of the first CG×N÷X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷X}×Y.

[0613] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N÷X}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷X}×Y.

[0614] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (11-1):

[0615] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0616] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0617] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0618] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷X}×Y)

[0619] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (11-1)

[0620] For example, if the first CG is a Type2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or, appears in) the symbol (or, SFN, slot, symbol) calculated according to the following formula (12-1):

[0621] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0622] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0623] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0624] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷X}×Y]

[0625] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (12-1)

[0626] Optionally, when the first rounded value is F{the period of the first CG×N÷X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷X}×Y+(K-1)×Z.

[0627] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N÷X}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷X}×Y+(K-1)×Z.

[0628] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0629] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (11-3):

[0630] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0631] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0632] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0633] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N÷X}×Y+(K-1)×Z)

[0634] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (11-3)

[0635] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (12-3):

[0636] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0637] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0638] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0639] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N÷X}×Y+(K-1)×Z]

[0640] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (12-3)

[0641] Optionally, in another possible implementation, when the unit of the period of the first CG is a time slot, the first rounded value is F{the period of the first CG×N}.

[0642] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}.

[0643] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0644] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG×N} is the time slot.

[0645] Optionally, when the first rounded value is F{the period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×Z.

[0646] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×Z.

[0647] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (13-1):

[0648] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0649] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0650] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0651] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N}×Z)

[0652] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (13-1)

[0653] For example, if the first CG is a Type2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located at (or, appears in) the symbol (or, SFN, slot, symbol) calculated according to the following formula (14-1):

[0654] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0655] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0656] [(SFN start time×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0657] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N}×Z]

[0658] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (14-1)

[0659] Optionally, when the first rounded value is F{the period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×Z+(K-1)×Z.

[0660] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×Z+(K-1)×Z.

[0661] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0662] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (13-3):

[0663] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0664] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0665] (timeReferenceSFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0666] +timeDomainOffset×numberOfSymbolsPerSlot+S+F{period of the first CG×N}×Z+(K-1)×Z)

[0667] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (13-3)

[0668] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located at (or appears at) the symbol (or, SFN, slot, symbol) calculated according to the following formula (14-3):

[0669] [(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot)

[0670] +(slot number in the frame×numberOfSymbolsPerSlot)+symbol number in the slot]=

[0671] [(SFN start time ×numberOfSlotsPerFrame×numberOfSymbolsPerSlot

[0672] +slot start time ×numberOfSymbolsPerSlot+symbol start time )+F{period of the first CG×N}×Z+(K-1)×Z]

[0673] modulo(1024×numberOfSlotsPerFrame×numberOfSymbolsPerSlot) formula (14-3)

[0674] Optionally, the first rounding value is associated with the period of the first CG, N and the first rounding operation.

[0675] Optionally, in another possible implementation, the information of the first CG opportunity includes frame and time slot information, but does not include symbol information.

[0676] For example, the frame and time slot information of the first CG opportunity may include / be replaced by: the frame and time slot information of the first CG opportunity, or the starting frame and starting time slot information of the first CG opportunity, or the frame and time slot information of the starting position of the first CG opportunity, or the frame and time slot information of the starting position of the first CG opportunity.

[0677] For example, the information of the symbol of the first CG opportunity may include / be replaced by: information of the symbol where the first CG opportunity is located, or, information of the starting symbol of the first CG opportunity, or, information of the symbol at the starting position of the first CG opportunity, or, information of the symbol where the starting position of the first CG opportunity is located.

[0678] Optionally, in this embodiment, the information of the first CG opportunity does not include information of the symbol. Optionally, the information of the symbol of the first CG opportunity can refer to / be the starting symbol configured by the network device, such as S. Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) at least includes the period × N of the first CG, and may also include others, which are not limited by this application.

[0679] Optionally, a first rounding operation is performed on the right side of the equation.

[0680] Optionally, the specific position of the first rounding operation in the formula is not limited. Optionally, the specific position of the first rounding operation on the right side of the equation is not limited.

[0681] For example, the first rounding operation is on the right side of the equation, and the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) contains at least the period ×N of the first CG.

[0682] The following is a detailed description of a method for determining the first CG timing based on a first rounded value provided in another embodiment of the present application.

[0683] Optionally, in a possible implementation, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG×N}.

[0684] Optionally, information determining the first CG timing based on the first rounded value may include / be replaced by: information determining the first CG timing based on F{period of the first CG×N}.

[0685] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0686] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N} is milliseconds or subframes.

[0687] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period ×N of the first CG, and may also include others, which is not limited in this application.

[0688] Optionally, when the first rounded value is F{the period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×X.

[0689] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×X.

[0690] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (15-1):

[0691] [(SFN×numberOfSlotsPerFrame)

[0692] +(slot number in the frame)]=

[0693] (timeReferenceSFN×numberOfSlotsPerFrame

[0694] +timeDomainOffset+F{period of the first CG×N}×X)

[0695] modulo(1024×numberOfSlotsPerFrame) formula (15-1)

[0696] Optionally, formula (15-1) can be equivalent to / replaced by formula (15-2).

[0697] [(SFN×numberOfSlotsPerFrame)

[0698] +(slot number in the frame)]=

[0699] (timeReferenceSFN×numberOfSlotsPerFrame

[0700] +timeDomainOffset+ceil(N×periodicity) / 10×numberOfSlotsPerFrame)

[0701] modulo(1024×numberOfSlotsPerFrame) formula (15-2)

[0702] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (16-1):

[0703] [(SFN×numberOfSlotsPerFrame)

[0704] +(slot number in the frame)]=

[0705] [(SFN start time ×numberOfSlotsPerFrame

[0706] +slot start time )+F{period of the first CG×N}×X]

[0707] modulo(1024×numberOfSlotsPerFrame) formula (16-1)

[0708] Optionally, formula (16-1) can be equivalent to / replaced by formula (16-2).

[0709] [(SFN×numberOfSlotsPerFrame)

[0710] +(slot number in the frame)]=

[0711] [(SFN start time ×numberOfSlotsPerFrame

[0712] +slot start time)+ceil(N×periodicity) / 10×numberOfSlotsPerFrame]

[0713] modulo(1024×numberOfSlotsPerFrame) formula (16-2)

[0714] Optionally, when the first rounded value is F{the period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}×X+(K-1).

[0715] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}×X+(K-1).

[0716] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0717] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (15-3): [(SFN×numberOfSlotsPerFrame)

[0718] +(slot number in the frame)]=

[0719] (timeReferenceSFN×numberOfSlotsPerFrame

[0720] +timeDomainOffset+F{period of the first CG×N}×X+(K-1))

[0721] modulo(1024×numberOfSlotsPerFrame) formula (15-3)

[0722] Optionally, formula (15-3) can be equivalent to / replaced by formula (15-4).

[0723] [(SFN×numberOfSlotsPerFrame)

[0724] +(slot number in the frame)]=

[0725] (timeReferenceSFN×numberOfSlotsPerFrame

[0726] +timeDomainOffset+ceil(N×periodicity) / 10×numberOfSlotsPerFrame+(X-1))

[0727] modulo(1024×numberOfSlotsPerFrame) formula (15-4)

[0728] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (16-3): [(SFN×numberOfSlotsPerFrame)

[0729] +(slot number in the frame)]=

[0730] [(SFN start time ×numberOfSlotsPerFrame

[0731] +slot start time )+F{period of the first CG×N}×X+(K-1)]

[0732] modulo(1024×numberOfSlotsPerFrame) formula (16-3)

[0733] Optionally, formula (16-3) can be equivalent to / replaced by formula (16-4).

[0734] [(SFN×numberOfSlotsPerFrame)

[0735] +(slot number in the frame)]=

[0736] [(SFN start time ×numberOfSlotsPerFrame

[0737] +slot start time )+ceil(N×periodicity) / 10×numberOfSlotsPerFrame+(X-1)]

[0738] modulo(1024×numberOfSlotsPerFrame) formula (16-4)

[0739] Optionally, in another possible implementation, when the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{period of the first CG×N×X}.

[0740] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N×X}.

[0741] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0742] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG×N×X} is the time slot.

[0743] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period ×N×X ​​of the first CG, and may also include others, which is not limited in this application.

[0744] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (17-1):

[0745] [(SFN×numberOfSlotsPerFrame)

[0746] +(slot number in the frame)]=

[0747] (timeReferenceSFN×numberOfSlotsPerFrame

[0748] +timeDomainOffset+F{period of the first CG×N×X})

[0749] modulo(1024×numberOfSlotsPerFrame) formula (17-1)

[0750] Optionally, formula (17-1) can be equivalent to / replaced by formula (17-2).

[0751] [(SFN×numberOfSlotsPerFrame)

[0752] +(slot number in the frame)]=

[0753] (timeReferenceSFN×numberOfSlotsPerFrame

[0754] +timeDomainOffset+ceil(N×periodicity / 10×numberOfSlotsPerFrame))

[0755] modulo(1024×numberOfSlotsPerFrame) formula (17-2)

[0756] For example, if timeReferenceSFN=0, timeDomainOffset=0, the periodicity of the first CG=50 / 3ms, and timeDomainAllocation=0. Then, the information of the CG timing in the Nth CG cycle can be calculated according to formula (17-1) or (17-2). As shown in Table 22, Table 22 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0757] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the starting symbol S configured by the base station is 2 and the length L=10 (i.e., S=2,, L=10). Exemplarily, N=0, 1, 2.

[0758] Table 22 Information on CG timing in different CG cycles

[0759]

[0760] For example, as shown in Table 22, according to formula (17-1) or (17-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0761] For example, it can be seen from Table 22 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (17-1) or (17-2) will not cross time slots.

[0762] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (18-1):

[0763] [(SFN×numberOfSlotsPerFrame)

[0764] +(slot number in the frame)]=

[0765] [(SFN start time ×numberOfSlotsPerFrame

[0766] +slot start time )+F{period of the first CG×N×X}]

[0767] modulo(1024×numberOfSlotsPerFrame) formula (18-1)

[0768] Optionally, formula (18-1) can be equivalent to / replaced by formula (18-2).

[0769] [(SFN×numberOfSlotsPerFrame)

[0770] +(slot number in the frame)]=

[0771] [(SFN start time ×numberOfSlotsPerFrame

[0772] +slot start time )+ceil(N×periodicity / 10×numberOfSlotsPerFrame)]

[0773] modulo(1024×numberOfSlotsPerFrame) formula (18-2)

[0774] For example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=50 / 3ms, S=0, L=10. Then, according to formula (18-1) or (18-2), the information of the CG timing in the Nth CG period can be calculated. As shown in Table 24, Table 24 shows the information of the CG timing in different CG periods. For example, N=0, 1, 2.

[0775] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0776] Table 24 Information on CG timing in different CG cycles

[0777]

[0778] For example, as shown in Table 24, according to formula (18-1) or (18-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing of the Nth CG cycle can be calculated.

[0779] For example, it can be seen from Table 24 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (18-1) or (18-2) will not cross time slots.

[0780] Optionally, when the first rounded value is F{the period of the first CG×N×X}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N×X}+(K-1).

[0781] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N×X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N×X}+(K-1).

[0782] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0783] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (17-3): [(SFN×numberOfSlotsPerFrame)

[0784] +(slot number in the frame)]=

[0785] (timeReferenceSFN×numberOfSlotsPerFrame

[0786] +timeDomainOffset+F{period of the first CG×N×X}+(K-1))

[0787] modulo(1024×numberOfSlotsPerFrame) formula (17-3)

[0788] Optionally, formula (17-3) can be equivalent to / replaced by formula (17-4).

[0789] [(SFN×numberOfSlotsPerFrame)

[0790] +(slot number in the frame)]=

[0791] (timeReferenceSFN×numberOfSlotsPerFrame

[0792] +timeDomainOffset+ceil(N×periodicity / 10×numberOfSlotsPerFrame)+(X-1))

[0793] modulo(1024×numberOfSlotsPerFrame) formula (17-4)

[0794] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the periodicity of the first CG=50 / 3ms, timeDomainAllocation=0, S=0, L=10. According to formula (17-3) or (17-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 23, Table 23 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1, 2, 3.

[0795] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0796] Table 23 Information of the Kth CG opportunity in the first CG cycle

[0797]

[0798] For example, as shown in Table 23, according to formula (17-3) or (17-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0799] For example, it can be seen from Table 23 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (17-3) or (17-4) will not cross time slots.

[0800] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (18-3): [(SFN×numberOfSlotsPerFrame)

[0801] +(slot number in the frame)]=

[0802] [(SFN start time×numberOfSlotsPerFrame

[0803] +slot start time )+F{period of the first CG×N×X}+(K-1)]

[0804] modulo(1024×numberOfSlotsPerFrame) formula (18-3)

[0805] Optionally, formula (18-3) can be equivalent to / replaced by formula (18-4).

[0806] [(SFN×numberOfSlotsPerFrame)

[0807] +(slot number in the frame)]=

[0808] [(SFN start time ×numberOfSlotsPerFrame

[0809] +slot start time )+ceil(N×periodicity / 10×numberOfSlotsPerFrame)+(X-1)]

[0810] modulo(1024×numberOfSlotsPerFrame) formula (18-4)

[0811] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity = 50 / 3ms, S = 0, L = 10. Then, according to formula (18-3) or (18-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 25, Table 25 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N = 1, and exemplary, K = 1, 2, 3.

[0812] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0813] Table 25 Information of the Kth CG opportunity in the first CG cycle

[0814]

[0815] For example, as shown in Table 25, according to formula (18-3) or (18-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0816] For example, it can be seen from Table 25 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (18-3) or (18-4) will not cross time slots.

[0817] Optionally, in another possible implementation, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Y}.

[0818] Optionally, the information for determining the first CG timing based on the first rounded value may include / be replaced by: information for determining the first CG timing based on F{the period of the first CG×N÷Y}.

[0819] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0820] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N÷Y} is milliseconds or subframes.

[0821] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period ×N÷Y of the first CG, and may also include others, which is not limited in this application.

[0822] Optionally, when the first rounded value is F{the period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Y}×X.

[0823] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Y}×X.

[0824] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (19-1):

[0825] [(SFN×numberOfSlotsPerFrame)

[0826] +(slot number in the frame)]=

[0827] (timeReferenceSFN×numberOfSlotsPerFrame

[0828] +timeDomainOffset+F{period of the first CG×N÷Y}×X)

[0829] modulo(1024×numberOfSlotsPerFrame) formula (19-1)

[0830] Optionally, formula (19-1) can be equivalent to / replaced by formula (19-2).

[0831] [(SFN×numberOfSlotsPerFrame)

[0832] +(slot number in the frame)]=

[0833] (timeReferenceSFN×numberOfSlotsPerFrame

[0834] +timeDomainOffset+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame)

[0835] modulo(1024×numberOfSlotsPerFrame) formula (19-2)

[0836] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (20-1):

[0837] [(SFN×numberOfSlotsPerFrame)

[0838] +(slot number in the frame)]=

[0839] [(SFN start time ×numberOfSlotsPerFrame

[0840] +slot start time )+F{period of the first CG×N÷Y}×X]

[0841] modulo(1024×numberOfSlotsPerFrame) formula (20-1)

[0842] Optionally, formula (20-1) can be equivalent to / replaced by formula (20-2).

[0843] [(SFN×numberOfSlotsPerFrame)

[0844] +(slot number in the frame)]=

[0845] [(SFN start time ×numberOfSlotsPerFrame

[0846] +slot start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame]

[0847] modulo(1024×numberOfSlotsPerFrame) formula (20-2)

[0848] Optionally, when the first rounded value is F{the period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Y}×X+(K-1).

[0849] Optionally, when the unit of the period of the first CG is millisecond or subframe, and the first rounded value is F{period of the first CG×N÷Y}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Y}×X+(K-1).

[0850] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0851] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (19-3): [(SFN×numberOfSlotsPerFrame)

[0852] +(slot number in the frame)]=

[0853] (timeReferenceSFN×numberOfSlotsPerFrame

[0854] +timeDomainOffset+F{period of the first CG×N÷Y}×X+(K-1))

[0855] modulo(1024×numberOfSlotsPerFrame) formula (19-3)

[0856] Optionally, formula (19-3) can be equivalent to / replaced by formula (19-4).

[0857] [(SFN×numberOfSlotsPerFrame)

[0858] +(slot number in the frame)]=

[0859] (timeReferenceSFN×numberOfSlotsPerFrame

[0860] +timeDomainOffset+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame+(X-1))

[0861] modulo(1024×numberOfSlotsPerFrame) formula (19-4)

[0862] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (20-3): [(SFN×numberOfSlotsPerFrame)

[0863] +(slot number in the frame)]=

[0864] [(SFN start time ×numberOfSlotsPerFrame

[0865] +slot start time )+F{period of the first CG×N÷Y}×X+(K-1)]

[0866] modulo(1024×numberOfSlotsPerFrame) formula (20-3)

[0867] Optionally, formula (20-3) can be equivalent to / replaced by formula (20-4).

[0868] [(SFN×numberOfSlotsPerFrame)

[0869] +(slot number in the frame)]=

[0870] [(SFN start time ×numberOfSlotsPerFrame

[0871] +slot start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot÷numberOfSlotsPerFrame×10) / 10×numberOfSlotsPerFrame+(X-1)]

[0872] modulo(1024×numberOfSlotsPerFrame) formula (20-4)

[0873] Optionally, in a possible implementation, when the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Z}.

[0874] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Z}.

[0875] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0876] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG × N÷Z} is the time slot.

[0877] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period ×N÷Z of the first CG, and may also include others, which is not limited in this application.

[0878] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (21-1):

[0879] [(SFN×numberOfSlotsPerFrame)

[0880] +(slot number in the frame)]=

[0881] (timeReferenceSFN×numberOfSlotsPerFrame

[0882] +timeDomainOffset+F{period of the first CG×N÷Z})

[0883] modulo(1024×numberOfSlotsPerFrame) formula (21-1)

[0884] Optionally, formula (21-1) can be equivalent to / replaced by formula (21-2).

[0885] [(SFN×numberOfSlotsPerFrame)

[0886] +(slot number in the frame)]=

[0887] (timeReferenceSFN×numberOfSlotsPerFrame

[0888] +timeDomainOffset+ceil(N×periodicity÷numberOfSymbolsPerSlot))

[0889] modulo(1024×numberOfSlotsPerFrame) formula (21-2)

[0890] For example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10. Then, according to formula (21-1) or (21-2), the information of the CG timing in the Nth CG cycle can be calculated. As shown in Table 26, Table 26 shows the information of the CG timing in different CG cycles. For example, N=0, 1, 2.

[0891] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0892] Table 26 Information on CG timing in different CG cycles

[0893]

[0894] For example, as shown in Table 26, according to formula (21-1) or (21-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing in the Nth CG cycle can be calculated.

[0895] For example, it can be seen from Table 26 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (21-1) or (21-2) will not cross time slots.

[0896] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (22-1):

[0897] [(SFN×numberOfSlotsPerFrame)

[0898] +(slot number in the frame)]=

[0899] [(SFN start time ×numberOfSlotsPerFrame

[0900] +slot start time )+F{period of the first CG×N÷Z}]

[0901] modulo(1024×numberOfSlotsPerFrame) formula (22-1)

[0902] Optionally, formula (14-1) can be equivalent to / replaced by formula (14-2).

[0903] [(SFN×numberOfSlotsPerFrame)

[0904] +(slot number in the frame)]=

[0905] [(SFN start time ×numberOfSlotsPerFrame

[0906] +slot start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot)]

[0907] modulo(1024×numberOfSlotsPerFrame) formula (22-2)

[0908] For example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=14×50 / 3symbol, S=0, L=10. According to formula (22-1) or (22-2), the information of the CG timing in the Nth CG period can be calculated. As shown in Table 28, Table 28 shows the information of the CG timing in different CG periods. For example, N=0, 1, 2.

[0909] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0910] Table 28 Information on CG timing in different CG cycles

[0911]

[0912] For example, as shown in Table 28, according to formula (22-1) or (22-2), when N=0, the CG timing of the 0th CG cycle is calculated, when N=1, the CG timing of the 1st CG cycle is calculated, and when N=2, the CG timing of the 2nd CG cycle is calculated, and so on, the CG timing of the Nth CG cycle can be calculated.

[0913] For example, it can be seen from Table 28 that the CG opportunities in the 0th CG cycle to the 2nd CG cycle will not cross time slots. Furthermore, since the unit of the first rounding value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (22-1) or (22-2) will not cross time slots.

[0914] Optionally, when the first rounded value is F{the period of the first CG×N÷Z}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷Z}+(K-1).

[0915] Optionally, when the unit of the period of the first CG is symbol and the first rounded value is F{period of the first CG×N÷Z}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷Z}+(K-1).

[0916] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0917] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (21-3): [(SFN×numberOfSlotsPerFrame)

[0918] +(slot number in the frame)]=

[0919] (timeReferenceSFN×numberOfSlotsPerFrame

[0920] +timeDomainOffset+F{period of the first CG×N÷Z}+(K-1))

[0921] modulo(1024×numberOfSlotsPerFrame) formula (21-3)

[0922] Optionally, formula (21-3) can be equivalent to / replaced by formula (21-4).

[0923] [(SFN×numberOfSlotsPerFrame)

[0924] +(slot number in the frame)]=

[0925] (timeReferenceSFN×numberOfSlotsPerFrame

[0926] +timeDomainOffset+ceil(N×periodicity÷numberOfSymbolsPerSlot)+(X-1))

[0927] modulo(1024×numberOfSlotsPerFrame) formula (21-4)

[0928] For example, taking N=1 as an example, if timeReferenceSFN=0, timeDomainOffset=0, the period of the first CG periodicity=14×50 / 3symbol, timeDomainAllocation=0, S=0, L=10. According to formula (21-3) or (21-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 27, Table 27 shows the information of the Kth CG opportunity in the first CG period. Exemplarily, N=1. Exemplarily, K=1,2,3.

[0929] It should be noted that, in this embodiment, the information of the calculated first CG opportunity does not include the information of the symbol, and the information of the symbol can refer to the starting symbol configured by the base station, such as S. The following is an example in which the reference symbol configured by the base station is 2 and the length is L=10 (i.e., S=2,, L=10).

[0930] Table 27 Information of the Kth CG opportunity in the first CG cycle

[0931]

[0932] For example, as shown in Table 27, according to formula (21-3) or (21-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0933] For example, it can be seen from Table 27 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (21-3) or (21-4) will not cross time slots.

[0934] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (22-3): [(SFN×numberOfSlotsPerFrame)

[0935] +(slot number in the frame)]=

[0936] [(SFN start time×numberOfSlotsPerFrame

[0937] +slot start time )+F{period of the first CG×N÷Z}+(K-1)]

[0938] modulo(1024×numberOfSlotsPerFrame) formula (22-3)

[0939] Optionally, formula (22-3) can be equivalent to / replaced by formula (22-4).

[0940] [(SFN×numberOfSlotsPerFrame)

[0941] +(slot number in the frame)]=

[0942] [(SFN start time ×numberOfSlotsPerFrame

[0943] +slot start time )+ceil(N×periodicity÷numberOfSymbolsPerSlot)+(X-1)]

[0944] modulo(1024×numberOfSlotsPerFrame) formula (22-4)

[0945] For example, taking N=1 as an example, if SFN start time =0, slot start time =0, symbol start time =0, the period of the first CG periodicity=14×50 / 3symbol, L=10. According to formula (22-3) or (22-4), the information of the Kth CG opportunity in the first CG period can be calculated. As shown in Table 29, Table 29 shows the information of the Kth CG opportunity in the first CG period. For example, N=1, K=1, 2, 3.

[0946] Table 29 Information of the Kth CG opportunity in the first CG cycle

[0947]

[0948] For example, as shown in Table 29, according to formula (22-3) or (22-4), N=1, when K=1, the calculated result is the first CG timing in the first CG cycle, when K=2, the calculated result is the second CG timing in the first CG cycle, when K=3, the calculated result is the third CG timing in the first CG cycle, and so on, the CG timing in the Nth CG cycle can be calculated.

[0949] For example, it can be seen from Table 29 that the 1st CG opportunity to the 3rd CG opportunity in the 1st CG cycle will not cross time slots. Furthermore, since the unit of the first rounded value of the first rounding operation is the time slot, the CG opportunities in the CG cycle calculated according to formula (22-3) or (22-4) will not cross time slots.

[0950] Optionally, in a possible implementation, when the unit of the period of the first CG is a time slot, the first rounded value is F{period of the first CG×N÷X}.

[0951] Optionally, the information for determining the first CG timing based on the first rounded value may include / be replaced by: information for determining the first CG timing based on F{the period of the first CG×N÷X}.

[0952] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0953] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with millisecond granularity or subframe granularity, that is, the unit of the first rounding value F{period of the first CG×N÷X} is milliseconds or subframes.

[0954] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period of the first CG ×N÷X, and may also include others, which is not limited in this application.

[0955] Optionally, when the first rounded value is F{the period of the first CG×N÷X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷X}×X.

[0956] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N÷X}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷X}×X.

[0957] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (23-1):

[0958] [(SFN×numberOfSlotsPerFrame)

[0959] +(slot number in the frame)]=

[0960] (timeReferenceSFN×numberOfSlotsPerFrame

[0961] +timeDomainOffset+F{period of the first CG×N÷X}×X)

[0962] modulo(1024×numberOfSlotsPerFrame) formula (23-1)

[0963] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (24-1):

[0964] [(SFN×numberOfSlotsPerFrame)

[0965] +(slot number in the frame)]=

[0966] [(SFN start time ×numberOfSlotsPerFrame

[0967] +slot start time )+F{period of the first CG×N÷X}×X]

[0968] modulo(1024×numberOfSlotsPerFrame) formula (24-1)

[0969] Optionally, when the first rounded value is F{the period of the first CG×N÷X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷X}×X+(K-1).

[0970] Optionally, when the first rounded value is F{the period of the first CG×N÷X}, the information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N÷X}×X+(K-1).

[0971] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N÷X}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N÷X}×X+(K-1).

[0972] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[0973] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (23-3): [(SFN×numberOfSlotsPerFrame)

[0974] +(slot number in the frame)]=

[0975] (timeReferenceSFN×numberOfSlotsPerFrame

[0976] +timeDomainOffset+F{period of the first CG×N÷X}×X+(K-1))

[0977] modulo(1024×numberOfSlotsPerFrame) formula (23-3)

[0978] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (24-3): [(SFN×numberOfSlotsPerFrame)

[0979] +(slot number in the frame)]=

[0980] [(SFN start time ×numberOfSlotsPerFrame

[0981] +slot start time )+F{period of the first CG×N÷X}×X+(K-1)]

[0982] modulo(1024×numberOfSlotsPerFrame) formula (24-3)

[0983] Optionally, in another possible implementation, when the unit of the period of the first CG is a time slot, the first rounded value is F{the period of the first CG×N}.

[0984] Optionally, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}.

[0985] Optionally, the first CG opportunity may be / include: a CG opportunity in the Nth CG cycle, or a CG opportunity in the N+1th CG cycle, or the first CG opportunity in the Nth CG cycle, or the first CG opportunity in the N+1th CG cycle.

[0986] For example, in this case, the first rounding operation F{} can be regarded as a rounding operation with time slot granularity, that is, the unit of the first rounding value F{period of the first CG×N} is the time slot.

[0987] Optionally, the first rounding operation (or, within the first rounding operation, or, F{}, or, within F{}) includes at least the period ×N of the first CG, and may also include others, which is not limited in this application.

[0988] For example, if the first CG is Type 1 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (25-1):

[0989] [(SFN×numberOfSlotsPerFrame)

[0990] +(slot number in the frame)]=

[0991] (timeReferenceSFN×numberOfSlotsPerFrame

[0992] +timeDomainOffset+F{period of the first CG×N})

[0993] modulo(1024×numberOfSlotsPerFrame) formula (25-1)

[0994] For example, if the first CG is a Type 2 CG, the first CG opportunity or the CG opportunity in the Nth CG cycle (or, the first CG opportunity in the Nth CG cycle) or the CG opportunity in the N+1th CG cycle (or, the first CG opportunity in the N+1th CG cycle) is located in (or, appears in) the slot (or, SFN, slot) calculated according to the following formula (26-1):

[0995] [(SFN×numberOfSlotsPerFrame)

[0996] +(slot number in the frame)]=

[0997] [(SFN start time ×numberOfSlotsPerFrame

[0998] +slot start time )+F{period of the first CG×N}]

[0999] modulo(1024×numberOfSlotsPerFrame) formula (26-1)

[1000] Optionally, when the first rounded value is F{the period of the first CG×N}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{the period of the first CG×N}+(K-1).

[1001] Optionally, when the unit of the period of the first CG is time slot and the first rounded value is F{period of the first CG×N}, information determining the first CG timing based on the first rounded value may include: information determining the first CG timing based on F{period of the first CG×N}+(K-1).

[1002] Optionally, the first CG opportunity may be / include: the Kth CG opportunity in the Nth CG cycle, or the Kth CG opportunity in the N+1th CG cycle.

[1003] For example, if the first CG is Type 1 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (25-3): [(SFN×numberOfSlotsPerFrame)

[1004] +(slot number in the frame)]=

[1005] (timeReferenceSFN×numberOfSlotsPerFrame

[1006] +timeDomainOffset+F{period of the first CG×N}+(K-1))

[1007] modulo(1024×numberOfSlotsPerFrame) formula (25-3)

[1008] For example, if the first CG is a Type 2 CG, the first CG opportunity or the Kth CG opportunity in the Nth CG cycle or the Kth CG opportunity in the N+1th CG cycle is located in (or appears in) the slot (or SFN, slot) calculated according to the following formula (26-3): [(SFN×numberOfSlotsPerFrame)

[1009] +(slot number in the frame)]=

[1010] [(SFN start time ×numberOfSlotsPerFrame

[1011] +slot start time )+F{period of the first CG×N}+(K-1)]

[1012] modulo(1024×numberOfSlotsPerFrame) formula (26-3)

[1013] According to the technical solution provided by the present application, when the period of the CG is non-integer, the PUSCH can be prevented from crossing time slots, which is beneficial to reducing the implementation complexity and / or implementation cost of the terminal device and / or network device.

[1014] Figure 8 A schematic flow chart of a communication method provided in another embodiment of the present application is as follows: Figure 8 As shown, the method includes at least the following steps.

[1015] S810, the terminal device obtains the configuration information of the first CG.

[1016] For example, the terminal device obtains the configuration information of the first CG may include / be replaced by: the terminal device receives the configuration information of the first CG.

[1017] For example, accordingly, the network device sends the configuration information of the first CG to the terminal device.

[1018] For example, the configuration information of the first CG may include information of the period of the first CG.

[1019] Optionally, the period of the first CG is a non-integer or fraction. Optionally, the period of the first CG is a rational number. For example, the period of the first CG is 50 / 3ms or 25 / 3ms or 100 / 3ms or 100 / 9ms.

[1020] Optionally, the first CG is associated with the XR service.

[1021] Optionally, the first CG is associated with the XR service and may include / be replaced by: the first CG / first CG timing satisfies the LCP mapping restrictions of the XR-related LCH.

[1022] Optionally, the configuration information of the first CG may include other information in addition to the period information of the first CG.

[1023] Optionally, for different CG types, such as Type1 CG and Type2 CG, the configuration information of the first CG can be different or the same without restriction.

[1024] For example, the configuration information of the first CG of Type 1 CG may include, but is not limited to, any one or more of time reference frame (timeReferenceSFN), time domain offset (timeDomainOffset), period (periodicity), time domain resource allocation (timeDomainAllocation), starting symbol S, and length L. For example, timeDomainAllocation may indicate any one or more of starting symbol S, length L, and PUSCH mapping type. For example, S is the starting symbol. For example, L is the number of symbols occupied by an uplink resource.

[1025] For example, the configuration information of the first CG of Type 2 CG may include but is not limited to SFN start time 、slot start time 、symbol start time, periodicity, or length L.

[1026] For example, the relevant description of the configuration information of the first CG can be referred to the above, and for the sake of simplicity, it will not be repeated here. In addition, the configuration information of the first CG may also be different from that described above, and it should be understood that this application does not limit this.

[1027] S820: If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively, the terminal device offsets the time domain position of the first CG opportunity.

[1028] Optionally, the method may also include: S830, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the network device offsets the time domain position of the first CG opportunity.

[1029] It should be noted that the method for determining the starting position and ending position of the first CG opportunity based on the configuration information of the first CG may refer to the above description or the prior art, or may be other methods. It should be understood that the present application does not impose any limitation on this.

[1030] For example, the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, which may include / be replaced by: the starting position of the first CG opportunity is located in the first time slot, and the ending position of the first CG opportunity is located in the second time slot.

[1031] For example, the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, which may include / be replaced by: the first CG opportunity spans time slots.

[1032] Optionally, in a possible implementation, the end position of the offset first CG opportunity is located in the first time slot.

[1033] Optionally, the end position of the offset first CG opportunity is located at the last symbol of the first time slot.

[1034] Optionally, the end position of the offset first CG opportunity is located at a symbol other than the last symbol in the first time slot.

[1035] Optionally, the starting position of the offset first CG opportunity is located at the first symbol of the first time slot.

[1036] Optionally, the starting position of the offset first CG opportunity is located at a symbol other than the first symbol in the first time slot.

[1037] Optionally, the start position and end position of the offset first CG opportunity are both located in the first time slot.

[1038] Optionally, in another possible implementation, the starting position of the offset first CG opportunity is located in the second time slot.

[1039] Optionally, the starting position of the offset first CG opportunity is located at the first symbol of the second time slot.

[1040] Optionally, the starting position of the offset first CG opportunity is located at a symbol other than the first symbol in the second time slot.

[1041] Optionally, the end position of the offset first CG opportunity is located at the last symbol of the second time slot.

[1042] Optionally, the end position of the offset first CG opportunity is located at a symbol other than the last symbol in the second time slot.

[1043] Optionally, the start position and end position of the offset first CG opportunity are both located in the second time slot.

[1044] Optionally, offsetting the time domain position of the first CG opportunity may include / be replaced by: redetermining the time domain position of the first CG opportunity.

[1045] Optionally, offsetting the time domain position of the first CG opportunity may include / be replaced by: offsetting the time domain position of the first CG opportunity determined based on the configuration information of the first CG.

[1046] For example, redetermine can include / replace with: redetermine.

[1047] Optionally, the end position of the offset first CG opportunity may include / be replaced by: the re-determined end position of the first CG opportunity.

[1048] Optionally, the starting position of the offset first CG opportunity may include / be replaced by: the re-determined starting position of the first CG opportunity.

[1049] For example, the offset first CG timing may include / be replaced by: the real first CG timing.

[1050] For example, real can be included / replaced with: final.

[1051] Optionally, the terminal device and the network device may use the same method to offset the time domain position of the first CG opportunity.

[1052] For example, Fig. 9 As shown, Fig. 9This is a schematic diagram of the time domain position of the first CG opportunity illustrated in this application. Take the example that the starting position of the first CG opportunity is located at symbol 9 in the first time slot (for example, time slot 1), and the ending position is located at symbol 4 in the second time slot (for example, time slot 2). At this time, the first CG opportunity spans the first time slot (time slot 1) and the second time slot (time slot 2).

[1053] Optionally, in a possible implementation, the time domain position of the first CG opportunity is offset, and the end position of the first CG opportunity after the offset is located at the last symbol in the first time slot (for example, time slot 1), such as symbol D. Alternatively, the time domain position of the first CG opportunity is offset, and the end position of the first CG opportunity after the offset is located at a position other than the last symbol (symbol 13) in the first time slot (for example, time slot 1), such as symbol B. Fig.10 A schematic diagram of the time domain position of the first CG opportunity after the offset provided in the embodiment of the present application, such as Fig.10 As shown in (a) and (b), that is, the time domain position of the first CG opportunity is shifted toward the direction of the first time slot.

[1054] Optionally, in a possible implementation, the time domain position of the first CG opportunity is offset, and the starting position of the offset first CG opportunity is located at the first symbol of the second time slot (e.g., time slot 2), such as symbol 0. Alternatively, the time domain position of the first CG opportunity is offset, and the starting position of the offset first CG opportunity is located at a position other than the first symbol (e.g., symbol 0) of the second time slot (e.g., time slot 2), such as symbol 2. Fig.10 As shown in (c) and (d), that is, the time domain position of the first CG opportunity is shifted toward the direction of the second time slot.

[1055] For example, the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively. The first CG opportunity here can be understood as not being the real first CG opportunity.

[1056] For example, the first CG timing determined based on the configuration information of the first CG is not the true first CG timing.

[1057] According to the technical solution provided in the present application, it is possible to avoid the occurrence of PUSCH crossing time slots when the CG period is non-integer, which is beneficial to reducing the implementation complexity and / or implementation cost of terminal equipment and / or network equipment.

[1058] Fig.11 A schematic flow chart of a communication method provided in another embodiment of the present application is as follows: Fig.11 As shown, the method includes at least the following steps.

[1059] S1110, the terminal device obtains the configuration information of the first CG.

[1060] For example, the terminal device obtains the configuration information of the first CG may include / be replaced by: the terminal device receives the configuration information of the first CG.

[1061] For example, accordingly, the network device sends the configuration information of the first CG to the terminal device.

[1062] For example, the configuration information of the first CG may include information of the period of the first CG.

[1063] Optionally, the period of the first CG is a non-integer or fraction. Optionally, the period of the first CG is a rational number. For example, the period of the first CG is 50 / 3ms or 25 / 3ms or 100 / 3ms or 100 / 9ms

[1064] Optionally, the first CG is associated with the XR service.

[1065] Optionally, the first CG is associated with the XR service and may include / be replaced by: the first CG / first CG timing satisfies the LCP mapping restrictions of the XR-related LCH.

[1066] Optionally, the configuration information of the first CG may include other information in addition to the period information of the first CG.

[1067] Optionally, for different CG types, such as Type1 CG and Type2 CG, the configuration information of the first CG can be different or the same without restriction.

[1068] For example, the configuration information of the first CG of Type 1 CG may include, but is not limited to, any one or more of time reference frame (timeReferenceSFN), time domain offset (timeDomainOffset), period (periodicity), time domain resource allocation (timeDomainAllocation), starting symbol S, and length L. For example, timeDomainAllocation may indicate any one or more of starting symbol S, length L, and PUSCH mapping type. For example, S is the starting symbol. For example, L is the number of symbols occupied by an uplink resource.

[1069] For example, the configuration information of the first CG of Type 2 CG may include but is not limited to SFN start time 、slot start time 、symbol start time , periodicity, or length L.

[1070] For example, the relevant description of the configuration information of the first CG can be referred to the above, and for the sake of simplicity, it will not be repeated here. In addition, the configuration information of the first CG may also be different from that described above, and it should be understood that this application does not limit this.

[1071] S1120: If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the terminal device determines the time domain position of the first CG opportunity based on the information of the second CG opportunity.

[1072] Optionally, the method may also include: S1130, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the network device determines the time domain position of the first CG opportunity based on the information of the second CG opportunity.

[1073] It should be noted that the method for determining the starting position and ending position of the first CG opportunity based on the configuration information of the first CG may refer to the above description or the prior art, or may be other methods. It should be understood that the present application does not impose any limitation on this.

[1074] For example, the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, which may include / be replaced by: the starting position of the first CG opportunity is located in the first time slot, and the ending position of the first CG opportunity is located in the second time slot.

[1075] For example, the starting position and the ending position of the first CG opportunity are respectively located in the first time slot and the second time slot, which may include / be replaced by: the first CG opportunity spans time slots.

[1076] Optionally, the information of the second CG opportunity may include / be replaced by: information of the starting symbol of the second CG opportunity.

[1077] Optionally, the time domain position of the first CG opportunity may include / be replaced by: the starting position of the first CG opportunity.

[1078] Optionally, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity may include / be replaced by: determining the actual time domain position of the first CG opportunity based on the information of the second CG opportunity.

[1079] For example, real can be included / replaced with: final.

[1080] Optionally, the time domain position of the first CG opportunity may include / be replaced by: information of the first CG opportunity.

[1081] Optionally, the information of the first CG opportunity may include / be replaced by: any one or more of the information of the frame, time slot and symbol of the first CG opportunity.

[1082] For example, any one or more of the information of the frame, time slot and symbol of the first CG opportunity may include / be replaced by: any one or more of the information of the frame, time slot and symbol where the first CG opportunity is located, or, any one or more of the information of the starting frame, starting time slot and starting symbol of the first CG opportunity, or, any one or more of the information of the frame, time slot and symbol of the starting position of the first CG opportunity, or, any one or more of the information of the frame, time slot and symbol where the starting position of the first CG opportunity is located.

[1083] For example, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity may include / be replaced by: re-determining the time domain position of the first CG opportunity based on the information of the second CG opportunity.

[1084] For example, determine can be included / replaced with: redetermine.

[1085] For example, redetermine can include / replace with: redetermine.

[1086] Optionally, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity includes / is replaced by: determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the first time slot, or determining the time domain position of the first CG opportunity based on the information of the second CG opportunity and the second time slot.

[1087] Optionally, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity includes / is replaced by: determining the time domain position of the first CG opportunity based on the information of the second CG opportunity, the information of the first time slot and the information of the first SFN, or determining the time domain position of the first CG opportunity based on the information of the second CG opportunity, the information of the second time slot and the information of the first SFN.

[1088] For example, the information of the first time slot may include / be replaced by: the index of the first time slot.

[1089] For example, the information of the second time slot may include / be replaced by: the index of the second time slot.

[1090] For example, the information of the first SFN may include / be replaced by: the index of the first SFN, or the first SFN.

[1091] For example, the information of the second SFN may include / be replaced by: the index of the second SFN, or the second SFN.

[1092] For example, the information of the starting position of the first CG opportunity determined based on the configuration information of the first CG includes any one or more of the following: information of the first SFN, an index of the first time slot, and information of the first time slot.

[1093] For example, the information of the end position of the first CG opportunity determined based on the configuration information of the first CG includes any one or more of the following: information of the second SFN, an index of the second time slot, and information of the second time slot.

[1094] For example, the first SFN and the second SFN may be the same or different, and this application does not limit this.

[1095] For example, the first time slot and the second time slot are different.

[1096] Optionally, in a possible implementation, the second CG opportunity is a CG opportunity in the Mth CG cycle.

[1097] Optionally, M is equal to 0, or, M is equal to 1.

[1098] For example, if M is equal to 0, the second CG timing is the CG timing in the 0th CG cycle. For example, if M is equal to 1, the second CG timing is the CG timing in the 1st CG cycle.

[1099] Optionally, in a possible implementation, the information of the second CG opportunity includes / is replaced by: information of the starting symbol included in the configuration information of the first CG, or information of the starting symbol.

[1100] For example, the information of the starting symbol included in the configuration information of the first CG can be understood as the information of the starting symbol indicated by the network device to the terminal device. It should be noted that the information of the starting symbol included in the configuration information of the first CG can be understood as the configuration information of the first CG explicitly including the starting symbol information, or the configuration information of the first CG implicitly including the starting symbol information. It should be understood that the embodiments of the present application are not limited to this.

[1101] Optionally, the present application further includes: the terminal device obtains information of the starting symbol. For example, the terminal device receives information of the starting symbol sent by the network device.

[1102] It should also be noted that the information of the starting symbol indicated by the network device to the terminal device can be understood as the information of the starting symbol explicitly indicated by the network device to the terminal device, or the information of the starting symbol implicitly indicated by the network device to the terminal device. It should be understood that the embodiments of the present application are not limited to this.

[1103] For example, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity can be understood as redetermining the time domain position of the first CG opportunity based on the starting symbol and the first time slot included in the configuration information of the first CG; or, redetermining the time domain position of the first CG opportunity based on the starting symbol and the first time slot.

[1104] For example, Fig. 9 As shown, assuming that the starting position of the first CG opportunity is located at symbol 9 in the first time slot (for example, time slot 1), and the ending position is located at symbol 4 in the second time slot (for example, time slot 2), at this time, the first CG opportunity spans the first time slot and the second time slot.

[1105] Optionally, the time domain position of the first CG opportunity can be determined based on the starting symbol included in the configuration information of the first CG, for example, the starting symbol is 3, and further based on the first time slot being time slot 1. Fig.12 A schematic diagram of the time domain position of the first CG opportunity determined based on the second CG opportunity information provided in an embodiment of the present application. Fig.12 As shown in (a), for example, the starting position of the re-determined first CG opportunity is symbol 3, the ending position is symbol C, the time slot is time slot 1, and the SFN remains unchanged.

[1106] Optionally, in a possible implementation, the second CG opportunity is a CG opportunity in the first N CG cycles of the CG cycle in which the first CG opportunity is located, where N≥1 and N is an integer.

[1107] For example, determining the time domain position of the first CG opportunity based on the information of the second CG opportunity can be understood as that the first time slot redetermines the time domain position of the first CG opportunity based on the starting symbol of the second CG opportunity.

[1108] For example, Fig. 9 As shown, assuming that the starting position of the first CG opportunity is located at symbol 9 in the first time slot (for example, time slot 1), and the ending position is located at symbol 4 in the second time slot (for example, time slot 2), at this time, the first CG opportunity spans the first time slot and the second time slot.

[1109] Optionally, the time domain position of the first CG opportunity can be re-determined based on the starting symbol of the second CG opportunity, for example, the starting symbol of the second CG opportunity is 2, and the first time slot is time slot 1, and the SFN of the first CG opportunity. For example, the starting position of the re-determined first CG opportunity is symbol 2, the ending position is symbol B, the time slot is time slot 1, and the SFN remains unchanged, such as Fig.12 as shown in (b).

[1110] Optionally, the terminal device and the network device may use the same method to redetermine the time domain position of the first CG opportunity.

[1111] For example, the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively. The first CG opportunity here can be understood as not being the real first CG opportunity.

[1112] For example, the first CG timing determined based on the configuration information of the first CG is not the true first CG timing.

[1113] According to the technical solution provided by the present application, when the period of the CG is non-integer, the PUSCH can be prevented from crossing time slots, which is beneficial to reducing the implementation complexity and / or implementation cost of the terminal device and / or network device.

[1114] Fig.13 A schematic flow chart of a communication method provided in another embodiment of the present application is as follows: Fig.13 As shown, the method includes at least the following steps.

[1115] S1310, the terminal device obtains the configuration information of the first CG.

[1116] For example, the terminal device obtains the configuration information of the first CG may include / be replaced by: the terminal device receives the configuration information of the first CG.

[1117] For example, accordingly, the network device sends the configuration information of the first CG to the terminal device.

[1118] For example, the configuration information of the first CG may include information of the period of the first CG.

[1119] Optionally, the period of the first CG is a non-integer or fraction. Optionally, the period of the first CG is a rational number. For example, the period of the first CG is 50 / 3ms or 25 / 3ms or 100 / 3ms or 100 / 9ms

[1120] Optionally, the first CG is associated with the XR service.

[1121] Optionally, the first CG is associated with the XR service and may include / be replaced by: the first CG / first CG timing satisfies the LCP mapping restrictions of the XR-related LCH.

[1122] Optionally, the configuration information of the first CG may include other information in addition to the period information of the first CG.

[1123] Optionally, for different CG types, such as Type1 CG and Type2 CG, the configuration information of the first CG can be different or the same without restriction.

[1124] For example, the configuration information of the first CG of Type 1 CG may include, but is not limited to, any one or more of time reference frame (timeReferenceSFN), time domain offset (timeDomainOffset), period (periodicity), time domain resource allocation (timeDomainAllocation), starting symbol S, and length L. For example, timeDomainAllocation may indicate any one or more of starting symbol S, length L, and PUSCH mapping type. For example, S is the starting symbol. For example, L is the number of symbols occupied by an uplink resource.

[1125] For example, the configuration information of the first CG of Type 2 CG may include but is not limited to SFN start time 、slot start time 、symbol start time , periodicity, or length L.

[1126] For example, the relevant description of the configuration information of the first CG can be referred to the foregoing, and for the sake of simplicity, it will not be repeated here. In addition, the configuration information of the first CG may also be different from that described above, and it should be understood that the present application does not limit this. S1320, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the terminal device ignores the first CG opportunity, or the terminal device ignores the part of the first CG opportunity in the first time slot, or the terminal device ignores the part of the first CG opportunity in the second time slot.

[1127] Optionally, the method also includes: S1330, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the network device ignores the first CG opportunity, or the network device ignores the part of the first CG opportunity in the first time slot, or the network device ignores the part of the first CG opportunity in the second time slot.

[1128] It should be noted that the method for determining the starting position and ending position of the first CG opportunity based on the configuration information of the first CG may refer to the above description or the prior art, or may be other methods. It should be understood that the present application is not limited thereto.

[1129] Optionally, in a possible implementation, ignoring the first CG opportunity may include / be replaced by: determining that the first CG opportunity is an invalid opportunity.

[1130] Optionally, the first CG opportunity is an invalid opportunity, which can be understood as the terminal device does not send data at the first CG opportunity, and / or the network device does not receive data at the first CG opportunity.

[1131] Optionally, ignoring the portion of the first CG opportunity in the first time slot may include / replace with: determining that the portion of the first CG opportunity in the first time slot is an invalid CG opportunity, or, determining that the portion of the first CG opportunity in the first time slot is invalid; or, determining that the portion of the first CG opportunity in the second time slot is the first CG opportunity (or the true first CG opportunity) or a valid CG opportunity.

[1132] Optionally, ignoring the portion of the first CG opportunity in the second time slot may include / replace with: determining that the portion of the first CG opportunity in the second time slot is an invalid CG opportunity, or determining that the portion of the first CG opportunity in the second time slot is invalid; or determining that the portion of the first CG opportunity in the first time slot is the first CG opportunity (or the true first CG opportunity) or a valid CG opportunity.

[1133] For example, Fig. 9 As shown, assuming that the starting position of the first CG opportunity is located at symbol 9 in the first time slot (for example, time slot 1), and the ending position is located at symbol 4 in the second time slot (for example, time slot 2), at this time, the first CG opportunity spans the first time slot and the second time slot.

[1134] In one possible implementation, Fig.14 A schematic diagram of the time domain position of the first CG opportunity provided by another embodiment of the present application. Fig.14 As shown, the first CG opportunity is ignored.

[1135] In one possible implementation, Fig.15 A schematic diagram of the time domain position of the first CG opportunity provided by another embodiment of the present application, specifically, ignoring the part of the first CG opportunity in the first time slot, such as Fig.15 Alternatively, the portion of the first CG opportunity in the second time slot is ignored, as shown in (a). Fig.15 as shown in (b).

[1136] Optionally, in one possible implementation, the part of the first CG opportunity in the second time slot is ignored, which can be understood as determining that the end position of the first CG opportunity (or the true first CG opportunity) is located in the first time slot, for example, at the last symbol of the first time slot, or at a symbol other than the last symbol in the first time slot.

[1137] Optionally, in one possible implementation, the part of the first CG opportunity in the first time slot is ignored, which can be understood as determining that the starting position of the first CG opportunity (or the true first CG opportunity) is located in the second time slot, for example, the first symbol in the second time slot, or a symbol in the second time slot other than the first symbol.

[1138] For example, Fig. 9 As shown, assuming that the starting position of the first CG opportunity is located at symbol 9 in the first time slot (for example, time slot 1), and the ending position is located at symbol 4 in the second time slot (for example, time slot 2), at this time, the first CG opportunity spans the first time slot and the second time slot.

[1139] In one possible implementation, Fig.16 A schematic diagram of the time domain position of the first CG opportunity provided by another embodiment of the present application. Fig.16 As shown, it can be determined that the end position of the first CG opportunity is located at symbol D in the first time slot, or the end position of the first CG opportunity is located at a symbol other than symbol D in the first time slot, for example, symbol B. Fig.16 The solid-line frame portion can be understood as the time domain position of the first CG opportunity, and the terminal device considers the end position of the first CG opportunity to be symbol D or symbol B.

[1140] In one possible implementation, Fig.16 A schematic diagram of the time domain position of the first CG opportunity provided by another embodiment of the present application. Fig.16 As shown, it can be determined that the starting position of the first CG opportunity is located at symbol 0 in the second time slot, or the starting position of the first CG opportunity is located at a symbol other than symbol 0 in the second time slot, for example, symbol 2. Fig.16 The solid-line frame portion can be understood as the time domain position of the first CG opportunity, and the terminal device considers the starting position of the first CG opportunity to be symbol 0 or symbol 2.

[1141] Optionally, ignoring the portion of the first CG opportunity in the first time slot may be or be replaced by: satisfying the first condition and ignoring the portion of the first CG opportunity in the first time slot.

[1142] For example, the first condition may include: the portion of the first CG opportunity in the first time slot is greater than or equal to the portion of the first CG opportunity in the second time slot, or, the portion of the first CG opportunity in the first time slot is less than or equal to the portion of the first CG opportunity in the second time slot, or, the length of the portion of the first CG opportunity in the first time slot in the time domain is greater than or equal to the length of the portion of the first CG opportunity in the second time slot in the time domain, or, the length of the portion of the first CG opportunity in the first time slot in the time domain is less than or equal to the length of the portion of the first CG opportunity in the second time slot in the time domain.

[1143] Optionally, ignoring the portion of the first CG opportunity in the second time slot may be or be replaced by: satisfying the first condition and ignoring the portion of the first CG opportunity in the second time slot.

[1144] Optionally, the portion of the first CG opportunity in the first time slot is greater than or equal to the portion of the first CG opportunity in the second time slot, or, the portion of the first CG opportunity in the first time slot is less than or equal to the portion of the first CG opportunity in the second time slot, or, the length of the portion of the first CG opportunity in the first time slot in the time domain is greater than or equal to the length of the portion of the first CG opportunity in the second time slot in the time domain, or, the length of the portion of the first CG opportunity in the first time slot in the time domain is less than or equal to the length of the portion of the first CG opportunity in the second time slot in the time domain.

[1145] For example, the portion of the first CG opportunity in the first time slot may include / be understood as: the portion of the first CG opportunity in the first time slot determined based on the configuration information of the first CG.

[1146] For example, the portion of the first CG opportunity in the second time slot may include / be understood as: the portion of the first CG opportunity in the second time slot determined based on the configuration information of the first CG.

[1147] Optionally, in a possible implementation, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, and the time domain length of the first CG opportunity in the first time slot is less than the time slot length of the first CG opportunity in the second time slot, the part of the first CG opportunity in the first time slot is ignored, or the part of the first CG opportunity in the second time slot is ignored.

[1148] Optionally, in a possible implementation, if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, and the time domain length of the first CG opportunity in the first time slot is greater than the time slot length of the first CG opportunity in the second time slot, the part of the first CG opportunity in the first time slot is ignored, or the part of the first CG opportunity in the second time slot is ignored.

[1149] For example, real can be included / replaced with: final.

[1150] Optionally, the terminal device and the network device may adopt the same method to ignore the first CG opportunity, or ignore the part of the first CG opportunity in the first time slot, or ignore the part of the first CG opportunity in the second time slot.

[1151] For example, the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively. The first CG opportunity here can be understood as not being the real first CG opportunity.

[1152] For example, the first CG timing determined based on the configuration information of the first CG is not the true first CG timing.

[1153] According to the technical solution provided by the present application, when the period of the CG is non-integer, the PUSCH can be prevented from crossing time slots, which is beneficial to reducing the implementation complexity and / or implementation cost of the terminal device and / or network device.

[1154] It should be understood that the prior art may change with the evolution of technical solutions, and the technical solutions provided in this application are not limited to the provided prior art.

[1155] It should be noted that different embodiments or some steps (for example, any one or more steps) in different embodiments in the present application can be combined with each other to form new embodiments. It should be noted that some steps or any one or more steps in different embodiments may include optional steps in a certain embodiment, mandatory steps in a certain embodiment, or optional steps and mandatory steps in a certain embodiment, and the present application does not limit this.

[1156] It should be noted that, unless otherwise specified or there is no logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other.

[1157] It should be noted that the sequence of the steps in the embodiments of the present application is not limited by the present application.

[1158] It should be noted that the order of judging different conditions in the embodiments of the present application is not limited by the present application.

[1159] It should be noted that the words “after” and “when” in this application do not strictly limit the time point.

[1160] It should be noted that the nouns, terms, etc. involved in this application are merely examples and may also be other names, which are not limited in this application.

[1161] Finally, the device embodiment of the embodiment of the present application is introduced.

[1162] In order to implement the functions in the method provided in this application, the terminal device and the network device may include a hardware structure and / or a software module, and implement the above functions in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether one of the above functions is executed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.

[1163] Fig.17 17 is a schematic block diagram of a communication device 1700 according to an embodiment of the present application. The communication device 1700 includes a processor 1710 and a communication interface 1720, and the processor 1710 and the communication interface 1720 may be interconnected via a bus 1730. The communication device 1700 may be a terminal device or a network device.

[1164] Optionally, the communication device 1700 may further include a memory 1740. The memory 1740 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a portable read-only memory (CD-ROM), and the memory 1740 is used for related instructions and data.

[1165] The processor 1710 may be one or more central processing units (CPUs). When the processor 1710 is a CPU, the CPU may be a single-core CPU or a multi-core CPU.

[1166] When the communication device 1700 is a network device, exemplarily, the processor 1710 is used to perform the following operations: determine information of a first CG timing based on a first rounding value, wherein the first rounding value is associated with a period of the first CG and a first rounding operation, and the unit of the first rounding value is not a symbol.

[1167] Exemplarily, processor 1710 is used to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1168] Exemplarily, processor 1710 is used to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is determined based on the information of the second CG opportunity.

[1169] Exemplarily, the processor 1710 is configured to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot, respectively,

[1170] Ignore the first CG opportunity; or,

[1171] Ignore the portion of the first CG opportunity in the first time slot; or,

[1172] Ignore the portion of the first CG opportunity in the second time slot.

[1173] When the communication device 1700 is a terminal device, illustratively, the processor 1710 is configured to perform the following operations:

[1174] Information about the first CG timing is determined based on a first rounding value, wherein the first rounding value is associated with the period of the first CG and a first rounding operation, and the unit of the first rounding value is not a symbol.

[1175] Exemplarily, processor 1710 is used to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1176] Exemplarily, processor 1710 is used to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is determined based on the information of the second CG opportunity.

[1177] Exemplarily, the processor 1710 is configured to perform the following operations: if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot, respectively,

[1178] Ignore the first CG opportunity; or,

[1179] Ignore the portion of the first CG opportunity in the first time slot; or,

[1180] Ignore the portion of the first CG opportunity in the second time slot.

[1181] The above contents are only exemplary descriptions. When the communication device 1700 is a terminal device / network device, it will be responsible for executing the methods or steps related to the terminal device / network device in the above method embodiments.

[1182] The above description is only an exemplary description. For specific content, please refer to the content shown in the above method embodiment. Fig.17 The implementation of each operation in can also refer to Figure 7-Figure 16 The corresponding description of the method embodiment shown.

[1183] Fig.18 1 is a schematic block diagram of a communication device 1800 according to an embodiment of the present application. The communication device 1800 may be a terminal device / network device, or a chip or module in a terminal device / network device, for implementing the method involved in the above embodiment. The communication device 1800 includes a transceiver unit 1810 and a processing unit 1820. The transceiver unit 1810 and the processing unit 1820 are exemplarily introduced below.

[1184] The transceiver unit 1810 may include a transmitting unit and a receiving unit. The transmitting unit is used to perform a transmitting action of the communication device, and the receiving unit is used to perform a receiving action of the communication device. For ease of description, the embodiment of the present application combines the transmitting unit and the receiving unit into one transceiver unit. A unified description is given here, and no further description is given later.

[1185] When the communication device 1800 is a terminal device, exemplarily, the transceiver unit 1810 is used to obtain configuration information of a first configuration authorization CG, the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to determine information about the timing of the first CG based on a first rounding value, the first rounding value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounding value is not a symbol.

[1186] Exemplarily, the transceiver unit 1810 is used to obtain configuration information of a first configuration authorization CG, the configuration information of the first CG including information of the period of the first CG; the processing unit 1820 is used to offset the time domain position of the first CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1187] Exemplarily, the transceiver unit 1810 is used to obtain configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of the period of the first CG; the processing unit 1820 is used to determine the time domain position of the first CG opportunity based on the information of the second CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot.

[1188] Exemplarily, the transceiver unit 1810 is used to obtain configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to determine the start position and the end position of the first CG opportunity determined based on the configuration information of the first CG, if they are located in the first time slot and the second time slot, respectively.

[1189] Ignore the first CG opportunity; or,

[1190] Ignore the portion of the first CG opportunity in the first time slot; or,

[1191] Ignore the portion of the first CG opportunity in the second time slot.

[1192] When the communication device 1800 is a network device, exemplarily, the transceiver unit 1810 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of the period of the first CG; the processing unit 1820 is used to determine information of the first CG timing based on a first rounding value, wherein the first rounding value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounding value is not a symbol.

[1193] Exemplarily, the transceiver unit 1810 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to offset the time domain position of the first CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1194] Exemplarily, the transceiver unit 1810 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of the period of the first CG; the processing unit 1820 is used to determine the time domain position of the first CG opportunity based on the information of the second CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot.

[1195] Exemplarily, the transceiver unit 1810 is used to send configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to determine the start position and the end position of the first CG opportunity determined based on the configuration information of the first CG if they are located in the first time slot and the second time slot, respectively.

[1196] Ignore the first CG opportunity; or,

[1197] Ignore the portion of the first CG opportunity in the first time slot; or,

[1198] Ignore the portion of the first CG opportunity in the second time slot.

[1199] The above contents are only exemplary descriptions. When the communication device 1800 is a terminal device / network device, it will be responsible for executing the methods or steps related to the terminal device / network device in the above method embodiments.

[1200] Optionally, the communication device 1800 further includes a storage unit 1830, and the storage unit 1830 is used to store a program or code for executing the aforementioned method.

[1201] Fig.17 and Fig.18 The device embodiment shown is used to implement Figure 7-Figure 16 The content described. Fig.17 and Fig.18 The specific execution steps and methods of the device shown can refer to the contents described in the aforementioned method embodiment.

[1202] Fig.19 1 is a schematic block diagram of a communication device 1900 according to an embodiment of the present application. The communication device 1900 is used to implement the functions of a terminal device / network device. The communication device 1900 may be a chip in a terminal device / network device.

[1203] The communication device 1900 includes: an input / output interface 1920 and a processor 1910. The input / output interface 1920 may be an input / output circuit. The processor 1910 may be a signal processor, a chip, or other integrated circuit that can implement the method of the present application. The input / output interface 1920 is used for inputting or outputting signals or data.

[1204] For example, when the communication device 1900 is a terminal device, the input-output interface 1920 is used to obtain configuration information of a first configuration authorization CG, and the configuration information of the first CG includes information about the period of the first CG. The processor 1910 is used to determine information about the first CG timing based on a first rounding value, the first rounding value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounding value is not a symbol.

[1205] Exemplarily, the input-output interface 1920 is used to obtain configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to offset the time domain position of the first CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1206] Exemplarily, the input-output interface 1920 is used to obtain configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to determine the time domain position of the first CG opportunity based on information of the second CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot.

[1207] Exemplarily, the input / output interface 1920 is used to obtain configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of a period of the first CG; the processing unit 1820 is used to determine, if the start position and the end position of the first CG timing determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot,

[1208] Ignore the first CG opportunity; or,

[1209] Ignore the portion of the first CG opportunity in the first time slot; or,

[1210] Ignore the portion of the first CG opportunity in the second time slot.

[1211] The processor 1910 is also used to execute part or all of the steps of any method provided in this application.

[1212] For example, the communication device 1900 is a network device, and the input and output port 1920 is used to send configuration information of a first configuration authorization CG, and the configuration information of the first CG includes information about the period of the first CG. The processor 1910 is used to determine information about the first CG timing based on a first rounding value, and the first rounding value is associated with the period of the first CG and the first rounding operation, and the unit of the first rounding value is not a symbol.

[1213] Exemplarily, the input-output interface 1920 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information about the period of the first CG; the processing unit 1820 is used to offset the time domain position of the first CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

[1214] Exemplarily, the input-output interface 1920 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of the period of the first CG; the processing unit 1820 is used to determine the time domain position of the first CG opportunity based on the information of the second CG opportunity if the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot.

[1215] Exemplarily, the input / output interface 1920 is used to send configuration information of a first configuration authorization CG, wherein the configuration information of the first CG includes information of a period of the first CG; the processing unit 1820 is used to determine the start position and the end position of the first CG opportunity determined based on the configuration information of the first CG, if they are located in the first time slot and the second time slot, respectively.

[1216] Ignore the first CG opportunity; or,

[1217] Ignore the portion of the first CG opportunity in the first time slot; or,

[1218] Ignore the portion of the first CG opportunity in the second time slot.

[1219] In one possible implementation, the processor 1910 implements the functions implemented by the network device or the terminal device by executing instructions stored in the memory.

[1220] Optionally, the communication device 1900 also includes a memory.

[1221] Optionally, the processor and memory are integrated together.

[1222] Optionally, the memory is outside the communication device 1900 .

[1223] In a possible implementation, the processor 1910 may be a logic circuit, and the processor 1910 inputs / outputs messages or signals through the input / output interface 1920. The logic circuit may be a signal processor, a chip, or other integrated circuit that can implement the method of the embodiment of the present application.

[1224] The above description of the communication device 1900 is only an exemplary description. The communication device 1900 can be used to execute the method described in the above embodiment. The specific content can be found in the description of the above method embodiment, which will not be repeated here.

[1225] Fig. 20 2 is a schematic block diagram of a communication device 2000 according to an embodiment of the present application. The communication device 2000 may be a network device or a chip in a network device. The communication device 2000 is used to execute Figure 7-Figure 16 The operations in the method embodiment shown are performed by the network device.

[1226] When the communication device 2000 is a network device, for example, it is a base station. Fig. 20 A simplified schematic diagram of the base station structure is shown. The base station includes module 2010, module 2020 and module 2030. Module 2010 is mainly used for baseband processing, controlling the base station, etc.; module 2010 is usually the control center of the base station, which can be generally referred to as a processor, and is used to control the base station to perform the processing operations on the network device side in the above method embodiment. Module 2020 is mainly used to store computer program code and data. Module 2030 is mainly used for receiving and transmitting radio frequency signals and converting radio frequency signals into baseband signals; module 2030 can generally be referred to as a transceiver module, a transceiver, a transceiver circuit, or a transceiver, etc. The transceiver module of module 2030, which can also be referred to as a transceiver or a transceiver, etc., includes an antenna 2033 and a radio frequency circuit ( Fig. 20 Not shown), wherein the RF circuit is mainly used for RF processing. Optionally, the device for implementing the receiving function in module 2030 can be regarded as a receiver, and the device for implementing the sending function can be regarded as a transmitter, that is, module 2030 includes a receiver 2032 and a transmitter 2031. The receiver can also be called a receiving module, a receiver, or a receiving circuit, etc., and the transmitter can be called a transmitting module, a transmitter, or a transmitting circuit, etc.

[1227] Module 2010 and module 2020 may include one or more single boards, each of which may include one or more processors and one or more memories. The processor is used to read and execute the program in the memory to realize the baseband processing function and the control of the base station. If there are multiple single boards, each single board can be interconnected to enhance the processing capability. As an optional implementation, multiple single boards may share one or more processors, or multiple single boards may share one or more memories, or multiple single boards may share one or more processors at the same time.

[1228] For example, in one implementation, the transceiver module of module 2030 is used to perform Figure 7-Figure 16 The processor of module 2010 is used to execute the sending and receiving related processes performed by the network device in the embodiment shown. Figure 7-Figure 16The illustrated embodiment relates to processes performed by the network device.

[1229] In another implementation, the processor of module 2010 is used to execute Figure 7-Figure 16 The illustrated embodiment is a process related to the processing performed by the communication device.

[1230] In another implementation, the transceiver module of module 2030 is used to execute Figure 7-Figure 16 The illustrated embodiment shows a process related to transmission and reception performed by a communication device.

[1231] It should be understood that Fig. 20 This is only an example and not a limitation. The network device including the processor, memory and transceiver may not rely on Figures 17 to 19 The structure shown.

[1232] When the communication device 2000 is a chip, the chip includes a transceiver, a memory and a processor. The transceiver may be an input / output circuit or a communication interface; the processor may be a processor, a microprocessor or an integrated circuit integrated on the chip. The sending operation of the network device in the above method embodiment may be understood as the output of the chip, and the receiving operation of the network device in the above method embodiment may be understood as the input of the chip.

[1233] Fig.21 2 is a schematic block diagram of a communication device 2100 of an embodiment of the present application. The communication device 2100 may be a terminal device, a processor or a chip of a terminal device. The communication device 2100 may be used to perform the operations performed by the terminal device or the communication device in the above method embodiment.

[1234] When the communication device 2100 is a terminal device, Fig.21 FIG. 1 shows a simplified schematic diagram of the structure of a terminal device. Fig.21 As shown, the terminal device includes a processor, a memory, and a transceiver. The memory can store computer program codes, and the transceiver includes a transmitter 2131, a receiver 2132, and a radio frequency circuit ( Fig.21 Not shown), antenna 2133 and input / output device ( Fig.21 not shown).

[1235] The processor is mainly used to process communication protocols and communication data, as well as to control terminal devices, execute software programs, process software program data, etc. The memory is mainly used to store software programs and data. The radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing radio frequency signals. The antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices. For example, touch screens, display screens, keyboards, etc. are mainly used to receive data input by users and output data to users. It should be noted that some types of terminal devices may not have input and output devices.

[1236] When data needs to be sent, the processor performs baseband processing on the data to be sent and outputs the baseband signal to the RF circuit. The RF circuit performs RF processing on the baseband signal and then sends the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the terminal device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor. The processor converts the baseband signal into data and processes the data. For ease of explanation, Fig.21 Only one memory, processor and transceiver are shown. In an actual terminal device product, there may be one or more processors and one or more memories. The memory may also be referred to as a storage medium or a storage device. The memory may be set independently of the processor or integrated with the processor, and the embodiments of the present application do not limit this.

[1237] In the embodiment of the present application, the antenna and the radio frequency circuit with transceiver functions can be regarded as the transceiver module of the terminal device, and the processor with processing function can be regarded as the processing module of the terminal device.

[1238] like Fig.21 As shown, the terminal device includes a processor 2110, a memory 2120 and a transceiver 2130. The processor 2110 can be called a processing unit, a processing board, a processing module, a processing device, etc., and the transceiver 2130 can be called a transceiver unit, a transceiver, a transceiver device, etc.

[1239] Optionally, the device for implementing the receiving function in the transceiver 2130 may be regarded as a receiving module, and the device for implementing the transmitting function in the transceiver 2130 may be regarded as a transmitting module, that is, the transceiver 2130 includes a receiver and a transmitter. A transceiver may sometimes be referred to as a transceiver, a transceiver module, or a transceiver circuit, etc. A receiver may sometimes be referred to as a receiver, a receiving module, or a receiving circuit, etc. A transmitter may sometimes be referred to as a transmitter, a transmitting module, or a transmitting circuit, etc.

[1240] For example, in one implementation, the processor 2110 is used to execute Figure 7-Figure 16 In the embodiment shown, the processing action of the terminal device is performed by the transceiver 2130. Figure 7-Figure 16 The sending and receiving actions of the terminal device in the middle.

[1241] For example, in one implementation, the processor 2110 is used to execute Figure 7-Figure 16 In the embodiment shown, the processing action of the terminal device is performed by the transceiver 2130. Figure 7-Figure 16 The sending and receiving actions of the terminal device in the middle.

[1242] It should be understood that Fig.21 This is only an example and not a limitation. The terminal device including the transceiver module and the processing module may not rely on Figures 17 to 19 The structure shown.

[1243] When the communication device 2100 is a chip, the chip includes a processor, a memory and a transceiver. The transceiver may be an input / output circuit or a communication interface; the processor may be a processing module or a microprocessor or an integrated circuit integrated on the chip. The sending operation of the terminal device in the above method embodiment may be understood as the output of the chip, and the receiving operation of the terminal device in the above method embodiment may be understood as the input of the chip.

[1244] The present application also provides a chip, including a processor, for calling and executing instructions stored in a memory from the memory, so that a communication device equipped with the chip executes the methods in the above examples.

[1245] The present application also provides another chip, including: an input interface, an output interface, and a processor, wherein the input interface, the output interface, and the processor are connected via an internal connection path, and the processor is used to execute the code in the memory, and when the code is executed, the processor is used to execute the method in each of the above examples. Optionally, the chip also includes a memory, and the memory is used to store computer programs or codes.

[1246] The present application also provides a processor, which is coupled to a memory and is used to execute the methods and functions involving a network device or a terminal device in any of the above-mentioned embodiments.

[1247] In another embodiment of the present application, a computer program product including instructions is provided. When the computer program product is run on a computer, the method of the above embodiment is implemented.

[1248] The present application also provides a computer program. When the computer program is executed in a computer, the method of the above embodiment is implemented.

[1249] In another embodiment of the present application, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a computer, the method described in the above embodiment is implemented.

[1250] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[1251] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[1252] In several embodiments provided in the present application, the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[1253] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[1254] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[1255] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[1256] The above are only specific implementations of the embodiments of the present application, but the protection scope of the embodiments of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or replacements within the technical scope disclosed in the embodiments of the present application, which should be included in the protection scope of the embodiments of the present application. Therefore, the protection scope of the embodiments of the present application shall be based on the protection scope of the claims.

Claims

1. A communication method, characterized in that: The method comprises: Obtain configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about a period of the first CG; Information about the first CG timing is determined based on a first rounding value, wherein the first rounding value is associated with the period of the first CG and a first rounding operation, and the unit of the first rounding value is not a symbol.

2. A communication method, characterized in that: The method comprises: Sending configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; Information about the first CG timing is determined based on a first rounding value, wherein the first rounding value is associated with the period of the first CG and a first rounding operation, and the unit of the first rounding value is not a symbol.

3. The communication method according to claim 1 or 2, characterized in that: When the unit of the period of the first CG is milliseconds or subframes, The first rounded value is F{the period of the first CG×N}; or, The first rounded value is F{the period of the first CG×N×X}; Wherein, N is a non-negative integer, F{} represents a first rounding operation, and X is the number of time slots contained in one millisecond or one subframe.

4. The communication method according to claim 1 or 2, characterized in that: When the unit of the period of the first CG is symbol, The first rounded value is F{the period of the first CG×N÷Y}; or, The first rounded value is F{the period of the first CG×N÷Z}; Wherein, N is a non-negative integer, F{} represents a first rounding operation, Y is the number of symbols contained in one millisecond or one subframe, and Z is the number of symbols contained in one time slot.

5. The communication method according to claim 3, characterized in that: When the first rounded value is F{the period of the first CG×N}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Y; Wherein, Y is the number of symbols contained in one millisecond or one subframe.

6. The communication method according to claim 3, characterized in that: When the first rounded value is F{the period of the first CG×N}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Y+(K-1)×Z; Wherein, Y is the number of symbols contained in one millisecond or one subframe, Z is the number of symbols contained in one time slot, K≥1, and K is an integer.

7. The communication method according to claim 3, characterized in that: When the first rounded value is F{the period of the first CG×N×X}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Z; Wherein, Z is the number of symbols contained in a time slot.

8. The communication method according to claim 3, characterized in that: When the first rounded value is F{the period of the first CG×N×X}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value ×Z+(K-1)×Z; Wherein, Z is the number of symbols contained in a time slot, K≥1, and K is an integer.

9. The communication method according to claim 4, characterized in that: When the first rounded value is F{the period of the first CG×N÷Y}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Y; Wherein, Y is the number of symbols contained in one millisecond or one subframe.

10. The communication method according to claim 4, characterized in that: When the first rounded value is F{the period of the first CG×N÷Y}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Y+(K-1)×Z; Wherein, Y is the number of symbols contained in one millisecond or one subframe, K≥1, and K is an integer.

11. The communication method according to claim 4, characterized in that: When the first rounded value is F{the period of the first CG×N÷Z}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value×Z; Wherein, Z is the number of symbols contained in a time slot.

12. The communication method according to claim 4, characterized in that: When the first rounded value is F{the period of the first CG×N÷Z}, The information for determining the first CG timing based on the first rounded value includes: Determine information of the first CG timing based on the first rounded value ×Z+(K-1)×Z; Wherein, Z is the number of symbols contained in a time slot, K≥1, and K is an integer.

13. The communication method according to any one of claims 1 to 12, characterized in that: The information of the first CG opportunity includes information of frame, time slot and symbol.

14. The communication method according to claim 1 or 2, characterized in that: The first rounding value is associated with the period of the first CG, N and the first rounding operation, where N≥0 and N is an integer.

15. The communication method according to claim 1, 2 or 14, characterized in that: When the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG×N}; or, When the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Y}, where Y is the number of symbols contained in one millisecond or one subframe.

16. The communication method according to claim 1, 2 or 14, characterized in that: In the case where the unit of the period of the first CG is milliseconds or subframes, the first rounded value is F{the period of the first CG×N×X}, where X is the number of time slots contained in one millisecond or one subframe; or, When the unit of the period of the first CG is a symbol, the first rounded value is F{the period of the first CG×N÷Z}, where Z is the number of symbols contained in a time slot.

17. The communication method according to claim 15, characterized in that: The information for determining the first CG timing based on the first rounded value includes: The information of the first CG opportunity is determined based on the first rounded value ×X+(K-1), wherein X is the number of time slots contained in one millisecond or one subframe, K≥1, and K is an integer.

18. The communication method according to claim 16, characterized in that: The information for determining the first CG timing based on the first rounded value includes: The information of the first CG timing is determined based on the first rounded value + (K-1), where K≥1 and K is an integer.

19. The communication method according to claims 14-18, characterized in that: The information of the first CG opportunity includes frame and time slot information, but does not include symbol information.

20. The method according to any one of claims 1 to 19, characterized in that The first CG opportunity is a CG opportunity in the Nth CG cycle, or the first CG opportunity is a CG opportunity in the N+1th CG cycle, where N≥0 and N is an integer.

21. The method according to any one of claims 6 or 8 or 10 or 12 or 16 or 17, characterized in that: The first CG opportunity is the Kth CG opportunity in the Nth CG cycle, or the first CG opportunity is the Kth CG opportunity in the N+1th CG cycle, wherein N≥0, K≥1, and N and K are both integers.

22. The communication method according to any one of claims 1 to 21, characterized in that: The first rounding operation includes any one of the following operations: Round up, round down, or round up.

23. A communication method, characterized in that , the method comprises: Obtain configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about a period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

24. A communication method, characterized in that: The method comprises: Sending configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is offset, wherein the ending position of the first CG opportunity after the offset is located in the first time slot, or the starting position of the first CG opportunity after the offset is located in the second time slot.

25. A communication method, characterized in that: The method comprises: Obtain configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about a period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is determined based on the information of the second CG opportunity.

26. A communication method, characterized in that: The method comprises: Sending configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are respectively located in the first time slot and the second time slot, the time domain position of the first CG opportunity is determined based on the information of the second CG opportunity.

27. A communication method, characterized in that: The method comprises: Obtain configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about a period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively, Ignore the first CG opportunity; or, Ignore the portion of the first CG opportunity in the first time slot; or, Ignore the portion of the first CG opportunity in the second time slot.

28. A communication method, characterized in that: The method comprises: Sending configuration information of a first configuration authorization CG, where the configuration information of the first CG includes information about the period of the first CG; If the starting position and the ending position of the first CG opportunity determined based on the configuration information of the first CG are located in the first time slot and the second time slot respectively, Ignore the first CG opportunity; or, Ignore the portion of the first CG opportunity in the first time slot; or, Ignore the portion of the first CG opportunity in the second time slot.

29. A communication device, characterized in that: The communication device includes a module for executing the method according to any one of claims 1, or 3 to 22, or includes a module for executing the method according to any one of claims 23, 25 or 27, or includes a module for executing the method according to any one of claims 2 to 22, or includes a module for executing the method according to any one of claims 24, 26 or 28.

30. A communication device, characterized in that: The communication device includes a processor, which is configured to execute the method according to any one of claims 1, or 3 to 22, or configured to execute the method according to any one of claims 23, 25 or 27, or configured to execute the method according to any one of claims 2 to 22, or configured to execute the method according to any one of claims 24, 26 or 28.

31. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes instructions, which, when executed, implement the method according to any one of claims 1, 3 to 22, implement the method according to any one of claims 23, 25 or 27, or implement the method according to any one of claims 2 to 22, or implement the method according to any one of claims 24, 26 or 28.

32. A computer program product, characterized in that The computer program product comprises instructions which, when executed, implement the method according to any one of claims 1, 3 to 22, implement the method according to any one of claims 23, 25 or 27, or implement the method according to any one of claims 2 to 22, or implement the method according to any one of claims 24, 26 or 28.

Images