Uplink transmission method and apparatus

Abstract

The present application provides an uplink transmission method and apparatus. The method includes: a network device instructs a terminal device to transmit a first transport block in a plurality of time units, and further instructs the terminal device to transmit uplink control information UCI in the first time unit. The first time unit is one of the plurality of time units. Regardless of whether the terminal device detects that the network device has instructed the terminal device to transmit UCI, both the network device and the terminal device calculate a position of a leading bit in a coded bit sequence output through rate matching in a second time unit based on a parameter G corresponding to the first time unit. The second time unit is a time unit following the first time unit in the plurality of time units, and the parameter G is a total amount of coded bits available for transmission of the first transport block and UCI in one time unit. Thus, starting from the second time unit, the network device and the terminal device can align the position of the leading bit of bit selection in each rate matching, thereby increasing the decoding success rate.

Description

[Technical Field]

[0001] The present application relates to the field of communications, and more particularly to an uplink transmission method and apparatus. [Background technology]

[0002] Currently, transport block over multi-slot (TBoMS) rate matching is performed once per time unit, and the position in the circular buffer of the first bit in the bit selection for the next rate matching is calculated in real time based on the position in the circular buffer of the last bit in the bit selection for the current rate matching. In one data transmission, a network device schedules a terminal device to report uplink control information (UCI) by using a physical downlink control channel (PDCCH) and instructs the terminal device to include the UCI on a physical uplink shared channel (PUSCH). However, if the terminal device does not detect the PUCCH, the UCI is not carried on the PUSCH. As a result, the network device and the terminal device cannot align the position in the circular buffer of the first bit in the bit selection for rate matching for one time unit. As a result, the network device will erroneously decode all coded bit sequences starting from the time unit in the currently transmitted coded bit sequence. In this case, the urgent problem to be solved is how the network device and the terminal device determine the position in the circular buffer of the first bit in the bit selection for each rate matching of the network device and the terminal device. Summary of the Invention [Problem to be solved by the invention]

[0003] The present application provides an uplink transmission method and apparatus for increasing the success rate of decoding uplink transmissions of a terminal device. [Means for solving the problem]

[0004] According to a first aspect, there is provided an uplink transmission method, including: a terminal device receiving first instruction information from a network device, the first instruction information instructing the terminal device to transmit a first transport block in a plurality of time units; a terminal device receiving second instruction information from the network device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in the first time unit, the first time unit being one of the plurality of time units; a terminal device determining a position in a circular buffer of a leading bit in a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in the second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G being a positive integer; and a second time unit being a time unit following the first time unit in the plurality of time units. The terminal device transmits the UCI and the first transport block to the network device in the plurality of time units.

[0005] In the above solution, the network device instructs the terminal device to include UCI indication information in the first time unit. When the terminal device detects the indication, the total amount of coded bits of the UCI is not removed from the parameter G used by the network device and the terminal device to determine the position in the circular buffer of the first bit in the coded bit sequence output through rate matching in the second time unit (the time unit following the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position in the circular buffer of the first bit in the bit selection for each rate matching, which improves the decoding success rate.

[0006] In relation to the first aspect, in some implementations of the first aspect, determining by the terminal device a position in the circular buffer of a leading bit in the first coded bit sequence based on a parameter G corresponding to the first time unit includes: determining by the terminal device a position in the circular buffer of a leading bit in the first coded bit sequence based on a times a parameter G corresponding to the first time unit; <a≦1である。

[0007] In relation to the first aspect, in some implementations of the first aspect, the method further includes: the terminal device determining a length of the second coded bit sequence based on a parameter G corresponding to the first time unit, the second coded bit sequence being a coded bit sequence output through rate matching in the first time unit.

[0008] In the above solution, when the terminal device receives the second indication information, the network device and the terminal device can determine the position in the circular buffer of the first bit in the first coded bit sequence and the length of the second coded bit sequence in the same manner as when the terminal device does not receive the second indication information, which extends the scope of application of the uplink transmission method provided in this application.

[0009] Regarding the first aspect, in some implementations of the first aspect, a is equal to any one of the following numbers, namely, 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x (0 < x < 100), where x is an integer.

[0010] Regarding the first aspect, in some implementations of the first aspect, for the terminal device to determine the position of the leading bit in the first encoded bit sequence within the cyclic buffer based on the parameter G corresponding to the first time unit is for the terminal device to, Z c and includes determining the position of the leading bit in the first encoded bit sequence within the cyclic buffer based on the parameter G corresponding to the first time unit, where Z c is a low-density parity-check LDPC factor.

[0011] In the above solution, when resource mapping is executed on the terminal side, the step of searching for the position of the last bit mapped in the previous time unit within the first encoded bit sequence is reduced, and based on determining the position of the leading bit in the first encoded bit sequence within the cyclic buffer based on G, the position is Z c is determined by referring to. This simplifies the calculations in the mapping process and reduces the overhead.

[0012] Regarding the first aspect, in some implementations of the first aspect, the method further includes the following. The terminal device maps the second encoded bit sequence to time-frequency resources in the first time unit, where the second encoded bit sequence is the encoded bit sequence output through rate matching in the first time unit, and the amount of bits in the second encoded bit sequence is equal to the parameter G corresponding to the first time unit. The terminal device maps UCI to some time-frequency resources within the first time unit to replace some bit sequences within the first encoded bit sequence carried in the some time-frequency resources.

[0013] In the above solution, the UCI is multiplexed in a puncturing manner in the first time unit, so that the bit sequence contained in the first transport block and carried on time-frequency resources other than the time-frequency resource occupied by the UCI in the first time unit remains unchanged, which improves the decoding success rate and accuracy of the network device.

[0014] In relation to the first aspect, in some implementations of the first aspect, the first indication information further indicates that the network device can transmit one transport block in the multiple time units, the first transport block being one transport block, and the first indication information includes a transport block transmission enable field over multiple slots, or the first indication information includes a transport block over multiple slots mapping type parameter.

[0015] In the above solution, the network device's support for the capability of transmission over multiple slots is indicated to the terminal device in multiple formats, thereby enriching the signaling design and improving the uplink transmission efficiency.

[0016] According to a second aspect, there is provided an uplink transmission method, including: a network device transmitting first instruction information to a terminal device, the first instruction information instructing the terminal device to transmit a first transport block in a plurality of time units; a network device transmitting second instruction information to the terminal device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in the first time unit, the first time unit being one of the plurality of time units; a network device receiving the first transport block from the terminal device; a network device determining a position in a circular buffer of a leading bit in a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G being a positive integer; and a second time unit being a time unit following the first time unit in the plurality of time units.

[0017] In the above solution, the network device instructs the terminal device to include UCI indication information in the first time unit. When the terminal device detects or does not detect the indication, the total amount of coded bits of the UCI is not removed from the parameter G used by the network device and the terminal device to determine the position in the circular buffer of the first bit in the coded bit sequence output through rate matching in the second time unit (the time unit following the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position in the circular buffer of the first bit in the bit selection for each rate matching, which increases the decoding success rate.

[0018] With respect to a second aspect, in some implementations of the second aspect, for a network device to determine the position of a leading bit in a first encoded bit sequence within a circular buffer based on a parameter G corresponding to a first time unit, the network device includes determining the position of the leading bit in the first encoded bit sequence within the circular buffer based on a times the parameter G corresponding to the first time unit, where 0 < a ≤ 1.

[0019] In the above solution, G is multiplied by a that is greater than 0 and less than 1, whereby the network device can pre - calculate the position of the leading bit in the first encoded bit sequence within the circular buffer. This shortens the gap between the trailing bit in the second encoded bit sequence and the leading bit in the first encoded bit sequence, improving channel quality.

[0020] With respect to a second aspect, in some implementations of the first aspect, the method further includes the following. The network device determines the length of a second encoded bit sequence based on a parameter G corresponding to a first time unit, and the second encoded bit sequence is an encoded bit sequence output through rate matching in the first time unit.

[0021] In the above solution, further, the length of the second encoded bit sequence is still calculated based on G. Since G is larger than aG, it is possible to more surely remove the above - mentioned gap.

[0022] With respect to a second aspect, in some implementations of the first aspect, a is equal to any one of the following numbers: 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x (0 < x < 100), where x is an integer.

[0023] In relation to the second aspect, in some implementations of the first aspect, the network device determining a position in the circular buffer of a leading bit in the first coded bit sequence based on a parameter G corresponding to a first time unit may include the network device determining a position in the circular buffer of a leading bit in the first coded bit sequence based on a parameter G corresponding to a first time unit. c and determining a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to the first time unit; Z c is a low density parity check LDPC factor.

[0024] In the above solution, when resource mapping is performed at the terminal side, the step of finding the position in the first coded bit sequence of the last bit mapped to the previous time unit is reduced to determining the position in the circular buffer of the first bit in the first coded bit sequence based on G, with the position being determined by reference to Zc, which simplifies the calculations in the mapping process and reduces overhead.

[0025] In relation to the second aspect, in some implementations of the first aspect, the first indication information further indicates that the network device can transmit one transport block within the multiple time units, the first transport block being one transport block, and the first indication information includes a transport block transmission enable field over multiple slots, or the first indication information includes a transport block over multiple slots mapping type parameter.

[0026] In the above solution, the network device's support for the capability of transmission over multiple slots is indicated to the terminal device in multiple formats, thereby enriching the signaling design and improving the uplink transmission efficiency.

[0027] According to a third aspect, there is provided an uplink transmission method, including: a terminal device receiving first instruction information from a network device, the first instruction information instructing the terminal device to transmit one transport block in a plurality of time units; the terminal device determining that transmission of a first coded bit sequence in the first time unit is canceled, the first time unit being one of the plurality of time units, the first coded bit sequence being a coded bit sequence output through rate matching in the first time unit; and the terminal device transmitting the first coded bit sequence to the network device in a second time unit, the second time unit being a time unit other than the first time unit of the plurality of time units.

[0028] In relation to the third aspect, in some implementations of the third aspect, the first bit in the bit sequence transmitted by the terminal device in the time unit following the second time unit is the bit following the last bit in the first coded bit sequence.

[0029] In relation to the third aspect, in some implementations of the third aspect, the method further includes: the terminal device transmitting a second coded bit sequence to the network device in a third time unit, the second coded bit sequence being a coded bit sequence output through rate matching in the third time unit, a first bit in the second coded bit sequence being a bit next to a last bit in the coded bit sequence carried in a last time unit of the plurality of time units, and the third time unit being a next time unit for carrying an uplink transport block in the first time domain resource.

[0030] According to a fourth aspect, there is provided a transceiver module configured to receive first instruction information from a network device, the first instruction information instructing a terminal device to transmit a first transport block in a plurality of time units, the transceiver module being further configured to receive second instruction information from the network device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in the first time unit, the first time unit being one of the plurality of time units; and a circular buffer of a leading bit in a first coded bit sequence based on a parameter G corresponding to the first time unit. a processing module configured to determine a position within a first time unit, where the first coded bit sequence is a coded bit sequence output through rate matching in a second time unit, a parameter G is a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G is a positive integer, the second time unit is a time unit following the first time unit in the plurality of time units, and the transceiver module is further configured to transmit the UCI and the first transport block to a network device in the plurality of time units.

[0031] In the above solution, the network device instructs the terminal device to include UCI indication information in the first time unit. When the terminal device detects the indication, the total amount of coded bits of the UCI is not removed from the parameter G used by the network device and the terminal device to determine the position in the circular buffer of the first bit in the coded bit sequence output through rate matching in the second time unit (the time unit following the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position in the circular buffer of the first bit in the bit selection for each rate matching, which improves the decoding success rate.

[0032] With respect to the fourth aspect, in some implementations of the fourth aspect, the processing module is specifically configured to determine the position of the leading bit in the first encoded bit sequence in the cyclic buffer based on a times the parameter G corresponding to the first time unit, where 0 < a ≤ 1.

[0033] With respect to the fourth aspect, in some implementations of the fourth aspect, the processing module is further configured to determine the length of the second encoded bit sequence based on the parameter G corresponding to the first time unit, and the second encoded bit sequence is the encoded bit sequence output through rate matching in the first time unit.

[0034] With respect to the fourth aspect, in some implementations of the fourth aspect, a is equal to any one of the following numbers, namely, 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x (0 < x < 100), where x is an integer.

[0035] With respect to the fourth aspect, in some implementations of the fourth aspect, the processing module is specifically Z c and based on the parameter G corresponding to the first time unit, is configured to determine the position of the leading bit in the first encoded bit sequence in the cyclic buffer, and Z c is a low-density parity-check LDPC factor.

[0036] With respect to the fourth aspect, in some implementations of the fourth aspect, the processing module is further configured to map the second encoded bit sequence to the time-frequency resources in the first time unit, the second encoded bit sequence is the encoded bit sequence output through rate matching in the first time unit, and the amount of bits in the second encoded bit sequence is equal to the parameter G corresponding to the first time unit.

[0037] The processing module is further configured to map the UCI to a number of time-frequency resources within the first time unit to replace a number of bit sequences within the first coded bit sequence carried in the number of time-frequency resources.

[0038] In relation to the fourth aspect, in some implementations of the fourth aspect, the first indication information further indicates that the network device can transmit one transport block in the multiple time units, and the first transport block is one transport block.

[0039] The first indication information includes a transport block transmission enable field over multiple slots, or the first indication information includes a mapping type parameter of the transport block over multiple slots.

[0040] According to a fifth aspect, there is provided a transceiver module configured to transmit first instruction information to a terminal device, the first instruction information instructing the terminal device to transmit a first transport block in a plurality of time units, the transceiver module being further configured to transmit second instruction information to the terminal device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in the first time unit, the first time unit being one of the plurality of time units, and the transceiver module being further configured to receive the first transport block from the terminal device. and a processing unit that determines a position in a circular buffer of a leading bit in a first coded bit sequence based on a parameter G corresponding to a first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of a first transport block and UCI in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units.

[0041] In the above solution, the network device instructs the terminal device to include UCI indication information in the first time unit. When the terminal device detects or does not detect the indication, the total amount of coded bits of the UCI is not removed from the parameter G used by the network device and the terminal device to determine the position in the circular buffer of the first bit in the coded bit sequence output through rate matching in the second time unit (the time unit following the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position in the circular buffer of the first bit in the bit selection for each rate matching, which increases the decoding success rate.

[0042] With respect to the fifth aspect, in some implementations of the fifth aspect, the processing module is specifically configured to determine the position of the leading bit in the first encoded bit sequence in the circular buffer based on a times the parameter G corresponding to the first time unit, where 0 < a ≤ 1.

[0043] With respect to the fifth aspect, in some implementations of the fifth aspect, the processing module is further configured to determine the length of the second encoded bit sequence based on the parameter G corresponding to the first time unit, and the second encoded bit sequence is the encoded bit sequence output through rate matching in the first time unit.

[0044] With respect to the fifth aspect, in some implementations of the fifth aspect, a is equal to any one of the following numbers: 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x (0 < x < 100), where x is an integer.

[0045] With respect to the fifth aspect, in some implementations of the fifth aspect, the processing module is specifically c and based on Z and the parameter G corresponding to the first time unit, is configured to determine the position of the leading bit in the first encoded bit sequence in the circular buffer, where c Z is a low density parity check LDPC factor.

[0046] With respect to the fifth aspect, in some implementations of the fifth aspect, the first indication information further indicates that the network device can transmit one transport block in a plurality of time units, and the first transport block is one transport block.

[0047] The first indication information includes a transport block transmission enabling field on the multislot, or the first indication information includes a mapping type parameter of the transport block on the multislot.

[0048] According to a sixth aspect, there is provided an uplink transmission method, the method including:

[0049] A terminal device receives downlink control information and first information from a network device, the downlink control information instructing the terminal device to transmit aperiodic channel state information (A-CSI) on first time domain resources, the first information instructing the terminal device to transmit a physical uplink shared channel (PUSCH) on second time domain resources, the first time domain resources overlapping with the second time domain resources, and the terminal device cancels transmission of the A-CSI or cancels PUSCH transmission on the overlapping time domain resources between the first time domain resources and the second time domain resources.

[0050] With respect to the seventh aspect, in some implementations of the seventh aspect, the first time domain resource and the second time domain resource are included in the same time unit.

[0051] According to an eighth aspect, there is provided an uplink transmission method, the method including:

[0052] A terminal device receives first instruction information from a network device, the first instruction information instructing the terminal device to transmit a first transport block in a plurality of time units. The terminal device receives second instruction information from the network device, the second instruction information instructing the terminal device to transmit a HARQ-ACK and first control information in the first time unit, the first control information including channel state information (CSI) and / or configured grant-uplink control information (CG-UCI), the first time unit being one of the plurality of time units. The terminal device determines a position in a circular buffer of a leading bit in a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and the HARQ-ACK in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit within the plurality of time units. The terminal device transmits a HARQ-ACK, first information, and a first transport block to the network device in the plurality of time units.

[0053] According to a ninth aspect, there is provided an uplink transmission method, the method including:

[0054] The terminal device receives first indication information from the network device, the first indication information instructing the terminal device to transmit a first transport block in a plurality of time units.

[0055] The terminal device receives second instruction information from the network device, the second instruction information instructing the terminal device to transmit a HARQ-ACK in a first time unit, the first time unit being one of the plurality of time units.

[0056] When the number of bits occupied by the HARQ-ACK is greater than two, the terminal device multiplexes the HARQ-ACK into the first transport block using a puncturing method.

[0057] The terminal device transmits a first transport block, in which the HARQ-ACK is multiplexed, to the network device during the plurality of time units.

[0058] According to a tenth aspect, there is provided an uplink transmission method, the method including:

[0059] The network device transmits first information to the terminal device, the first information instructing the terminal device to transmit one transport block in a first transmission manner.

[0060] When the network device does not receive or does not correctly receive the transport block, the network device transmits second information to the terminal device, and the second information instructs the terminal device to transmit the transport block in a second transmission scheme.

[0061] The first transmission scheme is a single code block based physical uplink shared channel (PUSCH) or a single code block based PUSCH repetition of repetition type A, and the second transmission scheme is a multi-slot transport block or a multi-slot transport block repetition; or The first transmission scheme is a multi-code block-based physical uplink shared channel (PUSCH) or a multi-code block-based PUSCH repetition of repetition type A, and the first transmission scheme is the same as the second transmission scheme.

[0062] In relation to the tenth aspect, in some implementations of the tenth aspect, the method further includes:

[0063] The network device determines a second transmission method based on the first transmission method.

[0064] According to an eleventh aspect, there is provided an uplink transmission apparatus, the apparatus including: a transceiver module configured to receive downlink control information and first information from a network device, the downlink control information instructing a terminal device to transmit aperiodic channel state information (A-CSI) on first time domain resources, and the first information instructing a terminal device to transmit a physical uplink shared channel (PUSCH) on second time domain resources, the first time domain resources overlapping with the second time domain resources; a processing module configured to cancel transmission of the A-CSI or cancel PUSCH transmission on overlapping time domain resources between a first time domain resource and a second time domain resource;

[0065] According to a twelfth aspect, there is provided an uplink transmission apparatus, the apparatus including: a transceiver module configured to receive first instruction information from a network device, the first instruction information instructing a terminal device to transmit a first transport block at a plurality of time units; the transceiver module is further configured to receive second instruction information from a network device, the second instruction information instructing the terminal device to transmit a HARQ-ACK and first control information in a first time unit, the first control information including channel state information (CSI) and / or configured grant-uplink control information (CG-UCI), and the first time unit is one of the plurality of time units; a processing module configured to determine a position in a circular buffer of a first bit in a first coded bit sequence based on a parameter G corresponding to a first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of a first transport block and a HARQ-ACK in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units; The processing module, wherein the transceiver module is further configured to transmit the HARQ-ACK, the first information, and the first transport block to a network device in the plurality of time units.

[0066] According to a thirteenth aspect, there is provided an uplink transmission apparatus, the apparatus including: a transceiver module configured to receive first instruction information from a network device, the first instruction information instructing a terminal device to transmit a first transport block at a plurality of time units; the transceiver module is further configured to receive second instruction information from a network device, the second instruction information instructing the terminal device to transmit a HARQ-ACK in a first time unit, the first time unit being one of the plurality of time units; A processing module configured to multiplex a HARQ-ACK into a first transport block in a puncturing manner when a number of bits occupied by the HARQ-ACK is greater than two bits, The processing module, wherein the transceiver module is further configured to transmit, to a network device, a first transport block in which HARQ-ACKs are multiplexed, in the plurality of time units.

[0067] According to a fourteenth aspect, there is provided an uplink transmission apparatus, the apparatus including: A transceiver module configured to transmit first information to a terminal device, the first information instructing the terminal device to transmit one transport block in a first transmission scheme.

[0068] When the transceiver module does not receive or incorrectly receives the transport block, the transceiver module is further configured to transmit second information to the terminal device, the second information instructing the terminal device to transmit the transport block in a second transmission scheme.

[0069] The first transmission scheme is a single code block based physical uplink shared channel (PUSCH) or a single code block based PUSCH repetition of repetition type A, and the second transmission scheme is a multi-slot transport block or a multi-slot transport block repetition; or The first transmission scheme is a multi-code block-based physical uplink shared channel (PUSCH) or a multi-code block-based PUSCH repetition of repetition type A, and the first transmission scheme is the same as the second transmission scheme.

[0070] According to a fifteenth aspect, there is provided an uplink transmission method, the method including:

[0071] The terminal device receives first indication information from the network device, the first indication information instructing the terminal device to transmit a first transport block in a plurality of time units.

[0072] The terminal device receives second instruction information from the network device, the second instruction information instructing the terminal device to transmit uplink control information UCI in a first time unit, the first time unit being one of the plurality of time units.

[0073] The terminal device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G being a positive integer, and the second time unit being one of the plurality of time units.

[0074] The terminal device transmits the UCI and the first transport block to the network device in the plurality of time units.

[0075] In the above solution, the network device instructs the terminal device to include UCI indication information in the first time unit, and when the terminal device detects the indication, the total amount of coded bits of the UCI is not deducted from the parameter G used by the network device and the terminal device to determine the position in the circular buffer of the first bit in the coded bit sequence output through rate matching in the second time unit. Therefore, starting from the second time unit, the network device and the terminal device can align the positions in the circular buffer of the first bits in the bit selection for each rate matching, which increases the decoding success rate.

[0076] In one implementation, the multiple time units correspond to equal parameter G.

[0077] In one implementation, the terminal device determining a position in a circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to the first time unit includes: the parameter G corresponding to the first time unit and the actual periodicity N of the bit selection cb', determining the position in the circular buffer of the first bit in the first coded bit sequence.

[0078] In one implementation, the parameter G corresponding to the first time unit and the actual periodicity N of the bit selection cb ' determining the position in the circular buffer of the first bit in the first coded bit sequence based on: The parameter G corresponding to the first time unit and the actual periodicity N of the bit selection cb ' and based on the first leading bit index k r,n 'Determine; The first leading bit index k r,n ', the first bit in the first coded bit sequence, at position k in the circular buffer. r,n This includes determining:

[0079] n represents the index of a second time unit in the plurality of time units, and the index is obtained by counting the plurality of time units chronologically from 0.

[0080] In one implementation, the first leading bit index k r,n ' satisfies the following:

[0081] k r,n '=mod(k r,0 '+n×G,N cb ').

[0082] k r,0 N' represents the first leading bit index of the first time unit among the plurality of time units; cb where n′ represents the actual periodicity of the bit selection, and n represents the index of the second time unit in the plurality of time units, which is obtained by counting the plurality of time units chronologically from 0.

[0083] In one implementation, k r,n', the first bit in the first coded bit sequence, at position k in the circular buffer. r,n Determining includes:

[0084] 0≦k r,n ' <K NULL '-2Z c If so, k r,n =k r,n ';or K NULL '-2Z c ≦k r,n ' <N cb 'If k r,n =k r,n '+(K NULL -K NULL ').

[0085] K NULL '-2Z c represents the position of the first filler bit in the circular buffer, and K NULL -K NULL ' represents the number of filler bits in the circular buffer.

[0086] In some implementations, the actual periodicity of the bit selection, N cb ' satisfies the following:

[0087] N cb '=N cb -(K NULL -K NULL '). where K NULL -K NULL ' represents the number of filler bits in the circular buffer, and N cb represents the size of the circular buffer.

[0088] In one implementation, a first leading bit index k of a first time unit in the plurality of time units r,n ' satisfies the following:

[0089] 0≦k0 <K NULL '-2Z c If so, k r,0 '=k0, where K NULL '-2Z crepresents the index of the first filler bit in the circular buffer; K NULL '-2Z c ≦k0 <K NULL -2Z c If so, k r,0 '=K NULL '-2Z c , where K NULL -2Z c represents the index of the first parity bit in the circular buffer; or K NULL -2Z c ≦k0 <N cb If so, k r,0 '=k0-(K NULL -K NULL '), where K NULL -K NULL ' represents the number of filler bits in the circular buffer.

[0090] k0 represents the position in the circular buffer of the first bit in the coded bits corresponding to the first time unit in the plurality of time units, and k0 is jointly determined by the redundancy version RV and the base graph BG.

[0091] The above solution ensures that the bit sequences obtained by performing bit selection in each of the multiple slots are continuous, thereby guaranteeing decoding performance.

[0092] According to a sixteenth aspect, there is provided a communication device including a processor and a memory, wherein the memory is configured to store a computer program, and the processor is configured to execute the computer program stored in the memory, thereby causing the communication device to perform the communication method according to any of the first to third, seventh to tenth, and fifteenth aspects.

[0093] According to a seventeenth aspect, there is provided a computer-readable storage medium for storing a computer program that, when executed on a computer, enables the computer to perform the communication method according to any one of the first to third aspects, the seventh to tenth aspects, and the fifteenth aspect.

[0094] According to a seventeenth aspect, there is provided a chip system including a processor configured to call a computer program from a memory and execute the computer program such that a communication device in which the chip system is installed performs a communication method according to any of the first to third aspects, the seventh to tenth aspects, and the fifteenth aspect. [Brief explanation of the drawings]

[0095] [Figure 1] 1 is a schematic diagram of a wireless communication system 100 to which certain embodiments of the present application can be applied.

[0096] [Figure 2] 1 is a schematic diagram of a multi-slot transport block.

[0097] [Figure 3] 1 is a schematic flowchart of signal processing.

[0098] [Figure 4] FIG. 1 is a schematic diagram of a transmission opportunity.

[0099] [Figure 5] Schematic diagram of TBoMS resource mapping based on redundancy version cycles.

[0100] [Figure 6] This is a schematic diagram of rate matching performed once in each slot of TBoMS.

[0101] [Figure 7] Indicates the position in the circular buffer of the leading bit used by network devices and end devices to perform bit selection at each rate matching.

[0102] [Figure 8] 1 is a schematic interactive diagram of an uplink transmission method 100 according to the present application;

[0103] [Figure 9] 2 is a schematic interactive diagram of an uplink transmission method 200 according to the present application.

[0104] [Figure 10] FIG. 1 illustrates an example of two possible uplink-downlink slot configurations.

[0105] [Figure 11] FIG. 10 is a diagram illustrating an example of determining the start position of bit selection in rate matching.

[0106] [Figure 12] 1 is a schematic diagram showing a bit sequence in a circular buffer being carried sequentially by a PUSCH;

[0107] [Figure 13] 1 is a schematic diagram showing a bit sequence in a circular buffer being carried sequentially by a PUSCH;

[0108] [Figure 14] 1 is a schematic diagram of sequentially carrying a bit sequence in a circular buffer by PUSCH;

[0109] [Figure 15] 1 is a schematic diagram in which a bit sequence for transmission over multiple slots is carried sequentially by a PUSCH;

[0110] [Figure 16]10 shows RV cyclic configuration scheduling for PUSCH repetition type A.

[0111] [Figure 17] 10 shows RV cyclic configuration scheduling for PUSCH repetition type A.

[0112] [Figure 18] 10 shows RV cyclic configuration scheduling for PUSCH repetition type A.

[0113] [Figure 19] 10 shows RV cyclic configuration scheduling for PUSCH repetition type A.

[0114] [Figure 20] 5 is a schematic diagram of an example of an uplink transmission method 500. FIG.

[0115] [Figure 21] 5 is a schematic diagram of another example of an uplink transmission method 500. FIG.

[0116] [Figure 22] 5 is a schematic diagram of yet another example of an uplink transmission method 500. FIG.

[0117] [Figure 23] FIG. 1 is a schematic diagram of an example of TBoMS transmission.

[0118] [Figure 24] 1 is a schematic block diagram of a communication device used for uplink transmission according to an embodiment of the present application;

[0119] [Figure 25] 1 is a schematic diagram of an uplink transmission device 20 according to an embodiment of the present invention.

[0120] [Figure 26] 10 is a schematic block diagram of k0 in filler bits.

[0121] [Figure 27] (a), (b), (c), and (d) are schematic diagrams of four different cases of the positions of k0′, k0, and the filler bits in the circular buffer.

[0122] [Figure 28] (a) and (b) show circular buffers of length Ncb and Ncb', respectively. DETAILED DESCRIPTION OF THE INVENTION

[0123] The technical solutions in the embodiments of the present application may be applied to various communication systems, such as a 5th generation (5G) system or a new radio (NR) system, a long term evolution (LTE) system, an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD) system, and a universal mobile telecommunications system (UMTS). In addition, the technical solutions in the embodiments of the present application may be further applied to sidelink communication. For example, the technical solutions in the embodiments of the present application may be further applied to device-to-device (D2D) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and communication in a vehicular internet system.

