Methods and apparatus for transmitting information

Abstract

This application provides a method and apparatus for transmitting information. The method involves a network device determining a first parameter from a set of possible values; that is, the number of transmission opportunities or time units used to carry the first bit sequence. The network device then sends the first parameter to a terminal device. The terminal device maps the first bit sequence to K transmission opportunities based on the first parameter, where the first bit sequence is an encoded bit sequence, and K is the value of the first parameter received by the terminal device. The first parameter in the set of first parameters ensures that the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, improving demodulation performance.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to a method and apparatus for transmitting information. Background Technology

[0002] To improve coverage performance, Transport Block Over Multi-Slot (TBoMS) technology is used to aggregate small data packets from multiple time slots into a single large data packet, which is then transmitted across multiple time slots. Furthermore, to implement resource mapping in TBoMS, a redundant resource mapping mechanism, i.e., a redundant version (RV) cyclic mechanism, can be reused. The RV indicates the coded bits carried during a transmission in the cyclic buffer. Since a transport block (TB) using the redundant resource mapping mechanism only includes data packets from one time slot, the transport block size (TBS) using TBoMS is significantly larger than that using the redundant resource mapping mechanism for the same number of time slots. Therefore, during TBoMS resource mapping, it is possible that information bits cannot be completely mapped to time-frequency resources, leading to a decrease in demodulation performance. Summary of the Invention

[0003] This application provides a method and apparatus for transmitting information, which enables information bits to be fully mapped to time and frequency resources during information transmission, thereby improving demodulation performance.

[0004] In a first aspect, a method for transmitting information is provided, comprising: a network device determining a first parameter from a set of values ​​for a first parameter, the set of values ​​for the first parameter being determined according to the coding rate or modulation coding method of a first bit sequence, the first bit sequence being an encoded bit sequence, and the first parameter being the number of transmission timings or time units used to carry the first bit sequence; and the network device transmitting indication information of the first parameter to a terminal device.

[0005] It should be noted that the term "transmission timing" mentioned in this application can be replaced with "time unit". For the sake of convenience, this application uses "transmission timing" as an example, but it is not limited to this.

[0006] It should be understood that, under the above scheme, the terminal device does not expect to receive values ​​outside the set of possible values ​​for the first parameter from the network device.

[0007] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0008] In conjunction with the first aspect, in some implementations of the first aspect, the product of the coding rate and the value of the first parameter is less than or equal to N, where N is a positive integer.

[0009] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is as follows:

[0010] {1,2}, or {1,2,4}, or {1,2,4,8}, or {1,2,4,8,16}, or {1,2,4,8,16,32}, or {1,2,4,6}, or {1,2,4,6,8}, or {1,2,4,6,8,10}, or {1,2,4,6,8,10,12}, or {1,2,4,6,8,10} {1, 12, 14}, or {1, 2, 4, 6, 8, 10, 12, 14, 16}, or {1, 2, 4, 6, 8, 10, 12, 14, 16, 18}, or {1, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20}, or {1, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22}, or {1, 2 {1,2,4,6,8,10,12,14,16,18,20,22,24}, or {1,2,4,6,8,10,12,14,16,18,20,22,24,26}, or {1,2,4,6,8,10,12,14,16,18,20,22,24,26,28}, or {1,2,4,6,8,10,1} 2,14,16,18,20,22,24,26,28,30}, or {1,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32}, or {1,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34}.

[0011] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is a subset of {1,2,3,...N·k}, where k is less than or equal to the first threshold and k is a positive integer.

[0012] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is {1,2,3,...N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0013] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is a subset of {1,2,3,...N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0014] In conjunction with the first aspect, in some implementations of the first aspect, the second bit sequence is carried by N transmission opportunities, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities.

[0015] In the above scheme, when the product of the coding rate and the number of transmission opportunities is less than or equal to 1, the information bits in the encoded bit sequence can be completely carried by a single transmission opportunity. The network device determines the set of transmission opportunities that meet the conditions based on the coding rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0016] In conjunction with the first aspect, in some implementations of the first aspect, when N is greater than 1, the network device sends a first indication information to the terminal device, the first indication information being used to indicate that the second bit sequence is carried by N transmission opportunities.

[0017] The above scheme ensures that when the product of the coding rate and the number of transmission opportunities is less than or equal to N (N is a positive integer greater than 1), the information bits in the encoded bit sequence can be fully carried by N transmission opportunities. The network device determines the set of transmission opportunities that satisfy the condition that the product of the coding rate and the number of transmission opportunities is less than or equal to 1 based on the coding rate. The upper limit of this set is increased by a factor of M, and the number of transmission opportunities is determined from this set. Simultaneously, the network device sends the number of transmission opportunities to the terminal device and sends an indication message indicating N. When the terminal device performs resource mapping based on this number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, improving demodulation performance.

[0018] In conjunction with the first aspect, in some implementations of the first aspect, the product of the coding rate and the value of the first parameter is less than or equal to P, where P is a real number and P≥1.

[0019] It should be understood that P and Q in this application are real numbers.

[0020] In conjunction with the first aspect, in some implementations of the first aspect, or L is determined based on the frame structure, and L > 0.

[0021] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is as follows: a subset of This indicates that P·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0022] In conjunction with the first aspect, in some implementations of the first aspect, the second bit sequence is carried by one transmission opportunity, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in one transmission opportunity.

[0023] In the above scheme, when the product of the coding rate and the number of transmission opportunities is less than or equal to 1, the information bits in the encoded bit sequence can be completely carried by a single transmission opportunity. The network device determines the set of transmission opportunities that meet the conditions based on the coding rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0024] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is {10}, or {8}, or {6}, or {4}, or {2}, or {36,38,40,42,44}, or {36}, or {36,38}, or {36,38,40}, or {36,38,40,42}, or {26,28,30,32}, or {26,28,30}, or {26,28}, or {26}, or {22,24,26}, or {22,24}, or {22}, or {18,20}, or {18}, or {14,16}, or {14}, or {12}.

[0025] In conjunction with the first aspect, in some implementations of the first aspect, the product of the encoding bitrate and the value of the first parameter is greater than N and less than or equal to M, where M > N and N is a positive integer.

[0026] In conjunction with the first aspect, in some implementations of the first aspect, M is N. times.

[0027] In conjunction with the first aspect, in some implementations of the first aspect, the second bit sequence and the third bit sequence in the first bit sequence are each carried by at least one transmission opportunity, wherein the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities, and the third bit sequence is at least one bit sequence in the first bit sequence that has a different starting point than the second bit sequence.

[0028] In conjunction with the first aspect, in some implementations of the first aspect, when N is greater than 1, the network device sends a second indication information to the terminal device, the second indication information being used to indicate that the second bit sequence is carried by N transmission opportunities.

[0029] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is as follows: A subset of, in which, This indicates rounding down M·k, where k is less than or equal to the reciprocal of the code rate, and k is a positive integer.

[0030] The above scheme, where the product of the coding rate and the number of transmission opportunities is greater than 1 and less than or equal to 22 / 17, and constrains RV0 and RV1 to map to different transmission opportunities, allows the information bits in the encoded bit sequence to be fully carried by multiple transmission opportunities. The network device determines the set of transmission opportunities that meet the conditions based on the coding rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on this number of transmission opportunities, it ensures that the information bits are completely mapped to time-frequency resources for transmission, improving demodulation performance.

[0031] In conjunction with the first aspect, in some implementations of the first aspect, the product of the coding rate and the value of the first parameter is greater than P and less than or equal to Q, where P and Q are real numbers, P≥1, and Q>P.

[0032] In conjunction with the first aspect, in some implementations of the first aspect, or Q equals The P and L values ​​are determined based on the frame structure, and L > 0.

[0033] In conjunction with the first aspect, in some implementations of the first aspect, the second bit sequence and the third bit sequence in the first bit sequence are each carried by at least one transmission timing, wherein the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is associated with the number of time slots included in one transmission timing, and the third bit sequence is at least one bit sequence in the first bit sequence that has a different starting point than the second bit sequence.

[0034] In conjunction with the first aspect, in some implementations of the first aspect, the set of values ​​for the first parameter is as follows: A subset of, in which, This indicates rounding down from P·k+1. This indicates that Q·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0035] The above scheme, where the product of the coding rate and the number of transmission opportunities is greater than 1 and less than or equal to 22 / 17, and constrains RV0 and RV1 to map to different transmission opportunities, allows the information bits in the encoded bit sequence to be fully carried by multiple transmission opportunities. The network device determines the set of transmission opportunities that meet the conditions based on the coding rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on this number of transmission opportunities, it ensures that the information bits are completely mapped to time-frequency resources for transmission, improving demodulation performance.

[0036] In conjunction with the first aspect, in some implementations of the first aspect, the number of time slots included in the transmission timing carrying the second bit sequence is greater than the number of time slots included in the transmission timing carrying the fourth bit sequence, wherein the second bit sequence is the bit sequence in the first bit sequence that starts with the first bit, and the fourth bit sequence is at least one bit sequence in the first bit sequence that starts with a bit other than the first bit.

[0037] The above scheme can improve the success rate of fully mapping information bits to video resources for transmission and improve demodulation performance when the time domain resources allocated to each time slot are different and the number of time slots included in each transmission opportunity is different. Mapping information bits to transmission opportunities with more time slots can further improve the success rate of fully mapping information bits to video resources for transmission.

[0038] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the network device determining the coding rate based on the modulation and coding scheme (MCS).

[0039] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the network device sending third indication information to the terminal device, the third indication information being used to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, wherein K is the value of the first parameter and B is a positive integer.

[0040] Secondly, a method for transmitting information is provided, comprising: a terminal device receiving a first parameter from a network device; the terminal device mapping a first bit sequence to K transmission opportunities according to the first parameter, where K is the value of the first parameter and K is a positive integer; wherein, when the product of the encoding code rate of the first bit sequence and K is less than or equal to a first threshold value, the terminal device will transmit the first bit sequence at the y-th... k A bit sequence starting with bits is mapped to the k-th transmission opportunity, where the position y k Corresponding to the kth transmission opportunity, 1≤k≤K, where k is an integer, the first bit sequence includes the bit sequence, and the length of the bit sequence is related to the number of time slots included in a transmission opportunity.

[0041] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0042] In conjunction with the second aspect, in some implementations of the second aspect, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0043] The above scheme reduces the step of finding the position of the last bit mapped to the previous transmission timing or time slot in the first bit sequence when the terminal performs resource mapping, simplifying the calculation in the mapping process and saving overhead.

[0044] In conjunction with the second aspect, in some implementations of the second aspect, the first parameter is determined based on the coding rate or modulation coding method of the first bit sequence, the first bit sequence is the encoded bit sequence, and the first parameter is the number of transmission opportunities or time units used to carry the first bit sequence.

[0045] In conjunction with the second aspect, in some implementations of the second aspect, the first threshold value is P times any of the following values: 0.9, 0.948, 0.95, 1, 1.2 Alternatively, the first threshold value can be P times any of the following values: 0.9, 0.948, 0.95, 1.

[0046] In conjunction with the second aspect, in some implementations of the second aspect, or Or 1, where L is determined according to the frame structure, and L is greater than 0.

[0047] In conjunction with the second aspect, in some implementations of the second aspect, when the product of the coding rate of the first bit sequence and K is greater than the first threshold value, the terminal device maps the second bit sequence to K transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in the K transmission opportunities.

[0048] The above scheme performs partial retransmission of TBoMS during repeated resource mapping, which improves transmission reliability and accuracy while shortening the latency of TBoMS retransmission.

[0049] Thirdly, a method for transmitting information is provided, comprising: a network device generating first indication information; the network device transmitting indication information of a first parameter and the first indication information to a terminal device, wherein the first parameter is the number of transmission opportunities or time units used to carry the first bit sequence, the first indication information is used to indicate that a second bit sequence is carried by N transmission opportunities, the first bit sequence is an encoded bit sequence, the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, N is a positive integer, and N is less than or equal to the value of the first parameter.

[0050] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0051] In conjunction with the third aspect, in some implementations of the third aspect, N is greater than or equal to the product of the coding rate and the first parameter.

[0052] In conjunction with the third aspect, in some implementations of the third aspect, the first indication information is also used to indicate that the fifth bit sequence is carried by N transmission opportunities, and the fifth bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start with bits other than the first bit.

[0053] In conjunction with the third aspect, in some implementations of the third aspect, the method further includes: the network device sending third indication information to the terminal device, the third indication information being used to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

[0054] The above scheme performs partial retransmission of TBoMS during repeated resource mapping, which improves transmission reliability and accuracy while shortening the latency of TBoMS retransmission.

[0055] Fourthly, a method for transmitting information is provided, comprising: a terminal device receiving indication information of a first parameter and a first indication information from a network device, wherein the first parameter is the number of transmission opportunities or time units used to carry the first bit sequence, the first indication information is used to indicate that a second bit sequence is carried by N transmission opportunities, the first bit sequence is an encoded bit sequence, the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, N is a positive integer, and N is less than or equal to the value of the first parameter; the terminal device maps the first bit sequence to K transmission opportunities according to the first parameter and the first indication information, where K is the value of the first parameter and K is a positive integer.

[0056] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0057] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or,

[0058] in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0059] The above scheme reduces the step of finding the position of the last bit mapped to the previous transmission timing or time slot in the first bit sequence when performing resource mapping, simplifies the calculation in the mapping process, and saves overhead.

[0060] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the terminal device maps the first bit sequence to K transmission opportunities according to the first indication information, including: the terminal device maps the second bit sequence to N transmission opportunities, and maps the third bit sequence to one transmission opportunity, wherein the third bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from bits other than the first bit in the first bit sequence, the length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, and the length of the third bit sequence is associated with the number of time slots included in one transmission opportunity.

[0061] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the terminal device maps the first bit sequence to K transmission opportunities according to the first indication information, including: when the product of the coding rate of the first bit sequence and K is less than or equal to a second threshold value, the terminal device maps the second bit sequence and the third bit sequence to N transmission opportunities respectively, wherein the third bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from other bits besides the first bit in the first bit sequence, and the lengths of the second bit sequence and the third bit sequence are associated with the number of time slots included in the N transmission opportunities.

[0062] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the terminal device maps the first bit sequence to the first resource according to the first indication information, including: when the product of the coding rate of the first bit sequence and K is greater than the second threshold value, the terminal device maps the second bit sequence to the K transmission opportunities.

[0063] The above scheme performs partial retransmission of TBoMS during repeated resource mapping, which improves transmission reliability and accuracy while shortening the latency of TBoMS retransmission.

[0064] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the second threshold value is any one of the following: 0.9, 0.948, 0.95, 1.

[0065] Fifthly, a method for transmitting information is provided, comprising: a terminal device receiving fourth indication information and fifth indication information from a network device, the fourth indication information indicating that a first resource is used to carry a Transmission Block Over Multi-Time Slot Transport (TBoMS), and the fifth indication information indicating that the first resource is used to carry a sounding reference signal (SRS); the terminal device transmitting the SRS to the network device according to the first resource.