[0124] To facilitate understanding of the embodiments of the present application, a communication system to which the embodiments of the present application are applicable will first be described with reference to FIG.

[0125] Figure 1 is a schematic diagram of a wireless communication system 100 to which an embodiment of the present application can be applied. As shown in Figure 1, the wireless communication system 100 may include at least one network device, such as network device 111 shown in Figure 1. The wireless communication system 100 may further include at least one terminal device, such as terminal device 121 shown in Figure 1. Multiple antennas may be configured for both the network device and the terminal device, and the network device and the terminal device may communicate with each other by using multi-antenna technology.

[0126] When a network device communicates with a terminal device, the network device may manage one or more cells. A cell may have an integer number of terminal devices. Optionally, the network device 111 and the terminal device 121 form a single-cell communication system. Without loss of generality, the cell is denoted as cell #1. The network device 111 may be the network device in cell #1, or the network device 111 may serve a terminal device (e.g., terminal device 121) in cell #1.

[0127] It should be noted that a cell may be understood as an area within the coverage of a network device's radio signal.

[0128] In the embodiments of the present application, the sending device may be a terminal device, and the receiving device may be a network device, for example, the sending device is the terminal device 121, and the receiving device is the network device 111.

[0129] It should be understood that Figure 1 is merely an illustrative example, and the present application is not limited thereto. For example, the embodiments of the present application may further be applied to any communication scenario in which data (or data blocks) need to be repeatedly transmitted.

[0130] It should be further understood that a network device in a wireless communication system can be any device having radio transceiver functionality. Examples of such a device include, but are not limited to, an evolved NodeB (eNB), a radio network controller (RNC), a NodeB (NB), a base station controller (BSC), a base transceiver station (BTS), a home base station (e.g., a home evolved NodeB or home NodeB (HNB)), a baseband unit (BBU), an access point (AP), a wireless relay node, a wireless backhaul node, a transmission point (TP) or a transmission and reception point (TRP) in a wireless fidelity (Wi-Fi) system, etc. Alternatively, the device can be a gNB in ​​a 5G system such as an NR system, a transmission point (TRP or TP), or one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system. Alternatively, the device may be a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (DU).

[0131] In some deployments, a gNB may include a central unit (CU) and a DU. The gNB may further include an active antenna unit (AAU). The CU implements some gNB functions, and the DU implements some gNB functions. For example, the CU is responsible for processing non-real-time protocols and services and implements radio resource control (RRC) layer and packet data convergence protocol (PDCP) layer functions. The DU is responsible for processing physical layer protocols and real-time services and implements radio link control (RLC) layer, media access control (MAC) layer, and physical (PHY) layer functions. The AAU implements some physical layer processing functions, radio frequency processing, and active antenna-related functions. RRC layer information is ultimately converted to or from PHY layer information. Therefore, in this architecture, higher layer signaling, such as RRC layer signaling, may alternatively be considered to be sent by the DU or by the DU and AAU. It may be understood that a network device may be a device including one or more of a CU node, a DU node, and an AAU node. In addition, a CU may be classified as a network device within an access network (radio access network, RAN), or a CU may be classified as a network device within a core network (CN). This is not a limitation in this application.

[0132] It should be further understood that a terminal device in a wireless communication system may also be referred to as user equipment (UE), access terminal, subscriber unit, subscriber station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user equipment. The terminal device in the embodiments of the present application may be a mobile phone, a tablet computer (pad), a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Application scenarios are not limited to the embodiments of the present application.

[0133] To facilitate understanding of the embodiments of the present application, the following will first briefly describe the embodiments with reference to some terms used in the present application.

[0134] 1. Hourly

[0135] The time unit is generally a unit of time. For example, the time unit may include, but is not limited to, a subframe, a slot, a symbol, a physical slot, an available slot, a first symbol of a slot, a first symbol of a physical slot, a first symbol of an available slot, etc. The symbol (e.g., the first symbol) may be a time-domain symbol (e.g., an orthogonal frequency division multiplexing (OFDM) symbol), etc. The time unit may be determined based on both the uplink-downlink slot configuration and the TDRA table and may be indicated by the first symbol S and the length L in the TDRA table.

[0136] Regarding slots, one slot format may include several orthogonal frequency division multiplexing (OFDM) symbols. For example, one slot format may include 14 OFDM symbols, or 12 OFDM symbols, or 7 OFDM symbols. In one slot, all OFDM symbols may be used for uplink transmission, or may be used for downlink transmission, or some may be used for downlink transmission, some may be used for uplink transmission, and some may be flexible time-domain symbols (which can be flexibly configured to be used for uplink or downlink transmission). It should be understood that the above examples are merely illustrative and do not constitute any limitations on the present application. Considering forward compatibility of the system, the number of OFDM symbols included in a slot and the use of the slot for uplink and / or downlink transmission are not limited to the above examples. In this application, the time domain symbols may be OFDM symbols, and specifically, the time domain symbols may be replaced with OFDM symbols.

[0137] 2. Transport block over multi-slot (TBoMS)

[0138] Compared with LTE and Long Term Evolution Advanced (LTE-A) wireless communication systems, NR wireless communication systems are deployed on higher frequency bands to obtain larger communication bandwidths. However, the higher frequency bands cause larger path losses and larger penetration losses, so the coverage performance of NR is much lower than that of LTE and LTE-A.

[0139] To improve the coverage performance of NR, a multi-slot transport block technique is proposed. For example, as shown in Figure 2, TB#1 to TB#4 are aggregated into a large transport block (TB). In this technique, small data packets in each slot are aggregated into a large data packet, and the aggregated data packet is transmitted over multiple slots. This reduces the number of TB segmentations to reduce cyclic redundancy code (CRC) overhead, increases the transport block size (TBS) to increase coding gain, and reduces frequency resources to improve power spectral density and coverage performance.

[0140] 3. Repeated transmission of type A and type B

[0141] As mentioned above, in some scenarios, such as deep coverage scenarios at the cell edge or underground, path loss in wireless signal propagation is very severe. To improve uplink transmission performance and coverage performance, a method for repeatedly transmitting data blocks is to improve the uplink transmission performance. For example, the terminal device repeatedly transmits the PUSCH, and the network device performs combined detection on the repeatedly transmitted data blocks. This method can improve channel estimation performance, data demodulation performance, and cell coverage capability.

[0142] The current NR protocol is used as an example. In the current NR protocol, the PUSCH can be transmitted repeatedly up to 16 times, and the PUCCH can be transmitted repeatedly up to 8 times. The current NR protocol supports Type A repetitive transmission for the PUCCH and Type A and Type B repetitive transmission for the PUSCH.

[0143] (1) Type A repeat transmission

[0144] Type A repeat transmission means that N consecutive slots need to be scheduled for N repetitions, and the start position and total length of the time domain symbol that needs to be occupied in one slot for one repeat transmission are configured. Of the N slots, any slot that satisfies the condition that the start position and total length of the time domain symbol occupied for one repeat transmission are the same as the configured start position and total length may actually be used for one repeat transmission. N is an integer equal to or greater than 1.

[0145] (2) Type B repeat transmission

[0146] Type B repeat transmission means that repeat transmission is performed N times on multiple consecutive time domain symbols based on the time domain leading symbol position S of the first repeat transmission and the number of time domain symbols L that need to be occupied in each repetition. Specifically, starting from the Sth time domain symbol of the first scheduled slot, the following N*L time domain symbols (which may be extended to another slot) are all used to perform N repeat transmissions.

[0147] It should be understood that the specific description of the repeated transmission of Type A and Type B refers to the existing protocol, which does not limit the scope of protection of the embodiments of the present application.

[0148] For ease of explanation, hereinafter, a repeated transmission of type A is denoted as repetition type A, and a repeated transmission of type B is denoted as repetition type B.

[0149] 4. Redundancy version (RV)

[0150] Before the information bit string is transmitted by using a physical antenna, some signal processing processes are generally performed, as shown in FIG.

[0151] Channel coding: Redundancy bits and parity bits are introduced into the information bit string. Therefore, after the signal arrives at the receiving end, the receiving end can better restore the information bit string based on the check relationship between multiple received bits (including information bits and parity bits). For data channels, NR currently supports low-density parity-check (LDPC) channel coding. For example, a 100-bit information bit string is converted into a 500-bit coded bit string by LDPC coding with a coding rate of 1 / 5, and 400 bits of redundancy are introduced. The ratio of the length of the information bit string to the length of the coded bit string is equal to the coding rate of 1 / 5. For distinction, the coded bit string is referred to as the coded bit string.

[0152] Rate matching (RM): Rate matching is performed for each code block (CB) and mainly includes two parts: bit selection and bit interleaving. Bit selection refers to sequentially reading some coded bits from a circular buffer based on a redundancy version (RV), and bit interleaving refers to performing row-column interleaving on the coded bits. Finally, the bits of each code block obtained after bit interleaving are sequentially concatenated to output a codeword (CW). During information bit string transmission, after a relatively long coded bit string is obtained through channel coding, not all of the coded bit string is transmitted directly. In general, the terminal device may determine the amount of bits that can be transmitted based on the configured amount of available resource elements (RE) and the configured modulation order indicated to the terminal device by the network device, and then perform a selection from the coded bit string (current protocols specify four starting points that are approximately evenly distributed within the coded bit string and are marked as RV0, RV1, RV2, and RV3, respectively).

[0153] For example, the amount of available REs in one current resource block (RB) is 12*12=144, and quadrature phase shift keying (QPSK) modulation is performed, so that one physical resource block (PRB) can carry 144*2=288 bits. Therefore, 288 bits from the 500-bit coded bit string need to be selected as the selected bit string, and then modulation, resource mapping, and other processing are performed on the selected bit string. In this case, the corresponding coding rate = information bit string / length of selected bit string = 100 / 288.

[0154] More specifically, rate matching includes bit selection and bit interleaving. Bit selection means selecting coded bits from a circular buffer based on the starting point specified by the RV. The length of the selected coded bits is determined by the size of the mapped time-frequency resource. Bit interleaving means performing row-column interleaving on the selected bits. Therefore, the bit interleaving granularity and the bit selection granularity are consistent and can be collectively referred to as the rate matching granularity.

[0155] For example, if the mapped time-frequency resource is one or more OFDM symbols included in one TO, the length of the selected coded bits is the time-frequency resource on that one TO (without considering code block segmentation). It can also be understood that the rate matching granularity is one TO. Specifically, if code block segmentation is not considered, the length of the selected coded bits is the size of the mapped time-frequency resource, which is expressed by the formula N TO =N RE Q m N L where N TOis the number of bits that can be carried by the time-frequency resource in one transmission opportunity, and Q m is the modulation order, and N L is the number of layers.

[0156] 5. Repeated RV circulation mechanism

[0157] In the following, we use iteration type A as an example to explain the current iterated RV circulation mechanism.

[0158] The RV indicated by the downlink control information (DCI) for scheduling the physical uplink shared channel (PUSCH) is rv id For repetition type A, the RVs used in the n-th transmission opportunity of the PUSCH are shown in Table 1. One transmission opportunity is defined as one slot. It should be understood that the RV update granularity is one transmission opportunity, i.e., the RVs used need to be updated at each transmission opportunity. The update sequence is determined by the RV sequence, which is {0, 2, 3, 1} by default, i.e., the RVs are cyclically updated in the order of {0, 2, 3, 1}, and the starting point of the cycle is the RV indicated by the DCI for scheduling the PUSCH. id Also, if the RV sequence indication information repK-RV is configured using higher layer signaling, the RVs are updated in the order indicated by repK-RV. For repetition type B, the RVs used for the nth actual repetition of PUSCH are shown in Table 1. The actual repetition is obtained after the nominal repetition is segmented by slot boundaries and invalid symbols. The nominal repetition is directly configured by the base station, e.g., parameters such as the start and length indicator value (SLIV) and the number of repetitions K. [Table 1]

[0159] The RV indicates the coded bits carried in one transmission opportunity in the circular buffer. Specifically, the data obtained after low-density parity-check (LDPC) encoding is stored in the circular buffer and is called the coded bits. The RV starting point is the RV for each transmission. id The coded bits are selected sequentially from k0 in the circular buffer and mapped to the time-frequency resource of one transmission opportunity until that time-frequency resource is exhausted. There are four V starting points in total, which are denoted as rv id =0, rv id =1, rv id =2, and rv id = 3 and are denoted as RV0, RV1, RV2, and RV3, respectively. Each RV starting point k0 is associated with a base graph (BG) used for LDPC coding, as shown in Table 2. cb represents the length of the coded bits, and Z C represents the expansion factor of the LDPC coding. [Table 2]

[0160] For example, as shown in Figure 4(a), the circular ring represents a circular buffer that stores the coded bit string sequence obtained after channel coding is performed on the information bits, and the positions of RV0 to RV3 are determined according to Table 2. Figure 4(b) shows the resource mapping result of TDRA based on iteration type A, in which the coded bits are sequentially mapped to the time-frequency resources on four transmission opportunities in the order of the RV sequence {0, 2, 3, 1}.

[0161] In the repetitive resource mapping mechanism, i.e., RV rotation mechanism, one TB contains only a data packet in one slot, while one TBoMS is the aggregate result of data packets in multiple slots. In the same number of slots, the TBS of the TBoMS is much larger than the repeated TBS. As a result, there is a high possibility that information bits cannot be transmitted completely, resulting in degraded demodulation performance.

[0162] For example, as shown in Figure 5, a circular ring represents a circular buffer, which is configured to store the coded bit string sequence obtained after channel coding is performed on the information bits. The blank areas in the circular ring are coded parity bits, and the shaded areas in the circular ring are coded information bits. RV0, RV1, RV2, and RV3 are approximately four equally divided position points of the coded bit sequence. When the RV sequence {0, 2, 3, 1} is used for transmission, i.e., bits transmitted in different slots are selected from different RV starting points for mapping and transmission (a bit sequence of a specific length is selected).

[0163] Note that circular buffer and circular buffer have consistent meanings throughout this document.

[0164] 6. Uplink control information (UCI) multiplexing technology

[0165] To reduce inter-modulation interference in uplink transmission of a terminal device, when the physical uplink control channel (PUCCH) and the PUSCH overlap in the time domain, two transmission methods are supported: (1) Discard the PUSCH transmission if the PUCCH priority is higher than the PUSCH priority, or if the PUCCH priority is the same as the PUSCH priority but the timeline condition is not met; (2) If the PUCCH priority is the same as the PUSCH priority and the timeline condition is met, then multiplex the UCI carried on the PUCCH into the PUSCH for transmission.

[0166] In the second case, i.e., when UCI is multiplexed into the PUSCH for transmission, the UCI includes at least one of a hybrid automatic repeat request-acknowledgement (HARQ-ACK), channel state information (CSI), and configured grant-uplink control information (CG-UCI).

[0167] (1) A UCI bit sequence including at least one of a HARQ-ACK, a CSI, and a CG-UCI is generated.

[0168] (2) Code block segmentation is performed on the generated UCI bit sequence, and a cyclic redundancy check (CRC) code is generated and added.

[0169] (3) Channel coding is performed for each code block. HARQ-ACK and CSI are coded independently, and CSI part 1 and CSI part 2 are coded independently. For CG-UCI, if HARQ-ACK is not multiplexed onto PUSCH for transmission, CG-UCI is coded independently; otherwise, CG-UCI and HARQ-ACK are jointly coded.

[0170] (4) Rate matching is performed for each coded code block, which involves calculating the amount of coded modulation symbols for each UCI layer and performing bit selection.

[0171] (5) Code block concatenation is performed to concatenate the bit sequences output through rate matching of each code block.

[0172] (6) The UCI bits on which the code block concatenation has been performed are modulated and then mapped to the designated PUSCH transmission resource.

[0173] 7. Cancel a Transmission

[0174] In the communication process, the transmission resources of several signals may conflict, i.e., the resources may overlap. However, a terminal device may not have the ability to transmit signals simultaneously. Therefore, to ensure that the network device and the terminal device have a consistent understanding and ensure normal communication, some rules must be defined to determine which signal should be transmitted preferentially when a conflict occurs. The following lists some conflict handling mechanisms for various conflict scenarios in the prior art.

[0175] Case 1: A semi-statically configured downlink slot or symbol conflicts with an uplink data channel PUSCH resource.

[0176] The network device configures the frame structure for the UE by transmitting higher layer signaling, specifically, by transmitting which slots / symbols are downlink slots / symbols, which slots / symbols are uplink slots / symbols, and which slots / symbols are flexible. In particular, the higher layer signaling may be tdd-UL-DL-ConfigurationCommon and tdd-UL-DL-ConfigurationDedicated. In general, downlink slots or symbols can be configured to transmit only downlink signals, uplink slots or symbols can be configured to transmit only uplink signals, and flexible slots or symbols can be configured to occasionally transmit uplink or downlink signals. If symbols occupied by the PUSCH overlap with semi-statically configured downlink symbols, the PUSCH transmission is canceled, even if the symbols partially overlap.

[0177] Case 2: Dynamically indicated downlink symbols conflict with semi-statically configured uplink data channel PUSCH resources.

[0178] There are two PUSCH scheduling modes, which are described as follows:

[0179] First scheduling mode: Dynamic Grant (DG) scheduling, i.e., grant-based scheduling. The scheduling network device transmits control information PDCCH to the user. The PDCCH schedules uplink data PUSCH transmissions, i.e., the PDCCH indicates PDSCH or PUSCH time domain resources.

[0180] Second Scheduling Mode: Configured Grant Scheduling. Configured grant scheduling includes two types: configured grant type 1 and configured grant type 2. The configured grant type 2 scheduling mode is similar to the first dynamic scheduling mode, i.e., one PDCCH activates configured scheduling and then transmits the configured scheduling based on higher layer configuration information. For configured grant type 1, the network device does not transmit control information PDCCH to the user. The location of the time domain resource occupied by the data transmission is configured using higher layer signaling.

[0181] A network device may transmit one PDCCH to carry DCI format 2_0. The DCI format may indicate that symbols in one or more slots are uplink symbols, downlink symbols, or flexible symbols. Alternatively, the DCI may schedule PDSCH or CSI-RS on some symbols. If symbols occupied by the PUSCH of the configured grant scheduling overlap with symbols indicated by the DCI (which may be DCI format 2_0 or may be DCI for scheduling downlink data PDSCH or CSI-RS), processing is performed according to the following rules:

[0182] If the terminal device does not report partial cancellation capability, or if the network device does not indicate partial cancellation capability, and the first symbol of the PUSCH is within time T after the last symbol of the DCI proc,2 If it is within the time limit, the PUSCH transmission is not canceled; otherwise, the PUSCH transmission is canceled.

[0183] If the terminal device reports partial cancellation capability or the network device indicates partial cancellation capability, then after the last symbol of the DCI, time T proc,2 Only PUSCH transmissions after this time are cancelled, not PUSCH transmissions before this time.

[0184] T proc,2 is calculated using the following formula: T proc,2 =max((N2+d 2,1 +d2)(2048+144)·κ2 -μ T c +T ext +T switch ,d 2,2 )

[0185] Any of the overlapping PUCCHs and PUSCHs may correspond to a PDCCH, where "corresponding" in this specification may indicate that the PDCCH is used to schedule PUSCH transmission, or that the PDCCH is used to schedule PDSCH, and the PDCCH indicates a PUCCH that carries PDSCH feedback information.

[0186] N2 is the PDSCH preparation time determined based on μ for UE processing capability 1 and UE processing capability 2 according to Table 3 and Table 4, respectively, where μ is (μ DL ,μ UL ), and the value of μ corresponds to one of T proc,2 where μ DL corresponds to the subcarrier spacing of the PDCCH for scheduling the PUSCH, and μ UL corresponds to the subcarrier spacing of the uplink channel for transmitting the PUSCH. For non-shared spectrum channel access procedures, T ext = 0. If the first symbol of the PUSCH contains only DM-RS, then d 2,1 = 0, otherwise d 2,1 = 1. If DCI scheduling triggers BWP switching, d 2,2is equal to the switching time, otherwise d 2,2 = 0. If a high priority PUSCH overlaps with a low priority PUCCH, d2 of the high priority PUSCH is set by the value reported by the UE, otherwise d2 = 0. [Table 3] [Table 4]

[0187] Case 3: Repeated PUCCH and PUSCH resources compete.

[0188] When the PUCCH is transmitted in N slots, the PUSCH may also be transmitted in one slot or several slots, and the PUCCH and the PUSCH may be transmitted in several slots. In this case, in the overlapping slots, the terminal device transmits only the PUCCH and does not transmit the PUSCH.

[0189] Case 4: High priority PUCCH resources compete with low priority PUSCH resources.

[0190] The priority of the PUCCH may be indicated in the DCI for scheduling the PDSCH or may be configured by using higher layer signaling. In conclusion, there is a way to determine whether the priority of the PUCCH is high priority or low priority. The priority of the dynamically scheduled PUSCH is indicated in the DCI, and the priority of the scheduled PUSCH is configured by using higher layer signaling.

[0191] Once the resources of a high priority PUCCH overlap with the resources of a low priority PUSCH, the low priority PUSCH is cancelled.

[0192] Case 5: In a carrier aggregation scenario, the direction of a symbol in the reference cell or another cell conflicts with the PUSCH.

[0193] If multiple cells are configured for the UE, half-duplex behavior = "enabled" is configured to indicate that half-duplex contention handling should be performed, the UE cannot support simultaneous transmission and reception in any of the cells, the UE reports that the network device can support half-duplex operation, and blind detection of DCI format 2_0 is not configured, the following symbols will conflict with the PUSCH and the PUSCH will be canceled:

[0194] The symbols are indicated as symbols used to receive synchronization signal (SS) / physical broadcast channel (PBCH) blocks in any serving cell by ssb-PositionsInBurst in SIB1 or ssb-PositionsInBurst in ServingCellConfigCommon.

[0195] The symbols are indicated as downlink symbols by the tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated parameters in the reference cell, or are configured by higher layer signaling to receive PDCCH, PDSCH, or CSI-RS.

[0196] Case 6: The cancellation indication information indicates that the PUSCH transmission is to be cancelled.

[0197] The network device may transmit a cancellation indication to the terminal device. The cancellation indication is carried in DCI format 2_4. The bitmap specifically indicates the resource positions in the reference time-frequency resource where the PUSCH is canceled. Specifically, a position indicated as 1 indicates cancellation. If at least one of the symbols occupied by the PUSCH is indicated as 1, all PUSCHs starting from the first symbol indicated as 1 in the PUSCH are canceled.

[0198] For example, PUSCH occupies symbols 2 to 12, and symbols 3 and 4 are denoted as 1. In this case, symbol 2 is still reserved, and all PUSCH from symbols 3 to 12 are canceled.

[0199] Compared with Long Term Evolution (LTE) and LTE-A wireless communication systems, 5G NR wireless communication systems are deployed on higher frequency bands to obtain larger communication bandwidths. However, the higher frequency bands cause larger path losses and larger penetration losses, so the coverage performance of NR is much lower than that of LTE and LTE-A.

[0200] To improve coverage performance, TBoMS technology is proposed, in which small data packets in each slot are aggregated into a large data packet and the aggregated data packet is transmitted in multiple slots, thereby reducing the number of TB segmentation to reduce CRC overhead, increasing TBS to increase coding gain, and reducing frequency resources to improve power spectral density and coverage performance.

[0201] Currently, TBoMS rate matching is performed once per slot. As shown in Figure 6, the start position of the current bit selection in rate matching is the bit next to the end position of the previous bit selection. That is,

number

[0202] In 3GPP RAN1#106-e, the intermediate parameter, i.e., information bit N info They suggest that the formula for calculating N info =K N RE ·R·Q m N L

[0203] N RE represents the number of resource elements (RE) in one slot; R represents the coding rate; Q m represents the modulation order; N Lwhere K is the number of layers; K is the scaling factor for TBS calculation, indicating that TBs in K slots are aggregated into one large TB. In addition, the number of slots N allocated for TBoMS PUSCH transmission indicates that a TB aggregated in K slots is transmitted in N slots. The number of slots N and the scaling factor K satisfy the condition K≦N, which means that the number of slots for TB aggregation can be different from the number of slots for TB transmission. As shown in Figure 23, the time division duplex (TDD) spectrum uplink-downlink slot configuration is assumed to be DDSUU, with N=8 and K=4. In this case, during TBoMS PUSCH transmission, a large TB aggregated in 4 slots is transmitted in 8 slots.

[0204] Currently, in the process in which a terminal device performs rate matching and a network device performs rate de-matching (which can be understood as the reverse process of rate matching in a terminal device), the position in the circular buffer of the first bit of the bit selection for the current rate matching is calculated in real time based on the position in the circular buffer of the last bit of the bit selection for the previous rate matching. If one party incorrectly determines the position in the circular buffer of the last bit of the bit selection for the previous rate matching, the positions of the first bits of the bit selections for all rate matchings starting from the current rate matching will be incorrectly determined, causing error propagation. As a result, the bits expected to be received by the network device cannot be aligned with the bits transmitted by the terminal, resulting in a decoding error on the network side. It should be understood that before the position in the circular buffer of the last bit of the bit selection for the previous rate matching is calculated, the bit length to be output in the previous rate matching needs to be determined. Currently, the bit length output in rate matching is generally calculated based on the total amount of coded bits available for the transmission of the TB (G is the total number of coded bits available for the transmission of the transport block). Note that when UCI is multiplexed onto the PUSCH, the UCI occupies some of the coded bits originally available for the transmission of the TB. Therefore, when calculating G, the total amount of coded bits occupied by UCI needs to be subtracted from the total amount of coded bits occupied when UCI is not multiplexed. The UCI may include at least one of HARQ-ACK, A-CSI, CSI Part 1, CSI Part 2, CG-UCI, and joint coding of HARQ-ACK and CG-UCI. An example in which the UCI is A-CSI is used below for detailed explanation.

[0205] For example, the network device transmits a PDCCH to schedule the terminal device to report A-CSI, and the reported A-CSI needs to be multiplexed into the TBoMS transmission. The network device performs rate de-matching on the uplink shared control channel (UL-SCH) and determines the position of the first bit in the bit selection for each rate matching in the manner described above. When the A-CSI is multiplexed onto the UL-SCH, the total number of coded bits of the A-CSI needs to be subtracted to obtain the total number of coded bits G'G' available for TB transmission when calculating the output bit length through rate matching. If the A-CSI is multiplexed into the second slot, the length of the bits available for TB transmission and output in the second rate matching is smaller than that in another slot. Therefore, the position of the first bit in the third rate matching needs to be advanced in the circular buffer. In this case, when performing rate de-matching, the network device also uses G', which is obtained after subtracting the total number of coded bits of A-CSI, as the length of bits available for TB transmission and output in the second rate matching. In this case, the network device considers that the terminal device transmits the TB to the network device in the uplink slot shown in FIG. 7(a). However, if the terminal device fails to detect the PDCCH, the terminal cannot know that A-CSI needs to be reported. Therefore, when the terminal device determines the length of bits available for TB transmission and output in the second rate matching, the total number of coded bits of A-CSI is not subtracted; when the terminal device determines the position of the first bit in bit selection for rate matching in the third slot, the total number of coded bits of A-CSI is not subtracted to obtain G', which is the total number of coded bits available for TB transmission. In this case, the uplink slot in which the terminal device transmits the TB to the network device is shown in FIG. 7(b).Comparing Figure 7(a) with Figure 7(b) reveals that in this case, the network device and the terminal device do not align the positions of the first bits in the bit selection for each rate matching bit in the circular buffer, causing a decoding error in the network device.

[0206] Below, G and G' will be explained using an example. G'=Φ-θ-ψ. Φ is the total amount of coded bits that can be carried by the allocated time-frequency resources, θ is the amount of coded bits occupied by reference signals or other channels, and ψ represents the amount of coded bits occupied by UCI, where θ is greater than or equal to 0. When there are no other reference signals or other channels, θ=0. When there is no UCI occupation, ψ=0.

[0207] In one possible embodiment (no UCI multiplexing), G'=N RE ×Q m ×N L where N RE , Q m and N L N represents the number of REs, modulation order, and number of layers, respectively. RE =min(156,N RE ')n prb where n prb N represents the total number of PRBs allocated. RE '=N sc RB N symb sh -N D,urP PRB -N oh PRB where N sc RB = 12 is the number of subcarriers in the frequency domain within a physical resource block, and N symb sh is the number of symbols allocated to the PUSCH, L, and N DMRS PRB is the number of DM-RS REs for each PRB within the allocated duration, including the absence of data in the DM-RS CDM group, and N ohPRB is the overhead configured by the higher layer parameter xOverhead of PUSCH-ServingCellConfig.

[0208] In another possible embodiment (where UCI multiplexing is present), G'=N RE ×Q m ×N L -ψ.

[0209] ψ is not subtracted from G in the uplink transmission method provided in the embodiment of the present application in the above two aspects.

[0210] 8. Time Domain Resource Allocation (TDRA) Table

[0211] A PUSCH-TDRA table is used to configure the time-domain relationship between the PDCCH and the PUSCH. The PUSCH-TDRA table contains one or more PUSCH-TDRAs. The UE determines the bit width of the DCI field based on the number of entries in the PUSCH-TDRA table. A value of 0 in the DCI field indicates the first element in the list, a value of 1 in the DCI field indicates the second element in the list, and so on.

number

[0212] For more information, see TS38.331.

[0213] 9. Filler Bit

[0214] Filler bits are also referred to herein as null bits (NULL).

[0215] LDPC coding is performed when the size of the code block obtained before encoding is Z c where Z cIt should be understood that Z is the LDPC lifting size. However, after TBS calculation, CRC addition, base graph selection, and code block segmentation, the size of each code block is not necessarily Z. c Therefore, the size of the code block obtained before LDPC encoding is Z c Filler bits need to be added after each code block to ensure that the number of bits is an integer multiple of .

[0216] For a detailed description of filler bits, see section 5.2.2 of TS38.212.

[0217] The uplink transmission method provided in the present application will be described below with reference to FIGS.

[0218] Hereinafter, with reference to FIG. 8, an uplink transmission method 100 in an embodiment of the present application will be described in detail.

[0219] 8 is a schematic interaction diagram of the method 100 according to the present application. The method 100 can be implemented in two different ways based on whether the terminal device detects the second indication information.

[0220] In a first possible implementation, the terminal device detects the second indication information.

[0221] S101: A network device transmits first instruction information to a terminal device, and in response, the terminal device receives first instruction information from the network device, the first instruction information instructing the terminal device to transmit a first transport block in multiple time units.

[0222] It should be understood that the first transport block in this specification refers to one transport block.

[0223] Note that a time unit in this application can be understood as an available slot, which is currently determined jointly based on the uplink-downlink slot configuration, TDRA, and synchronization signal and PBCH block (SSB).

[0224] For example, the uplink-downlink slot configuration is DDSUU; in slot S, the first 10 symbols are downlink symbols, the middle two symbols are flexible symbols, and the last two symbols are uplink symbols. TDRA indicates that the first slot is the first D, the number of slots is 4, the first symbol S in a slot is the first symbol, and the symbol length L is 10. According to the indications of S and L, the symbols corresponding to slot D and slot S are downlink symbols and cannot be used for TBoMS transmission. Therefore, the available slots can be determined to be four U in DDSUU.

[0225] In another example, S denotes the 13th symbol and L = 2. In this case, the available slots may be the first two, S and U, in DDSUUDDSUU. Because S and L denote the uplink symbols in slot S, slot S may also be used for transmissions over multiple slots.

[0226] S102: The network device transmits second instruction information to the terminal device, and correspondingly, the terminal device receives second instruction information from the network device, the second instruction information instructing the terminal device to transmit uplink control information UCI in a first time unit, the first time unit being one of the plurality of time units.

[0227] It should be understood that the first instruction information instructs the terminal device to transmit a first transport block in the plurality of time units, the second instruction information instructs the terminal device to transmit UCI in the first time unit, and the terminal device transmits the first transport block multiplexed with UCI to the network device. The first transport block multiplexed with UCI may be understood as the first time unit carrying the UCI and coded bits of the first transport block.

[0228] S103: The terminal device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit, where the first coded bit sequence is a coded bit sequence output through rate matching in a second time unit, the parameter G is a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G is a positive integer, and the second time unit is a time unit following the first time unit in the plurality of time units.

[0229] It should be understood that, for the plurality of time units, rate matching is performed once for each time unit, and a coded bit sequence is output once. As the time unit following the first time unit, the position in the circular buffer of the first bit of the coded bit sequence (the aforementioned first coded bit sequence) output through rate matching in the second time unit is determined based on a parameter G corresponding to the first time unit. Specifically, when the position in the circular buffer of the first bit of the first coded bit sequence is determined based on G, the length of the coded bit sequence output through rate matching in the first time unit needs to be first determined based on G, and then the position in the circular buffer of the first bit of the first coded bit sequence is determined based on the length. Alternatively, the position in the circular buffer of the first bit of the first coded bit sequence can be directly determined based on G.

[0230] S104: The terminal device transmits the UCI and the first transport block to the network device in the plurality of time units.

[0231] It should be understood that in a specific implementation, since some time domain resources in the first time unit are used to carry UCI, in S104 the network device may not be able to completely transmit the first transport block indicated in S101.

[0232] S105: The network device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to the first time unit.

[0233] It should be understood that the solution in S105 where the network device determines the position in the circular buffer of the first bit in the first coded bit sequence is similar to the solution in S103 where the terminal device determines the position in the circular buffer of the first bit in the first coded bit sequence.

[0234] For details, please refer to the corresponding description in S203 of the first possible implementation of the method 200.