[0066] The above scheme prioritizes the transmission of SRS on the resource when there is a resource conflict between TBoMS PUSCH and SRS, i.e. when TBoMS PUSCH and SRS occupy the same resource, thereby reducing the resource conflict between TBoMS PUSCH and SRS.

[0067] In conjunction with the fifth aspect, in some implementations of the fifth aspect, the fourth indication information is further used to indicate that the second resource is used to carry the TBoMS. The method further includes: the terminal device transmitting the TBoMS with the network device according to the second resource; or, the terminal device transmitting the TBoMS with the network device according to the third resource, wherein the third resource is a resource in the second resource other than the resource in the same time slot as the first resource; or, the terminal device transmitting the TBoMS with the network device according to the fourth resource, wherein the fourth resource is a resource in the second resource whose timing precedes that of the first resource; or, the terminal device not transmitting the TBoMS.

[0068] A sixth aspect provides a method for transmitting information, comprising: a terminal device receiving indication information of a first parameter from a network device; the terminal device mapping a first bit sequence to K transmission opportunities according to the first parameter, where K is the value of the first parameter and K is a positive integer, wherein the last bit of the bit sequence mapped to the k-th transmission opportunity is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k The integer is 0 ≤ k ≤ K, and k is an integer.

[0069] In a seventh aspect, a method for transmitting information is provided, comprising: a network device determining a first parameter from a set of values ​​for a first parameter, wherein the set of values ​​for the first parameter is a subset of {1,2,3,...N·k}, or the set of values ​​for the first parameter is {1,2,3,...N·k}, wherein the first parameter is the number of transmission timing or transmission time units used to carry a first bit sequence, and the first bit sequence is an encoded bit sequence; the network device transmitting indication information of the first parameter to a terminal device.

[0070] Eighthly, a resource mapping apparatus is provided, comprising: a transceiver module, configured to determine a first parameter from a set of values ​​for a first parameter, the set of values ​​for the first parameter being determined according to the coding rate or modulation coding method of a first bit sequence, the first bit sequence being an encoded bit sequence, and the first parameter being the number of transmission timings or time units used to carry the first bit sequence; the transceiver module is further configured to send indication information of the first parameter to a terminal device.

[0071] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0072] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the product of the coding rate and the value of the first parameter is less than or equal to N, where N is a positive integer.

[0073] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the set of values ​​for the first parameter is {1,2,3,...N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0074] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the second bit sequence is carried by N transmission opportunities, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities.

[0075] In conjunction with the eighth aspect, in some implementations of the eighth aspect, when N is greater than 1, the network device sends a first indication message to the terminal device, the first indication message being used to indicate that the second bit sequence is carried by N transmission opportunities.

[0076] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the product of the coding rate and the value of the first parameter is less than or equal to P, where P is a real number and P≥1.

[0077] In conjunction with the eighth aspect, in some implementations of the eighth aspect, or L is determined based on the frame structure, and L > 0.

[0078] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the set of values ​​for the first parameter is as follows: a subset of This indicates that P·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0079] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the second bit sequence is carried by one transmission opportunity, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in one transmission opportunity.

[0080] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the product of the coding rate and the value of the first parameter is greater than N and less than or equal to M, where M > N and N is a positive integer.

[0081] In conjunction with the eighth aspect, in some implementations of the eighth aspect, M is N. times.

[0082] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the second bit sequence and the third bit sequence in the first bit sequence are each carried by at least one transmission opportunity, wherein the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities, and the third bit sequence is at least one bit sequence in the first bit sequence whose starting point is different from that of the second bit sequence.

[0083] In conjunction with the eighth aspect, in some implementations of the eighth aspect, when N is greater than 1, the network device sends a second indication message to the terminal device, the second indication message being used to indicate that the second bit sequence is carried by N transmission opportunities.

[0084] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the set of values ​​for the first parameter is as follows: A subset of, in which, This indicates rounding down M·k, where k is less than or equal to the reciprocal of the code rate, and k is a positive integer.

[0085] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the product of the coding rate and the value of the first parameter is greater than P and less than or equal to Q, where P and Q are real numbers, P≥1, and Q>P.

[0086] In conjunction with the eighth aspect, in some implementations of the eighth aspect, or Q equals The P and L values ​​are determined based on the frame structure, and L > 0.

[0087] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the second bit sequence and the third bit sequence in the first bit sequence are each carried by at least one transmission timing, wherein the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is associated with the number of time slots included in one transmission timing, and the third bit sequence is at least one bit sequence in the first bit sequence that has a different starting point than the second bit sequence.

[0088] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the set of values ​​for the first parameter is as follows: A subset of, in which, This indicates rounding down from P·k+1. This indicates that Q·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0089] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the number of time slots included in the transmission timing carrying the second bit sequence is greater than the number of time slots included in the transmission timing carrying the fourth bit sequence, wherein the second bit sequence is the bit sequence in the first bit sequence that starts with the first bit, and the fourth bit sequence is at least one bit sequence in the first bit sequence that starts with a bit other than the first bit.

[0090] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the apparatus further includes a processing module for determining the coding rate based on the modulation and coding scheme (MCS).

[0091] In conjunction with the eighth aspect, in some implementations of the eighth aspect, the transceiver module is further configured to send a third indication information to the terminal device, the third indication information being configured to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

[0092] Eighthly, a resource mapping apparatus is provided, comprising: a transceiver module for receiving a first parameter from a network device; and a processing module for mapping a first bit sequence to K transmission opportunities according to the first parameter, wherein K is a value of the first parameter and K is a positive integer, wherein when the product of the coding rate of the first bit sequence and K is less than or equal to a first threshold value, the terminal device maps the bit sequence starting at position i in the first bit sequence to the i-th transmission opportunity, wherein position i corresponds to the i-th transmission opportunity, 1≤i≤K, i is an integer, the first bit sequence includes the bit sequence, and the length of the bit sequence is associated with the number of time slots included in a transmission opportunity.

[0093] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0094] In conjunction with the ninth aspect, in some implementations of the ninth aspect, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0095] In conjunction with the ninth aspect, in some implementations of the ninth aspect, the first parameter is determined based on the coding rate or modulation coding scheme of the first bit sequence, the first bit sequence being the encoded bit sequence, and the first parameter being the number of transmission opportunities or time units used to carry the first bit sequence.

[0096] In conjunction with aspect nine, in some implementations of aspect nine, the first threshold value is P times any of the following values: 0.9, 0.948, 0.95, 1, 1.2 Alternatively, the first threshold value can be P times any of the following values: 0.9, 0.948, 0.95, 1.

[0097] In conjunction with the ninth aspect, in some implementations of the ninth aspect, or Or 1, where L is determined according to the frame structure, and L is greater than 0.

[0098] In conjunction with the ninth aspect, in some implementations of the ninth aspect, when the product of the coding rate of the first bit sequence and K is greater than the first threshold value, the terminal device maps the second bit sequence to K transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in the K transmission opportunities.

[0099] In a tenth aspect, a resource mapping apparatus is provided, comprising: a processing module for generating first indication information; and a transceiver module for sending indication information of a first parameter and the first indication information to a terminal device, wherein the first parameter is the number of transmission opportunities or time units for carrying the first bit sequence, the first indication information is used to indicate that a second bit sequence is carried by N transmission opportunities, the first bit sequence is an encoded bit sequence, the second bit sequence is a bit sequence in the first bit sequence starting from the first bit, the length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, N is a positive integer, and N is less than or equal to the value of the first parameter.

[0100] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0101] In conjunction with the tenth aspect, in some implementations of the tenth aspect, N is greater than or equal to the product of the coding rate and the first parameter.

[0102] In conjunction with the tenth aspect, in some implementations of the tenth aspect, the first indication information is further used to indicate that the fifth bit sequence is carried by N transmission opportunities, the fifth bit sequence being at least one bit sequence in the first bit sequence that starts with a bit other than the first bit in the first bit sequence.

[0103] In conjunction with the tenth aspect, in some implementations of the tenth aspect, the apparatus further includes: the transceiver module, configured to send third indication information to the terminal device, the third indication information being configured to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then map the first bit sequence to B transmission opportunities, wherein K is the value of the first parameter and B is a positive integer.

[0104] Eleventhly, a resource mapping apparatus is provided, comprising: a transceiver module, configured to receive indication information of a first parameter and a first indication information from a network device, wherein the first parameter is the number of transmission opportunities or time units for carrying the first bit sequence, the first indication information is used to indicate that a second bit sequence is carried by N transmission opportunities, the first bit sequence is an encoded bit sequence, the second bit sequence is a bit sequence in the first bit sequence starting from the first bit in the first bit sequence, the length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, N is a positive integer, and N is less than or equal to the value of the first parameter; and a processing module, configured to map the first bit sequence to K transmission opportunities according to the indication information of the first parameter and the first indication information, wherein K is the value of the first parameter and K is a positive integer.

[0105] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0106] In conjunction with the eleventh aspect, in some implementations of the eleventh aspect, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0107] In conjunction with the eleventh aspect, in some implementations of the eleventh aspect, the processing module is specifically used to map the second bit sequence to N transmission opportunities and the third bit sequence to one transmission opportunity. The third bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from bits other than the first bit in the first bit sequence. The length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, and the length of the third bit sequence is associated with the number of time slots included in one transmission opportunity.

[0108] In conjunction with the eleventh aspect, in some implementations of the eleventh aspect, the processing module is specifically used to map the second bit sequence and the third bit sequence to N transmission opportunities respectively when the product of the coding rate of the first bit sequence and K is less than or equal to the second threshold value. The third bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from other bits besides the first bit in the first bit sequence. The lengths of the second bit sequence and the third bit sequence are associated with the number of time slots included in the N transmission opportunities.

[0109] In conjunction with the eleventh aspect, in some implementations of the eleventh aspect, when the product of the coding rate of the first bit sequence and K is greater than the second threshold value, the processing module is specifically used to map the second bit sequence to the K transmission opportunities.

[0110] In conjunction with the eleventh aspect, in some implementations of the eleventh aspect, the second threshold value is any one of the following: 0.9, 0.948, 0.95, 1.

[0111] In a twelfth aspect, an apparatus for resource mapping is provided, comprising: a transceiver module configured to receive fourth indication information and fifth indication information from a network device, the fourth indication information indicating that a first resource is used to carry a Transmission Block Across Multiple Time Slots (TBoMS), and the fifth indication information indicating that the first resource is used to carry a Sounding Reference Signal (SRS); the transceiver module is further configured to transmit the SRS to the network device according to the first resource.

[0112] The above scheme prioritizes the transmission of SRS on the resource when there is a resource conflict between TBoMS PUSCH and SRS, i.e. when TBoMS PUSCH and SRS occupy the same resource, thereby reducing the resource conflict between TBoMS PUSCH and SRS.

[0113] In conjunction with the twelfth aspect, in some implementations of the twelfth aspect, the fourth indication information is further used to indicate that the second resource is used to carry the TBoMS, and the transceiver module is further used to transmit the TBoMS with the network device according to the second resource; or, the transceiver module is further used to transmit the TBoMS with the network device according to the third resource, the third resource being a resource in the second resource other than the resource in the same time slot as the first resource; or, the transceiver module is further used to transmit the TBoMS with the network device according to the fourth resource, the fourth resource being a resource in the second resource whose timing precedes that of the first resource; or, the transceiver module is further used not to transmit the TBoMS.

[0114] In a thirteenth aspect, an apparatus for transmitting information is provided, comprising: a transceiver module for receiving indication information of a first parameter from a network device; and a processing module for mapping a first bit sequence to K transmission opportunities according to the first parameter, wherein K is a value of the first parameter and K is a positive integer, and the last bit of the bit sequence mapped to the k-th transmission opportunity is the x-th bit in the first bit sequence. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the first bit sequence. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k The integer is 0 ≤ k ≤ K, and k is an integer.

[0115] In a fourteenth aspect, an information transmission apparatus is provided, comprising: a transceiver module configured to determine a first parameter from a set of values ​​for a first parameter, wherein the set of values ​​for the first parameter is a subset of {1,2,3,...N·k}, or the set of values ​​for the first parameter is {1,2,3,...N·k}, wherein the first parameter is the number of transmission timing or transmission time units used to carry a first bit sequence, and the first bit sequence is an encoded bit sequence; the transceiver module is further configured to send indication information of the first parameter to a terminal device.

[0116] In a fifteenth aspect, a communication device is provided, characterized in that it comprises: a processor and a memory; the memory for storing a computer program; and the processor for executing the computer program stored in the memory, such that the communication device performs the communication method or embodiment described in any one of the first to sixth aspects.

[0117] In a sixteenth aspect, a computer-readable storage medium is provided, characterized in that the computer-readable storage medium stores instructions that, when executed on a computer, cause the computer to perform the communication method or embodiment described in any one of the first to sixth aspects.

[0118] In a seventeenth aspect, a chip is provided, characterized in that it comprises: a memory for storing a computer program; and a processor for reading and executing the computer program stored in the memory, wherein when the computer program is executed, the processor executes the communication method or embodiment described in any one of the first to sixth aspects.

[0119] In a sixteenth aspect, a computer program product is provided, characterized in that the computer program product includes computer program code, which, when run on a computer, causes the computer to perform the communication method or embodiment described in any one of the first to sixth aspects. Attached Figure Description

[0120] Figure 1 This is a schematic diagram of a wireless communication system 100 applicable to embodiments of this application.

[0121] Figure 2 A schematic diagram of a multi-timeslot transport block is shown.

[0122] Figure 3 A schematic diagram of the signal processing flow is shown.

[0123] Figure 4 A schematic diagram of the transmission timing is shown.

[0124] Figure 5 A schematic diagram of TBoMS resource mapping based on redundant version cycles is shown.

[0125] Figure 6 A schematic diagram of the redundant version loop mechanism is shown.

[0126] Figure 7 A schematic diagram of an information transmission method 200 according to an embodiment of this application is shown.

[0127] Figure 8 A schematic diagram of an information transmission method 300 according to an embodiment of this application is shown.

[0128] Figure 9 A schematic diagram of an information transmission method 400 according to an embodiment of this application is shown.

[0129] Figure 10 A schematic diagram of an information transmission method 500 according to an embodiment of this application is shown.

[0130] Figure 11 A schematic diagram is shown of one possible implementation of the information transmission method 500 according to an embodiment of this application.

[0131] Figure 12 A schematic diagram illustrating a possible second implementation of the information transmission method 500 according to an embodiment of this application is shown.

[0132] Figure 13 A schematic diagram illustrating a possible implementation three or five of the information transmission method 500 according to an embodiment of this application is shown.

[0133] Figure 14 A schematic diagram is shown of a possible implementation of the information transmission method 500 of this application embodiment.

[0134] Figure 15 A schematic diagram illustrating a possible implementation six or seven of the information transmission method 500 according to an embodiment of this application is shown.

[0135] Figure 16 A schematic diagram is shown illustrating eight or nine possible implementations of the information transmission method 500 according to an embodiment of this application.

[0136] Figure 17 A schematic diagram of an information transmission method 600 according to an embodiment of this application is shown.

[0137] Figure 18 A schematic diagram of an information transmission method 700 according to an embodiment of this application is shown.

[0138] Figure 19 This is a schematic block diagram of a communication device for transmitting information provided in an embodiment of this application.

[0139] Figure 20 A schematic diagram of the information transmission device 20 provided in the embodiments of this application. Detailed Implementation

[0140] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0141] The technical solutions of this application embodiment can be applied to various communication systems, such as: 5th generation (5G) systems or new radio (NR), long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, universal mobile telecommunication system (UMTS), etc. Furthermore, the technical solutions of this application embodiment can also be applied to sidelink communication. For example, the technical solutions of this application embodiment can also be applied to: device-to-device (D2D) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and communication in vehicle-to-everything (V2X) systems.

[0142] To facilitate understanding of the embodiments of this application, firstly, in conjunction with Figure 1 This describes a communication system applicable to embodiments of this application.

[0143] Figure 1 This is a schematic diagram of a wireless communication system 100 applicable to embodiments of this application. As shown in Figure 1, the wireless communication system 100 may include at least one network device.

[0144] like Figure 1 The network device 111 shown, the wireless communication system 100 may also include at least one terminal device, such as Figure 1 The terminal device 121 shown. Both the network device and the terminal device can be configured with multiple antennas, and the network device and the terminal device can communicate using multi-antenna technology.

[0145] When the network device and the terminal device communicate, the network device can manage one or more cells, and a cell can contain 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 referred to as cell #1. The network device 111 can be a network device in cell #1, or in other words, the network device 111 can serve the terminal devices (such as terminal device 121) in cell #1.

[0146] It should be noted that a residential area can be understood as the area within the wireless signal coverage of network devices.

[0147] The transmitting device mentioned in this application embodiment can be a terminal device, and the receiving device can be a network device. For example, the transmitting device is terminal device 121, and the receiving device is network device 111.

[0148] It should be understood that the above Figure 1 This is merely an illustrative example and is not intended to limit the scope of the application. For instance, embodiments of this application can also be applied to any communication scenario that requires the repeated transmission of data (or data blocks).

[0149] It should also be understood that the network equipment in this wireless communication system can be any device with wireless transceiver capabilities. This equipment includes, but is not limited to: evolved Node B (eNB), radio network controller (RNC), node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (e.g., home evolved node B, or home node B, HNB), baseband unit (BBU), access point (AP), wireless relay node, wireless backhaul node, transmission point (TP), or transmission and reception point (TRP) in a wireless fidelity (WIFI) system. It can also be a gNB in ​​a 5G system, such as NR, or a transmission point (TRP or TP), one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, or a network node constituting a gNB or transmission point, such as a baseband unit (BBU) or a distributed unit (DU).

[0150] In some deployments, a gNB may include a centralized unit (CU) and a distribution unit (DU). A gNB may also include an active antenna unit (AAU). The CU implements some of the gNB's functions, and the DU implements others. For example, the CU handles non-real-time protocols and services, implementing radio resource control (RRC) and packet data convergence protocol (PDCP) layer functions. The DU handles physical layer protocols and real-time services, implementing radio link control (RLC), media access control (MAC), and physical (PHY) layer functions. The AAU implements some physical layer processing functions, radio frequency processing, and active antenna-related functions. Since RRC layer information ultimately becomes PHY layer information, or is derived from PHY layer information, in this architecture, higher-layer signaling, such as RRC layer signaling, can be considered to be sent by the DU, or by the DU+AAU. It is understood that network devices can be devices that include one or more of the following: CU nodes, DU nodes, and AAU nodes. In addition, the CU can be classified as a network device in the radio access network (RAN) or as a network device in the core network (CN), and this application does not limit this.

[0151] It should also be understood that the terminal equipment in this wireless communication system can also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user device. In the embodiments of this application, the terminal equipment can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal device, augmented reality (AR) terminal device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. The embodiments of this application do not limit the application scenarios.

[0152] To facilitate understanding of the embodiments of this application, the following is a brief introduction to several terms involved in this application.

[0153] 1. Time slot

[0154] A slot can be formatted to contain a number of orthogonal frequency division multiplexing (OFDM) symbols. For example, a slot can contain 14 OFDM symbols, or 12 OFDM symbols, or 7 OFDM symbols. The OFDM symbols in a slot can be used entirely for uplink transmission; entirely for downlink transmission; or a combination of both, with some used for downlink, some for uplink, and some as flexible time-domain symbols (which can be flexibly configured for uplink or downlink transmission). It should be understood that the above examples are merely illustrative and should not constitute any limitation on this application. For forward compatibility considerations, the number of OFDM symbols 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, time-domain symbols can be OFDM symbols, and time-domain symbols can be replaced with OFDM symbols.

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

[0156] Compared to LTE and Long Term Evolution Advanced (LTE-A) wireless communication systems, NR wireless communication systems are deployed in higher frequency bands to obtain greater communication bandwidth. However, higher frequency bands result in greater path loss and penetration loss, making NR's coverage performance far inferior to LTE and LTE-A.

[0157] To improve the coverage performance of NR, a multi-timeslot transport block technique is proposed. For example, such as... Figure 2 As shown, TB#1 to TB#4 are aggregated into a large TB. This technique aggregates small data packets in each time slot into a large data packet and transmits the aggregated data packet together in multiple time slots. By reducing the number of TB splits, the overhead of cyclic redundancy code (CRC) is reduced. By increasing the transport block size (TBS), the coding gain is improved. And by reducing frequency resources, the power spectral density is increased, thus improving coverage performance.

[0158] 3. Transmission occasion (TO)

[0159] A transmission sequence consists of multiple consecutive time-domain symbols. As an example, such as... Figure 4 The time-domain resources shown include downlink (DL) slots, special (S) slots, and uplink (UP) slots. DL slots contain 14 DL symbols, UL slots contain 14 UL symbols, and S slots contain 6 DL symbols, 2 invalid symbols, and 6 UL symbols. Figure 4 The frame structure of the time-domain resources in the transmission is asymmetrical, so the number of uplink time-domain symbols included in each transmission opportunity may be different. When the frame structure of the time-domain resources is symmetrical, the number of uplink time-domain symbols included in each transmission opportunity is the same. A transmission opportunity may include one or more time slots, or it may include one time slot and several time-domain symbols, or it may include multiple time slots and several time-domain symbols.

[0160] 4. Repeated transmission of type A and type B

[0161] As mentioned earlier, in some scenarios, such as deep coverage areas like cell edges or basements, path loss for wireless signal propagation is severe. To improve uplink transmission performance, one method to enhance coverage is to repeatedly transmit data blocks. For example, the terminal device repeatedly transmits PUSCH, and the network device merges and detects the repeatedly transmitted data blocks. This approach can improve channel estimation performance and data demodulation performance, thereby enhancing cell coverage.

[0162] Taking the current NR protocol as an example, it supports a maximum of 16 repeated transmissions of PUSCH and a maximum of 8 repeated transmissions of PUCCH. The current NR protocol supports type A repeated transmissions of PUCCH and both type A and type B repeated transmissions of PUSCH.

[0163] (1) Repeated transmission of type A

[0164] Type A repetitive transmission refers to: N repetitions require scheduling N consecutive slots. The starting position and total length of the time-domain symbols required for a single repetitive transmission within one slot are configured. Among the N slots, the slot whose starting position and total length of the time-domain symbols occupied by a single repetitive transmission are the same as the configured starting position and total length can be used for a single repetitive transmission. Here, N is an integer greater than or equal to 1.

[0165] (2) Repeated transmission of type B

[0166] Type B retransmission indicates that N retransmissions are performed on multiple consecutive time-domain symbols, based on the starting time-domain symbol position S of the first retransmission and the number of time-domain symbols L required for each retransmission. That is, starting from the S-th time-domain symbol of the first scheduled slot, the subsequent N*L time-domain symbols (which may extend to other slots) are used for N retransmissions.

[0167] It should be understood that specific descriptions of repeated transmissions of type A and type B can be found in existing protocols, which do not limit the scope of protection of the embodiments of this application.

[0168] For ease of description, the repeated transmission method of type A will be referred to as repetition type A, and the repeated transmission method of type B will be referred to as repetition type B.

[0169] 5. Redundancy version (RV)

[0170] Before being transmitted through a physical antenna, the information bit string typically undergoes some signal processing, such as... Figure 3 As shown.

[0171] Channel coding: By introducing redundancy and parity bits into the information bit string, the receiver can reconstruct the information bit string effectively based on the check relationships between the 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 transformed into a 500-bit encoded bit string through LDPC coding at 1 / 5 of the coding rate, introducing 400 bits of redundancy. The ratio of the length of the information bit string to the length of the encoded bit string is equal to 1 / 5 of the coding rate. For distinction, the encoded bit string is denoted as the encoded bit string.

[0172] Rate matching: After the information bit string is channel-coded to obtain a longer encoded bit string, not all of the encoded bit string is sent out directly. Generally, the terminal device can determine how many bits it can send according to the number of available resource elements (REs) and modulation order configured by the network device, and then select from the encoded bit string (the current protocol specifies 4 starting points, approximately evenly distributed in the encoded bit string, labeled RV0, RV1, RV2, and RV3 respectively).

[0173] For example, if the number of available resource elements (REs) in a single resource block (RB) is 12 * 12 = 144, and using quadrature phase shift keying (QPSK) modulation, then a single physical resource block (PRB) can carry 144 * 2 = 288 bits. Therefore, 288 bits need to be selected from the 500-bit encoded bit string as the selected bit string, and then this selected bit string is modulated and processed through resource mapping. In this case, the corresponding coding rate = information bit string / length of the selected bit string = 100 / 288.

[0174] More specifically, rate matching includes bit selection and bit interleaving. Bit selection refers to selecting coded bits from the circular buffer based on the starting point specified by RV, with the selected code length determined by the size of the mapped time-frequency resource. Bit interleaving involves interleaving the selected bits row-to-column, so the granularity of bit interleaving is consistent with that of bit selection, and they can be collectively referred to as the granularity of rate matching.

[0175] For example, if the mapped time-frequency resource is a time slot encompassed by a TO, then the length of the selected coded bits is the time-frequency resource over one TO (without considering code block segmentation). This can also be understood as the granularity of rate matching being 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 can be expressed by the formula: N TO =N RE ·Q·ν, where N TO Q represents the number of bits that the time-frequency resources can carry in a single transmission opportunity, where Q is the modulation order and ν is the number of layers.

[0176] 6. Reuse the RV loop mechanism to TBoMS resource mapping

[0177] The following example, using repeated type A, illustrates the current solution for reusing the RV loop mechanism in TBoMS resource mapping.

[0178] Assume that the RV indicated by the downlink control information (DCI) of the scheduling physical uplink shared channel (PUSCH) is rv. id For TBoMS based on time domain resource allocation (TDRA) of repetition type A, the RV used by the nth transmission opportunity of PUSCH is shown in Table 1. Here, a transmission opportunity is defined as a time slot. It should be understood that the RV update granularity is one transmission opportunity; that is, the RV used must be updated for each transmission opportunity. The update order is determined by the RV sequence, which defaults to {0,2,3,1}. That is, the RV is updated cyclically in the order {0,2,3,1}, and the starting point of the cycle is indicated by the RV specified by the DCI of the PUSCH scheduling. id Confirmed. Additionally, if the higher-layer signaling configures RV sequence indication information repK-RV, then the RVs are updated according to the order indicated by repK-RV. For TBoMS based on TDRA of repetition type B, the RVs used in the nth actual repetition of PUSCH are shown in Table 1. Here, the actual repetition is obtained by dividing the nominal repetition by slot boundaries and invalid symbols. The nominal repetition is directly configured by the base station, such as parameters like the start and length indicator value (SLIV) and the number of repetitions K.

[0179] Table 1. Duplicate Resource Mapping Mechanism

[0180]

[0181] RV is used to indicate the coded bits carried in a transmission within the circular buffer. Specifically, data encoded using low-density parity check (LDPC) is stored in the circular buffer and called coded bits; each transmission is based on RV. id The starting point of the RV is determined and denoted as k0. Encoded bits are sequentially selected from k0 in the circular buffer and mapped to the time-frequency resources for a single transmission opportunity, until the time-frequency resources are exhausted. There are four RV starting points, denoted as rv... id =0, rv id =1,rv id =2 and rv id =3 indicates, and are respectively denoted as RV0, RV1, RV2 and RV3. The starting point k0 of each RV is related to the basic graph (BG) used by LDPC encoding, as shown in Table 2, where N cb Z represents the length of the encoded bits. C This represents the expansion factor of LDPC encoding.

[0182] Table 2 RV starting position k0

[0183]

[0184] For example, Figure 5 Give the DCI indication rv for scheduling PUSCH id =0, resource mapping results for TBoMS spanning 4 time slots. For example... Figure 5 As shown in (a), the circular ring represents a circular buffer, storing the encoded bit string sequence obtained after channel coding of information bits. The positions of RV0 to RV3 are determined according to Table 2; Figure 5 As shown in (b), this is the resource mapping result of TDRA based on repetition type A. The encoded bits are mapped to the time-frequency resources of the 4 transmission opportunities in the order of RV sequence {0,2,3,1}.

[0185] The repeated resource mapping mechanism, also known as the RV loop mechanism, involves a TB (Telegraphic Transfer Block) containing only data packets from one time slot, while a TBoMS (Telegraphic-Bonded Memory System) is an aggregation of data packets from multiple time slots. For the same number of time slots, the TBS (Telegraphic-Bonded Memory System) of a TBoMS is much larger than that of a repeated TBS, easily leading to incomplete transmission of information bits and thus reduced demodulation performance.

[0186] For example, such as Figure 6As shown, the circular ring represents a circular buffer, which stores the encoded bit string sequence obtained after channel coding of information bits. The blank part in the ring is the encoded check bit, and the shaded part in the ring is the encoded information bit. RV0,1,2,3 are the approximate four-part positions of this encoded bit sequence. When transmitting using the RV cyclic {0,2,3,1} method, bits transmitted in different time slots are selected from different RV starting points (selecting a bit sequence of a certain length) for mapping and transmission. It should be noted that the encoded bit string sequence stored in the circular buffer in this application is the "first bit sequence". The "circular buffer" mentioned in this application essentially refers to the "first bit sequence". For example, "the first bit in the circular buffer" is essentially referring to "the first bit in the first bit sequence".

[0187] by Figure 6 For example, if the resources in PUSCH#0 are assumed to be able to carry 100 bits, then 100 consecutive bits are selected from the encoded bit sequence starting from position RV0 for transmission; if the resources in PUSCH#1 are assumed to be able to carry 100 bits, then 100 consecutive bits are selected from the encoded bit sequence starting from position RV2 for transmission; if the resources in PUSCH#2 are assumed to be able to carry 100 bits, then 100 consecutive bits are selected from the encoded bit sequence starting from position RV3 for transmission; if the resources in PUSCH#3 are assumed to be able to carry 100 bits, then 100 consecutive bits are selected from the encoded bit sequence starting from position RV1 for transmission.

[0188] Since PUSHC#0 can only carry a portion of the information bits, while other PUSCHs carry parity bits, when the number of bits that PUSCH#0 can carry is less than the length of the information bits in the circular buffer, the time domain resources (PUSCH#0 to PUSCH#3) will not be able to carry the complete information bits, resulting in a decrease in demodulation performance.