[0235] In this embodiment of the present application, the network device instructs the terminal device to include the indication information of UCI in the first time unit; when the terminal device detects the instruction, the total amount of encoded bits of UCI is not subtracted from the parameter G used by the network device and the terminal device to determine the position of the leading bit in the encoded bit sequence output through rate matching in the second time unit (the next time unit after the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position of the leading bit in the cyclic buffer in the bit selection in each rate matching. This increases the decoding success rate.

[0236] In S103, in a possible implementation, the terminal device determines the position of the leading bit in the cyclic buffer in the first encoded bit sequence based on a times the parameter G corresponding to the first time unit, where 0 < a ≤ 1. Here, a is equal to any of 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x, (0 < x < 100), where x is an integer. For example, a may be any number from 0.1, 0.2, 0.3,..., 0.9, 1, or alternatively, any number from 0.2, 0.4, 0.6, 0.8, 1.

[0237] Similarly, when determining the position of the leading bit in the cyclic buffer in the first encoded bit sequence based on aG, the terminal device first determines the length of the encoded bit sequence output through rate matching within the first time unit based on aG, and then needs to determine the position of the leading bit in the cyclic buffer in the first encoded bit sequence based on the length.

[0238] Correspondingly, the network device also determines the position of the leading bit in the cyclic buffer in the same way in the first encoded bit sequence.

[0239] Method 100 further includes the following.

[0240] The terminal device determines a length of the second coded bit sequence based on a parameter G corresponding to the first time unit.

[0241] For details, please refer to the descriptions corresponding to steps 2 and 3 in S202 in the second possible implementation of method 200.

[0242] In this embodiment of the present application, when the terminal device receives the second indication information, the network device and the terminal device can determine the position in the circular buffer of the first bit in the first coded bit sequence and the length of the second coded bit sequence in the same manner as when the terminal device does not receive the second indication information, which extends the scope of application of the uplink transmission method provided in the present application.

[0243] In another possible implementation of S103, the terminal device c and a parameter G corresponding to the first time unit, determining a position in the circular buffer of a first bit in the first coded bit sequence; c is a low density parity check LDPC factor.

[0244] Correspondingly, the network device determines the position in the circular buffer of the first bit in the first coded bit sequence in the same manner.

[0245] For details, please refer to the corresponding description in the third possible implementation of the method 200.

[0246] It should be understood that in the prior art, when resource mapping is performed at the terminal side, the position in the circular buffer of the last bit mapped to the previous time unit needs to be found, which results in high computational overhead.

[0247] In this embodiment of the present application, when resource mapping is performed at the terminal side, the step of locating the position of the last bit in the first coded bit sequence that was mapped to the previous time unit is reduced, and the step of locating the position of the first bit in the first coded bit sequence in the circular buffer based on G is performed based on Z c This simplifies the calculations and reduces overhead in the mapping process.

[0248] In another possible implementation of S103, the terminal device c and a times a parameter G corresponding to the first time unit, where Z c is a low density parity check LDPC factor.

[0249] Correspondingly, the network device determines the position in the circular buffer of the first bit in the first coded bit sequence in the same manner.

[0250] For details, please refer to the descriptions corresponding to steps 2 and 3 of S202 in the second possible implementation of method 200.

[0251] It should be understood that in the prior art, when resource mapping is performed at the terminal side, the position in the circular buffer of the last bit mapped to the previous time unit needs to be found, which results in high computational overhead.

[0252] In this embodiment of the present application, when resource mapping is performed at the terminal side, the step of locating the position of the last bit in the first coded bit sequence that was mapped to the previous time unit is reduced, and the position is determined based on determining the position in the circular buffer of the first bit in the first coded bit sequence based on aG, and the position is determined based on Z c This simplifies the calculations and reduces overhead in the mapping process.

[0253] The method 100 further includes:

[0254] The terminal device maps the second coded bit sequence to time-frequency resources in the first time unit, where the second coded bit sequence is a coded bit sequence output through rate matching in the first time unit, and the amount of bits in the second coded bit sequence is equal to a parameter G corresponding to the first time unit. The terminal device maps UCI to some time-frequency resources in the first time unit to replace some bit sequences in the first coded bit sequence carried in the some time-frequency resources.

[0255] It should be noted that in a specific implementation, the bit sequence that is mapped to the time-frequency resource is not the sequence on which rate matching is performed, but may be mapped to that time-frequency resource only after code block concatenation is performed.

[0256] In this embodiment of the present application, the UCI is multiplexed in a puncturing manner in the first time unit, so that the bit sequence contained in the first transport block and carried on time-frequency resources other than the time-frequency resource occupied by the UCI in the first time unit remains unchanged, which improves the decoding success rate and accuracy of the network device.

[0257] The first indication information further indicates that the network device can transmit one transport block in the multiple time units, the first transport block being one transport block, and the first indication information includes a transport block transmission enable field over multiple slots, or the first indication information includes a transport block over multiple slots mapping type parameter.

[0258] It should be understood that the above solutions provide several possible signaling designs for the first indication information. The first indication information can include a multi-slot transport block transmission enable field by newly adding a TDRA table to the first indication information. The first indication information can include a multi-slot transport block mapping type parameter by changing the mapping type field in the first indication information from 1 bit to 2 bits.

[0259] For details, please refer to the corresponding description in S201 of method 200.

[0260] In this embodiment of the present application, the fact that a network device supports the capability of transmission over multiple slots is indicated to a terminal device in multiple forms, thereby enriching the signaling design and improving the uplink transmission efficiency.

[0261] In a second possible implementation, the terminal device does not detect the second indication information.

[0262] For details of S101', please refer to the corresponding description in S101 in the first possible implementation.

[0263] S102': The network device sends second instruction information to the terminal device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in a first time unit, the first time unit being one of the plurality of time units. However, the terminal device does not detect the second instruction information from the network device. Therefore, the terminal device does not transmit UCI in the first time unit.

[0264] S103′: The terminal device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit, where the parameter G is a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G is a positive integer, and the second time unit is a time unit following the first time unit in the plurality of time units.

[0265] In this case, since the terminal device does not detect the second indication information, it should be understood that the parameter G corresponding to the first time unit is the total amount of coded bits available for transmission of the first transport block in the first time unit.

[0266] It should be further understood that, in the plurality of time units, rate matching is performed once in each time unit, and a coded bit sequence is output once. As a time unit following the first time unit, a position in the circular buffer of a leading bit of a coded bit sequence (the aforementioned first coded bit sequence) output through rate matching in a second time unit (the time unit following the first time unit) is determined based on a parameter G corresponding to the first time unit.

[0267] Optionally, S103' may be replaced with the following: The terminal device determines the position in the circular buffer of the first bit in the first coded bit sequence according to conventional techniques.

[0268] S104': The terminal device transmits a first transport block to the network device in the plurality of time units.

[0269] It should be understood that the terminal device transmits a first transport block in the plurality of time units, and the network device considers the terminal device to transmit UCI in the first time unit.

[0270] S105′: The network device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit, where the first coded bit sequence is a coded bit sequence output through rate matching in a second time unit, the parameter G is a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G is a positive integer, and the second time unit is a time unit following the first time unit in the plurality of time units.

[0271] It should be understood that although the network device considers that the terminal device transmits UCI in the first time unit, the total amount of coded bits of the UCI is not subtracted from G, which is used by the network device to determine the position of the first bit in the first coded bit sequence in the circular buffer. Therefore, regardless of whether the terminal device determines the position of the first bit in the first coded bit sequence in the circular buffer based on G in S103′ or determines the position of the first bit in the first coded bit sequence in the circular buffer according to the prior art, the position of the first bit in the first coded bit sequence in the circular buffer calculated by the terminal device in S103′ matches the position of the first bit in the first coded bit sequence in the circular buffer calculated by the network device in S105′.

[0272] In this embodiment of the present application, the network device instructs the terminal device to include the UCI indication information in the first time unit. When the terminal device does not detect the instruction, the total amount of the UCI encoded bits is not subtracted from the parameter G used by the network device and the terminal device to determine the position of the leading bit in the encoded bit sequence output through rate matching in the second time unit (the next time unit after the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position of the leading bit in the cyclic buffer in the bit selection for each rate matching. This increases the decoding success rate.

[0273] In S103', in a possible implementation, the terminal device determines the position of the leading bit in the first encoded bit sequence in the cyclic buffer based on a times the parameter G corresponding to the first time unit, where 0 < a ≤ 1. Here, a is either 0.1x (0 < x < 10), 0.2x (0 < x < 5), or 0.01x (0 < x < 100), and x is an integer. For example, a can be any number from 0.1, 0.2, 0.3,..., 0.9, 1, or any number from 0.2, 0.4, 0.6, 0.8, 1.

[0274] Similarly, when determining the position of the leading bit in the first encoded bit sequence in the cyclic buffer based on aG, the terminal device first determines the length of the encoded bit sequence output through rate matching within the first time unit based on aG, and then needs to determine the position of the leading bit in the first encoded bit sequence in the cyclic buffer based on the length.

[0275] Correspondingly, the network device also determines the position of the leading bit in the first encoded bit sequence in the cyclic buffer in the same way.

[0276] It should be understood that when the terminal device does not detect the second indication information, if the network device calculates the position of the first bit in the first coded bit sequence based on the parameter G from which the total number of coded bits of the UCI is not subtracted, there is a gap between that position and the last bit in the second coded bit sequence. Since the gap is on the network device side, the gap is caused by the RE used to carry the UCI. The gap in the systematic bits may degrade channel quality.

[0277] In this embodiment of the present application, G is multiplied by a greater than 0 and less than 1, which allows the network device to pre-calculate the position in the circular buffer of the first bit in the first coded bit sequence, shortening the gap between the last bit in the second coded bit sequence and the first bit in the first coded bit sequence and improving channel quality.

[0278] The method 100 further includes:

[0279] The terminal device determines the length of the second coded bit sequence based on a parameter G corresponding to the first time unit, where the second coded bit sequence is a coded bit sequence output through rate matching in the first time unit.

[0280] Furthermore, in this embodiment of the present application, the length of the second coded bit sequence is still calculated based on G. Since G is greater than aG, it can be further ensured that the aforementioned gaps are removed.

[0281] In another possible implementation of S103, the terminal device c and a parameter G corresponding to the first time unit, determining a position in the circular buffer of a first bit in the first coded bit sequence, where Z c is the low density parity check LDPC coefficient.

[0282] Correspondingly, the network device determines the position in the circular buffer of the first bit in the first coded bit sequence in the same manner.

[0283] For details, please refer to the corresponding description in the third possible implementation of the method 200.

[0284] It should be understood that in the prior art, when resource mapping is performed at the terminal side, the position in the circular buffer of the last bit mapped to the previous time unit needs to be found, which results in high computational overhead.

[0285] In this embodiment of the present application, when resource mapping is performed at the terminal side, the step of locating the position of the last bit in the first coded bit sequence that was mapped to the previous time unit is reduced, and based on determining the position in the circular buffer of the first bit in the first coded bit sequence based on G, the position is determined to be Z c This simplifies the calculations and reduces overhead in the mapping process.

[0286] In another possible implementation of S103, the terminal device c and a times a parameter G corresponding to the first time unit, where Z c is a low density parity check LDPC factor.

[0287] Correspondingly, the network device determines the position in the circular buffer of the first bit in the first coded bit sequence in the same manner.

[0288] For details, please refer to the descriptions corresponding to steps 2 and 3 of S202 in the second possible implementation of method 200.

[0289] It should be understood that in the prior art, when resource mapping is performed at the terminal side, the position in the circular buffer of the last bit mapped to the previous time unit needs to be found, which results in high computational overhead.

[0290] In this embodiment of the present application, when resource mapping is performed at the terminal side, the step of locating the position of the last bit in the first coded bit sequence that was mapped to the previous time unit is reduced, and the position is determined based on aG in the circular buffer of the first bit in the first coded bit sequence, and the position is determined based on Z c This simplifies the calculations and reduces overhead in the mapping process.

[0291] The first indication information further indicates that the network device can transmit one transport block in the multiple time units, the first transport block being one transport block, and the first indication information includes a transport block transmission enable field over multiple slots, or the first indication information includes a transport block over multiple slots mapping type parameter.

[0292] It should be understood that the above solutions provide several possible signaling designs for the first indication information. The first indication information can include a multi-slot transport block transmission enable field by newly adding a TDRA table to the first indication information. The first indication information can include a multi-slot transport block mapping type parameter by changing the mapping type field in the first indication information from 1 bit to 2 bits.

[0293] For details, please refer to the corresponding description in S201 of method 200.

[0294] In this embodiment of the present application, the fact that a network device supports the capability of transmission over multiple slots is indicated to a terminal device in multiple forms, thereby enriching the signaling design and improving the uplink transmission efficiency.

[0295] The following describes in detail an uplink transmission method 200 in an embodiment of the present application with reference to Fig. 9. Fig. 9 is a schematic interactive diagram of the method 200 according to the present application.

[0296] Specifically, method 200 may have multiple different implementations. The following uses several different implementations as illustrative examples. The several different implementations separately provide methods for a terminal device to calculate the position of the first bit in a bit sequence output through rate matching in time unit #n based on G corresponding to time unit #n-1.

[0297] In a first possible implementation, the terminal device calculates the position of the first bit in the bit sequence to be output through rate matching in time unit #n based on G corresponding to time unit #n-1, and calculates the length of the bit sequence to be output through rate matching in time unit #n based on G or G' corresponding to time unit #n. If all the time units contain different numbers of OFDM symbols, the time units correspond to different Gs. If all the time units contain the same number of OFDM symbols, the time units correspond to the same G.

[0298] It should be noted that in the following embodiments, for convenience, an example in which one time unit is equal to one slot is used for explanation. In specific implementation, one time unit may be understood as a symbol, a physical slot, an available slot, etc., as defined in the terminology section of this application. This is not limited in this application.

[0299] S201: A network device transmits scheduling information to a terminal device, where the scheduling information indicates to the terminal device to transmit a PUSCH in multiple slots, where the PUSCH carries an UL-SCH corresponding to one TB, or the scheduling information instructs the terminal device to transmit a TBoMS PUSCH, and further instructs the terminal device to include UCI on the PUSCH.

[0300] It should be noted that the terminal device may or may not detect signaling in the scheduling information that instructs the terminal device to include UCI on the PUSCH.

[0301] It should be understood that the terminal device carries UCI on the PUSCH in the following cases: Two common examples are given below.

[0302] (1) DCI triggers the terminal device to perform A-CSI measurement and report CSI, and the reported CSI and PUSCH overlap in the time domain.

[0303] (2) DCI triggers the terminal device to receive the PDSCH and send the HARQ-ACK corresponding to the PDSCH on the PUCCH, but the PUCCH and the PUSCH overlap in the time domain, and the priority of the PUCCH is the same as the priority of the PUSCH.

[0304] Optionally, the scheduling information further indicates at least one of a number of TBoMS slots, a number of TBoMS repetitions, a TBS calculation scaling factor, an RV update granularity, and a TBoMS transmission enablement.

[0305] Below we describe some possible signaling designs.

[0306] Possible design 1:

[0307] The scheduling information indicates that the number of TBoMS slots is equal to N, where N is equal to or less than 4, 6, or 8. A specific implementation may be that a 1-bit to 3-bit field numberOfSlots is newly added to PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList to indicate the number of slots N.

[0308] Possible values ​​for N are {1,2,...,8} or a subset thereof. For example, the subsets can be {2,4}, {2,4,6}, {2,4,8}, {2,4,6,8}, {2,4,7}, {2,4,7,8}, {2,3,4,7,8}, {1,2,4}, {1,2,4,6}, {1,2,4,8}, {1,2,4,6,8}, {1,2,4,7}, {1,2,4,7,8}, and {1,2,3,4,7,8}.

[0309] It should be understood that if TBoMS repetition is not supported, the number of TBoMS slots indicates only the number of slots allocated to one TBoMS transmission. The TBS calculation scaling factor and RV update granularity are implicitly indicated by the number of TBoMS slots. The TBS calculation scaling factor, RV update granularity, and number of TBoMS slots are all equal to K. The terminal device may determine that K=N in an implicit indication manner.

[0310] Whether a network device enables the TBoMS transmission feature can be indicated to the terminal device explicitly or implicitly. There are three possible explicit indication methods:

[0311] (1) Based on the existing TDRA table, a new TDRA table dedicated to TBoMS time domain resource allocation is added. PUSCH-TimeDomainResourceAllocationListTBoMS

[0312] It should be understood that compared with another TDRA table, the newly added TDRA table has the highest priority. That is, when the newly added TDRA table is configured, the TDRA table is enabled, and the other TDRA table is not enabled. Therefore, when the newly added TDRA table is configured, TBoMS transmission is enabled; otherwise, TBoMS transmission is not enabled. The other TDRA table includes: -pusch-TimeDomainAllocationList -pusch-TimeDomainAllocationListDCI-0-1 -pusch-TimeDomainAllocationListDCI-0-2 -pusch-TimeDomainAllocationListForMultiPUSCH

[0313] (2) A new 1-bit field, enableTBoMS, is added to PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList. If this field is 0 or not configured, it indicates that TBoMS transmission is not enabled; otherwise, TBoMS transmission is enabled.

[0314] (3) The field mappingType in PUSCH-Allocation in RRC signaling PUSCH-TimeDomainResourceAllocationList is changed from 1 bit to 2 bits, indicating {typeA, typeB, TBoMS}, where "10" or "11" indicates TBoMS transmission.

[0315] Optionally, TBoMS transmission is explicitly enabled, but if the number of TBoMS slots is N=1, TBoMS transmission is not enabled. The implicit indication method is as follows: When the number of TBoMS slots is greater than 1, it indicates that TBoMS transmission is enabled. If the number of TBoMS slots is equal to 1 or the number of TBoMS slots is not configured, it indicates that TBoMS transmission is not enabled.

[0316] Possible design 2:

[0317] Based on Possible Design 1, the scheduling information is rep This is indicated by the existing field numberOfRepetitions in the PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList.

[0318] In this case, TBoMS repetition is supported, and the total number of slots for TBoMS repetition is N × N rep Optionally, the total number of slots is not expected to exceed 16, 24, or 32.

[0319] Possible design 3:

[0320] The scheduling information indicates the number of TBoMS slots. The number of slots can be 4, 6, or less than or equal to 8, as indicated by the existing field numberOfRepetitions in PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList. Candidate values ​​are {1,2,...,8} or a subset thereof. For example, the subset can be {2,4}, {2,4,6}, {2,4,8}, {2,4,6,8}, {2,4,7}, {2,4,7,8}, {2,3,4,7,8}, {1,2,4}, {1,2,4,6}, {1,2,4,8}, {1,2,4,6,8}, {1,2,4,7}, {1,2,4,7,8}, and {1,2,3,4,7,8}.

[0321] It should be understood that if TBoMS repetition is not supported, the number of TBoMS slots indicates only the number of slots allocated to one TBoMS transmission. The TBS calculation scaling factor and RV update granularity are implicitly indicated by the number of TBoMS slots. The TBS calculation scaling factor, RV update granularity, and number of TBoMS slots are all equal to K. The terminal device may determine that K=N in an implicit indication manner.

[0322] In addition, because the number of slots is indicated by the existing field numberOfRepetitions, the prior art cannot distinguish between the two functions of repetition and TBoMS. Therefore, new signaling needs to be added to explicitly indicate whether TBoMS transmission is enabled. For details, see the three explicit indication methods in Possible Design 1.

[0323] Possible design 4:

[0324] The scheduling information indicates the number of TBoMS slots. The number of slots can be 16, 24, or 32 or less, and is indicated by the existing field numberOfRepetitions in PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList. The field has 3 or 4 bits. The possible values ​​are {1, 2, ..., 32} or a subset thereof. For example, the subsets are {1,2,3,4,7,8,12,16}, {1,2,3,4,7,8,12,16,20}, {1,2,3,4,7,8,12,16,24}, {1,2,3,4,7,8,12,16,28}, {1,2,3,4,7,8,12,16,32}, {1,2,3,4,7,8,12,16,20,24}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32 ...44}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32}, ,16,24,28}, {1,2,3,4,7,8,12,16,24,32}, {1,2,3,4,7,8,12,16,28,32}, {1,2,3,4,7,8,12,16,20,24,28}, {1,2,3,4,7,8,12,16,20,24,32}, {1,2,3,4,7,8,12,16,24,28,32}, {1,2,3,4,7,8,12,16,20,24,28,32}.

[0325] The scheduling information indicates the TBS calculation scaling factor. The value of the scaling factor is equal to K, where K is 4, 6, or 8 or less. A new field scalingFactor of 1 bit to 3 bits is added to PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList to indicate the scaling factor. The candidate values are {1, 2, …, 8} or a subset thereof. For example, the subset can be {2, 4}, {2, 4, 6}, {2, 4, 8}, {2, 4, 6, 8}, {2, 4, 7}, {2, 4, 7, 8}, {2, 3, 4, 7, 8}, {1, 2, 4}, {1, 2, 4, 6}, {1, 2, 4, 8}, {1, 2, 4, 6, 8}, {1, 2, 4, 7}, {1, 2, 4, 7, 8}, and {1, 2, 3, 4, 7, 8}.

[0326] Optionally, it is not expected that N or K is not an integer.

[0327] When K = N, it is not essentially a TBoMS repetition, and the number of slots represents only the number of slots allocated for one TBoMS transmission; or when K < N, it is essentially a TBoMS repetition, and the number of slots represents the total number of slots including the transmissions of the TBoMS repetitions. It should be understood that K represents the number of slots for one TBoMS transmission, and when N / K is an integer, the number of TBoMS repetitions is N / K. The RV update granularity is K slots. It is not expected that K > N.

[0328] Whether to enable the TBoMS transmission function can be indicated explicitly or implicitly. Explicit indication is indicated by three explicit indication methods in possible design 1. Optionally, TBoMS transmission is explicitly enabled, but if K=1 or K>N, TBoMS transmission is not enabled. The implicit indication method is as follows: If the TBS calculation scaling factor K is configured, K≠1, and K≦N, it indicates that TBoMS transmission is enabled; otherwise (i.e., the scaling factor K is not configured, or K is configured but K=1 or K>N), TBoMS transmission is not enabled.

[0329] Possible Design 5:

[0330] The scheduling information indicates the number of TBoMS slots. The number of slots can be 16, 24, or less than or equal to 32. A new field numberOfSlots of 3 or 4 bits is added to PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList to indicate the number of slots N. Candidate values ​​are {1, 2, ..., 32} or any subset thereof. For example, the subsets are {1,2,3,4,7,8,12,16}, {1,2,3,4,7,8,12,16,20}, {1,2,3,4,7,8,12,16,24}, {1,2,3,4,7,8,12,16,28}, {1,2,3,4,7,8,12,16,32}, {1,2,3,4,7,8,12,16,20,24}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32 ...44}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32}, ,16,24,28}, {1,2,3,4,7,8,12,16,24,32}, {1,2,3,4,7,8,12,16,28,32}, {1,2,3,4,7,8,12,16,20,24,28}, {1,2,3,4,7,8,12,16,20,24,32}, {1,2,3,4,7,8,12,16,24,28,32}, {1,2,3,4,7,8,12,16,20,24,28,32}.

[0331] The scheduling information indicates the TBS calculation scaling factor. The value of the scaling factor is K, where K is equal to or less than 4, 6, or 8. One to three bits of the existing field numberOfRepetitions in PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList indicate the scaling factor. Candidate values ​​are a subset of {1, 2, ..., 8}. For example, the subsets are {1,2,3,4,7,8,12,16}, {1,2,3,4,7,8,12,16,20}, {1,2,3,4,7,8,12,16,24}, {1,2,3,4,7,8,12,16,28}, {1,2,3,4,7,8,12,16,32}, {1,2,3,4,7,8,12,16,20,24}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32 ...44}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32}, ,16,24,28}, {1,2,3,4,7,8,12,16,24,32}, {1,2,3,4,7,8,12,16,28,32}, {1,2,3,4,7,8,12,16,20,24,28}, {1,2,3,4,7,8,12,16,20,24,32}, {1,2,3,4,7,8,12,16,24,28,32}, {1,2,3,4,7,8,12,16,20,24,28,32}.

[0332] Optionally, it is not contemplated that N / K is not an integer.

[0333] It should be understood that the difference between Possible Design 4 and Possible Design 5 lies in the specific signaling instructions.

[0334] Possible Design 6:

[0335] The scheduling information indicates the number of TBoMS slots. The value of the number of slots is N, where N is equal to or less than 16, 24, or 32. To indicate the number of slots N, a new field numberOfSlots of 3 or 4 bits is added to PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList. Candidate values ​​are {1, 2, ..., 32} or a subset thereof. For example, the subsets are {1,2,3,4,7,8,12,16}, {1,2,3,4,7,8,12,16,20}, {1,2,3,4,7,8,12,16,24}, {1,2,3,4,7,8,12,16,28}, {1,2,3,4,7,8,12,16,32}, {1,2,3,4,7,8,12,16,20,24}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32 ...44}, {1,2,3,4,7,8,12,16,20,28}, {1,2,3,4,7,8,12,16,20,32}, ,16,24,28}, {1,2,3,4,7,8,12,16,24,32}, {1,2,3,4,7,8,12,16,28,32}, {1,2,3,4,7,8,12,16,20,24,28}, {1,2,3,4,7,8,12,16,20,24,32}, {1,2,3,4,7,8,12,16,24,28,32}, {1,2,3,4,7,8,12,16,20,24,28,32}.

[0336] The scheduling information is the number of TBoMS iterations N rep which is indicated by the existing field numberOfRepetitions in the PUSCH-Allocation in the RRC signaling PUSCH-TimeDomainResourceAllocationList.

[0337] In this case, TBoMS iterations are supported and the number of iterations is N rep It should be understood that the number of slots indicates the number of all slots allocated to the TBoMS iterations. The TBS calculation scaling factor and RV update granularity are determined by the number of TBoMS iterations Nrep and the number of slots, i.e., K=N / N rep Therefore, N / N rep It is not expected that is not an integer.

[0338] Whether the TBoMS transmission function is enabled can be indicated explicitly or implicitly. Explicit indication is shown in three explicit indication methods in Possible Design 1. Optionally, TBoMS transmission is explicitly enabled, but N rep ≧N or N / N rep If N is not an integer, TBoMS transmission is not enabled. The implicit indication method is as follows: rep <Nであり、N / N rep If is an integer, TBoMS transmission is enabled; otherwise, TBoMS transmission is not enabled.

[0339] Optionally, if a terminal device is scheduled to transmit a PUSCH, and the PUSCH does not carry a TB but carries CSI for reporting, it is not expected that TBoMS time domain resource allocation will be performed to transmit the PUSCH.

[0340] The above describes six signaling designs for scheduling information.

[0341] S202: Generate a PUSCH based on the scheduling information.

[0342] The terminal device performs rate matching based on the scheduling information to generate the UL-SCH.

[0343] It should be understood that in addition to rate matching, generating the UL-SCH further includes processes such as TBS calculation, code block segmentation, LDPC encoding, code block concatenation, resource mapping, and modulation, etc. These processes may be performed according to conventional techniques, and therefore will not be described in detail herein.

[0344] Specifically, in step 1, the terminal device determines the number of times to perform rate matching and the time unit in which each rate matching is performed based on the number of slots for transmitting the PUSCH indicated by the scheduling information.

[0345] Optionally, the number of times rate matching is performed is equal to the number of slots for transmitting the PUSCH, which is equal to N. It should be understood that rate matching is performed once in each slot, and the bit length output in each rate matching is determined by the available time-frequency resources in one slot.

[0346] For example, as shown in (a) of FIG. 10, the uplink-downlink slot configuration is DDDSU, and the number of slots for transmitting PUSCH is equal to 4. Assuming that both slot S and slot U can be used to transmit PUSCH, the number of rate matchings is equal to 4, the time unit for performing rate matching RM#0 / RM#2 is slot S, and the time unit for performing rate matching RM#1 / RM#3 is slot U.

[0347] For example, as shown in (b) of FIG. 10, the uplink-downlink slot configuration is DDSUU, and the number of slots for transmitting PUSCH is equal to 4. Assuming that only slot U is used to transmit PUSCH, the number of rate matching operations is equal to 4, and the time unit for performing each rate matching operation is slot U.

[0348] How to determine the output bit sequence through rate matching will be explained in detail by performing steps 2 to 4 subsequently.

[0349] In step 2, the length of the bit sequence output through rate matching is calculated based on the parameter G in the uplink transmission method provided in this application, and E r In step 3, the starting point of the output bit sequence through rate matching is E r In step 4, the terminal device determines the first bit position and the bit length E r Alternatively, in step 2, the length of the bit sequence output through rate matching is determined by performing bit selection based on r ' is calculated based on the parameter G in the prior art; in step 3, the length of the bit sequence output through rate matching is calculated based on the parameter G in the uplink transmission method provided in the present application, and E r The starting point of the bit sequence output through rate matching is E r In step 4, the terminal device determines the first bit position and the bit length E r ' to determine the output bit sequence.

[0350] If there is only one code block, E r Since G = G, steps 2 and 3 may alternatively be simplified as follows: Step 2 is not performed, and in step 3, the starting point of the bit sequence output through rate matching may be directly determined based on G.

[0351] Before describing steps 2 to 4 in detail, the following will first explain the main difference between G and G' using (b) in Figure 7 as an example. Assume that UCI needs to be multiplexed into the slot corresponding to RM#2. In this case, in the prior art solution, when the position in the circular buffer of the first bit in the bit sequence to be output in the slot corresponding to RM#3 is calculated, the total amount of coded bits G' used is only the total amount of coded bits available for the transmission of the TB, i.e., G' does not include the total amount of coded bits occupied by the UCI. However, in this embodiment of the present application, when the position in the circular buffer of the first bit in the bit sequence to be output in the slot corresponding to RM#3 is calculated, the total amount of coded bits G includes the total amount of coded bits available for the transmission of the TB and the total amount of coded bits occupied by the UCI.

[0352] Step 2: The terminal device determines the output bit length through rate matching.

[0353] It should be understood that the terminal device determines the bit length to be output through rate matching based on the total number of coded bits G or G'. However, G or G' may be determined by the terminal device or indicated by the network device (e.g., by using RRC or DCI).

[0354] It should be further understood that if the time domain resources available for uplink transmission in different time units are different, for example, if the number of OFDM symbols included in the special slot and the uplink slot is different, then different slots will also have different G or G'. Therefore, the terminal device needs to separately determine different G or G' based on different slots.

[0355] When the bit length is determined based on G or G', the following also describes how to determine the bit length based on whether the amount of OFDM symbols included in every time unit is the same or different.

[0356] 1. E based on G r Calculate.

[0357] (1) The number of OFDM symbols contained in every time unit is different.

[0358] The terminal device determines the total amount of coded bits G available for transmission of the TB in time unit #n. n Based on this, the bit length E output through rate matching of code block #r in time unit #n is r,n where r = 0, 1, ..., or C-1, n = 0, 1, ..., or N-1, and C is the number of code blocks. For example, the terminal device determines the bit length E r,n where C' is the number of scheduled code blocks.

[0359] Optionally, the total number of coded bits G n is the total number of REs allocated to the PUSCH in time unit #n, N RE,n The total number of coding bits occupied by UCI is not subtracted. For example, G n =N RE,n ×Q m ×N L where Q m represents the modulation order, and N L represents the number of layers.

[0360] Regardless of whether the terminal device multiplexes the UCI with the UL-SCH, the payload size of the UCI is G nIt should be understood that the UCI is not subtracted from the calculation of G. Specifically, if the terminal device fails to detect scheduling information indicating that the UCI is multiplexed with the UL-SCH, the terminal device naturally cannot know the size of the coded bits occupied by the UCI. If the terminal device detects scheduling information indicating that the UCI is multiplexed with the UL-SCH and the UCI is multiplexed with the UL-SCH, G n is not deducted.

[0361] For example, (a) in Figure 10 is used as an example. Assume that the allocated time units are available slots, and that both slot S and slot U are considered available slots. The number of time units is equal to 4, the number of available symbols in slot S is 4, the number of available symbols in slot U is 13, and the number of RBs is 40. In this case, N RE,0 =N RE,2 =1920, N RE,1 =N RE,3 =6240. Furthermore, Q m =2, N L Assume that G0 = G2 = 3840 and G1 = G3 = 12480. Therefore, E 0,0 =E 1,0 =E 0,2 =E 1,2 = 960, and E 0,1 =E 1,1 =E 0,3 =E 1,3 =3900.

number

[0362] (2) The number of OFDM symbols contained in every time unit is the same, and the way to calculate the bit length based on G is as follows:

[0363] The terminal device determines the bit length E output through rate matching of code block #r in time unit #n based on the total number G of coding bits available for transmission of TB in one time unit corresponding to one rate matching. r where r = 0, 1, …, or C-1, and n = 0, 1, …, or N-1. For example, the terminal device determines the bit length E r Determine.