[0189] The theoretical analysis is as follows: assuming that the resource mapping mechanism of TBoMS is based on repeating Type A TDRA, the coding code rate is R, the modulation order is Q, the number of layers is v, and the number of REs allocated to PUSCH in one transmission time is N. RE If the number of time slots is K, then the number of information bits is N. info =N RE ·Q·R·ν·K, where N is the number of bits that the time-frequency resources can carry in a single transmission opportunity. TO =N RE If the equivalent code rate R·K>1, the information bits cannot be fully carried by the time-frequency resources of a single transmission opportunity, resulting in a decrease in demodulation performance.

[0190] The following combination Figure 7The method 200 for sending information according to the embodiments of this application will be described in detail. Figure 7 This is a schematic interactive diagram of method 200 of this application.

[0191] S201, the network device determines the first parameter from the set of values ​​of the first parameter. The set of values ​​of the first parameter is determined according to the coding rate or modulation coding method of the first bit sequence. The first bit sequence is the encoded bit sequence. The first parameter is the number of transmission opportunities or time units used to carry the first bit sequence.

[0192] It should be understood that there is a correspondence between the encoding bitrate and the set of values ​​for the first parameter, and the set of values ​​for the first parameter includes at least one value for the first parameter.

[0193] The set of possible values ​​for the first parameter can take many different forms in a specific implementation.

[0194] In one possible scenario, the set of values ​​for the first parameter is a subset of {1,2,3,...N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer and N is a positive integer.

[0195] It should be understood that in this case, when the value of the transmission timing number K belongs to the set of values ​​of the first parameter, the product of the coding rate R and the transmission timing number K is less than or equal to N, where N is a positive integer.

[0196] When N=1, since the number of information bits is N info =N RE ·Q·R·ν·K, where N is the number of bits that the time-frequency resources can carry in a single transmission opportunity. TO =N RE ·Q·ν, then when the product of the coding rate R and the transmission timing K is less than or equal to 1, N info ≤N TO Therefore, the information bits can be fully carried by the time-frequency resources of a transmission opportunity, as can be seen in the possible implementation of the information transmission method 500 in the embodiments of this application.

[0197] When N is greater than 1, the number of information bits is N. info =N RE The number of bits that can be carried by the time-frequency resources of M transmission opportunities is N. TO =N RE ·Q·ν·M, then when the product of the coding rate R and the transmission timing K is less than or equal to N, N info ≤N TO Then the information bits can be fully carried by the time and frequency resources of M transmission opportunities, as can be seen in the possible implementation method three of the information transmission method 500 in the embodiment of this application.

[0198] Additionally, when N is greater than 1, the network device sends a first indication message to the terminal device. The first indication message is used to indicate that the second bit sequence is carried by N transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities.

[0199] In the second possible scenario, the set of possible values ​​for the first parameter is: a subset of This indicates that P·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer, and P≥1.

[0200] It should be understood that in this case, when the value of the transmission timing number K belongs to the set of values ​​of the first parameter, the product of the coding rate R and the transmission timing number K is less than or equal to P. or L is determined based on the frame structure. When the time-frequency resources allocated to each time slot are different, and the time-frequency resources included in each transmission opportunity are the same, P=1, see possible implementation six in the information transmission method 500 of this application embodiment for details; when the time-frequency resources allocated to each time slot are different, and the time-frequency resources included in each transmission opportunity are different, see possible implementation eight in the information transmission method 500 of this application embodiment for details.

[0201] In this case, the second bit sequence is carried by one transmission opportunity, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer, and the length of the second bit sequence is related to the number of time slots included in one transmission opportunity.

[0202] In the third possible scenario, the set of possible values ​​for the first parameter is: A subset of, in which, This means rounding down M·k, where k is less than or equal to the reciprocal of the encoded bit rate, and k is a positive integer, N is a positive integer, and M > N.

[0203] It should be understood that in this case, when the value of the number of transmission opportunities K belongs to the set of values ​​of the first parameter, the product of the coding rate R and the number of transmission opportunities K is greater than N and less than or equal to M, where M can be 22 / 17 times N. In this case, the second bit sequence and the third bit sequence in the first bit sequence are each carried by at least one transmission opportunity, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer, and the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities, and the third bit sequence is at least one bit sequence in the first bit sequence whose starting point is different from that of the second bit sequence. For a detailed explanation of this method with N=1 as an example, please refer to the possible implementation method two of the information transmission method 500 in the embodiments of this application.

[0204] Possible scenario four: the set of possible values ​​for the first parameter is... in, This indicates rounding down from P·k+1. This means rounding down Q·k, where k is less than or equal to the reciprocal of the encoded bit rate, and k is a positive integer, P≥1, and Q>P.

[0205] It should be understood that in this case, when the value of the transmission timing K belongs to the set of values ​​for the first parameter, the product of the coding rate R and the transmission timing K is greater than P and less than or equal to Q, where Q can be 22 / 17 times P. or L is determined based on the frame structure. When the time-frequency resources allocated to each time slot are different, and the time-frequency resources included in each transmission opportunity are the same, P=1, see possible implementation seven of the information transmission method 500 in this application embodiment for details; when the time-frequency resources allocated to each time slot are different, and the time-frequency resources included in each transmission opportunity are different, see possible implementation eight of the information transmission method 500 in this application embodiment for details.

[0206] The second and third bit sequences in the first bit sequence are each carried by at least one transmission opportunity. The second bit sequence is a bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is associated with the number of time slots included in one transmission opportunity. The third bit sequence is at least one bit sequence in the first bit sequence that starts at a different point than the second bit sequence.

[0207] S202, the network device sends the indication information of the first parameter to the terminal device. Accordingly, the terminal device receives the indication information of the first parameter from the network device.

[0208] S203, the terminal device maps the first bit sequence to K transmission opportunities according to the first parameter, where K is the value of the first parameter and K is a positive integer.

[0209] Wherein, when the product of the coding rate of the first bit sequence and K is less than or equal to the first threshold value, the terminal device will map the bit sequence starting at position i in the circular buffer to the i-th transmission opportunity, wherein position i corresponds to the i-th transmission opportunity, 1≤i≤K, i is an integer, the first bit sequence includes the bit sequence, and the length of the bit sequence is associated with the number of time slots included in a transmission opportunity.

[0210] It should be understood that, for the terminal device in this application, the terminal device can perform resource mapping as described in S203 if the product of the encoding code rate of the first bit sequence and K is less than or equal to a first threshold value; and when the product of the encoding code rate of the first bit sequence and K is greater than the first threshold value, the terminal device maps the second bit sequence to K transmission opportunities, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer, and the length of the second bit sequence is related to the number of time slots included in the K transmission opportunities, specifically referring to possible implementations one and two in method 500 of the embodiments of this application.

[0211] For example, the first threshold value is P times any of the following values: 0.9, 0.948, 0.95, 1, 1.2 Alternatively, the first threshold value may be P times any of the following values: 0.9, 0.948, 0.95, 1.

[0212] in, or Or 1, where L is determined according to the frame structure, and L is greater than 0.

[0213] It should be noted that in method 200, when the network device executes S201, this application does not limit the resource mapping method executed by the terminal device, and S203 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S203, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and S201 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0214] In this embodiment of the application, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values ​​for the first parameter, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0215] Method 200 also includes:

[0216] Optionally, for possible cases two and four in S201, when the time-frequency resources allocated to each time slot are different and the time-frequency resources included in each transmission opportunity are different, the number of time slots included in the transmission opportunity carrying the second bit sequence is greater than the number of time slots included in the transmission opportunity carrying the fourth bit sequence, wherein the second bit sequence is the bit sequence in the first bit sequence that starts with the first bit in the circular buffer, and the fourth bit sequence is at least one bit sequence in the first bit sequence that starts with other bits besides the first bit in the circular buffer.

[0217] Furthermore, in the embodiments of this application, when the time domain resources allocated to each time slot are different and the number of time slots included in each transmission opportunity is different, mapping the information bits to the transmission opportunity with more time slots can further improve the success rate of completely mapping the information bits to video resources for transmission and improve demodulation performance.

[0218] Optionally, the network device sends third indication information to the terminal device, the third indication information being used to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer. See method 700 in embodiment 700 of this application for details.

[0219] Furthermore, in this embodiment of the application, when performing repeated resource mapping, TBoMS is partially retransmitted, which can shorten the latency of TBoMS retransmission while improving transmission reliability and accuracy.

[0220] Optionally, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the circular buffer. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the circular buffer. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer. For details, please refer to method 600 in embodiment 600 of this application.

[0221] Furthermore, in this embodiment of the application, when the terminal performs resource mapping, the step of finding the position of the last bit mapped to the previous transmission timing or time slot in the circular buffer is reduced, simplifying the calculation in the mapping process and saving overhead.

[0222] Optionally, the network device determines the coding rate based on a modulation and coding scheme (MCS). For details, please refer to the method 500 section of this application embodiment for the method of determining the transmission timing set A or transmission timing set B based on the MCS table. It should be noted that the set of values ​​for the first parameter in method 200 can be understood as a subset of the transmission timing set A or transmission timing set B in method 500.

[0223] The following combination Figure 8 The method 300 for sending information according to the embodiments of this application will be described in detail. Figure 8 This is a schematic interactive diagram of method 300 of this application.

[0224] S301, the network device generates the first instruction information.

[0225] S302, the network device sends the indication information of the first parameter and the first indication information to the terminal device, and correspondingly, the terminal device receives the indication information of the first parameter and the first indication information from the network device.

[0226] It should be understood that the first parameter is the number of transmission opportunities or time units used to carry the first bit sequence, the first indication information is used to indicate that the second bit sequence is carried by N transmission opportunities, the first bit sequence is the encoded bit sequence, the second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer, the length of the second bit sequence is related to the number of time slots included in the N transmission opportunities, N is a positive integer, and N is less than or equal to the value of the first parameter.

[0227] Furthermore, N is greater than or equal to the product of the coding rate and the first parameter.

[0228] Optionally, the first indication information is further used to indicate that the fifth bit sequence is carried by N transmission opportunities, wherein the fifth bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from the bits other than the first bit in the circular buffer.

[0229] Specifically, in one possible scenario, the second bit sequence in the circular buffer is carried by N transmission opportunities, while the bit sequences at other starting points are carried by 1 transmission opportunity. See the fourth possible implementation of method 500 in this application embodiment for details. In another possible scenario, all bit sequences in the circular buffer are carried by N transmission opportunities. See the fifth possible implementation of method 500 in this application embodiment for details.

[0230] S303, the terminal device maps the first bit sequence to K transmission opportunities according to the first parameter and the first indication information, where K is the value of the first parameter and K is a positive integer.

[0231] Specifically, corresponding to possible scenario one in S302, the terminal device maps the second bit sequence to N transmission opportunities and the third bit sequence to one transmission opportunity. The third bit sequence is at least one bit sequence from the first bit sequence that starts with a bit other than the first bit in the circular buffer. The length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, and the length of the third bit sequence is associated with the number of time slots included in one transmission opportunity. Corresponding to possible scenario two in S302, when the product of the coding rate of the first bit sequence and K is less than or equal to the second threshold, the terminal device maps the second bit sequence and the third bit sequence to N transmission opportunities respectively. The third bit sequence is at least one bit sequence from the first bit sequence that starts with a bit other than the first bit in the circular buffer. The lengths of the second bit sequence and the third bit sequence are associated with the number of time slots included in the N transmission opportunities. Furthermore, when the product of the coding rate of the first bit sequence and K is greater than the second threshold, the terminal device maps the second bit sequence to the K transmission opportunities.

[0232] For example, the second threshold value is any one of the following: 0.9, 0.948, 0.95, 1.

[0233] In this embodiment of the application, when information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission, thereby improving demodulation performance.

[0234] Method 300 also includes:

[0235] Optionally, the network device sends a third indication message to the terminal device, the third indication message being used to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

[0236] In this embodiment of the application, when performing repeated resource mapping, TBoMS is partially retransmitted, which can shorten the latency of TBoMS retransmission while improving transmission reliability and accuracy.

[0237] Optionally, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the circular buffer. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the circular buffer. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0238] In this embodiment of the application, when the terminal performs resource mapping, the step of finding the position of the last bit mapped to the previous transmission timing or time slot in the circular buffer is reduced, which simplifies the calculation in the mapping process and saves overhead.

[0239] The following combination Figure 9 The method 400 for sending information according to the embodiments of this application will be described in detail. Figure 9 (a) is a schematic interactive diagram of method 400 of this application.

[0240] S401, the terminal device receives the fourth indication information and the fifth indication information from the network device. Accordingly, the network device sends the fourth indication information and the fifth indication information to the terminal device. The fourth indication information indicates that the first resource is used to carry Trans-BoMS (Transport Block Across Multiple Time Slots), and the fifth indication information indicates that the first resource is used to carry a sounding reference signal (SRS).

[0241] It should be understood that the fourth and fifth instruction messages can be transmitted separately or together.

[0242] It should be understood that the two indication messages indicate that the first resource is transmitting different signals, which can be interpreted as the first resource being a conflicting resource.

[0243] For example, the first resource here can be a number of OFDM symbols in a time slot or a number of time slots, and this application does not limit it in this way.

[0244] S402, the terminal device transmits SRS with the network device according to the first resource.

[0245] It should be understood that when resources for transmitting TBoMS conflict with resources for transmitting SRS, the terminal device prioritizes sending SRS on the conflicting resource. There may be various specific implementations of S402, such as S402a, S402b, S402c, or S402d as described below. These will be discussed in conjunction with... Figure 9 Sections (b), (c), (d), and (e) provide detailed explanations of several possible implementation methods.

[0246] S402a, the terminal device transmits SRS according to the first resource and network device, and transmits TBoMS according to the second resource and network device.

[0247] For example, when the fourth indication information indicates that the last four OFDM symbols of the first time slot (i.e., S time slot) and the following two time slots (both UL time slots) are used to transmit TBoMS, and the fifth indication information indicates that the last four OFDM symbols of the second time slot are used to transmit SRS, when the terminal device executes S402, as follows: Figure 9 As shown in (b), SRS occupies the last 4 OFDM symbols of the second of the three time slots, and the resources other than the 4 OFDM symbols indicated by the fourth indication information are still used to transmit TBoMS.

[0248] S402b, the terminal device transmits SRS with the network device according to the first resource and transmits TBoMS with the network device according to the third resource, wherein the third resource is the resource in the second resource other than the resource in the same time slot as the first resource.

[0249] For example, when the fourth indication information indicates that the last four OFDM symbols of the first time slot (i.e., S time slot) and the following two time slots (both UL time slots) are used to transmit TBoMS, and the fifth indication information indicates that the last four OFDM symbols of the second time slot are used to transmit SRS, when the terminal device executes S402, as follows: Figure 9As shown in (c), the SRS occupies the last 4 OFDM symbols of the second time slot out of the three time slots. The first 10 OFDM symbols of the second time slot are treated as illegal symbols and are not used to transmit TBoMS. The resources other than the second time slot indicated by the fourth indication information are still used to transmit TBoMS. Optionally, the first 10 OFDM symbols in the second time slot can also be used to transmit other signals.

[0250] S402c, the terminal device transmits SRS with the network device according to the first resource, and the terminal device transmits TBoMS with the network device according to the fourth resource, where the fourth resource is the resource in the second resource whose timing precedes that of the first resource.

[0251] For example, when the fourth indication information indicates that the last four OFDM symbols of the first time slot (i.e., S time slot) and the following two time slots (both UL time slots) are used to transmit TBoMS, and the fifth indication information indicates that the last four OFDM symbols of the second time slot are used to transmit SRS, when the terminal device executes S402, as follows: Figure 9 As shown in (d), the SRS occupies the last 4 OFDM symbols of the second of the three time slots. OFDM symbols that follow these 4 OFDM symbols are considered invalid symbols (i.e., Figure 9 In the third time slot (d) of the above, TBoMS is not transmitted. The resources indicated by the fourth indication information, excluding the third time slot and the last four OFDM symbols of the second time slot, are still used to transmit TBoMS. Optionally, the third time slot can also be used to transmit other signals.

[0252] S402d, the terminal device transmits SRS according to the first resource and network device, but the terminal device does not transmit TBoMS.

[0253] For example, when the fourth indication information indicates that the last four OFDM symbols of the first time slot (i.e., S time slot) and the following two time slots (both UL time slots) are used to transmit TBoMS, and the fifth indication information indicates that the last four OFDM symbols of the second time slot are used to transmit SRS, when the terminal device executes S402, as follows: Figure 9 As shown in (e), the SRS occupies the last four OFDM symbols of the second of the three time slots. The resources other than these four OFDM symbols, as indicated by the fourth indication information, are not used for TBoMS transmission. Optionally, the resources other than these four OFDM symbols, as indicated by the fourth indication information, can also be used to transmit other signals.

[0254] In this embodiment of the application, when there is a resource conflict between transmitting TBoMS PUSCH and SRS, that is, when TBoMS PUSCH and SRS occupy the same resources, SRS is transmitted first on the resource, thereby reducing the resource conflict between TBoMS PUSCH and SRS; the implementation method in S402a has the lowest cost and overhead.

[0255] The following combination Figure 10 The method 500 for sending information according to the embodiments of this application will be described in detail. Figure 10 This is a schematic interaction diagram of method 500 of this application. (Combined with...) Figure 10 Taking the consistent allocation of time domain resources in each time slot and the inconsistent allocation of time domain resources in each time slot as examples, this paper introduces nine possible implementations of the information transmission method in the embodiments of this application.

[0256] The following example uses the consistency of time-domain resources allocated to each time slot as an example, combined with... Figure 11 This section introduces one possible implementation method.

[0257] S501, the network device determines the resource mapping parameters for uplink transmission.

[0258] Network devices determine the resource mapping parameters based on the BG, modulation and coding scheme (MCS) table, and MCS index. These resource mapping parameters include the number of time slots K and RV indication information rv. id And RV sequence indication information repK-RV.

[0259] It should be understood that in this application, for the case of repeated Type A, one transmission opportunity is defined as one time slot. Therefore, in the possible implementations of repeated Type A, such as in possible implementation one, the "number of time slots" involved is the "number of transmission opportunities" in the MCS table.

[0260] The MCS tables are shown in Tables 3 to 7 below. Each MCS table includes the MCS index, modulation order Q, target code rate, spectral efficiency, and transmission timing set A and transmission timing set B. It should be noted that the PDSCH MCS tables are applicable to both uplink and downlink.

[0261] When performing LDPC encoding on information bits using LDPC BG1 or LDPC BG2 as shown in Table 2, the corresponding transmission time slot set A can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication, and then the time slot number K can be determined from the transmission time slot set A.

[0262] For example, if the MCS table is the MCS index table 1 of PDSCH, i.e., table 3, and the MCS index is 3, then when the network device determines the time slot set A to be {1,2,3,4}, then the value of the above time slot number K should be one of {1,2,3,4}.

[0263] It should be understood that in the first possible implementation, the set A of transmission timings includes K that satisfies the first condition: R·K≤1. Here, R is the coding rate. Since the number of information bits is N... info =N RE ·Q·R·ν·K, where N is the number of bits that the time-frequency resources can carry in a single transmission opportunity. TO =N RE ·Q·ν, then when the first condition is satisfied, N info ≤N TO Therefore, the information bits can be fully carried by the time-frequency resources of a transmission opportunity. When R is constant, K that satisfies the condition can be determined according to the first condition.

[0264] Figure 11 A schematic diagram illustrates one possible implementation of the information transmission method according to an embodiment of this application. Wherein, Figure 11 (a) in the example uses LDPC BG1. Figure 11 (b) in the example uses LDPC BG2 to illustrate resource mapping when the first condition is met. Figure 11 As shown in (a), the circular ring represents a circular buffer that stores the encoded bit string sequence obtained after channel coding of the information bits. The blank parts in the ring are the encoded parity bits, and the shaded parts are the encoded information bits. The BG1 mother code rate is 1 / 3, meaning that the information bits account for approximately 1 / 3 of the encoded bits. The encoded bit string sequence starting from RV0 can be completely carried by PUSCH#0. Figure 11 As shown in (b), the ring represents a circular buffer that stores the encoded bit string sequence obtained after channel coding of the information bits. The blank part in the ring is the encoded parity bit, and the shaded part in the ring is the encoded information bit. The BG2 mother code rate is 1 / 5, that is, the information bits account for about 1 / 5 of the encoded bits. The encoded bit string sequence starting from RV0 can be completely carried by PUSCH#0.

[0265] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the number of time slots K.

[0266] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0267] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0268] When the product of the known coding rate R and the number of time slots K transmitted by the network device is less than a first handover threshold μ (i.e., R·K≤μ), the terminal device uses a first resource mapping mechanism for resource mapping. When R·K≥μ, the terminal device uses a second resource mapping mechanism for resource mapping. For example, when LDPC coding uses BG1, μ can be a set... One of them, when LDPC encoding uses BG2, μ can be a set. one of the.

[0269] Figure 11 (c) shows a schematic diagram of a terminal device using the first resource mapping mechanism. The first resource mapping mechanism, namely the RV loop mechanism, uses the RV indication information rv... id As the RV cycle start point, the RV sequence indicator information repK-RV indicates the RV cycle order. The RV update granularity is one transmission opportunity. Encoded bits are retrieved from the corresponding position in the cycle buffer and mapped to the time-frequency resources of the corresponding transmission opportunity. For example, as... Figure 11 As shown in (c), starting from rvid=0, RV0, RV1, RV2, and RV3 are mapped to a transmission time.

[0270] Figure 11 (d) in the diagram illustrates a terminal device using the second resource mapping mechanism. The second resource mapping mechanism, also known as the continuous resource mapping mechanism, retrieves encoded bits from the circular buffer starting with the first encoded bit and maps them to time-frequency resources for K transmission opportunities; the RV is not updated. For example, as... Figure 11 As shown in (d) in the figure, with rv id Starting from 0, RV0 is mapped to a TBoMS transmission timing.

[0271] It should be noted that this second resource mapping mechanism performs rate matching at the granularity of all transmission times; in other words, it performs rate matching at the granularity of the entire TBoMS. Similarly, the bit interleaving granularity of the second resource mapping mechanism is also all transmission times or the entire TBoMS.

[0272] S504, the terminal device sends an uplink signal to the network device on the uplink transmission time-frequency resources; correspondingly, the network device receives the uplink signal from the terminal device on the uplink transmission time-frequency resources.

[0273] It should be noted that in the first possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0274] In this embodiment, when the product of the encoding code rate and the number of transmission opportunities is less than or equal to 1, the information bits in the encoded bit sequence can be fully carried by a single transmission opportunity. The network device determines a set of transmission opportunities that meet the conditions based on the encoding code rate, selects a transmission opportunity number from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the transmission opportunity number, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0275] The following example uses the consistency of time-domain resources allocated to each time slot as an example, combined with... Figure 12 This section introduces a second possible implementation method.

[0276] S501, the network device determines the resource mapping parameters for uplink transmission.

[0277] Network devices determine the resource mapping parameters based on the BG, modulation and coding scheme (MCS) table, and MCS index. These resource mapping parameters include the number of time slots K and RV indication information rv. id And RV sequence indication information repK-RV.

[0278] It should be understood that in this application, for the case of repeated Type A, one transmission opportunity is defined as one time slot. Therefore, in this possible implementation method one, the "number of time slots" involved is the "number of transmission opportunities" in the MCS table.

[0279] When using LDPC BG1 as shown in Table 2 for LDPC encoding of information bits, the corresponding transmission time slot number set B can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication. Then, the time slot number K is determined from the transmission time slot number set B, and the RV indication information rv is constrained. id The RV sequence indication information repK-RV ensures that RV0 and RV1 must be mapped to time-frequency resources of at least one transmission opportunity.

[0280] For example, if the MCS table is Table 4, which is the MCS index table 2 of PDSCH, and the MCS index is 5, then the network device determines the time slot number set B as {3} based on the MCS index. Therefore, the time slot number K = 3, and the RV indication information rv... id =1 or 3, and repK-RV is not configured, i.e., the default is {0,2,3,1}. It should be understood that "constraint RV indicator information rv" id The RV sequence indication information repK-RV, such that RV0 and RV1 must each be mapped to time-frequency resources of at least one transmission opportunity, can be understood in this example as follows: if there are only three transmission opportunities among the time-domain resources that can be mapped, then RV0 and RV1 must be mapped to time-frequency resources of at least one transmission opportunity. id When RV = 1, RV1, RV0, and RV2 can each be mapped to a transmission timing, rv id When RV=3, RV3, RV1, and RV0 can be mapped to a transmission timing.

[0281] It should be understood that the set of transmission timings B in the second possible implementation method includes K that satisfies the second condition: Where R is the encoding code rate. When using LDPCBG1 as shown in Table 2 for LDPC encoding of information bits, the mother code rate is 1 / 3, meaning that information bits account for approximately 1 / 3 of the encoded bits, and the information bits between RV0 and RV1 account for approximately [percentage missing] of the encoded information bit string. In the circular buffer, the space between RV0 and RV1 consists entirely of information bits, and RV1 also contains a portion of information bits. The number of information bits is N. info =N RE The number of encoded bits in the circular buffer is 3×N. info Then the number of information bits between RV0 and RV1 is The number of bits that the time-frequency resources of a single transmission opportunity can carry is N. TO =N RE ·Q·ν, then when the second condition is satisfied, N info ≥N TO ,and, This allows the information bits between RV0 and RV1 to be fully carried by the time-frequency resources at a given transmission time.

[0282] Figure 12 A schematic diagram illustrating a possible second implementation of the information transmission method according to an embodiment of this application is shown. For example... Figure 12 As shown, the circular ring represents a circular buffer that stores the encoded bit string sequence obtained after the information bits are channel-coded. The blank part in the ring is the encoded check bit, and the shaded part in the ring is the encoded information bit.

[0283] S502 to S504 are similar to the first possible implementation, and will not be elaborated on here.

[0284] It should be noted that in the second possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0285] In this embodiment, when the product of the encoding code rate and the number of transmission opportunities is greater than 1 and less than or equal to 22 / 17, and when RV0 and RV1 are constrained to be mapped to different transmission opportunities, the information bits in the encoded bit sequence can be fully carried by multiple transmission opportunities. The network device determines the set of transmission opportunities that meet the conditions based on the encoding code rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0286] The following example uses the consistency of time-domain resources allocated to each time slot as an example, combined with... Figure 13 Here is a third possible implementation method.

[0287] S501 includes all relevant content in determining the transmission time slot number set A in possible implementation one. Based on this, and according to the number M of transmission opportunities included in the time-frequency resources corresponding to the selected bit length, the upper limit of the transmission opportunity number set A is expanded by a factor of M to form the transmission opportunity number set AM. The number of time slots K is then determined within the transmission opportunity number set AM. It should be understood that, in conjunction with the aforementioned descriptions of "redundant version," "rate matching," and "bit selection" in this application, the length of the selected coded bit is the size of the mapped time-frequency resource. For example, if the mapped time-frequency resource is the time-frequency resource on M TOs, then the length of the selected bit is the time-frequency resource on M TOs, the granularity of rate matching is M TOs, and the RV update granularity is M transmission opportunities. Possible implementation three mainly discusses the case where M is greater than 1.

[0288] In addition, the resource mapping parameters sent by the network device to the terminal device in S501 include not only the number of time slots K, but also first indication information. The first indication information is used to indicate that the size of the mapped time-frequency resource is M transmission opportunities, or the first indication information is used to indicate that the length of the selected bit is M transmission opportunities, or the first indication information is used to indicate that the RV update granularity is M transmission opportunities.

[0289] It should be noted that this third possible implementation performs rate matching at the granularity of M transmission opportunities when mapping resources. In other words...

[0290] For example, the MCS table is the MCS index table 1 of PDSCH, i.e., table 3, the MCS index is 3, M=2, the time slot number set A is {1,2,3,4}, then the time slot number set AM is {1,2,..,8}, and the value of the time slot number K should be one of {1,2,..,8}.

[0291] It should be understood that in the third possible implementation, the set of transmission timings AM includes K that satisfies the third condition: R·K≤M, where R is the coding rate. Since the number of information bits is N... info =N RE The number of bits that can be carried by the time-frequency resources of M transmission opportunities is N. TO =N RE ·Q·ν·M, then when the third condition is satisfied, N info ≤N TO Therefore, the information bits can be fully carried by the time-frequency resources of M transmission opportunities.

[0292] In the third possible implementation, Figure 13 A schematic diagram illustrating a possible third implementation of the information transmission method according to an embodiment of this application is shown. Wherein, Figure 13 (a) in the example shows a schematic diagram of resource mapping when the third condition is met, using LDPC BG1 and M=2 as an example. Figure 13 As shown in (a), the circular ring represents a circular buffer that stores the encoded bit string sequence obtained after channel coding of information bits. The blank part in the ring is the encoded parity bit, and the shaded part in the ring is the encoded information bit. The BG1 mother code rate is 1 / 3, meaning that information bits account for approximately 1 / 3 of the encoded bits. The encoded bit string sequence starting with RV0 can be fully carried by PUSCH#0 and PUSCH#1, the encoded bit string starting with RV1 can be carried by PUSCH#6 and PUSCH#7, the encoded bit string starting with RV2 can be carried by PUSCH#2 and PUSCH#3, and the encoded bit string starting with RV3 can be carried by PUSCH#4 and PUSCH#5.

[0293] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the number of time slots K and the first indication information.

[0294] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0295] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0296] When the resource mapping parameters received by the terminal device include the aforementioned first indication information, and the product of the known coding rate R and the number of time slots K sent by the network device is less than the second handover threshold (i.e., R·K≤M·μ), the terminal device uses the fourth resource mapping mechanism for resource mapping. When R·K≥M·μ, the terminal device uses the second resource mapping mechanism for resource mapping. For example, when LDPC encoding uses BG1, μ can be a set... one of the.