[0364] Optionally, the total number of coded bits G may be multiplied by the total number of REs N allocated to the PUSCH in one time unit. RE The size of the coded bits of the UCI is not subtracted. For example, G=N RE ×Q m ×N L where Q m represents the modulation order, and N L where ∑ denotes the number of layers. It should be understood that in this case, the total number of REs allocated to the PUSCH in each time unit in which rate matching is performed remains consistent.

[0365] For example, (b) in Figure 10 is used as an example. Assuming that N=4, the number of available symbols in each slot U is 13, and the number of RBs is 40, then N RE =6240. Furthermore, Q m =2, N L = 1, C' = C = 3, then G = 12480. In this case, E0 = E1 = E2 = 4160.

number

[0366] 2. E based on G' r ' to calculate.

[0367] (1) The number of OFDM symbols included in every time unit #n is different.

[0368] Gn Based on 'E r,n The way to calculate ' is n Based on E r,n The method for calculating is the same as (1). The differences are as follows:

[0369] All G n is G n ' and all E r,n is E r,n The total number of coded bits G n ' is the total number of REs allocated to the PUSCH in time unit #n, N RE,n The total number of coded bits occupied by UCI is determined by, for example, G n is the total number of REs allocated to the PUSCH in time unit #n, N RE,n The total number of coded bits occupied by UCIs is subtracted (the total number of coded bits occupied by UCIs is not subtracted). For example, G n =N RE,n ×Q m ×N L , G n '=N RE,n ×Q m ×N L -ψ, where Q m represents the modulation order, and N L denotes the number of layers, and ψ denotes the total amount of coding bits occupied by UCI.

[0370] (2) The number of OFDM symbols included in every time unit #n is the same.

[0371] E based on G' r The way to calculate ' is to use E based on G. r This is the same as the method for calculating (2). The differences are as follows:

[0372] All G's are replaced by G's, and all E's are replaced by G's. r is E rThe total number of coded bits G must be replaced by the total number of REs allocated to the PUSCH in one time unit N RE The total number of coded bits G' is determined by the total number of REs allocated to the PUSCH in one time unit N RE The total number of coding bits occupied by UCI is not subtracted. For example, G=N RE ×Q m ×N L , G'=N RE ×Q m ×N L -ψ, where Q m represents the modulation order, and N L denotes the number of layers, and ψ denotes the total amount of coding bits occupied by UCI.

[0373] Step 3: The terminal device determines the first bit position for bit selection in rate matching.

[0374] The terminal device determines the first bit position in the bit selection in the rate matching based on the bit length E r It should be understood that the decision is based on the

[0375] The following provides some possible implementations.

[0376] Possible implementation 1:

[0377] The terminal device selects the first bit position k in the bit selection of the code block #r in the time unit #n-1. r,n-1 , bit length E r,n-1 , and the position k of the first bit of the bit selection in the rate matching of code block #r in time unit #n based on the RV update time interval K. r,n Determine.

[0378] For example, the terminal device may determine the position k of the first bit in the bit selection for rate matching of the code block #r in time unit #n based on Algorithm 3 or the following formula: r,n Determine:

number

[0379] where m is an integer, k0 represents the offset of the first bit in the bit selection, and N cb represents the size of the code block finally stored in the circular buffer after LDPC encoding. k0 is the RV index rv id It should be understood that the RV index rv is determined jointly based on the BG and the RV index rv. id is determined based on the leading RV and RV sequence. When n is an integer multiple of K, the position k of the leading bit in the bit selection for rate matching of code block #r of time unit #n is r,n is determined by k0, i.e., specified by RV. If n is not an integer multiple of K, the position k of the first bit in the bit selection for rate matching of code block #r in time unit #n is r,n is the position k of the first bit in the bit selection for rate matching of code block #r in time unit #n-1. r,n-1 and bit length E r,n-1 is determined by.

number

[0380] Possible implementation 2:

[0381] The terminal device performs one rate matching on the code block #r to obtain the bit length E r and the RV update time interval K, the position k of the first bit in the bit selection for rate matching of code block #r in time unit #n r,n Determine.

[0382] For example, the terminal device may determine the position k of the first bit in the bit selection for rate matching of code block #r in time unit #n based on the following formula: r,n Determine m, where m is an integer.

number

[0383] It should be appreciated that in this case, the total number of REs allocated to the PUSCH in each time unit in which rate matching is performed remains consistent.

[0384] Possible implementation 3:

[0385] The terminal device selects the first bit position k in the bit selection for rate matching #n-1 of code block #r. r,n-1 , bit length E r,n-1 Based on the number of NULL bits and the RV update interval K, the position k of the first bit in the bit selection for rate matching #n of code block #r is r,n Determine.

[0386] For example, the terminal device may select the first bit position k in the bit selection for rate matching #n of code block #r based on Algorithm 4. r,n where m is an integer and K NULL ' denotes the size of the code block obtained before NULL bits are inserted, and K NULL denotes the size of the code block obtained after NULL bits are inserted, and Z c represents the LDPC extension factor, and K NULL '-2Z c represents the amount of systematic bits, and K NULL -K NULL ' represents the number of NULL bits, and N cb -(K NULL -K NULL') represents the number of non-NULL bits in the circular buffer. cb , K. NULL , K. NULL ', Z c and BG are all determined using conventional techniques.

[0387] It should be understood that if the bit selection in the current rate matching passes through a NULL bit, the starting position in the bit selection in the next rate matching is the starting position in the current rate matching plus the sequence length output through the current rate matching plus the number of NULL bits; otherwise, the starting position in the bit selection in the next rate matching is the starting position in the current rate matching plus the sequence length output through the current rate matching.

number

[0388] For example, (a) in FIG. 10 is used as an example. The first RV is RV2, K=4, N=4, K NULL =6336, K NULL '=6056,N cb =19008, Z c = 288 and only the first code block is considered, E 0,0 =E 0,2 = 960, and E 0,1 =E 0,3 = 3900. In this case, as shown in Figure 11(a), k 0,0 =0, k 0,1 =960, k 0,2 =4860, k 0,3 =6100.

[0389] Possible implementation 4:

[0390] The terminal device selects the first bit position k in the bit selection for rate matching #n-1 of code block #r. r,n-1, the bit length E output through one rate matching r The position k of the first bit in rate matching #n of code block #r is determined based on the number of NULL bits and the RV update interval K. r,n For example, this is shown in Algorithm 5. It should be appreciated that in this case, the total number of REs allocated to the PUSCH in each time unit in which rate matching is performed remains consistent.

number

[0391] For example, (b) in Figure 10 is used as an example. The first RV is RV1, the RV sequence is {0, 2, 3, 1}, N=4, K NULL =6336, K NULL '=6176,N cb =19008, and Z c = 288, and if only the first code block is considered, then E0 = 4160. In this case, as shown in Figure 11(b), k 0,0 =4896, k 0,1 =9216, k 0,2 =0, k 0,3 =4160.

[0392] The above describes possible implementation 4, and the following describes possible implementations 5 through 8.

[0393] First, we briefly explain the overall idea and main steps of possible implementations 5 to 8.

[0394] The number of time units allocated to one TBoMS transmission is N, the TBS calculation scaling factor K=N, and the RV update period is also N. It should be understood that if TBoMS repetition is not enabled, the TBoMS transmission occupies N time units, one RV is used, and the RV to be used is indicated by higher layer signaling; or if TBoMS repetition is enabled, M represents the number of TBoMS repetitions, each TBoMS repetition occupies N time units, so that M TBoMS repetitions occupy a total of M×N time units, and the RV is updated in the first time unit of each TBoMS repetition, and the update sequence is indicated by higher layer signaling.

[0395] In this case, the first bit index (or first bit position) k0 in bit selection in rate matching performed in each time unit can be determined as follows:

[0396] (1) For the first time unit of N time units in each TBoMS iteration:

[0397] k0 is determined based on RV and BG. For the specific determination method, please refer to the description corresponding to Table 2 in this application.

[0398] Optionally, if the first bit indicated by the first bit index k0 in the bit selection in the rate matching corresponding to the first time unit is a filler bit, k0 needs to be corrected to the index of the bit next to the last bit of those filler bits.

[0399] It should be understood that filler bits are not selected during bit selection. Therefore, the correction of k0 can ensure that the first bit in the bit selection for rate matching corresponding to a time unit other than the first time unit in the N time units of each TBoMS repetition obtained by using the following method is the bit next to the last bit in the bit selection for rate matching corresponding to the time unit before that time unit (note that if the next bit is a filler bit, it is also corrected to the bit next to the last filler bit). In this way, it is guaranteed that the coded bit sequences output through rate matching corresponding to two adjacent time units will not overlap in the absence of UCI multiplexing, discarding, or transmission cancellation.

[0400] For example, as shown in Figure 26, before correction, NULL '-2Z c ≦k0 <K NULL -2Z c In this case, after correction, k0=K NULL -2Z c Here, K NULL '-2Z c represents the position of the first filler bit in the circular buffer, and K NULL -2Z c represents the position of the bit following the last filler bit in the circular buffer.

[0401] (2) For any time unit other than the first time unit in the N time units of one TBoMS repetition:

[0402] The first bit index k0 in the bit selection for rate matching corresponding to the different time unit is determined by at least one of the following parameters: 1. The first bit index k0' in the bit selection for rate matching in the previous time unit; 2. Circular buffer length (period) N cbHere, the circular buffer is configured to store the code blocks obtained after LDPC encoding. 3. Number of filler bits in the circular buffer, K NULL -K NULL '; 4. First position of filler bits in the circular buffer, K NULL '-2Z c ; 5. Position K of the bit next to the last filler bit in the circular buffer NULL -2Z c ; 6. The value of G corresponding to the previous time unit; 7. The bit length E output through rate matching corresponding to the previous time unit determined in step 2 r (E r is determined by the value of G corresponding to the previous time unit); 8. The value of G corresponding to said first time unit; 9. The bit length E output through rate matching corresponding to the first time unit determined in step 2 r (determined by the value of G corresponding to the first time unit); 10. A value of G corresponding to any time unit among the N time units of the one TBoMS iteration; and 11. The bit length E output through rate matching corresponding to the arbitrary time unit among the N time units of the one TBoMS repetition determined in step 2 r (Determined by the value of G corresponding to said arbitrary time unit).