[0297] For example, suppose the first indication information indicates M=2, and the RV indication information is rv id =0, the RV sequence is {0,2,3,1}, and the number of time slots K = 8. Figure 13 (b) shows a schematic diagram of a terminal device using the fourth resource mapping mechanism. Figure 13 As shown in (b), the fourth resource mapping mechanism uses the RV indicator information rvid as the RV cycle start point, the RV sequence indicator information repK-RV as the RV cycle order, and the RV update granularity as two transmission opportunities. It retrieves the coded bits from the corresponding positions in the circular buffer and maps them to the time-frequency resources of the corresponding transmission opportunities. It should be understood that the difference between the fourth resource mapping mechanism and the first resource mapping mechanism is that the RV update granularity of the fourth resource mapping mechanism is M transmission opportunities, that is, RV is updated once every M transmission opportunities. In other words, the difference between the fourth resource mapping mechanism and the first resource mapping mechanism is that the rate matching granularity of the fourth resource mapping mechanism is M transmission opportunities, and the bit interleaving granularity is also M transmission opportunities.

[0298] For cases where the terminal device uses the second resource mapping mechanism, please refer to the description in Possible Implementation Method 1.

[0299] S504 is similar to the first possible implementation, so I won't go into details here.

[0300] It should be noted that in the third possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0301] In this embodiment, when the product of the encoding code rate and the number of transmission opportunities is less than or equal to N (N is a positive integer greater than 1), the information bits in the encoded bit sequence can be fully carried by N transmission opportunities. The network device determines a set of transmission opportunities that satisfy the condition that the product of the encoding code rate and the number of transmission opportunities is less than or equal to 1 based on the encoding code rate. The upper limit of this set is increased by a factor of M, and the number of transmission opportunities is determined from this set. The network device sends the number of transmission opportunities to the terminal device and simultaneously sends an indication information indicating N to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, the information bits can be completely mapped to time-frequency resources for transmission, improving demodulation performance.

[0302] The following example uses the consistency of time-domain resources allocated to each time slot as an example, combined with... Figure 14 The fourth possible implementation method will be introduced.

[0303] S501, the network device determines the resource mapping parameters for uplink transmission.

[0304] The network device determines the resource mapping parameters based on the coding rate R, the number of time slots K, and the fourth condition, which is R·K≤N≤K. The resource mapping parameters include the number of time slots K and the second indication information. The second indication information is used to indicate that the update granularity of RV0 is N, that is, RV0 is updated once every N transmission opportunities.

[0305] It should be understood that the number of time slots K is predetermined by the network equipment. For example, it can be determined by a combination of factors such as coverage performance, service type, and quality of service (QoS).

[0306] It should be understood that the second indication information only indicates that the update granularity of RV0 is N. Therefore, in this possible implementation method four, the update granularity of RV2, RV3, and RV1 is still a transmission timing.

[0307] It should be understood that, in order to solve the problem that the time-frequency resources of a single transmission opportunity cannot carry the complete information bits, this possible implementation method four constrains the information bits to be fully carried by the time-frequency resources of N transmission opportunities, i.e., N info ≤N TO To solve this problem, we need to use N bits of information. info =N RE ·Q·R·ν·K, the number of bits that the time-frequency resources for N transmission opportunities can carry is N. TO =N RE ·Q·ν·N, must satisfy N info ≤N TO Therefore, R·K≤N. Since the number of transmission opportunities carrying RV0, N, is always less than the number of transmission opportunities carrying coded bits, K, the fourth condition is R·K≤N≤K.

[0308] For example, assuming R = 379 / 1024 and K = 4, when the fourth condition is satisfied, Then N = 2, 3, 4.

[0309] Optionally, when rv id When rvid = 0, RV0 can be mapped to the uplink transmission time and frequency resources as much as possible. Therefore, in this possible implementation method four, it is preferable to indicate rvid = 0 to the terminal device in the resource mapping parameters.

[0310] Figure 14 A schematic diagram illustrates a possible implementation four of the information transmission method according to an embodiment of this application. Wherein, Figure 14 (a) in the example shows a schematic diagram of resource mapping when the fourth condition is met, using LDPC BG1 and N=2 as an example. Figure 14 As shown in (a), the circular ring represents a circular buffer that stores the encoded bit string sequence obtained after channel coding of the information bits. The blank part in the ring is the encoded parity bit, and the shaded part in the ring is the encoded information bit. The BG1 mother code rate is 1 / 3, meaning that the information bits account for approximately 1 / 3 of the encoded bits. The encoded bit string sequence starting with RV0 can be fully carried by PUSCH#0 and PUSCH#1, and the encoded bit string sequences starting with RV1, RV2, and RV3 can be carried by PUSCH#4, PUSCH#2, and PUSCH#3, respectively.

[0311] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the number of time slots K and second indication information.

[0312] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0313] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0314] When the resource mapping parameters received by the terminal device include the aforementioned second indication information, the terminal device determines to use the third resource mapping mechanism based on the second indication information.

[0315] For example, suppose the second indication information indicates N=2, and the RV indication information is rv id =0, the RV sequence is {0,2,3,1}, and the number of time slots K = 8. Figure 14 (b) shows a schematic diagram of a terminal device using the fourth resource mapping mechanism. The third resource mapping mechanism uses RV indication information (rv). idAs the starting point of the RV cycle, the RV sequence indicator information repK-RV represents the RV cycle order. Encoded bits are retrieved from the corresponding positions in the circular buffer and mapped to the time-frequency resources at the corresponding transmission opportunities. Specifically, RV0 is updated with a granularity of two transmission opportunities, while RV1, RV2, and RV3 are updated with a granularity of one transmission opportunity. In other words, updating RV0 to RV2 requires two transmission opportunities, while other RV updates require only one. It should be understood that the only difference between the third resource mapping mechanism and the first resource mapping mechanism is that the RV0 update granularity is N transmission opportunities, meaning RV0 is updated once every N transmission opportunities.

[0316] S504 is similar to the first possible implementation, so I won't go into details here.

[0317] In this embodiment of the application, when information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission, thereby improving demodulation performance.

[0318] The following example uses the consistency of time-domain resources allocated to each time slot as an example, combined with... Figure 13 Fifthly, we will introduce five possible implementation methods.

[0319] The network device determines the resource mapping parameters based on the coding rate R, the number of time slots K, and the fifth condition, which is R·K≤M≤K. The resource mapping parameters include the number of time slots K and the first indication information. The first indication information is used to indicate that the update granularity of RV is N, that is, RV is updated once every N transmission opportunities.

[0320] It should be understood that the number of time slots K is predetermined by the network equipment. For example, it can be determined by a combination of factors such as coverage performance, service type, and quality of service (QoS).

[0321] It should be understood that, in order to solve the problem that the time-frequency resources of a single transmission opportunity cannot carry a complete set of information bits, this possible implementation method four constrains the information bits to be fully carried by the time-frequency resources of M transmission opportunities, i.e., N. info ≤N TO This will solve the problem. The derivation process of the fifth condition is similar to that of the fourth condition, and will not be elaborated here.

[0322] Optionally, when rvid=0, RV0 can be mapped to the uplink transmission time-frequency resources as much as possible. Therefore, in this possible implementation, it is preferable to indicate rvid=0 to the terminal device in the resource mapping parameters.

[0323] In the fifth possible implementation, Figure 13 A schematic diagram illustrates a fifth possible implementation of the information transmission method according to an embodiment of this application. Wherein, Figure 13 (a) in the example shows a schematic diagram of resource mapping when the fifth condition is met, using LDPC BG1 and M=2 as an example. Figure 13 As shown in (a), the circular ring represents a circular buffer that stores the encoded bit string sequence obtained after channel coding of information bits. The blank part in the ring is the encoded parity bit, and the shaded part in the ring is the encoded information bit. The BG1 mother code rate is 1 / 3, meaning that information bits account for approximately 1 / 3 of the encoded bits. The encoded bit string sequence starting with RV0 can be fully carried by PUSCH#0 and PUSCH#1, the encoded bit string starting with RV1 can be carried by PUSCH#6 and PUSCH#7, the encoded bit string starting with RV2 can be carried by PUSCH#2 and PUSCH#3, and the encoded bit string starting with RV3 can be carried by PUSCH#4 and PUSCH#5.

[0324] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the number of time slots K and the first indication information.

[0325] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0326] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0327] For specific implementation details, please refer to S503 in Possible Implementation Method 3, which will not be elaborated upon here.

[0328] S504 is similar to the first possible implementation, so I won't go into details here.

[0329] In this embodiment of the application, when information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission, thereby improving demodulation performance.

[0330] The following example uses a frame structure where the temporal resources allocated to each time slot can be inconsistent and symmetrical, combined with... Figure 15 This section introduces six possible implementation methods.

[0331] In the sixth possible implementation, Figure 15A schematic diagram illustrating a possible implementation six of the information transmission method according to an embodiment of this application is shown. It should be understood that... Figure 15 Taking the symmetrical frame structure of DDDSU as an example, Figure 15 In this context, D represents the DL time slot, U represents the UL time slot, and S represents the S time slot. For details regarding the transmission timing, please refer to the description of the transmission timing and corresponding information in this application. Figure 4 .like Figure 15 As shown in (a), a transmission opportunity consists of multiple consecutive uplink time domain resources, and each transmission opportunity includes the same number of time slots.

[0332] S501, the network device determines the resource mapping parameters for uplink transmission.

[0333] The network device determines the resource mapping parameters based on the BG, the modulation and coding scheme (MCS) table, and the MCS index. The resource mapping parameters include the transmission timing number K, the RV indication information rvid, and the RV sequence indication information repK-RV.

[0334] When LDPC encoding information bits using LDPC BG1 or LDPC BG2 as shown in Table 2, the corresponding transmission timing set A can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication, and then the transmission timing number K can be determined from the transmission timing set A.

[0335] It should be understood that the K included in the transmission timing set A in possible implementation method six satisfies the first condition: R·K≤1.

[0336] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the transmission timing number K.

[0337] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0338] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0339] When the product of the known coding rate R and the number of time slots K transmitted by the network device is less than a first handover threshold μ (i.e., R·K≤μ), the terminal device uses a first resource mapping mechanism for resource mapping. When R·K≥μ, the terminal device uses a second resource mapping mechanism for resource mapping. For example, when LDPC coding uses BG1, μ can be a set... One of them, when LDPC encoding uses BG2, μ can be a set. one of the.

[0340] Figure 15 (b) shows a schematic diagram of a terminal device using a first resource mapping mechanism. The first resource mapping mechanism, namely the RV loop mechanism, uses the RV indication information rv... id As the RV cycle start point, the RV sequence indicator information repK-RV indicates the RV cycle order. The RV update granularity is one transmission opportunity. Encoded bits are retrieved from the corresponding position in the cycle buffer and mapped to the time-frequency resources of the corresponding transmission opportunity. For example, as... Figure 15 As shown in (b) in the figure, with rv id Starting from 0, RV0, RV1, RV2, and RV3 are mapped to a transmission time.

[0341] Figure 15 (c) shows a schematic diagram of a terminal device using the second resource mapping mechanism. The second resource mapping mechanism, also known as the continuous resource mapping mechanism, retrieves encoded bits from the first encoded bit in the circular buffer and maps them to time-frequency resources for K transmission opportunities; the RV is not updated. For example, as... Figure 15 As shown in (c) in the figure, with rv id Starting from 0, RV0 is mapped to a TBoMS transmission timing.

[0342] It should be noted that this second resource mapping mechanism performs rate matching at the granularity of all transmission times; in other words, it performs rate matching at the granularity of the entire TBoMS. Similarly, the bit interleaving granularity of the second resource mapping mechanism is also all transmission times or the entire TBoMS.

[0343] S504, the terminal device sends an uplink signal to the network device on the uplink transmission time-frequency resources; correspondingly, the network device receives the uplink signal from the terminal device on the uplink transmission time-frequency resources.

[0344] It should be noted that in the sixth possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0345] In this embodiment, when the product of the encoding code rate and the number of transmission opportunities is less than or equal to 1, the information bits in the encoded bit sequence can be fully carried by a single transmission opportunity. The network device determines a set of transmission opportunities that meet the conditions based on the encoding code rate, selects a transmission opportunity number from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the transmission opportunity number, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0346] The following example uses a frame structure where the temporal resources allocated to each time slot can be inconsistent and symmetrical, combined with... Figure 15 This section introduces seven possible implementation methods.

[0347] In the seventh possible implementation, Figure 15 A schematic diagram illustrating a possible implementation seven of the information transmission method according to an embodiment of this application is shown. It should be understood that... Figure 15 Taking the symmetrical frame structure of DDDSU as an example, Figure 15 In this context, D represents the DL time slot, U represents the UL time slot, and S represents the S time slot. For details regarding the transmission timing, please refer to the description of the transmission timing and corresponding information in this application. Figure 4 .like Figure 15 As shown in (a), each transmission timing includes the same number of time slots.

[0348] S501, the network device determines the resource mapping parameters for uplink transmission.

[0349] The network device determines the resource mapping parameters based on the BG, the modulation and coding scheme (MCS) table, and the MCS index. The resource mapping parameters include the transmission timing number K, the RV indication information rvid, and the RV sequence indication information repK-RV.

[0350] When using LDPC BG1 as shown in Table 2 for LDPC encoding of information bits, the corresponding transmission timing set B can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication. Then, the transmission timing number K is determined from the transmission timing set B. At the same time, the RV indication information rvid and the RV sequence indication information repK-RV are constrained so that RV0 and RV1 must be mapped to the time-frequency resources of at least one transmission timing.

[0351] It should be understood that the set of transmission timings B in the second possible implementation method includes K that satisfies the second condition: Where R is the coding rate.

[0352] S502 to S504 are similar to possible implementation six, and will not be elaborated on here.

[0353] It should be noted that in the seventh possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0354] In this embodiment, when the product of the encoding code rate and the number of transmission opportunities is greater than 1 and less than or equal to 22 / 17, and when RV0 and RV1 are constrained to be mapped to different transmission opportunities, the information bits in the encoded bit sequence can be fully carried by multiple transmission opportunities. The network device determines the set of transmission opportunities that meet the conditions based on the encoding code rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0355] The following example uses a frame structure where the temporal resources allocated to each time slot can be inconsistent and the frame structure is asymmetric. Figure 16 This section introduces eight possible implementation methods.

[0356] In the eighth possible implementation, Figure 16 A schematic diagram illustrating eight possible implementations of the information transmission method according to embodiments of this application is shown. It should be understood that... Figure 16 Taking the asymmetric frame structure DDDSUDSUU as an example, Figure 16 In this context, D represents the DL time slot, U represents the UL time slot, and S represents the S time slot. For details regarding the transmission timing, please refer to the description of the transmission timing and corresponding information in this application. Figure 4 .like Figure 16 As shown in (a), a transmission opportunity consists of multiple consecutive uplink time domain resources, and each transmission opportunity includes a different number of time slots.

[0357] The network device determines the resource mapping parameters based on the BG, the modulation and coding scheme (MCS) table, and the MCS index. The resource mapping parameters include the transmission timing number K, the RV indication information rvid, and the RV sequence indication information repK-RV.

[0358] When performing LDPC encoding on information bits using LDPC BG1 or LDPC BG2 as shown in Table 2, the corresponding transmission timing set A can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication. Furthermore, the upper limit of the transmission timing set A needs to be increased by a factor of P to obtain the transmission timing set AP. Simultaneously, RV0 must be mapped to a long transmission timing. Here, P can be... or "Long transmission opportunity" can be understood as a transmission opportunity that includes more time slots within a single TBoMS transmission opportunity, for example... Figure 16 The transmission timing corresponding to “SUU” in (a) of the text.

[0359] For example, when the transmission timing set A determined by the MCS index and MCS table is {1, 2, 3, 4, 5}, and L = 2, If the transmission timing set AP is {1, 2, 3, 4, 6}, then the transmission timing K should be one of {1, 2, 3, 4, 5, 6}. It should be understood that the upper limit of 6 for the transmission timing set AP is based on... The result is obtained by rounding down.

[0360] It should be understood that in possible implementation eight, the K included in the transmission time set AP satisfies the sixth condition: R·K≤P. Assuming a TBoMS transmission includes an even number of TOs K, when using BG1 and BG2 as shown in Table 2 for LDPC encoding, the number of information bits included in the "SU" time slot is... The “SUU” time slot includes the following number of information bits: in, L depends on the frame structure. Figure 16 Taking (a) as an example, the ratio of the number of U timeslots in the second half of the cycle (2 U timeslots in the "DDSUU" timeslot) to the number of U timeslots in the first half of the cycle (1 U timeslot in the "DDDSU" timeslot), i.e., L = 2, is required to ensure that a long transmission time slot can fully carry the information bits N. info =N info1 +N info2 It needs to meet the following requirements:

[0361]

[0362]

[0363]

[0364] therefore, or,

[0365] S502, the network device sends resource mapping parameters to the terminal device, and the terminal device receives the resource mapping parameters from the network device, which include the number of time slots K.

[0366] Alternatively, network devices can send resource mapping parameters via higher-level signaling or DCI.

[0367] S503, the terminal device maps the encoded bits to the uplink transmission time and frequency resources according to the resource mapping parameters.

[0368] When the product of the known coding rate R and the number of time slots K transmitted by the network device is less than the third handover threshold Pμ, i.e., R·K≤Pμ, the terminal device uses the first resource mapping mechanism for resource mapping. When R·K≥Pμ, the terminal device uses the second resource mapping mechanism for resource mapping. Here, P can be... or For example, when LDPC encoding uses BG1, μ can be a set One of them, when LDPC encoding uses BG2, μ can be a set. one of the.

[0369] Figure 16 (b) shows a schematic diagram of a terminal device using a first resource mapping mechanism. The first resource mapping mechanism, namely the RV loop mechanism, uses the RV indication information rv... id As the RV cycle start point, the RV sequence indicator information repK-RV indicates the RV cycle order. The RV update granularity is one transmission opportunity. Encoded bits are retrieved from the corresponding position in the cycle buffer and mapped to the time-frequency resources of the corresponding transmission opportunity. For example, as... Figure 16 As shown in (b), starting from rvid=1, RV0, RV1, RV2 and RV3 are mapped to a transmission timing, and RV0 is mapped to a long transmission timing.

[0370] Figure 16 (c) shows a schematic diagram of a terminal device using the second resource mapping mechanism. The second resource mapping mechanism, also known as the continuous resource mapping mechanism, retrieves encoded bits from the first encoded bit in the circular buffer and maps them to time-frequency resources for K transmission opportunities; the RV is not updated. For example, as... Figure 16 As shown in (c), RV0 is mapped to a TBoMS transmission timing starting from rvid=0.

[0371] It should be noted that this second resource mapping mechanism performs rate matching at the granularity of all transmission times; in other words, it performs rate matching at the granularity of the entire TBoMS. Similarly, the bit interleaving granularity of the second resource mapping mechanism is also all transmission times or the entire TBoMS.

[0372] S504, the terminal device sends an uplink signal to the network device on the uplink transmission time-frequency resources; correspondingly, the network device receives the uplink signal from the terminal device on the uplink transmission time-frequency resources.

[0373] It should be noted that in the eighth possible implementation, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and the S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and the S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0374] In this embodiment, when the product of the coding rate and the number of transmission opportunities is less than or equal to P (P≥1), the information bits in the encoded bit sequence can be fully carried by a single transmission opportunity. The network device determines a set of transmission opportunities that meet the conditions based on the coding rate, selects a transmission opportunity number from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the transmission opportunity number, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0375] The following example uses a frame structure where the temporal resources allocated to each time slot can be inconsistent and the frame structure is asymmetric. Figure 16 This section introduces nine possible implementation methods.

[0376] S501, the network device determines the resource mapping parameters for uplink transmission.

[0377] The network device determines the resource mapping parameters based on the BG, modulation and coding scheme (MCS) table and MCS index. The resource mapping parameters include the number of time slots K, RV indication information rvid and RV sequence indication information repK-RV.

[0378] When using LDPC BG1 as shown in Table 2 for LDPC encoding of information bits, the corresponding transmission opportunity number set B can be selected from the MCS table (Tables 3 to 7 in this application) according to the MCS index indication. Further, the upper limit of the number of transmission opportunities in the transmission opportunity number set B needs to be expanded by P times to obtain the transmission opportunity number set BP. Then, the number of time slots K is determined in the transmission opportunity number set BP. At the same time, the RV indication information rvid and the RV sequence indication information repK-RV are constrained so that RV0 is mapped to the time-frequency resources of long transmission opportunities.

[0379] It should be understood that the set of transmission timings B in the second possible implementation method includes K that satisfies the second condition: Where P can be or Where R is the coding rate.

[0380] S502 to S504 are similar to those in the eighth possible implementation, and will not be elaborated on here.

[0381] It should be noted that in possible implementation nine, when the network device executes S501, this application does not limit the resource mapping method executed by the terminal device, and S503 executed by the terminal device can be replaced by various existing resource mapping methods; when the terminal device executes S503, this application does not limit the method for determining the number of transmission opportunities executed by the network device, and S501 executed by the network device can be replaced by various existing methods for determining the number of transmission opportunities.

[0382] In this embodiment, when the product of the coding rate and the number of transmission opportunities is greater than P and less than or equal to 22 / 17 times P (P≥1), and RV0 and RV1 are constrained to be mapped to different transmission opportunities, the information bits in the encoded bit sequence can be fully carried by multiple transmission opportunities. The network device determines the set of transmission opportunities that meet the conditions based on the coding rate, selects the number of transmission opportunities from this set, and sends it to the terminal device. When the terminal device performs resource mapping based on the number of transmission opportunities, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0383] The following combination Figure 17 The method 600 for sending information in this application will be described in detail below. There are multiple ways to implement method 600; three possible methods will be described in detail below.

[0384] When performing continuous resource mapping, the terminal device reads the starting position of the encoded bits from the circular buffer at position Z for each TO. c The granularity is an integer multiple of Z, where Z is the integer multiple of Z. cThis represents the LDPC lifting size, meaning that LDPC encoding outputs encoded bits in granularity that is an integer multiple of Zc.

[0385] Method 1, such as Figure 17 As shown in (a) in the figure, y k Indicates the position of the first bit mapped to the k-th transmission timing in the circular buffer, x k Indicates the position of the last bit mapped to the k-th transmission timing in the circular buffer, x k =0,1,2,...N cb -1, where N cb This indicates the number of encoded bits in the circular buffer. Indicates to Round down to the nearest integer.

[0386]

[0387] Method 2, such as Figure 17 As shown in (b) in the figure, y k Indicates the position of the first bit mapped to the k-th transmission timing in the circular buffer, x k Indicates the position of the last bit mapped to the k-th transmission timing in the circular buffer, x k =0,1,2,...N cb -1, where N cb This indicates the number of encoded bits in the circular buffer. Indicates to Round up.

[0388]

[0389] Method 3, such as Figure 17 As shown in (c) in the figure, y k Indicates the position of the first bit mapped to the k-th transmission timing in the circular buffer, x k Indicates the position of the last bit mapped to the k-th transmission timing in the circular buffer, x k =0,1,2,...N cb -1, where N cb This indicates the number of encoded bits in the circular buffer. Indicates to rounding.

[0390]

[0391] As an example, Z cWhen k=10 and k=0, the first LDPC encoding results in 50 bits, while the encoded bits mapped to TO#0 are only 45, i.e., x k =44. Therefore, according to method one, the position of the first bit in the bit sequence mapped to TO#1 is y. k+1 =40; According to method two, y k+1 =50; According to method three, y k+1 =40.

[0392] As an example, Z c When k=10 and k=0, the first LDPC encoding results in 50 bits, while the encoded bits mapped to TO#0 are only 48, i.e., x k =48. Therefore, according to method one, y k+1 =40; According to method two, y k+1 =50; According to method three, y k+1 =50.

[0393] In this embodiment of the application, when the terminal performs resource mapping, the step of finding the position of the last bit mapped to the previous transmission timing or time slot in the circular buffer is reduced, which simplifies the calculation in the mapping process and saves overhead.

[0394] It should be understood that the information transmission method 600 of this application can be implemented alone or in combination with other embodiments of the information transmission method of this application.

[0395] The following combination Figure 18 The method 700 for sending information in this application will be described in detail.

[0396] like Figure 18 As shown in (a) in S701, the network device sends the TBoMS retransmission count to the terminal device, and the terminal device receives the TBoMS retransmission count from the network device accordingly.

[0397] S702, the terminal device performs resource mapping based on the number of TBoMS repeated transmissions, and the resource mapping method is the same as described above.

[0398] It should be noted that, assuming that transmitting one TBoMS requires K transmission opportunities, and the number of times TBoMS is repeatedly transmitted is S, S can be equal to 1, 2, 3, 4... S does not necessarily need to be equal to K.

[0399] For example, such as Figure 18 As shown in (b), transmitting one TBoMS requires 4 transmission opportunities. The number of TBoMS repeated transmissions is 2, which can be understood as repeated transmission only for RV0 and RV2.

[0400] In this embodiment of the application, when performing repeated resource mapping, TBoMS is partially retransmitted, which can shorten the latency of TBoMS retransmission while improving transmission reliability and accuracy.

[0401] Table 3 MCS Index of PDSCH (Table 1)

[0402]

[0403] Table 4 MCS Index of PDSCH (Table 2)

[0404]

[0405] Table 5. MCS Index of PDSCH (Table 3)

[0406]

[0407] Table 6 PUSCH's MCS Index Table 1

[0408]

[0409] Table 7 PUSCH's MCS Index Table 2

[0410]

[0411] The above, combined with Figures 7 to 18 The methods provided in the embodiments of this application are described in detail below. Figures 19 to 20 The apparatus provided in the embodiments of this application will be described in detail.

[0412] Figure 19 This is a schematic block diagram of a communication device for resource mapping provided in an embodiment of this application. Figure 19 As shown, the communication device 10 may include a transceiver module 11 and a processing module 12.

[0413] The transceiver module 11 can be used to receive information sent by other devices and to send information to other devices. For example, it can receive fourth indication information or send indication information of the first parameter. The processing module 12 can be used to process the content of the device, for example, mapping the first bit sequence to K transmission opportunities according to the first parameter.

[0414] In one possible design, the communication device 10 may correspond to the network device in the above method embodiments.

[0415] Specifically, the communication device 10 may correspond to a network device in any of the methods 200 to 700 according to the embodiments of this application. The communication device 10 may include a module for performing the operations performed by the network device in the corresponding method, and each unit in the communication device 10 is for implementing the operations performed by the network device in the corresponding method.

[0416] For example, when the communication device 10 corresponds to the network device in method 200, the transceiver module 11 is used to perform step S202, and the processing module 12 is used to instruct step S201.

[0417] For example, when the communication device 10 corresponds to the network device in method 300, the transceiver module 11 is used to perform step S302, and the processing module 12 is used to instruct step S301.

[0418] For example, when the communication device 10 corresponds to the network device in method 400, the transceiver module 11 is used to perform steps S401 and S402.

[0419] For example, when the communication device 10 corresponds to the network device in method 500, the transceiver module 11 is used to execute steps S502 and S504, and the processing module 12 is used to instruct step S501.

[0420] For example, when the communication device 10 corresponds to the network device in method 700, the transceiver module 11 is used to perform step S701.

[0421] Specifically, in one possible embodiment, the transceiver module 11 is configured to determine the first parameter from a set of values ​​for the first parameter, the set of values ​​for the first parameter being determined according to the coding rate or modulation coding method of the first bit sequence, the first bit sequence being an encoded bit sequence, and the first parameter being the transmission timing or number of time units used to carry the first bit sequence; the transceiver module 11 is also configured to send indication information of the first parameter to the terminal device.

[0422] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0423] Wherein, the product of the encoding code rate and the value of the first parameter is less than or equal to N, where N is a positive integer.

[0424] The set of values ​​for the first parameter is {1,2,3,...N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0425] The second bit sequence is carried by N transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities.

[0426] When N is greater than 1, the network device sends a first indication message to the terminal device, which indicates that the second bit sequence is carried by N transmission opportunities.

[0427] Wherein, the product of the encoding code rate and the value of the first parameter is less than or equal to P, and P≥1.

[0428] in, or L is determined based on the frame structure, and L > 0.

[0429] The set of values ​​for the first parameter is as follows: This indicates that P·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0430] The second bit sequence is carried by one transmission opportunity. The second bit sequence is the bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in one transmission opportunity.

[0431] Wherein, the product of the encoding code rate and the value of the first parameter is greater than N and less than or equal to M, M>N, and N is a positive integer.

[0432] Where M is N times.

[0433] The second and third bit sequences in the first bit sequence are each carried by at least one transmission opportunity. The second bit sequence is a bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities. The third bit sequence is at least one bit sequence in the first bit sequence that starts at a different point than the second bit sequence.

[0434] When N is greater than 1, the network device sends a second indication message to the terminal device. The second indication message is used to indicate that the second bit sequence is carried by N transmission opportunities.

[0435] The set of values ​​for the first parameter is as follows: in, This indicates rounding down M·k, where k is less than or equal to the reciprocal of the code rate, and k is a positive integer.

[0436] Wherein, the product of the coding rate and the value of the first parameter is greater than P and less than or equal to Q, P≥1, Q>P.

[0437] in, or Q equals The P and L values ​​are determined based on the frame structure, and L > 0.

[0438] The second and third bit sequences in the first bit sequence are each carried by at least one transmission opportunity. The second bit sequence is a bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in one transmission opportunity. The third bit sequence is at least one bit sequence in the first bit sequence that starts at a different point than the second bit sequence.

[0439] The set of values ​​for the first parameter is as follows: in, This indicates rounding down from P·k+1. This indicates that Q·k is rounded down, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer.

[0440] The number of time slots included in the transmission timing carrying the second bit sequence is greater than the number of time slots included in the transmission timing carrying the fourth bit sequence. The second bit sequence is the bit sequence in the first bit sequence that starts with the first bit in the circular buffer, and the fourth bit sequence is at least one bit sequence in the first bit sequence that starts with any bit other than the first bit in the circular buffer.