[0403] For example, when the number of code blocks is C=1, E=E r = G and r = 0. In this case, k0 can be determined directly based on the value of G. When C > 1, E r ≠G and k0 is E r It must be determined based on G≡N RE ×Q m ×N L and N RE =min(156,N RE')n prb where n prb N represents the total number of PRBs allocated. RE '=N sc RB N symb sh -N D,urP PRB -N oh PRB where N sc RB = 12 is the number of subcarriers in the frequency domain within a physical resource block, and N symb sh is the number of symbols allocated to PUSCH, L, and N DMRS PRB is the number of DM-RS REs for each PRB within the allocated duration, including the absence of data in the DM-RS CDM group, and N oh PRB is the overhead configured by the higher layer parameter xOverhead in PUSCH-ServingCellConfig; r is the code block index, r = 0, 1, ..., or C-1, n = 0, 1, ..., or N-1, and C is the number of code blocks. In particular, the number of layers N L is equal to 1. In this case, G≡N RE ×Q m is.

[0404] Below, possible implementations 5 to 8 are described separately. r Alternatively, how to determine k0 based on the value of G (i.e., C≠1 or C=1) is described separately.

[0405] Possible implementation 5:

[0406] Step (1):

[0407] Actual periodicity of bit selection N cb ' to determine.

[0408] It should be understood that: (i) In the bit selection process, the data in the circular buffer is read out sequentially. The circular buffer is cyclic (the periodicity is N cb , the bits selected through the bit selection process are also periodic. Here, the periodicity of the bits selected through the bit selection process is the actual periodicity N cb (ii) Since no filler bits are selected during the bit selection process, the actual periodicity of the bit selection is determined by the circular buffer length (periodicity) N cb is smaller than.

[0409] For example, N cb '=N cb -(K NULL -K NULL ').

[0410] Step (2):

[0411] E r and G is the real periodicity of the bit selection, N cb ' to obtain the bit sequence length denoted by L.

[0412] Ways to represent L include, but are not limited to, some examples below. L=mod(E r ,N cb -(K NULL -K NULL '));or L=mod(E r ,N cb ');or L=mod(G,N cb -(K NULL -K NULL '));or L=mod(G,N cb ').

[0413] It should be understood that the addressing scheme for a circular buffer is modulo arithmetic. Specifically, the addressing step is a function of the actual periodicity of the bit selection, N. cbIf the address is an integer multiple of ', the starting address of two consecutive addressings remains unchanged. Modulo arithmetic is r Alternatively, G can be understood as being divided into two parts. The bit sequence length corresponding to the first part is N cb ' is less than 0 ≤ L <N cb The bit sequence length corresponding to the other part is N cb ε times ', where ε is an integer and ε≧0. Therefore, E r =N cb '×ε+L or G=N cb '×ε+L.

[0414] Step (3):

[0415] The first bit index of a time unit other than the first time unit among the N time units of one TBoMS repetition, assuming there are no filler bits.

number

[0416] Some ways to represent k0 include, but are not limited to, the following examples:

number

[0417] Step (4):

[0418] Determine the first bit index k0 of time unit #n based on k0', k0 and the position of the filler bit in the circular buffer.

[0419] First, based on k0', k0 and the position of the filler bit in the circular buffer, it is determined whether to use the filler bit to perform a bit selection process with a bit selection length of L. Below, several different cases are described separately.

[0420] 1. If the bit sequence −1 is filled with filler bits, ￣k0 is adjusted based on the number of filler bits KNULL-KNULL', i.e.

number

[0421] For example, as shown in FIG. 27(a),

number

number

[0422] In another example, as shown in FIG. 27(b),

number

number

[0423] 2. If the bit sequence −1 is not filled with filler bits, k0 is obtained based on ￣k0.

[0424] For example, as shown in Figure 27(c),

number

number

[0425] As another example, as shown in FIG. 27(d),

number

number

[0426] Optionally, if the leading bit indicated by k0 is a filler bit, then K NULL '-2Z c ≦k0 <K NULL -2Z c In this case, ￣k0 is K NULL -2Z c and corrected based on k0' to obtain k0. For example,

number

[0427] Below are given some examples of possible implementations 5.

number

[0428] Possible implementation 6:

[0429] A first counter j and a second counter k are set to 0. It should be understood that the first counter is configured to determine a leading bit k0 in another time unit other than the first time unit among the N time units of the one TBoMS iteration, and the second counter is configured to count the number of selected coded bits.

[0430] The encoded bits stored in the circular buffer are rAlternatively, the first bit index k0 of the current time unit is determined by sequentially tracing G and the first bit index k0' of the time unit preceding the current time unit.

[0431] Step 1: The index is mod(k0'+j,N cb ) from the circular buffer.

[0432] Step 2: If the read bit is not a filler bit, add 1 to the second counter, i.e., k=k+1; otherwise, keep the second counter unchanged and skip this step.

[0433] Step 3: Add 1 to the first counter, i.e., j=j+1.

[0434] Step 4: The second counter k is E r or G; if so, continue back to step 1; if not, perform step 5.

[0435] Step 5: The first bit index of the current time unit is mod(k0'+j,N cb ) is determined.

[0436] Below we describe two possible algorithms.

number

[0437] d represents the code block obtained after LDPC encoding, which is stored in a circular buffer.

[0438] Possible implementation 7:

[0439] The first bit index k0 of another time unit other than the first time unit among the N time units of the one TBoMS repetition is E rOr it is determined based on G and the first bit index k0' of the previous time unit.

[0440] Example 1: The spacing between k0' and k0 is E r Or G. For example, k0=mod(k0'+E r ,N cb ) or k0=mod(k0'+G,N cb )

[0441] Example 2:k r,n =mod(k0+n ×E r ,N cb ) or k r,n =mod(k0+n×G,N cb ), where n=1, 2, ..., N-1. In Example 2, k0 represents the first bit index in bit selection in rate matching corresponding to the first time unit (time unit #0) of the N time units of one TBoMS repetition, and is determined based on RV and BG; k r,n denotes the leading bit index in the bit selection for rate matching corresponding to time unit #n of the rth code block (time unit #n, n = 1, 2, ..., N-1), where r is the code block index, r = 0, 1, ..., or C-1, n = 0, 1, ..., or N-1, and C is the number of code blocks.

[0442] Possible implementation 8:

[0443] k r,n is k0 and E r or G, where n=1, 2, ..., N-1, and n represents a time unit index. k0 represents the first bit index in bit selection in rate matching corresponding to the first time unit (time unit #0) of the N time units of one TBoMS repetition, and is determined based on RV and BG; k r,ndenotes the leading bit index in the bit selection for rate matching corresponding to time unit #n of the rth code block (time unit #n, n = 1, 2, ..., N-1), where r is the code block index, r = 0, 1, ..., or C-1, n = 0, 1, ..., or N-1, and C is the number of code blocks.

[0444] Step A:

[0445] Calculate the sum of the bit selection lengths in all time units prior to the time unit corresponding to time unit #n, i.e., the sum of the bit selection lengths in rate matching corresponding to a total of n time units from time unit #0 to time unit #n-1.

[0446] For example, if the bit selection length in all time units is equal, i.e., E r Or, assuming G, the sum of the bit selection lengths in rate matching corresponding to a total of n time units from time unit #0 to time unit #n-1 is n × E r Or n×G.

[0447] Step B:

[0448] Actual periodicity of bit selection N cb ' to determine.

[0449] For example, N cb '=N cb -(K NULL -K NULL ').

[0450] Step C:

[0451] n×E r and n×G, L n The actual periodicity of the bit selection, denoted as N cb ' to map to '.

[0452] L n Some ways to express this include, but are not limited to, the following: L n =mod(n×E r ,N cb -(K NULL -K NULL '));or L n =mod(n×E r ,N cb ');or L n =mod(n×G,N cb -(K NULL -K NULL '));or L n =mod(n×G,N cb ').

[0453] Step D:

[0454] Assuming there are no filler bits, the first bit index ￣k of time unit #n n (intermediate variable) to L n and k0.

[0455] ￣k n Some ways to express include, but are not limited to, the following examples:

number

[0456] Step E:

[0457] First bit index k of time unit #n r,n is determined based on k0', ̂ k0 and the position of the filler bit in the circular buffer.

[0458] First, based on k0', ̂ k0, and the position of the filler bit in the circular buffer, the bit selection length is determined using the filler bit. n It is determined whether the bit selection process is performed, where .times. ...

[0459] 1. Bit selection length is L n If the bit selection process is performed using filler bits, then ￣k n is the number of filler bits, K NULL -K NULL ' is amended based on the

number

[0460] for example,

number

number

[0461] As another example,

number

number

[0462] 2. Bit selection length is L n If the bit selection process is performed without filler bits, then ￣k n Based on k r,n get.

[0463] for example,

number

number

[0464] As another example,

number

number

[0465] Optionally, k r,n If the leading bit indicated by is a filler bit, K NULL '-2Z c ≦k r,n <K NULL -2Z c In this case, ￣k n is K NULL -2Z c and k0, and k r,n For example,

number

[0466] Below are given some example algorithms of possible implementations 8.

number

[0467] Possible implementation 9:

[0468] Algorithm 4 in Possible Implementation 3 is improved.

number

[0469] It should be understood that the first bit index indicated by RV may fall into a filler bit, in which case the first bit should be the bit following the last filler bit.

[0470] 10 possible implementations:

[0471] Algorithm 5 in Possible Implementation 4 is improved.

number

[0472] It should be understood that the first bit index indicated by RV may correspond to a filler bit, in which case the first bit should be the bit following the last filler bit.

[0473] Possible implementation 11:

[0474] The difference between Algorithm 10-a and Algorithm 10-d is that they use different G(G n ) algorithm 10-a or 10-c may be used, and for slots with the same G algorithm 10-b or 10-d may be used.

number

[0475] For Algorithm 10-a or 10-c, the leading bit k in the bit selection for rate matching in slot #n and code block #r r,n is the bit selection length E for rate matching in slot #n-1 and code block #r. r,n-1It should be understood that the bit next to the ending bit in the bit selection with . Note that the bit selection here is only used to determine the starting bit, not the length of the bit sequence output through the bit selection. The length of the bit sequence output through the bit selection is determined by the bit selection length used in step 4.

number

[0476] Another embodiment of the present application provides an uplink transmission method, including:

[0477] The terminal device receives first indication information from the network device, where the first indication information instructs the terminal device to transmit a first transport block in a plurality of time units.

[0478] The terminal device receives second instruction information from the network device, where the second instruction information instructs the terminal device to transmit uplink control information UCI in a first time unit, the first time unit being one of the plurality of time units.

[0479] The terminal device determines a position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and UCI in one time unit, G being a positive integer, and the second time unit being one of the plurality of time units.

[0480] The terminal device transmits the UCI and the first transport block to the network device in the plurality of time units.

[0481] The difference between this embodiment and the embodiment of Fig. 8 is that the second time unit is one of multiple time units. For example, the second time unit is the time unit next to the first time unit, or the second time unit is the first time unit of the multiple time units, or the second time unit is any one of the multiple time units. For other related content of this embodiment, please refer to the description in the previous embodiment. The details will not be described again in this specification.

[0482] In one implementation, the multiple time units correspond to equal parameter G.

[0483] In one implementation, the terminal device determining a position in a circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to the first time unit includes: the parameter G corresponding to the first time unit and the actual periodicity N of the bit selection cb ', determining the position in the circular buffer of the first bit in the first coded bit sequence.

[0484] For example, the first leading bit index k r,n ' is the parameter G corresponding to the first time unit and the actual periodicity N of the bit selection. cb ' and is determined based on.

[0485] the position k in the circular buffer of the first bit in the first coded bit sequence r,n where the first leading bit index k r,n ' is determined based on the

[0486] With reference to a specific example, the first leading bit index k r,n ' and the position k in the circular buffer of the first bit in the first coded bit sequence. r,n Describe the decision.

[0487] The number of time units allocated to one TBoMS transmission is N, the TBS calculation scaling factor K is equal to N, and the RV update period is also N. It should be understood that if TBoMS repetition is not enabled, the TBoMS transmission occupies N time units, one RV is used, and the RV to be used is indicated by higher layer signaling; or if TBoMS repetition is enabled, M represents the number of TBoMS repetitions, each TBoMS repetition occupies N time units, and thus M TBoMS repetitions occupy a total of M×N time units, and the RV is updated in the first time unit of each TBoMS repetition, and the update sequence is indicated by higher layer signaling.

[0488] In this case, the first bit index (or first bit position) k in the bit selection for rate matching performed in each time unit of one TBoMS iteration is r,n may be determined as follows: n represents a time unit index, n = 0, 1, ..., N-1, r represents a code block index, r = 0, 1, ..., C-1, and C represents the number of code blocks.

[0489] (1) Actual periodicity of bit selection N cb ' to determine.

[0490] It should be understood that: (i) In the bit selection process, the data in the circular buffer are read out one by one sequentially. The circular buffer is periodic (the periodicity is N cb ), the bits selected through the bit selection process are also periodic. Here, the periodicity of the bits selected through the bit selection process is the actual periodicity N cb (ii) Since no filler bits are selected during the bit selection process, the actual periodicity of the bit selection is determined by the circular buffer length (periodicity) N cb is smaller than.

[0491] For example, N cb '=N cb -(K NULL -KNULL '). K NULL -K NULL ' represents the number of filler bits in the circular buffer.

[0492] (2) For the first time unit of N time units in one TBoMS iteration:

[0493] The first bit index k0 is determined based on the RV and BG. For the specific determination method, please refer to the description corresponding to Table 2 in this application.

[0494] The first bit index k0 is corrected, and the corrected first bit index is k r,0 An example is as follows:

[0495] The first bit indicated by the first bit index k0 is a systematic bit, i.e., 0≦k0 before correction. <K NULL '^2Z c If k, no correction is necessary. r,0 '=k0, where K NULL '-2Z c represents the index of the first filler bit in the circular buffer.

[0496] The first bit k0 indicated by the first bit index k0 is a filler bit, i.e., before correction, K NULL '-2Z c ≦k0 <K NULL -2Z c If so, after correction, k r,0 '=K NULL '-2Z c where K NULL -2Z c represents the index of the first parity bit in the circular buffer.

[0497] The first bit indicated by the first bit index k0 is the parity bit, i.e., K NULL -2Z c ≦k0 <N cb If k is corrected, r,0 '=k0-(K NULL -K NULL ').

[0498] The above example may alternatively be written in the form of Algorithm 11-a.

number

[0499] The first bit index k0 is a cb where k denotes the position of the coded bit in the circular buffer, and the first bit index k r,0 ' is a string of length N cb ' denotes the position of the coded bit in the circular buffer, k0 and k r,0 ' indicates the same coded bits. cb ' is a circular buffer of length N cb is obtained after subtracting the filler bit sequence from a circular buffer of length N cb The circular buffer in is imaginary and is only used to understand the implementation.

[0500] For example, if the length is N cb The coded bit sequence stored in the circular buffer is shown in Figure 28(a), where the systematic bit indexes range from 0 to K. NULL '-2Z c -1 and filler bit index is K NULL '-2Z c From K NULL -2Z c -1 and parity bit index is K NULL -2Z c From N cb -1. The length is N cbThe coded bit sequence stored in the circular buffer is shown in Figure 28(b), where the systematic bit indexes are from 0 to K. NULL '-2Z c -1 and parity bit index is K NULL '-2Z c From N cb '-1. Index 0 to K in Figure 28(a) NULL '-2Z c The coded bit sequence corresponding to -1 is the index 0 to K in Figure 28(b). NULL '-2Z c The coded bit sequence is the same as that corresponding to index K in Figure 28(a). NULL -2Z c From N cb The coded bit sequence corresponding to -1 is the index K in Figure 28(b). NULL '-2Z c From N c b'--Identical to the coded bit sequence corresponding to 1.

[0501] (3) For any time unit other than the first time unit among the N time units of one TBoMS repetition:

[0502] the first bit index k in the bit selection for rate matching corresponding to the other time unit r,n ' is determined by at least one of the following parameters, where n=1, 2, …, N-1: The first bit index k in the bit selection for rate matching in the first time unit r,0 '; Actual periodicity of bit selection N cb '; The value of G corresponding to the previous time unit; The bit length E output through rate matching corresponding to the previous time unit determined in step 2 r (E r is determined by the value of G corresponding to the previous time unit); a value of G corresponding to said first time unit; The bit length E output through rate matching corresponding to the first time unit determined in step 2 r (determined by the value of G corresponding to the first time unit); a value of G corresponding to any time unit among the N time units of the one TBoMS iteration; and The bit length N output through rate matching corresponding to the arbitrary time unit among the N time units of one TBoMS repetition determined in step 2. cb (Determined by the value of G corresponding to said arbitrary time unit).

[0503] k r,n ' is a string of length N cb It should be understood that ' is the position of the coded bit in the circular buffer.

[0504] For example, if the number of code blocks is C=1, then E=E r = G, and r = 0. In this case k r,n ' can be determined directly by the value of G. If C>1, then E r ≠G and k r,n ' is E r It must be determined based on G≡N RE ×Q m ×N L , and N RE =min(156,N RE ')n PRB where n PRB represents the total number of allocated PRBs; N RE '=N sc RB N symb sh -N DMRS PRB -N oh PRB where N sc RB = 12 is the number of subcarriers in the frequency domain within a physical resource block, and N symb shis the number of symbols allocated to the PUSCH, L, and N DMRS PRB is the number of DM-RS REs for each PRB within the allocated duration, including the absence of data in the DM-RS CDM group, and N oh PRB is the overhead configured by the higher layer parameter xOverhead in PUSCH-ServingCellConfig; r is the code block index, r = 0, 1, ..., C-1, and n = 1, 2, ..., N-1, where C is the number of code blocks. Specifically, for the number of layers N L is equal to 1. In this case, G≡N RE ×Q m is.

[0505] The specific steps are as follows:

[0506] Step A:

[0507] Calculate the sum of the bit selection lengths in all time units prior to the time unit corresponding to time unit #n, i.e., the sum of the bit selection lengths in rate matching corresponding to a total of n time units from time unit #0 to time unit #1.

[0508] For example, if the bit selection length in all time units is equal, i.e., E r or G, the sum of the bit selection lengths in rate matching corresponding to a total of n time units from time unit #0 to time unit #n-1 is n × E r Or n×G.

[0509] Step B:

[0510] n×E r or n × G, and k r,0 'Based on the bit selection in rate matching corresponding to time unit #n, length is N cb ' the index k of the first bit in the circular buffer r,n ' to determine.

[0511] For example, k r,n '=mod(k r,0 '+n×G,N cb '), or k r,n '=mod(k r,0 '+n×E r ,N c b'), where mod represents the modulo operation.

[0512] It should be understood that the addressing scheme of the circular buffer is modulo arithmetic.

[0513] (4) First bit index k r,n The first bit index k r,n ', where n=0, 1, ..., N-1, and an example is as follows:

[0514] First bit index k r,n The leading bit denoted by ' is the systematic bit, i.e., 0 ≤ k before correction. r,n ' <K NULL '-2Z c If k, no correction is necessary. r,n =k r,n ' is.

[0515] First bit index k r,n The leading bit indicated by ' is the parity bit, i.e., before correction, K NULL '-2Z c ≦k r,n ' <N cb ', then after correction, k r,n =k r,n '+(K NULL -K NULL ').

[0516] First bit index k r,n ' is a string of length N cb ' indicates the position of the coded bit in the circular buffer. Therefore, the first bit index is acb is the indicated position of the coded bit in the circular buffer, i.e., the first bit index k r,n Since filler bits are inserted between the systematic bits and the parity bits, the leading bit index k r,n The leading bit indicated by ' is the parity bit, and the leading bit index k r,n The number of filler bits in counting is K. NULL -K NULL ' needs to be taken into consideration.

[0517] The above example may alternatively be written in the form of Algorithm 11-b.

number

[0518] Optionally, the first bit index k in the bit selection for rate matching corresponding to time unit #0 r,0 Regarding k0, the following is true: r,0 = k0 can be determined directly. (The first bit index k in the selection in the rate matching corresponding to the other time unit is r,n is still determined based on Algorithm 11-b, where n=1, 2, …, N-1).

[0519] Step 4: The terminal device performs bit selection based on the first bit position and the bit length to determine the output bit sequence.

[0520] The terminal device performs bit selection based on the first bit position and the bit length to determine a first coded bit sequence.

[0521] Optionally, the terminal device may select a first bit position k in the bit selection for rate matching of the code block #r in the time unit #n. r,nand the bit length E output through rate matching of code block #r in time unit #n. r,n Determine the first coded bit sequence based on

[0014] For example, as shown in Algorithm 6, d represents the code blocks stored in the circular buffer, and e represents the first coded bit sequence.

number

[0522] Alternatively, in the above step, E r,n is E r may be replaced by d kr,n may be replaced by dk.

[0523] Alternatively, in the above step, E r,n is E r ' may be replaced by d kr,n may be replaced by dk.

[0524] Alternatively, in the above step, E r,n is E r,n may be replaced with '.

[0525] In the previous step, r,n and E r,n are E r , E r ' and E r,n ' respectively correspond to different solutions in Step 2 and Step 3. The details are as follows.

[0526] In step 2, the length of the bit sequence output through rate matching is calculated based on the parameter G in the uplink transmission method, and E r In step 3, the starting point of the bit sequence output through rate matching is E r In step 4, the first bit position and bit length E rA bit selection is performed based on the , to determine the output bit sequence.

[0527] Alternatively, in step 2, the bit length output through rate matching of code block #r in time unit #n is determined to be equal to the total number of coded bits G for transmission of TB in time unit #n. n is determined based on E r,n In step 3, the starting point of the bit sequence output through rate matching in time unit #n is E r,n In step 4, the first bit position and bit length E r,n A bit selection is performed based on the , to determine the output bit sequence.

[0528] Alternatively, in step 2, the length of the bit sequence output through rate matching is r In step 3, the length of the bit sequence output through rate matching is calculated based on the parameter G in the uplink transmission method, and E r The starting point of the bit sequence output through rate matching is E r In step 4, the first bit position and bit length E r ', a bit selection is performed to determine the output bit sequence.

[0529] Alternatively, in step 2, the bit length output through rate matching of code block #r in time unit #n is determined to be equal to the total number of coded bits G for transmission of TB in time unit #n. n ' is determined based on E r,n In step 3, the length of the bit sequence output through rate matching is determined by the parameter G n It is calculated based on E r,nThe starting point of the bit sequence output through rate matching in time unit #n is E r,n In step 4, the first bit position and bit length E r,n ', a bit selection is performed to determine the output bit sequence.

[0530] Optionally, the terminal device may select a first bit position k0 in bit selection for rate matching of the code block #r in the time unit #n, and a bit length E r,n Determine the first coded bit sequence based on d, where d represents the code block stored in the circular buffer and e represents the first coded bit sequence, as shown in Algorithm 6-a.

number

[0531] In Example 1 of Possible Implementation 5 and Possible Implementation 6 in Step 3 and Possible Implementation 7, the terminal device obtains the first bit position k0 in the bit selection in the rate matching of code block #r in time unit #n. E represents the bit selection length in the bit selection in the rate matching of code block #r in time unit #n, i.e., E r,n , E r , E r ' or E r,n ' is.

[0532] Optionally, in the various solutions mentioned above, the first bit index (or first bit position) k0 and the bit selection length E in the bit selection for the rate matching performed in each time unit are used. r Both are determined by G. The length is E r Further processing may be performed on the output bit sequence (e.g., the solution described below of truncating the output bit sequence), and then subsequent processing such as bit interleaving may be performed.

[0533] The number of time units allocated to one TBoMS transmission is N, the TBS calculation scaling factor K=N, and the RV update period is also N. It should be understood that if TBoMS repetition is not enabled, a TBoMS transmission occupies N time units, one RV is used, and the RV to be used is indicated by higher layer signaling; or if TBoMS repetition is enabled, M represents the number of TBoMS repetitions, each TBoMS repetition occupies N time units, and thus M TBoMS repetitions occupy a total of M×N time units, and the RV is updated in the first time unit of each TBoMS repetition, and the update sequence is indicated by higher layer signaling.

[0534] Step 1:

[0535] The first bit index of the time unit before the target time unit is k0', and the bit selection length is E r or G. For example, if the number of code blocks is C=1, then E=E r = G and r = 0. In this case, k0 can be determined directly based on the value of G. If C > 1, then E r ≠G and k0 is E r Specifically, the number of layers N L is equal to 1. In this case, G≡N RE ×Q m is.

[0536] Step 2:

[0537] k0' and E r Alternatively, perform a bit selection process based on G, where the first bit index k0 of the target time unit is the bit next to the last bit in the bit selection in the previous time unit.

[0538] Step 3:

[0539] E r' or G', the bit sequence selected in the previous time unit is truncated to the first E in the bit sequence. r ' or G bits and perform subsequent processing such as bit interleaving on the truncated bit sequence.

[0540] For example, the bit sequence output through bit selection is e0, e1, …, e Er-1 (or e0, e1, …, e G-1 ), and the truncated bit sequence is e0,e1,…,e Er'-1 (or e0, e1, …, e G'-1 ), and then subsequent operations such as bit interleaving are performed on the truncated bit sequence e0,e1,…,e Er'-1 is executed against.

[0541] Step 5: The terminal device sequentially performs bit interleaving and code block concatenation based on the first coded bit sequence, and outputs a UL-SCH.

[0542] Optionally, the terminal device further generates UCI based on the scheduling information.

[0543] It should be understood that the terminal device performs this step only when it receives signaling indicating that the terminal device carries UCI on the PUSCH.

[0544] S203: The terminal device generates a PUSCH based on at least the UL-SCH, and transmits the PUSCH to the network device.

[0545] In possible case 1, the terminal device generates a PUSCH based on the UL-SCH. In this case, it should be understood that the terminal device only detects signaling to transmit a PUSCH, and the network device does not transmit signaling instructing the terminal device to include UCI on the PUSCH; or, the network device transmits signaling instructing the terminal device to include UCI on the PUSCH, but the terminal device misses signaling detection.

[0546] For example, as shown in FIG. 12(a), in this case the bit sequences in the circular buffer are carried sequentially by the PUSCH.

[0547] In possible case 2, the terminal device multiplexes UCI onto the UL-SCH to generate a PUSCH.

[0548] In this case, it should be understood that the terminal device detects signaling sent by the network device instructing the terminal device to transmit a PUSCH and to carry UCI on the PUSCH.

[0549] In one example, the terminal device may select E r When calculating the length of the bit sequence output through rate matching using ', it is assumed that UCI is multiplexed into the second slot of PUSCH and the terminal device performs rate matching in the second uplink slot. The starting point for bit selection in rate matching is the E r The bit length output through rate matching in the previous uplink slot is determined based on G, that is, E r' is. In this case, as shown in FIG. 12(b), the total amount of encoded bits of UCI needs to be subtracted from G', and G' < G. Therefore, the leading bit in bit selection in rate matching in the third uplink slot is after the ending bit in bit selection in the second uplink slot in the cyclic buffer, and there is a gap between these two bits. Obviously, the gap is caused by UCI occupying the REs assigned to PUSCH.

[0550] In another example, when the terminal device uses E at step 2 in S202 to calculate the length of the bit sequence output through rate matching, UCI is multiplexed in the second slot of PUSCH, and the terminal device performs rate matching in the second uplink slot. The starting point in bit selection in rate matching is determined based on E in rate matching in the previous uplink slot, that is, determined based on G, and the bit length output through rate matching in the previous uplink slot is also determined based on G. In this case, as shown in FIG. 12(a), the leading bit in bit selection in rate matching in the third uplink slot is the next bit after the ending bit in bit selection in the second uplink slot in the cyclic buffer. r to calculate the length of the bit sequence output through rate matching, UCI is multiplexed in the second slot of PUSCH, and the terminal device performs rate matching in the second uplink slot. The starting point in bit selection in rate matching is determined based on E in rate matching in the previous uplink slot, that is, determined based on G, and the bit length output through rate matching in the previous uplink slot is also determined based on G. r It should be understood that through the comparison between (a) and (b) of FIG. 12, regardless of whether UCI is multiplexed on PUSCH, the starting point in bit selection in each rate matching remains consistent, that is, the starting point is independent of UCI multiplexing.

[0551] Through the comparison between (a) and (b) of FIG. 12, it should be understood that regardless of whether UCI is multiplexed on PUSCH, the starting point in bit selection in each rate matching remains consistent, that is, the starting point is independent of UCI multiplexing.

[0552] S204: The network device determines the UL-SCH based on the PUSCH.

[0553] Specifically, the network device determines the bit sequence length and the first bit position to be output through rate matching by using the same method as that used by the terminal device in S202, and determines the position of the UL-SCH in the circular buffer.

[0554] It will be appreciated that the network device and the terminal device use the same determination method, so that it can be ensured that the network device and the terminal device have a consistent understanding of the location of the UL-SCH within the PUSCH, thereby ensuring that the UL-SCH is parsed correctly.

[0555] For example, if the network device indicates that UCI is multiplexed with UL-SCH by using signaling, but the terminal device does not detect the signaling, the terminal device transmits a PUSCH as shown in (a) of Figure 12, and the network device determines the UL-SCH and UCI as shown in (b) of Figure 12. Because the network device and the terminal device use the same method to predetermine the first bit of the UL-SCH in the circular buffer and the UCI is not excluded when calculating G, the network device can completely parse all bits carried in the third slot.

[0556] In this embodiment of the present application, the network device instructs the terminal device to carry the indication information of UCI in the first time unit. When the terminal device detects or does not detect the instruction, the total amount of the encoded bits of UCI is not subtracted from the parameter G used by the network device and the terminal device to determine the position of the leading bit in the encoded bit sequence output through rate matching in the second time unit (the next time unit after the first time unit). Therefore, starting from the second time unit, the network device and the terminal device can align the position of the leading bit in the cyclic buffer in the bit selection in each rate matching. This increases the decoding success rate.

[0557] As mentioned in the signaling design of the scheduling information in S201, when the scaling factor K is equal to the number N of slots, it can be understood that the network device does not support TBoMS iterations in the N slots, and the number of the slots represents only the number of slots allocated for one TBoMS transmission; or when K < N, the number of slots represents the total number of slots including the transmission of TBoMS iterations, K represents the number of slots for one TBoMS transmission, and it should be noted that when N / K is an integer, the number of TBoMS iterations is N / K. In step 3 of S202, in algorithms 3, 4, and 5 in possible implementations 1, 3, and 4, n = mK is used as a decision condition, where n is the number of rate matching times and m is an integer. When this condition is satisfied, k r,n = k0, and the leading bit position k in the bit selection in the rate matching of the code block #r in the time unit n r,n is determined by k0, that is, specified by RV. When K = N, n = 0 can be used as a special case of n = mK. In this case, k0 is indicated by RV. When 1 < K < N and N / K is an integer, k m is indicated by RV, where m = N / K.

[0558] Optionally, the method 200 further includes:

[0559] It should be understood that the network device transmits UCI and instructs the terminal device to multiplex the UCI in the b-th slot, but it is assumed that the terminal device does not detect the PDCCH. In the above solution, the network device and the terminal device can align the leading bits in the bit sequences output through rate matching in all slots after the b-th slot. Method 200 can further optimize the resource mapping method in the b-th slot.

[0560] In the prior art, when UCI is multiplexed onto some time-frequency resources in a b-th slot, the bits of data information originally carried on the some time-frequency resources are postponed backward. When a terminal device misses PDCCH detection, all bits transmitted by the terminal device in the b-th slot are bits of the data information. In this case, the network device considers that the some time-frequency resources carry UCI and that time-frequency resources other than the some time-frequency resources in the b-th slot are bits of the data information. As a result, the network device cannot correctly detect the UL-SCH in the current slot.

[0561] In S202, when the length of the bit sequence output through rate matching is calculated based on G in step 2 and the position of the first bit in the bit sequence output through rate matching in the circular buffer is calculated based on G in step 3, the terminal device maps the second coded bit sequence to time-frequency resources in the first time unit, where the second coded bit sequence is the coded bit sequence output through rate matching in the first time unit, and the number of bits in the second coded bit sequence is equal to the parameter G corresponding to the first time unit. The terminal device maps UCI to some time-frequency resources in the first time unit to replace some bit sequences in the first coded bit sequence carried in the some time-frequency resources.

[0562] It should be understood that when data bits are mapped to a time unit (a slot is used as an example in this embodiment of the present application), the UL-SCH is first mapped to all REs in the time unit, and then the UCI is mapped to the corresponding resources in a puncturing manner. In this way, the UCI replaces resources carried on some REs in the time unit. In other words, the time-frequency resources occupied by data bits other than those replaced by the UCI in the time unit remain unchanged.

[0563] In this embodiment of the present application, in the above solution, the UCI is multiplexed in a puncturing manner in the first time unit, so that the bit sequence contained in the first transport block and carried on time-frequency resources other than the time-frequency resource occupied by the UCI in the first time unit remains unchanged, which improves the decoding success rate and accuracy of the network device.

[0564] In a second possible implementation, the terminal device calculates the position of the first bit in the bit sequence output through rate matching in time unit #n based on aG corresponding to time unit #n-1, and calculates the length of the bit sequence output through rate matching in time unit #n based on G or G'. If the number of OFDM symbols included in all time units is different, the time units correspond to different Gs. If the number of OFDM symbols included in all time units is the same, the time units correspond to the same G.

[0565] For details of S201', please refer to the description of S201 in the first possible implementation.

[0566] For details of S202', please refer to the description of S202 in the first possible implementation. The differences are as follows:

[0567] Parameter a is introduced, where 0 < a ≤ 1, and the product aG or [aG] of a and G is used to replace G in a first possible implementation to calculate the position of the leading bit in the cyclic buffer of the bit sequence output through rate matching. Here, [] represents rounding up, rounding down, or rounding to the nearest integer. For example, a can be indicated by RRC signaling and DCI signaling. For example, the parameter used to indicate a in RRC signaling may be one field added to the TDRA table, and the parameter used to indicate a in DCI may be a newly added field. The width of the newly added field in RRC or DCI, for example, 3 bits, 4 bits, or 5 bits, may each represent 8 / 16 / 32 possible values. For example, the possible values of a may be a subset in the set {0.1x, 0.2x, 0.01x}. 2 bits indicate that the size of the subset is 4, 3 bits indicate that the size of the subset is 8, 4 bits indicate that the size of the subset is 16, 5 bits indicate that the size of the subset is 32, and 6 bits indicate that the size of the subset is 64.

[0568] Alternatively, parameter G may be further introduced. In a second possible implementation, G - b is used to replace aG or [aG] to implement this method.

[0569] In the following, S202 is described using aG as an example.

[0570] Specifically, in step 2, the length of the bit sequence output through rate matching is calculated based on parameter G in the uplink transmission method provided in this application, as denoted by E r and is written as such. In step 3, E r " is calculated based on aG, and the starting point of the bit sequence output through rate matching is E rAlternatively, in step 2, the length Er' of the bit sequence output through rate matching is calculated based on the parameter G' in the prior art, and E r " is calculated based on aG, and the starting point of the bit sequence output through rate matching is E r " is determined based on the

[0571] E r When " is calculated based on aG, G in S202 in the first possible implementation is replaced by aG, and then substituted into a specific algorithm to obtain E r " is obtained, and in the subsequent steps of the calculation, E r E r " is replaced.

[0572] Alternatively, to implement the above solution, aG n may be replaced by E r is E r " is replaced.

[0573] S203': The terminal device generates a PUSCH based on at least the UL-SCH, and sends the PUSCH to the network device.

[0574] In possible case 1, the terminal device generates a PUSCH based on the UL-SCH. In this case, it should be understood that the terminal device only detects signaling to transmit a PUSCH, and the network device does not transmit signaling instructing the terminal device to include UCI on the PUSCH; or the network device transmits signaling instructing the terminal device to include UCI on the PUSCH, but the terminal device misses the signaling detection.

[0575] For example, as shown in Figure 13(a), in this case, the bit sequences in the circular buffer are sequentially carried by the PUSCH. Comparing Figure 12(a) and Figure 13(a), it can be seen that the position of the first bit in the bit sequence output through each rate matching is more advanced in Figure 13(a) than in Figure 12(a).

[0576] In possible case 2, the terminal device multiplexes UCI onto the UL-SCH to generate a PUSCH.

[0577] In this case, it should be understood that the terminal device detects signaling sent by the network device instructing the terminal device to send a PUSCH and to carry UCI on the PUSCH.

[0578] In one example, the terminal device may select E r When calculating the length of the bit sequence output through rate matching using ', it is assumed that UCI is multiplexed into the second slot of PUSCH and the terminal device performs rate matching in the second slot. The starting point for bit selection in rate matching is the E r The bit length output through rate matching in the previous uplink slot is determined based on G', that is, aG'. r' is. In this case, the total amount of UCI encoded bits needs to be subtracted from G', and G' may be smaller than aG or larger than aG. Therefore, when G' < aG, the leading bit in bit selection in rate matching in the third uplink slot can still be after the ending bit in the second bit selection in the cyclic buffer. As shown in FIG. 13(b), there is still a gap between these two bits. However, compared with FIG. 12(b), in FIG. 13(b), the position of the leading bit in the bit sequence output through each rate matching is advanced, and the gap between the leading bit in the bit sequence output through the third rate matching and the ending bit in the bit sequence output through the second rate matching is also smaller. Alternatively, when G' > aG, the leading bit in bit selection in the third rate matching may be the next bit after the ending bit in the second bit selection in the cyclic buffer. As shown in FIG. 13(a), there is no gap between the leading bit in bit selection in the third rate matching and the ending bit in the second bit selection, and in FIG. 13(a), compared with FIG. 12(a), the position of the leading bit in the bit sequence output through each rate matching has advanced.

[0579] In another example, when the terminal device calculates the length of the bit sequence output through rate matching using E in step 2 at S202', the UCI is multiplexed in the second slot of the PUSCH, and the terminal device performs rate matching in the second uplink slot. The starting point in bit selection in rate matching is E in rate matching in the previous uplink slot r in. rDetermined based on "aG", that is, determined based on aG, the bit length output through rate matching in the previous uplink slot is determined based on G, and aG < G. In this case, as shown in FIG. 13(a), the leading bit in the bit selection in the rate matching in the third uplink slot is the bit next to the ending bit in the bit selection in the second uplink slot in the cyclic buffer, and the position of the leading bit in the bit sequence output through each rate matching in FIG. 13(a) is further advanced than in the case of FIG. 12(a).

[0580] Through the comparison between (a) and (b) of FIG. 13, it should be understood that regardless of whether UCI is multiplexed on PUSCH, the starting point in the bit selection in each rate matching remains consistent, that is, the starting point is independent of UCI multiplexing.

[0581] In this embodiment of the present application, G is multiplied by a that is greater than 0 and less than 1, whereby the network device can pre-calculate the position of the leading bit in the first encoded bit sequence within the cyclic buffer. This shortens the gap between the ending bit in the second encoded bit sequence and the leading bit in the first encoded bit sequence, and improves the channel quality.

[0582] As mentioned in the signaling design of the scheduling information in S201', when the scaling factor K is equal to the number N of slots, it can be understood that the network device does not support TBoMS iterations, and the number of slots represents only the number of slots allocated for one TBoMS transmission; or, when K < N, the network device supports TBoMS iterations, the number of slots represents the total number of slots including the transmission of TBoMS iterations, K represents the number of slots for one TBoMS transmission, and it should be noted that when N / K is an integer, the number of TBoMS iterations is N / K. In step 3 in S202', in algorithms 3, 4, and 5 in possible implementations 1, 3, and 4, n = mK is used as a decision condition, where n is the number of rate matching times and m is an integer. When this condition is met, k r,0 = k0, and the leading bit position k in the bit selection in the rate matching of the code block #r at the time unit #n r,n is determined by k0, that is, specified by the RV. When K = N, n = 0 can be used as a special case where n = mK. In this case, k0 is indicated by the RV. When 1 < K < N and N / K is an integer, k m is indicated by the RV, where m = N / K.

[0583] Optionally, method 200 further includes the following.

[0584] It should be understood that the network device sends UCI to the terminal device and instructs it to multiplex the UCI in the b-th slot, assuming that the terminal device does not detect the PDCCH. In the above solution, the network device and the terminal device can align the leading bits in the bit sequences output through rate matching in all slots after the b-th slot. Method 200 can further optimize the resource mapping method in the b-th slot.

[0585] In the prior art, when UCI is multiplexed onto some time-frequency resources in the b-th slot, the bits of data information originally carried on the some time-frequency resources are postponed backward. When a terminal device misses PDCCH detection, all bits transmitted by the terminal device in the b-th slot are bits of the data information. In this case, the network device considers that the some time-frequency resources carry UCI and that time-frequency resources other than the some time-frequency resources in the b-th slot are bits of the data information. As a result, the network device cannot correctly detect the UL-SCH in the current slot.

[0586] In step S202', the length of the bit sequence output through rate matching is G, G n , aG or aG n In step 3, the position in the circular buffer of the first bit in the bit sequence output through rate matching is calculated based on G, G n , aG or aG n When the UCI is calculated based on the parameter G, the terminal device maps the second coded bit sequence to time-frequency resources in the first time unit, where the second coded bit sequence is a coded bit sequence output through rate matching in the first time unit, and the number of bits in the second coded bit sequence is equal to the parameter G corresponding to the first time unit. The terminal device maps the UCI to some time-frequency resources in the first time unit to replace some bit sequences in the first coded bit sequence carried in the some time-frequency resources.

[0587] It should be understood that when data bits are mapped to a time unit (a slot is used as an example in this embodiment of the present application), the UL-SCH is first mapped to all REs in the time unit, and then the UCI is mapped to the corresponding resources in a puncturing manner. In this way, the UCI replaces resources carried on some REs in the time unit. In other words, the time-frequency resources occupied by data bits other than the data bits replaced by the UCI in the time unit remain unchanged.

[0588] In this embodiment of the present application, the UCI is multiplexed in a puncturing manner in the first time unit, so that the bit sequence contained in the first transport block and carried on time-frequency resources other than the time-frequency resource occupied by the UCI in the first time unit remains unchanged, which improves the decoding success rate and accuracy of the network device.

[0589] In a third possible implementation, the terminal device may use G and Z corresponding to time unit #n-1. c Based on this, the position of the first bit in the bit sequence output through rate matching in time unit #n is calculated.

[0590] For details of S201'', please refer to the corresponding description in the first possible implementation.

[0591] For details of S202'', please refer to the corresponding description in the first possible implementation. The differences are as follows:

[0592] Step 3: The terminal device determines the first bit position for bit selection in rate matching. Here, several possible solutions are used for substitution:

[0593] Solution 1:

[0594] The first bit in the bit sequence output through the current rate matching is k n and the last bit in the previous rate matching is l n-1 In this case, the first bit in the current rate matching may be determined based on the last bit in the previous rate matching, for example, as follows:

number

[0595] Solution 2:

[0596] The position of the first bit in the bit sequence output through the current rate matching is determined based on the position of the first bit in the bit sequence output through the previous rate matching. Specifically, the position of the first bit in the bit sequence output through the current rate matching can be determined based on the position of the first bit output through the previous rate matching and the gap between the first bits in the bit sequences output through two consecutive rate matchings.

[0597] In one example,

number

[0598] I in the gap between the first bits of the bit sequence output through two successive rate matching r is calculated as follows:

number

number

[0599] In another example,

number

[0600] The gap between the first bits in the bit sequence output after two successive rate matchings. r can be calculated as follows:

number

number

[0601] Note that G in Solution 2 is calculated when all time units contain the same amount of OFDM symbols.

[0602] For example, I of this specification r For example, a column may be added to the TDRA table for configuration, and the candidate values ​​are a subset in {1, 2, ..., 66} or a subset in {1, 2, ..., 55}.

[0603] The above solution may alternatively be implemented in other ways.

[0604] E r is E r,n is replaced by I r I r,n or E r is E r,n ' and I r I r,n or Er is E r ' or E r is E r,n " and I r I r,n can be replaced with

[0605] Solution 3:

[0606] Based on Solution 2, if the upper layer parameter rateMatching is not set to limitedBufferRM, i.e., parameter I LBRM If is equal to 0, then N cb =N. For example, for BG1, N=66Z c Therefore, the method in Solution 2 can be simplified as follows:

[0607] k n =mod(k n-1 +I r ,66) where I r is the same as in Solution 2. k n Z c Note that denotes the first bit position.

[0608] Alternatively, similarly, for example, for BG2, N=50Z c and k n =mod(k n-1 +I r ,50).

[0609] As mentioned in the signaling design of the scheduling information in S201, when the scaling factor K is equal to the number of slots N, it can be understood that the network device does not support TBoMS iterations, and the number of slots represents only the number of slots allocated to one TBoMS transmission; or, when K < N, the network device supports TBoMS iterations, the number of slots represents the total number of slots including the transmission of TBoMS iterations, K represents the number of slots for one TBoMS transmission, and it should be noted that when N / K is an integer, the number of TBoMS iterations is N / K. In Solution 2 or Solution 3, when K = N and n = 0, k0 is indicated by the RV, when 1 < K < N and N / K is an integer, k m is indicated by the RV, where m = N / K.

[0610] N cb It should be understood that when = N, Solution 3 can significantly reduce the computational overhead.

[0611] Also, in Solutions 1 to 3, E r can alternatively be replaced by E r ' obtained through the calculation of G'. The remaining implementation is consistent with the specific implementation described above and will not be described again here.

[0612] For details of S203'', please refer to the corresponding description in the first possible implementation.

[0613] For details of S204'', please refer to the corresponding description in the first possible implementation.

[0614] In this embodiment of the present application, when resource mapping is performed on the terminal side, the step of searching for the position of the last bit mapped in the previous time unit within the first encoded bit sequence is reduced, and based on G, based on determining the position of the leading bit in the first encoded bit sequence within the circular buffer, the position is Z cThis simplifies the calculations and reduces overhead in the mapping process.

[0615] In a fourth possible implementation, the terminal device may use aG and Z corresponding to time unit #n-1. c Based on this, the position of the first bit in the bit sequence output through rate matching in time unit #n is calculated.

[0616] In the third possible implementation, G is replaced by aG, and E r Alternatively, E can be obtained through the calculation of aG r ". The remaining implementation is consistent with the specific implementation described above, and the details will not be described again here.

[0617] The uplink transmission method 300 provided in the present application will be described below with reference to FIGS.

[0618] For PUSCH repetition type A, when K>1, the same symbol allocation is applied across K consecutive slots, and the PUSCH is limited to a single transport layer. The UE shall repeat the TB in K consecutive slots and apply the same symbol allocation in those slots. The redundancy version applied to the nth transmission opportunity of the TB is determined according to Table 1 above, where n=0, 1, ..., or K-1. For example, as shown in Figure 14, the UE sends one repetition in each available uplink slot.

[0619] In method 300, for TBoMSPUSCH repetitions, the number of slots for one TBoMS transmission is N, and the number of repetitions for one TBoMS transmission is M. When N>1 and M>1, the same symbol configuration is applied across the N×M available slots. The UE shall repeat the TB in M ​​groups (or M repetitions) of the N available slots and apply the same symbol allocation in those slots. The redundancy version applied to the nth transmission opportunity of the TB may be determined according to Table 5, where n=0, 1, ..., or N×M-1, or n=0, N, 2N, ..., or (M-1)N. Within each group (or each repetition), a single RV is applied across N consecutive available slots (or N transmission opportunities). For example, as shown in Figure 15, when N=2 and M=4, [Table 5]

[0620] Compared with existing methods for dynamically scheduling a single slot for one repetitive transmission, this embodiment of the present application provides a method for dynamically scheduling uplink transmissions in multiple slots for one TBoMS transmission, thereby improving the TBoMS transmission method.

[0621] The uplink transmission method 400 provided in the present application will be described below with reference to FIGS.

[0622] In the prior art, for RV cyclic configuration scheduling of PUSCH repetition type A, the higher layer parameter repK-RV defines the redundancy version mode applied to the repetition. If cg-RetransmissionTimer is provided, the redundancy version of the configured grant uplink transmission is determined by the UE. If the parameter repK-RV is not provided in configuredGrantConfig and cg-RetransmissionTimer is not provided, the redundancy version of the configured grant uplink transmission is set to 0. If the parameter repK-RVRetransmissionTimer is not provided in configuredGrantConfig and cg-, the nth transmission opportunity in K repetitions is associated with the (mod(n-1, 4)+1)th value in the configured RV sequence, where n=1, 2, …, or K. If startingFromRV0 in the configured grant configuration is set to “off”, the initial transmission of a transport block can only start at the first transmission opportunity in K repetitions; otherwise, the initial transmission of a transport block starts at: (1) the first transmission opportunity in the K iterations, where the first transmission opportunity corresponds to when the constructed RV sequence is {0, 2, 3, 1}; or (2) any transmission opportunity in the K iterations associated with RV=0, where the any transmission opportunity corresponds to the constructed RV sequence {0, 3, 0, 3}; or (3) When K≧8, any transmission opportunity in the K iterations other than the last transmission opportunity, where the any transmission opportunity corresponds to the constructed RV sequence {0,0,0,0}.

[0623] In method 400, the upper layer parameter repK-RV defines the redundancy version mode applied to the repetition. If cg-RetransmissionTimer is provided, the redundancy version of the configured grant-uplink transmission is determined by the UE. If the parameter repK-RV is not provided in configuredGrantConfig and cg-RetransmissionTimer is not provided, the redundancy version of the configured grant-uplink transmission for each repetition (or each group of N transmissions) shall be set to 0. If the parameter repK-RV is provided in configuredGrantConfig and cg-RetransmissionTimer is not provided, the nth transmission opportunity of the M×N transmission opportunities is associated with the (mod((n-1) / N, 4)+1)th value in the configured RV sequence, where n=1, N+1, 2N+1, ..., or (M-1)×N+1. If startingFromRV0 in the configured grant configuration is set to "off", the initial transmission of a transport block can start only at the first transmission opportunity out of M × N transmission opportunities; otherwise, the initial transmission of a transport block can start at: (1) a first transmit opportunity among the M×N transmit opportunities, where the first transmit opportunity corresponds to a configured RV sequence {0, 2, 3, 1}; or (2) any one of the M×N transmit opportunities associated with RV=0, where the any one transmit opportunity corresponds to the configured RV sequence {0, 3, 0, 3}; or (3) any one of the M×N transmit opportunities associated with RV=0, where the any one transmit opportunity corresponds to the configured RV sequence {0,0,0,0}; or (4) Any transmission opportunity among the M×N transmission opportunities associated with RV=0 other than the ((M−1)×N+1)th transmission opportunity that satisfies condition 1, where the any transmission opportunity corresponds to the configured RV sequence {0,0,0,0}.

[0624] The condition 1 is M≧μ, N≧μ, and M×N≧μ, where μ=2, 4, 8, 16, 32, or 64.

[0625] In each iteration of a single TBoMS, a single RV is applied over N consecutive available slots (or N transmission opportunities).

[0626] In the following, several specific implementations are described separately by using an example where N=2 and M=4. Fig. 16 corresponds to startingFromRV0 set to "off", Fig. 17 corresponds to startingFromRV0 set to "on" and RV sequence {0,2,3,1}, Fig. 18 corresponds to startingFromRV0 set to "on" and RV sequence {0,3,0,3}, and Fig. 19 corresponds to startingFromRV0 set to "on" and RV sequence {0,0,0,0}.

[0627] Compared with existing methods for dynamically scheduling a single slot for one repetition transmission, this embodiment of the present application provides a method for statically scheduling uplink transmissions in multiple slots for one TBoMS transmission, thereby improving the TBoMS transmission method.

[0628] The uplink transmission method 500 of the present application will be described below with reference to FIGS.

[0629] For PUSCH repetition type A, regardless of whether a PUSCH transmission in a transmission opportunity is canceled or not, the RV is still performed cyclically according to the method shown in Figure 14. Here, it is assumed that the first downlink slot corresponds to RV0. That is, the RV corresponding to the PUSCH transmission in the canceled transmission opportunity is skipped. More precisely, as shown in Table 6.1.2.1-2, the RV corresponding to each transmission opportunity is determined to be unchanged. For reasons for canceling transmissions on some time domain resources, please refer to Cases 1 to 6.

[0630] In the method 500, when transmissions in some time units in the TBOMS transmission are canceled, three uplink transmission solutions are proposed. In the following, for illustration purposes, an example in which one time unit is one slot is used.

[0631] Solution 1: For TBoMS PUSCH transmission, if a PUSCH transmission at a transmission opportunity (whether repeated or non-repeated) is canceled, RV is still performed cyclically according to the method described in embodiment 1 / 2, and the coded bits corresponding to the PUSCH transmission at the canceled transmission opportunity are skipped (the "corresponding coded bits" are the coded bits output through code block segmentation, channel coding, rate matching, and code block concatenation).

[0632] As shown in Figure 20, for example, four repetitions are performed during one transmission, and two slots are occupied for one repetition. The transmission in the first slot corresponding to repetition #2 is canceled. In this case, the bit sequence that originally needs to be transmitted proceeds to be transmitted in the second slot corresponding to repetition #2, and the bit sequence transmitted in another repetition remains unchanged.

[0633] Note that a slot in this method is one available slot and corresponds to one transmission opportunity. This can be an entire slot, several slots, or several slots indicated by S and L, where S and L are the first symbol and length in the RRC signaling TDRA table. The available slots are determined based on the RRC configured uplink-downlink slot configuration (e.g., tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated), the TDRA table, and SSB decisions, and does not take into account discards due to contention.

[0634] Solution 2: If a PUSCH transmission in a transmit opportunity (whether repetitive or non-repetitive) is cancelled due to a TBoMS PUSCH transmission, the RV is still performed cyclically according to method 300 or 400 .

[0635] Also, if the first bit in the bit selection in rate matching on a transmission opportunity for a canceled PUSCH transmission is indicated by the RV (i.e., the first transmission opportunity for one repetition, or the first slot in an M group of N slots), then the first bit in the bit selection in rate matching on a transmission opportunity following the transmission opportunity for the canceled PUSCH transmission is indicated by the RV.

[0636] If the leading bit in the rate matching at the transmission opportunity for the canceled PUSCH transmission is not indicated by the RV (i.e., a transmission opportunity that is not the first for an iteration, or a slot that is not the first of M groups of N slots), the leading bit in the bit selection for the rate matching at the transmission opportunity following the transmission opportunity for the canceled PUSCH transmission is closely connected to the trailing bit in the bit selection for the rate matching at the transmission opportunity preceding the transmission opportunity for the canceled PUSCH transmission.

[0637] Note that a slot in this method is one available slot and corresponds to one transmission opportunity. This can be an entire slot, several slots, or several slots indicated by S and L, where S and L are the first symbol and length in the RRC signaling TDRA table. The available slots are determined based on the RRC configured uplink-downlink slot configuration (tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated), the TDRA table, and SSB decisions, and do not take into account discards due to contention.

[0638] Solution 3: The available slots are redefined. The available slots are determined based on the RRC-configured uplink-downlink slot configuration (e.g., tdd-UL-DL-Configuration Common or tdd-UL-DL-Configuration Dedicated) and the TDRA table, taking into account discards due to contention. One available slot corresponds to one transmission opportunity. The correspondence may be an entire slot, several slots, or several slots indicated by S and L, where S and L are the first symbol and length in the RRC signaling TDRA table. Then, RV rotation is performed using the method described in embodiments 1 and 2.

[0639] The following describes an uplink transmission method 600 provided in the present application.

[0640] According to method 600, rate matching can be performed over a set of N slots. Specifically, in this method, parameter G is the total amount of coded bits available for transmission of transport blocks and UCI in one time unit, which is N slots.

[0641] UCI multiplexing is performed in N slots in a puncturing manner, and UCI is multiplexed in only one slot.

[0642] Since rate matching is performed only once in N slots, bit selection is performed only once, with the starting point determined by RV and the length determined based on G.

[0643] First, UL-SCH bits are obtained after rate matching and code block concatenation. Bits corresponding to UCIs are multiplexed onto UL-SCH bits using a puncturing method. The UL-SCH bits multiplexed with UCIs are then mapped to the time-frequency resources of N slots.

[0644] The following describes an uplink transmission method 700 provided in the present application.

[0645] In possible implementation 1, A-CSI (Aperiodic CSI) is not expected to be multiplexed onto the TBoMS PUSCH.

[0646] It should be understood that the A-CSI is triggered by the DCI and multiplexed onto the PUSCH scheduled by the DCI to complete the A-CSI reporting. If the DCI schedules multiple PUSCHs, for example, TBoMS, the A-CSI is multiplexed onto only the first PUSCH to complete the reporting. However, in the output coded bit sequence obtained according to the current rate matching method, the first time unit generally carries systematic bits. Therefore, the A-CSI is not expected to be multiplexed onto the TBoMS PUSCH, thereby reducing the impact of A-CSI multiplexing on systematic bits in the TBoMS PUSCH and improving the decoding success rate.

[0647] In possible implementation 2, when the A-CSI triggered by the network device by using DCI and the configured grant (CG) TBoMS PUSCH indicated by other information overlap in time units, or when the resources used to transmit the A-CSI and the CG TBoMS PUSCH overlap in the time domain, the following transmission modes may be used:

[0648] Aspect 1: Cancel PUSCH transmissions in overlapping time units.

[0649] Aspect 2: Canceling A-CSI transmissions in overlapping time units.

[0650] In possible implementation 3, CSI is not expected to be multiplexed onto the TBoMS PUSCH.

[0651] It should be understood that the number of CSI bits is relatively large. Compared with multiplexing CSI on the TBoMS PUSCH or transmitting CSI on the TBoMS PUSCH using a puncturing method, the impact of CSI multiplexing on systematic bits in the TBoMS PUSCH can be reduced, and the decoding success rate can be increased. CSI refers to all types of CSI.

[0652] Here, we will explain puncturing in this embodiment of the present application. For example, when CSI is multiplexed onto the TBoMS PUSCH in a puncturing manner, assuming that the CSI occupies 40 bits, which are {a1, a2, . . . a40}, and the TBoMS PUSCH occupies 100 bits, which are {b1, b2, . . . b100}, and the CSI is multiplexed from the 11th bit to the 50th bit of the TBoMS PUSCH, then {a1, a2, . . . a40} will be replaced by {b11, b12, . . . b50}, and the positions of {b1, b2, . . . b10} and {b51, b52, . . . b100} will remain unchanged.

[0653] In possible implementation 4, the first bit in the 1st time unit is determined by RV, the first bit in the 2nd to nth time units is determined by using method #1, and the first bit in the (n+1)th to Nth time units is determined by using method #2.

[0654] Method #1 is a method for calculating the index of the leading bit in the bit selection in the rate matching process in a time unit based on G' in the aforementioned embodiment of the present application. Method #2 is a method for calculating the index of the leading bit in the bit selection in the rate matching process in a time unit based on G in the aforementioned embodiment of the present application. For the definitions of G and G', please refer to the above description. The details will not be described again in this specification.

[0655] in particular,

number

[0656] Method #1: Here, G n is G', and in Method #2, G nwhere G is the starting point of the bit sequence output through rate matching in each time unit. The starting point of the bit sequence output through rate matching in each time unit is calculated based on G, and the length of the bit sequence output is calculated based on G or G'.

[0657] The value of n may be a default value, such as n=2, n=3, or n=4. Alternatively, the value of n may be a specified value, such as a column added to the TDRA table to indicate the value of n, with a set of values ​​for n such as n={2,3,4}.

[0658] Possible implementation 5:

[0659] According to protocol release Rel-15 / 16, UCI multiplexed on PUSCH is classified into three types: HARQ-ACK, CSI, and CG-UCI.

[0660] 1. For HARQ-ACK multiplexing, DCI schedules the UE to receive the PDSCH, and the UE feeds back the HARQ-ACK on the PUCCH after receiving the PDSCH. If DCI detection is missed, misalignment occurs in Method #1. When Method #2 is used, systematic bits can be punctured. However, considering the small amount of HARQ-ACK bits, the impact of puncturing on the PUSCH is small, and therefore the performance loss of Method #2 is not significant.

[0661] 2. For CSI multiplexing, there is no false negative problem and Method #1 can be used. On the other hand, if Method #2 is used, the impact of puncturing on the PUSCH is large because the number of CSI bits is large, and therefore the performance loss of Method #2 is large.

[0662] There are three CSI feedback modes: periodic CSI (P-CSI), semi-persistent CSI (SP-CSI), and aperiodic (A-CSI).

[0663] (1) P-CSI is configured, triggered, and reported on the PUCCH by using RRC signaling, so there is no chance that the terminal device will miss DCI detection.

[0664] (2) SP-CSI is configured using RRC signaling, triggered by MAC CE signaling, and carried on PUCCH or PUSCH for reporting, so that the terminal device does not miss DCI detection.

[0665] (3) A-CSI is configured using RRC signaling, triggered using DCI signaling, and carried on the PUSCH for reporting. The PUSCH is also scheduled using the DCI. The DCI simultaneously triggers and schedules the PUSCH, so if DCI detection fails, the PUSCH is not transmitted. Therefore, there is no problem to be solved in this application.

[0666] It can be seen from the above that the P-CSI and SP-CSI are not triggered by DCI, so there is no missed detection problem. Since the same DCI is used to schedule the PUSCH and to trigger the reporting of the A-CSI, if DCI detection fails, the PUSCH is not transmitted, and therefore there is no missed detection problem.

[0667] 3. For CG-UCI multiplexing, the CG-UCI is configured by using RRC signaling and triggered by using RRC or DCI. When the CG-UCI is triggered by using RRC, the problem of missed detection does not occur. When the CG-UCI is triggered by using DCI, the problem of missed detection occurs, but the PUSCH is not transmitted. Therefore, Method #1 is also applicable.

[0668] However, considering the fact that joint coding is performed when CG-UCI and HARQ-ACK are simultaneously multiplexed onto PUSCH, the CG-UCI and HARQ-ACK are multiplexed onto PUSCH as HARQ-ACK after coding, and the impact caused by direct puncturing may be significant.

[0669] In conclusion, DCI misdetection occurs only when HARQ-ACK is multiplexed. The case of simultaneous multiplexing of CG-UCI and HARQ-ACK is special and requires further discussion.

[0670] In the above case, the following several modes for processing can be considered.

[0671] Aspect 1

[0672] In Method #2, G n represents the total amount of coded bits available for the transmission of TB in the nth time unit, assuming no HARQ-ACK multiplexing.

[0673] Example 1: When only HARQ-ACK is multiplexed on PUSCH, the total amount of coded bits available for transmission of HARQ-ACK in the nth time unit is G n is not deducted from

[0674] Example 2: When UCI is multiplexed on PUSCH and the UCI is CSI and / or CG-UCI, the total amount of coded bits for the transmission of UCI in the n-th time unit is Gn is subtracted from, i.e., method #1 is used.

[0675] Example 3: When CSI and HARQ-ACK are multiplexed on PUSCH, the total amount of coded bits for CSI transmission in the nth time unit is G n The total amount of coded bits for the transmission of HARQ-ACK in the nth time unit is not subtracted.

[0676] Using Example 1 as an example, assuming that HARQ-ACK occupies 10 bits and PUSCH occupies 100 bits, when HARQ-ACK is multiplexed on PUSCH in a puncturing manner, the puncturing position is the last 10 bits of the 100 bits occupied by PUSCH.

[0677] Aspect 2

[0678] Method #1 is G n uses G'. In other words, see the prior art solution. However, the HARQ-ACK multiplexing process is modified as follows:

[0679] (1) When the number of bits occupied by HARQ-ACK is 2 bits or less, in the prior art, HARQ-ACK is multiplexed onto PUSCH using a puncturing method.

[0680] (2) When the number of bits occupied by HARQ-ACK is greater than 2, the UL-SCH coded bits are still punctured, and the puncturing positions are consistent with the positions where HARQ-ACK is multiplexed for direct rate matching in the prior art. For details on UCI multiplexing in the prior art, see 38.212 6.2.7.

[0681] In one example, when CG-UCI is multiplexed, TBoMS is not applied to unlicensed bands, but only to licensed spectrum.

[0682] It should be understood that the CG-UCI is merely an extension of the CG PUSCH in unlicensed frequency bands, i.e., the CG PUSCH reports the CG-UCI only in the unlicensed spectrum and not in the licensed spectrum.

[0683] In another example, the CG-UCI and the HARQ-ACK are jointly coded and processed as a HARQ-ACK. In other words, this case is consistent with the HARQ-ACK solution in the previous example.

[0684] In Possible Implementation 6, two switching aspects, Method #1 and Method #2, are further described.

[0685] In switching manner 1, switching is performed based on the location of the DCI.

[0686] If the DCI scheduling the PDSCH (and HARQ-ACK is multiplexed into the PUSCH) exists only before the DCI scheduling the PUSCH, method #1 is used; otherwise, method #2 is used.

[0687] In the switching manner 2, the switching is performed according to the instructions in the TDRA table.

[0688] For example, a column is added to the TDRA table, which column contains one bit to indicate whether Method #1 or Method #2 is used.

[0689] Some of the possible implementations mentioned above can reduce the impact of CSI multiplexing on systematic bits in the TBoMS PUSCH, thereby increasing the decoding success rate.

[0690] The following describes an uplink transmission method 800 provided in the present application.

[0691] The network device transmits scheduling information to the terminal device. The scheduling information instructs the terminal device to transmit a TB via a PUSCH. After that, the network side does not receive the TB or does not receive the correct TB. The network device transmits the scheduling information again to the terminal device to instruct the terminal device to retransmit the TB. The terminal device receives the scheduling information, and the terminal device retransmits the TB to the network device based on the scheduling information. In addition, the scheduling information further indicates an uplink transmission mode to be used when the terminal device retransmits the TB.

[0692] Table 6 shows four uplink transmission modes. The network side can dynamically switch between different rows in the TDRA table by using DCI. N is the number of slots and M is the number of repetitions. [Table 6]

[0693] It should be understood that TBoMS is limited to being transmitted on one CB, while PUSCH is not limited to being transmitted on one CB. When dynamic switching is performed between single-slot PUSCH or Type-A PUSCH repetition and TBoMS or TBoMS repetition, the following problems may arise: When switching from PUSCH transmission, which is not limited to a single CB, to TBoMS transmission, which is limited to a single CB, it is highly likely that TBoMS transmission will not be feasible due to lack of support in existing protocols.

[0694] Regarding the above problem, the method 800 proposes rules for dynamic switching between different transmission modes.

[0695] Rule 1: No dynamic switching is performed.

[0696] Dynamic switching between PUSCH / Type-A PUSCH repetitions {N=1, M≧1} and TBoMS / TBoMS repetitions {N>1, M≧1} is not expected. That is, if the initial transmission is a PUSCH / Type-A PUSCH repetition {N=1, M≧1}, then the retransmission cannot be a TBoMS / TBoMS repetition {N>1, M≧1}. If the initial transmission is a TBoMS / TBoMS repetition {N>1, M≧1}, then the retransmission cannot be a PUSCH / Type-A PUSCH repetition {N=1, M≧1}.

[0697] For example, all rows in the TDRA table may only satisfy N=1 or only N>1, and N=1 and N>1 cannot occur simultaneously. Semi-static switching between the two is performed by reconfiguring the TDRA table through RRC.

[0698] Rule 2: A switch from initial TBoMS transmission to PUSCH retransmission is performed.

[0699] Rule 2-1: Only switching from initial transmission of TBoMS / IBoMS repetition {N>1, M≧1} to retransmission of single-slot PUSCH {N=1, M=1} is supported.

[0700] Alternatively, only Rule 2-2: Switching from initial transmission of TBoMS / TBoMS repetition {N>1, M≧1} to retransmission of Type A PUSCH repetition {N=1, M>1} is supported.

[0701] Alternatively, only Rule 2-3: Switching from initial transmission of TBoMS / IBoMS repetitions {N>1, M≧1} to single-slot PUSCH {N=1, M=1} or Type-A PUSCH repetitions {N=1, M>1} is supported.

[0702] Rule 3: A switch from initial PUSCH transmission to TBoMS retransmission is performed.

[0703] Switching from initial transmission of PUSCH / Type A PUSCH repetitions {N=1, M≧1} to retransmission of TBoMS / TBoMS repetitions {N>1, M≧1} is supported only if a single CB is transmitted; otherwise, dynamic switching is not supported.

[0704] In the above embodiment, rules are specified for dynamically switching between different transmission modes, which may reduce the cases where TBoMS transmission is not feasible.

[0705] The following describes an uplink transmission method 900 provided in the present application.

[0706] Corresponding to possible designs 1 to 6 in S201 of method 200, a column may be added to the configured TDRA table in the PUSCH-TimeDomainAllocationList to indicate the number N of time units allocated to TBoMS. For example, the repetition number configuration column for PUSCH repetition type A, i.e., numberOfRepetitions, is configured in the TDRA table to indicate the number M of repetitions of a single TBoMS when TBoMS transmission is enabled. However, this implementation only provides TDRA indication for TBoMS transmission of configured grant type 2 for dynamic grant and configured grant scheduling, and does not cover TDRA indication for TBoMS transmission of configured grant type 1.

[0707] To further improve the uplink transmission method provided herein, in method 900, a new field is introduced in an information element (IE) ConfiguredGrantConfig of RRC signaling to indicate the number N of allocated time units for a single TBoMS transmission so as to implement the TDRA indication for TBoMS transmission of configured grant type 1. For example, a specific indication manner may be shown as follows: The new field numberOfSlots indicates N, where N includes at least {2, 4, 8}, e.g., {1, 2, 4, 8}.

[0708] For example, for TBoMS transmission of configured grant type 1 or configured grant type 2, if N exists in the TDRA table, N is provided by the index row in the TDRA table; otherwise, N is provided by the newly added field in ConfiguredGrantConfig. Also, if N is provided by the newly added field in ConfiguredGrantConfig and N>1, TBoMS transmission is enabled. If N is provided by the newly added field in ConfiguredGrantConfig and N=1, single-slot PUSCH is enabled. When TBoMS transmission is enabled, the existing field repK indicates the number of repetitions M of a single TBoMS.

[0709] In the above embodiment, a TDRA indication for the configured grant type 1 TBoMS transmission is specified, which further improves the uplink transmission method provided in this embodiment of the present application and further increases the decoding success rate.

[0710] The method provided in the embodiment of the present application is described in detail above with reference to Figures 6 to 23. The apparatus provided in the embodiment of the present application is described in detail below with reference to Figures 24 and 25.

[0711] 24 is a schematic block diagram of a communication device 10 used for uplink transmission according to an embodiment of the present application. As shown in FIG. 24, the communication device 10 may include a transceiver module 11 and a processing module 12.

[0712] The transceiver module 11 may be configured to receive information transmitted by another device or to transmit information to another device. For example, the transceiver module 11 may receive first instruction information or transmit second instruction information. The processing module 12 may be configured to perform content processing for the device, for example, to determine the position in the circular buffer of a first bit in the first coded bit sequence based on a parameter G corresponding to a first time unit.

[0713] In one possible design, communication apparatus 10 may correspond to a terminal device in the method embodiments described above.

[0714] Specifically, the communication device 10 may correspond to a terminal device or a UE in any one of the methods 100 to 600 according to the embodiments of the present application. The communication device 10 may include modules configured to perform operations performed by the terminal device in the corresponding method. In addition, each unit in the communication device 10 is configured to implement operations performed by the terminal device in the corresponding method.

[0715] For example, when the communication apparatus 10 corresponds to a terminal device in the method 100, the transceiver module 11 is configured to perform steps S101, S102, and S104, and the processing module 12 is configured to perform S103.

[0716] For example, when the communication apparatus 10 corresponds to a terminal device in the method 200, the transceiver module 11 is configured to perform steps S201 and S203, and the processing module 12 is configured to perform S202.

[0717] In another possible design, the communication device 10 may correspond to a network device in the method embodiments described above.

[0718] Specifically, the communication device 10 may correspond to a network device in any one of the methods 100 to 400 according to the embodiments of the present application. The communication device 10 may include modules configured to perform the operations performed by the network device in the corresponding method. In addition, each unit in the communication device 10 is configured to implement the operations performed by the network device in the corresponding method.

[0719] For example, when the communication device 10 corresponds to a network device in the method 100, the transceiver module 11 is configured to perform steps S101, S102, and S104, and the processing module 12 is configured to perform S105.

[0720] For example, when the communication device 10 corresponds to a network device in the method 200, the transceiver module 11 is configured to perform steps S201 and S203, and the processing module 12 is configured to perform step S204.

[0721] FIG. 25 is a schematic diagram of a communication device 20 according to an embodiment of the present application.

[0722] In one possible design, apparatus 20 may be a network device, or may be a chip, system of chips, or the like located within a network device.

[0723] In one possible design, apparatus 20 may be a terminal device, including various handheld devices, vehicle-mounted devices, wearable devices, or computing devices with wireless communication capabilities, or other processing devices connected to a wireless modem, and various forms of terminals, mobile stations, terminals, user equipment, soft terminals, etc., or may be a chip, chip system, etc. located within a terminal device.

[0724] Apparatus 20 may include a processor 21 (i.e., an example of a processing module) and a memory 22. Memory 22 is configured to store instructions, and processor 21 is configured to execute the instructions stored in memory 22, such that apparatus 20 performs the steps performed by devices in the above-mentioned possible designs of the methods corresponding to Figures 8 to 23.

[0725] Furthermore, the device 20 may include an input port 23 (i.e., an example of a transceiver module) and an output port 24 (i.e., another example of a transceiver module). Furthermore, the processor 21, the memory 22, the input port 23, and the output port 24 may communicate with each other through an internal connection path to transmit control signals and / or data signals. The memory 22 may be configured to store a computer program, and the processor 21 may be configured to call the computer program from the memory 22, execute the computer program, and control the input port 23 to receive signals and the output port 24 to transmit signals to complete the steps of the terminal device, radio access network device, UE, or base station in the aforementioned method. The memory 22 may be integrated with the processor 21 or located separately from the processor 21.

[0726] Optionally, when the uplink transmission apparatus 20 is a communication device, the input port 23 is a receiver and the output port 24 is a transmitter. The receiver and the transmitter may be the same physical entity or different physical entities. When the receiver and the transmitter are the same physical entity, the receiver and the transmitter may be collectively referred to as a transceiver.

[0727] Optionally, if device 20 is a chip or circuit, input port 23 is an input interface and output port 24 is an output interface.

[0728] In one implementation, the functionality of input port 23 and output port 34 may be considered to be implemented through transceiver circuitry or dedicated transceiver chips. Processor 21 may be considered to be implemented through a dedicated processing chip, processing circuitry, processor, or general-purpose chip.

[0729] In another implementation, the device provided in this embodiment of the present application may be considered to be implemented by using a general-purpose computer. Specifically, program codes for realizing the functions of the processor 21, the input port 23, and the output port 24 are stored in the memory 22, and the general-purpose processor realizes the functions of the processor 21, the input port 23, and the output port 24 by executing the codes in the memory 22.

[0730] The modules or units in the apparatus 20 may be configured to perform the actions or processing steps performed by a random access device (e.g., a terminal device) in the above-described method, and detailed descriptions thereof will be omitted here to avoid repetition.

[0731] For the concept, description, detailed description and other steps of the device 20 related to the technical solution provided in the embodiments of the present application, please refer to the content descriptions in the aforementioned methods or other embodiments, and the details will not be described again in this specification.

[0732] It is to be understood that in embodiments of the present application, a processor may be a central processing unit (CPU), or the processor may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor, etc.

[0733] An embodiment of the present application further provides a computer-readable storage medium storing computer instructions used to implement the method performed by the network device or terminal device in the aforementioned method embodiment.

[0734] For example, when the computer program is executed by a computer, the computer is enabled to perform the method performed by the network device or terminal device in the above-described method embodiments.

[0735] An embodiment of the present application further provides a computer-readable storage medium storing computer instructions used to implement the method performed by the network device or terminal device in the aforementioned method embodiment.

[0736] For example, when the computer program is executed by a computer, the computer is enabled to perform the method performed by the network device or terminal device in the method embodiments described above.

[0737] It can be understood that the memory in the embodiments of the present application may be volatile memory or nonvolatile memory, or may include volatile memory and nonvolatile memory. The nonvolatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory may be random access memory (RAM) and is used as an external cache. By way of example and not limitation, RAM may come in many forms, such as static random access memory (static RAM, SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchlink dynamic random access memory (synchlink DRAM, SLDRAM), and direct rambus random access memory (direct rambus RAM, DR RAM).

[0738] All or part of the above-described embodiments may be implemented using software, hardware, firmware, or any combination thereof. When software is used to implement an embodiment, the above-described embodiment may be fully or partially implemented in the form of a computer program product. A computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded into or executed on a computer, all or part of the procedures or functions according to the embodiments of the present application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored on a computer-readable storage medium or transmitted from a computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., infrared, radio, or microwave) method. The computer-readable storage medium may be any available medium accessible by a computer, or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, or magnetic tapes), optical media (e.g., DVDs), or solid-state media. The solid-state media may be solid-state drives.

[0739] It should be understood that the term "and / or" herein only describes the association relationship between associated objects and represents that three relationships may exist. For example, A and / or B can represent the following three cases: only A exists, both A and B exist, and only B exists. In addition, the symbol " / " herein generally indicates an "or" relationship between associated objects.

[0740] It should be understood that the sequence numbers of the above processes do not refer to the execution sequence in various embodiments of the present application, and the execution order of the processes should be determined based on the functions and internal logic of the processes, and should not be construed as any limitation on the implementation process of the embodiments of the present application.

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

[0742] For the sake of convenience, the detailed operation processes of the aforementioned systems, devices and units may be clearly understood by those skilled in the art by referring to the corresponding processes in the aforementioned method embodiments, and the details will not be described again in this specification.

[0743] In some embodiments provided herein, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the described device embodiments are merely examples. For example, the division into units is merely a logical division of function, and other divisions may be used in actual implementation. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the shown or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces. Indirect couplings or communication connections between devices or units may be implemented electronically, mechanically, or in other ways.

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

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

[0746] When a function is implemented in the form of a software functional unit and sold or used as an independent product, the function may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or a portion of the technical solution, may be essentially implemented in the form of a software product. The computer software product is stored in a storage medium and includes instructions for instructing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present application. The aforementioned storage medium includes any medium capable of storing program code, such as a USB flash drive, a removable hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

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

Claims

1. 1. An uplink transmission method performed by a terminal device, the method comprising: receiving first instruction information from a network device, the first instruction information instructing the terminal device to transmit a first transport block in a plurality of time units; receiving second instruction information from the network device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in a first time unit, the first time unit being one of the plurality of time units; determining a position in a circular buffer of a first bit in bit selection of a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G representing a total amount of coded bits available for transmission of the first transport block and the UCI in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units; transmitting the UCI and the first transport block to the network device at the plurality of time units. method.

2. transmitting the UCI and the first transport block to the network device at the plurality of time units, 2. The method of claim 1, comprising transmitting the UCI to the network device in the first time unit and transmitting the UCI and the first transport block to the network device in the plurality of time units.

3. The method further comprises the following parameters: a first bit index in bit selection for rate matching in the first time unit; Circular buffer length; or The number of filler bits in the circular buffer determining the position within the circular buffer of a leading bit in a bit selection in the first coded bit sequence based on at least one of: The method of claim 1.

4. The method further comprises: determining a starting bit index for performing bit selection in the second time unit based on a number of filler bits skipped when the UCI is transmitted to the network device in the first time unit; The method of claim 1.

5. The method further comprises: determining a bit length for performing bit selection in the second time unit based on a parameter G' corresponding to the second time unit, the parameter G' being a total amount of coded bits available for transmission of only the first transport block in the second time unit; The method of claim 1.

6. The first indication information indicating that the terminal device is capable of transmitting the first transport block in the plurality of time units includes: when the first indication information is received and the number of time units indicated by the first indication information is greater than 1, the first indication information instructs transmitting the first transport block in the plurality of time units. The method of claim 1.

7. The method of claim 6 , wherein the number of the plurality of time units is at least 1, 2, 4, or 8.

8. 1. An uplink transmission method performed by a network device, the method comprising: transmitting first instruction information to a terminal device, the first instruction information instructing the terminal device to transmit a first transport block at a plurality of time units; transmitting second instruction information to the terminal device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in a first time unit, the first time unit being one of the plurality of time units; receiving the first transport block from the terminal device at the plurality of time units; determining a position in a circular buffer of a first bit in bit selection of a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and the UCI in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units. method.

9. The method further comprises the following parameters: a first bit index in bit selection for rate matching in the first time unit; Circular buffer length; or The number of filler bits in the circular buffer determining the position within the circular buffer of a leading bit in a bit selection in the first coded bit sequence based on at least one of: The method of claim 8.

10. The method further comprises: determining, by the network device, a starting bit index for performing bit selection in the second time unit based on a number of filler bits skipped when bit selection is performed in the first time unit; The method of claim 8.

11. The method further comprises: determining, by the network device, a bit length for performing bit selection in the second time unit based on a parameter G' corresponding to the second time unit, the parameter G' being a total amount of coded bits available for transmission of only the first transport block in the second time unit; 11. The method according to any one of claims 8 to 10.

12. The first indication information indicating that the terminal device is capable of transmitting the first transport block in the plurality of time units includes: When the terminal device receives the first indication information and the number of time units indicated by the first indication information is greater than 1, the first indication information includes indicating that the terminal device can transmit the first transport block in the plurality of time units.

11. The method according to any one of claims 8 to 10.

13. The method of claim 12 , wherein the number of the plurality of time units is at least 1, 2, 4, or 8.

14. 1. An uplink transmission device comprising: a transceiver module configured to receive first instruction information from a network device, the first instruction information instructing the uplink transmission apparatus to transmit a first transport block in a plurality of time units; the transceiver module is further configured to receive second instruction information from the network device, the second instruction information instructing the uplink transmission device to transmit uplink control information UCI in a first time unit, the first time unit being one of the plurality of time units; a processing module configured to determine a position in a circular buffer of a first bit in bit selection of a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and the UCI in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units; the transceiver module is further configured to transmit the UCI and the first transport block to the network device in the plurality of time units. Device.

15. 15. The apparatus of claim 14, wherein the transceiver module is configured to transmit the UCI to the network device in the first time unit and to transmit the UCI and the first transport block to the network device in the plurality of time units.

16. The processing module receives the following parameters: a first bit index in bit selection for rate matching in the first time unit; Circular buffer length; or The number of filler bits in the circular buffer and determining the position within the circular buffer of a first bit in a bit selection in the first coded bit sequence based on at least one of:

15. The apparatus of claim 14.

17. the processing module is further configured to: when the transceiver module does not transmit the UCI to the network device in the first time unit, determine a starting bit index for performing bit selection in the second time unit based on a number of filler bits skipped when bit selection is performed in the first time unit.

15. The apparatus of claim 14.

18. The processing module is further configured to determine a bit length for performing bit selection in the second time unit based on a parameter G′ corresponding to the second time unit, the parameter G′ being a total amount of coded bits available for transmission of only the first transport block in the second time unit.

18. The apparatus of any one of claims 14 to 17, comprising:

19. The first indication information indicating that the uplink transmission device can transmit the first transport block in the plurality of time units includes: the uplink transmission device receives the first indication information, and when the number of time units indicated by the first indication information is greater than 1, the first indication information indicates that the uplink transmission device can transmit the first transport block in the plurality of time units.

18. Apparatus according to any one of claims 14 to 17.

20. 20. The apparatus of claim 19, wherein the number of the plurality of time units is at least 1, 2, 4, or 8.

21. A communication device comprising: a transceiver module configured to transmit first instruction information to a terminal device, the first instruction information instructing the terminal device to transmit a first transport block at a plurality of time units; the transceiver module is further configured to transmit second instruction information to the terminal device, the second instruction information instructing the terminal device to transmit uplink control information (UCI) in a first time unit, the first time unit being one of the plurality of time units; the transceiver module is configured to receive the first transport block from the terminal device at the plurality of time units. a transceiver module; a processing module configured to determine a position in a circular buffer of a first bit in bit selection in a first coded bit sequence based on a parameter G corresponding to the first time unit, the first coded bit sequence being a coded bit sequence output through rate matching in a second time unit, the parameter G being a total amount of coded bits available for transmission of the first transport block and the UCI in one time unit, G being a positive integer, and the second time unit being a time unit following the first time unit in the plurality of time units. Device.

22. The processing module further includes the following parameters: a first bit index in bit selection for rate matching in the first time unit; Circular buffer length; or The number of filler bits in the circular buffer determining the position within the circular buffer of a first bit in a bit selection in the first coded bit sequence based on at least one of:

22. The apparatus of claim 21.

23. The processing module further configured to determine a starting bit index for performing bit selection in the second time unit based on a number of filler bits skipped when bit selection is performed in the first time unit.

22. The apparatus of claim 21, comprising:

24. The processing module is further configured to determine a bit length for performing bit selection in the second time unit based on a parameter G' corresponding to the second time unit, the parameter G' being a total amount of coded bits available for transmission of only the first transport block in the second time unit.

24. Apparatus according to any one of claims 21 to 23, comprising:

25. The first indication information indicating that the terminal device is capable of transmitting the first transport block in the plurality of time units includes: When the terminal device receives the first indication information and the number of time units indicated by the first indication information is greater than 1, the first indication information includes indicating that the terminal device can transmit the first transport block in the plurality of time units.

24. Apparatus according to any one of claims 21 to 23.

26. 26. The apparatus of claim 25, wherein the number of the plurality of time units is at least 1, 2, 4, or 8.

27. 10. A computer readable storage medium having instructions which, when executed on a computer, enable the computer to perform the method of claim 1.

28. A computer readable storage medium having instructions which, when executed on a computer, cause the computer to perform the method of claim 8.

Images