[0441] The device also includes a processing module for determining the coding rate based on the modulation and coding scheme (MCS).

[0442] The transceiver module 11 is further configured to send a third instruction message to the terminal device. The third instruction message is configured to instruct the terminal device to map the first bit sequence to K transmission opportunities and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

[0443] Specifically, in another possible embodiment, the processing module 12 is used to generate first indication information; the transceiver module 11 is used to send the indication information of the first parameter and the first indication information to the terminal device. The first parameter is the number of transmission opportunities or time units used to carry the first bit sequence. The first indication information is used to indicate that the second bit sequence is carried by N transmission opportunities. The first bit sequence is an encoded bit sequence. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities. N is a positive integer and N is less than or equal to the value of the first parameter.

[0444] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0445] Where N is greater than or equal to the product of the coding rate and the first parameter.

[0446] The first indication information is also used to indicate that the fifth bit sequence is carried by N transmission opportunities, and the fifth bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from the bits other than the first bit in the circular buffer.

[0447] The device further includes a transceiver module 11, which is used to send a third indication information to the terminal device. The third indication information is used to instruct the terminal device to map the first bit sequence to K transmission opportunities and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

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

[0449] Specifically, the communication device 10 may correspond to a terminal device in any of the methods 200 to 700 according to the embodiments of this application. The communication device 10 may include a module for performing the operations performed by the terminal device in the corresponding method, and each unit in the communication device 10 is for implementing the operations performed by the terminal device in the corresponding method.

[0450] For example, when the communication device 10 corresponds to the terminal device in method 200, the transceiver module 11 is used to perform step S202, and the processing module 12 is used to perform step S203.

[0451] For example, when the communication device 10 corresponds to the terminal device in method 300, the transceiver module 11 is used to perform step S302, and the processing module 12 is used to perform step S303.

[0452] For example, when the communication device 10 corresponds to the terminal device in method 400, the transceiver module 11 is used to execute steps S401 and S402.

[0453] For example, when the communication device 10 corresponds to the terminal device in method 500, the transceiver module 11 is used to execute steps S502 and S504, and the processing module 12 is used to execute step S503.

[0454] For example, when the communication device 10 corresponds to the terminal device in method 700, the transceiver module 11 is used to perform step S701, and the processing module 12 is used to perform step S702.

[0455] Specifically, in one possible embodiment, the transceiver module 11 is used to receive a first parameter from the network device, and the processing module 12 is used to map the first bit sequence to K transmission opportunities according to the first parameter, where K is the value of the first parameter and K is a positive integer. When the product of the coding rate of the first bit sequence and K is less than or equal to a first threshold value, the terminal device will map the bit sequence starting at position i in the circular buffer to the i-th transmission opportunity, where position i corresponds to the i-th transmission opportunity, 1≤i≤K, and i is an integer. The first bit sequence includes the bit sequence, and the length of the bit sequence is associated with the number of time slots included in a transmission opportunity.

[0456] In the above scheme, when the number of transmission opportunities carrying the encoded bit sequence (hereinafter referred to as the first parameter) meets certain conditions, the information bits in the encoded bit sequence can be fully carried by one or more transmission opportunities. The network device determines the set of values ​​for the first parameter through the encoding code rate, selects the first parameter from the set of values, and sends it to the terminal device. When the terminal device performs resource mapping based on the first parameter, it can ensure that the information bits are completely mapped to time-frequency resources for transmission, thereby improving demodulation performance.

[0457] Here, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the circular buffer. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the circular buffer. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0458] The first parameter is determined based on the coding rate or modulation coding method of the first bit sequence, the first bit sequence is the encoded bit sequence, and the first parameter is the number of transmission opportunities or time units used to carry the first bit sequence.

[0459] The first threshold value is P times any of the following values: 0.9, 0.948, 0.95, 1, 1.2 Alternatively, the first threshold value can be P times any of the following values: 0.9, 0.948, 0.95, 1.

[0460] in, or Or 1, where L is determined according to the frame structure, and L is greater than 0.

[0461] When the product of the coding rate of the first bit sequence and K is greater than the first threshold value, the terminal device maps the second bit sequence to K transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer. The length of the second bit sequence is related to the number of time slots included in the K transmission opportunities.

[0462] Specifically, in another possible embodiment, the transceiver module 11 is configured to receive indication information of a first parameter and a first indication information from the network device. The first parameter is the number of transmission opportunities or time units used to carry the first bit sequence. The first indication information is used to indicate that the second bit sequence is carried by N transmission opportunities. The first bit sequence is an encoded bit sequence. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit in the circular buffer. The length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities. N is a positive integer, and N is less than or equal to the value of the first parameter. The processing module 12 is configured to map the first bit sequence to K transmission opportunities according to the indication information of the first parameter and the first indication information. K is the value of the first parameter and K is a positive integer.

[0463] In the above scheme, when the information bits cannot be fully carried by the time-frequency resources of a transmission opportunity, the network device sends an indication message to the terminal device to indicate the number of transmission opportunities for the terminal device to carry the information bits. The terminal device performs resource mapping according to the number of transmission opportunities indicated by the network device, which enables the information bits to be fully mapped to the time-frequency resources for transmission and improves demodulation performance.

[0464] Here, the last bit of the bit sequence mapped to the k-th transmission timing is the x-th bit in the circular buffer. k The starting point of the bit sequence mapped to the (k+1)th transmission opportunity is the y-th bit in the circular buffer. k+1 bits, of which or, or, in, Indicates to Round down to the nearest integer. Indicates to Round up. Indicates to Rounding to the nearest whole number, Z c It is equal to A times the low-density parity-check (LDPC) factor, where A is a positive integer, x k k is an integer, greater than or equal to 0, and k is an integer.

[0465] Specifically, the processing module 12 is used to map the second bit sequence to N transmission opportunities and the third bit sequence to one transmission opportunity. The third bit sequence is at least one bit sequence among the bit sequences in the first bit sequence that start from the bits other than the first bit in the circular buffer. The length of the second bit sequence is associated with the number of time slots included in the N transmission opportunities, and the length of the third bit sequence is associated with the number of time slots included in one transmission opportunity.

[0466] Specifically, the processing module 12 is used to map the second bit sequence and the third bit sequence to N transmission opportunities when the product of the coding rate of the first bit sequence and K is less than or equal to the second threshold value. The third bit sequence is at least one bit sequence in the first bit sequence that starts from the bits other than the first bit in the circular buffer. The lengths of the second bit sequence and the third bit sequence are related to the number of time slots included in the N transmission opportunities.

[0467] Specifically, when the product of the coding rate of the first bit sequence and K is greater than the second threshold value, the processing module is used to map the second bit sequence to the K transmission opportunities.

[0468] The second threshold value is any one of the following: 0.9, 0.948, 0.95, 1.

[0469] Specifically, in another possible embodiment, the transceiver module 11 is configured to receive a fourth indication information and a fifth indication information from the network device, wherein the fourth indication information indicates that the first resource is used to carry Transmission Block Over Multi-Time Slot Transport (TBoMS) and the fifth indication information indicates that the first resource is used to carry a Sounding Reference Signal (SRS); the transceiver module 11 is also configured to transmit the SRS with the network device according to the first resource.

[0470] The above scheme prioritizes the transmission of SRS on the resource when there is a resource conflict between TBoMS PUSCH and SRS, i.e. when TBoMS PUSCH and SRS occupy the same resource, thereby reducing the resource conflict between TBoMS PUSCH and SRS.

[0471] The fourth indication information is further used to indicate that the second resource is used to carry the TBoMS, and the transceiver module 11 is further used to transmit the TBoMS with the network device according to the second resource; or, the transceiver module 11 is further used to transmit the TBoMS with the network device according to the third resource, the third resource being a resource in the second resource other than the resource in the same time slot as the first resource; or, the transceiver module 11 is further used to transmit the TBoMS with the network device according to the fourth resource, the fourth resource being a resource in the second resource whose timing precedes that of the first resource; or, the transceiver module 11 is further used not to transmit the TBoMS.

[0472] Figure 20 A schematic diagram of a resource mapping apparatus 20 provided in an embodiment of this application.

[0473] In one possible design, the device 20 can be a network device, or a chip or chip system located on the network device.

[0474] In one possible design, the device 20 can be a terminal device, including various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem, as well as various forms of terminals, mobile stations, terminals, user equipment, soft terminals, etc., or it can be a chip or chip system located on the terminal device.

[0475] The device 20 may include a processor 21 (i.e., an example of a processing module) and a memory 22. The memory 22 is used to store instructions, and the processor 21 is used to execute the instructions stored in the memory 22 to cause the device 20 to perform, for example... Figures 4 to 9 The steps performed by the device in the various possible designs described above are corresponding to the methods described above.

[0476] Furthermore, the device 20 may also 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, memory 22, input port 23, and output port 24 can communicate with each other through internal connection paths to transmit control and / or data signals. The memory 22 is used to store computer programs, and the processor 21 can be used to call and run the computer programs from the memory 22 to control the input port 23 to receive signals and control the output port 24 to send signals, thus completing the steps of the terminal device, wireless access network device, UE, or base station in the above method. The memory 22 may be integrated into the processor 21 or may be disposed separately from the processor 21.

[0477] Optionally, if the message transmission device 20 is a communication device, the input port 23 is a receiver, and the output port 24 is a transmitter. The receiver and transmitter can be the same or different physical entities. When they are the same physical entity, they can be collectively referred to as transceivers.

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

[0479] As one implementation method, the functions of input port 23 and output port 34 can be implemented using transceiver circuits or dedicated transceiver chips. Processor 21 can be implemented using dedicated processing chips, processing circuits, processors, or general-purpose chips.

[0480] As another implementation method, the device provided in the embodiments of this application can be implemented using a general-purpose computer. The program code that implements the functions of processor 21, input port 23 and output port 24 is stored in memory 22, and the general-purpose processor implements the functions of processor 21, input port 23 and output port 24 by executing the code in memory 22.

[0481] Each module or unit in device 20 can be used to perform the actions or processes performed by the device (e.g., terminal device) that performs random access in the above method. Here, to avoid redundancy, its detailed description is omitted.

[0482] For the concepts, explanations, detailed descriptions, and other steps related to the technical solutions provided in the embodiments of this application involved in the device 20, please refer to the descriptions of these contents in the foregoing methods or other embodiments, which will not be repeated here.

[0483] It should be understood that in the embodiments of this application, the processor can be a central processing unit (CPU), or it can be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor.

[0484] This application also provides a computer-readable storage medium storing computer instructions for implementing the methods executed by a network device or a terminal device in the above-described method embodiments.

[0485] For example, when the computer program is executed by a computer, it enables the computer to implement the methods executed by the network device or terminal device in the above method embodiments.

[0486] This application also provides a computer-readable storage medium storing computer instructions for implementing the methods executed by a network device or a terminal device in the above-described method embodiments.

[0487] For example, when the computer program is executed by a computer, it enables the computer to implement the methods executed by the network device or terminal device in the above method embodiments.

[0488] It should also be understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can 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 can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM).

[0489] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. This computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer program are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0490] It should be understood that the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this article generally indicates that the preceding and following related objects have an "or" relationship.

[0491] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0492] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0493] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the various embodiments of this application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. If the function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[0494] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for sending information, characterized in that, include: The network device determines the first parameter from the set of values ​​of the first parameter. The set of values ​​of the first parameter is determined according to the coding rate or modulation coding method of the first bit sequence. The first bit sequence is the encoded bit sequence. The first parameter is the transmission timing or number of time units used to carry the first bit sequence. The network device sends the indication information of the first parameter to the terminal device; The set of values ​​for the first parameter is a subset of {1, 2, 3, ..., N·k}, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer and N is a positive integer.

2. The method according to claim 1, characterized in that, When N is greater than 1, the network device sends a first indication message to the terminal device. The first indication message is used to indicate that the second bit sequence is carried by N transmission opportunities. The second bit sequence is the bit sequence in the first bit sequence starting from the first bit. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities.

3. The method according to claim 1, characterized in that, The set of possible values ​​for the first parameter is: a subset of This means rounding down P·k, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer, P is a real number, and P≥1.

4. The method according to claim 3, characterized in that... The second bit sequence is carried by one transmission opportunity, wherein the second bit sequence is the bit sequence in the first bit sequence starting from the first bit, and the length of the second bit sequence is related to the number of time slots included in one transmission opportunity.

5. The method according to claim 1, characterized in that, The set of possible values ​​for the first parameter is: A subset of, in which, This means rounding down M·k, where k is less than or equal to the reciprocal of the encoded bit rate, and k is a positive integer, N is a positive integer, and M > N.

6. The method according to claim 5, characterized in that, The second and third bit sequences in the first bit sequence are each carried by at least one transmission opportunity. The second bit sequence is the bit sequence in the first bit sequence that starts with the first bit. The length of the second bit sequence is related to the number of time slots included in the N transmission opportunities. The third bit sequence is at least one bit sequence in the first bit sequence that starts with a different bit than the second bit sequence.

7. The method according to claim 1, characterized in that, The set of possible values ​​for the first parameter is: A subset of, in which, This indicates rounding down from P·k+1. This means rounding down Q·k, where k is less than or equal to the reciprocal of the coding rate, and k is a positive integer. P and Q are real numbers, where P≥1 and Q>P.

8. The method according to claim 7, characterized in that, The second and third bit sequences in the first bit sequence are each carried by at least one transmission opportunity. The second bit sequence is a bit sequence in the first bit sequence that starts with the first bit in the circular buffer. The length of the second bit sequence is associated with the number of time slots included in one transmission opportunity. The third bit sequence is at least one bit sequence in the first bit sequence that starts at a different point than the second bit sequence.

9. The method according to any one of claims 3, 4, 7, and 8, characterized in that, The number of time slots included in the transmission timing carrying the second bit sequence is greater than the number of time slots included in the transmission timing carrying the fourth bit sequence, wherein the second bit sequence is the bit sequence in the first bit sequence that starts with the first bit, and the fourth bit sequence is at least one bit sequence in the first bit sequence that starts with a bit other than the first bit.

10. The method according to any one of claims 1 to 8, characterized in that, The method further includes: The network device sends a third indication message to the terminal device, the third indication message being used to instruct the terminal device to map the first bit sequence to K transmission opportunities, and then to map the first bit sequence to B transmission opportunities, where K is the value of the first parameter and B is a positive integer.

11. An information transmission device, characterized in that, include: A module for implementing the method of any one of claims 1 to 10.

12. A communication device, characterized in that, include: Processor and memory; The memory is used to store computer programs; The processor is configured to execute a computer program stored in the memory, so that the communication device performs the method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 10.

14. A chip, characterized in that, include: Memory, used to store computer programs; A processor for reading and executing the computer program stored in the memory, wherein when the computer program is executed, the processor performs the method as described in any one of claims 1 to 10.

15. A computer program product, characterized in that, The computer program product includes computer program code that, when run on a computer, causes the computer to perform the method as described in any one of claims 1 to 10.

Images