Communication method and apparatus

Abstract

A communication method and apparatus, relating to the technical field of communications, and capable of reducing interference between a transport block in a physical uplink shared channel (PUSCH) repetition Type B transmission mode and a transport block in a PUSCH repetition Type A transmission mode. The method comprises: a terminal device receiving first signaling; and outputting a kth signal on a kth first PUSCH transmission. The first signaling is used for scheduling a first PUSCH transmission, the first PUSCH transmission carries a first transport block, the maximum number of transmissions of the first PUSCH transmission is K, a single transmission of the first transport block occupies MN / K time units, M is the maximum number of transmissions of a second PUSCH transmission, the second PUSCH transmission carries a second transport block, and a single transmission of the second transport block occupies N time units; M, N, and K are all positive integers; the kth signal is determined on the basis of the first transport block and a kth element in an orthogonal cover code, k=1, 2, ..., K, the sum of an ith element, a (K / M+i)-th element, a (2K / M+i)-th element, …, and an ((M-1)K / M+i)-th element in the orthogonal cover code is 0, and i is a positive integer less than or equal to K / M.

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese Patent Application No. 202411370459.0, filed on September 27, 2024, and entitled "Communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and in particular to a communication method and apparatus. BACKGROUND

[0003] In a communication system, a terminal device can encapsulate data in a transport block (TB) and transmit the transport block multiple times on a physical uplink shared channel (PUSCH) to improve uplink coverage strength. For example, in a PUSCH repetition Type A transmission mode, one PUSCH transmission can occupy one time slot; or in a PUSCH repetition Type B transmission mode, one PUSCH transmission can occupy half a time slot or several symbols. In addition, the terminal device can spread the transport block by an orthogonal cover code (OCC) to improve the uplink coverage capacity.

[0004] However, spreading the transport block in the PUSCH repetition Type B transmission mode can cause interference to the transport block in the PUSCH repetition Type A transmission mode, and reduce the communication performance. SUMMARY

[0005] The present application provides a communication method and apparatus, which can reduce the interference between the transport block in the PUSCH repetition Type B transmission mode and the transport block in the PUSCH repetition Type A transmission mode, and improve the communication performance.

[0006] In a first aspect, the present application provides a communication method, which can be executed by a terminal device. In the present application, the "terminal device" can refer to the terminal device itself, a component (e.g., a processor, a chip, or a chip system) in the terminal device, or a logic module or software capable of realizing all or part of the functions of the terminal device. The method comprises: receiving, by the terminal device, first signaling; and outputting, by the terminal device, a kth signal on a kth first PUSCH transmission. The first signaling is used to schedule the first PUSCH transmission, the first PUSCH transmission carries a first transport block, the maximum number of transmissions of the first PUSCH transmission is K, a single transmission of the first transport block occupies MN / K time units, M is the maximum number of transmissions of a second PUSCH transmission, the second PUSCH transmission carries a second transport block, a single transmission of the second transport block occupies N time units, M, N, and K are positive integers, the kth signal is determined according to the first transport block and a kth element of an orthogonal cover code, k = 1, 2, …, K, the sum of an ith element, a K / M+i element, a 2K / M+i element, …, a (M-1)K / M+i element of the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

[0007] Based on the first aspect, the first transport block occupies MN / K time units in a single transmission, and the first PUSCH transmission carries the first transport block; the second transport block occupies N time units in a single transmission, and the second PUSCH transmission carries the second transport block. Therefore, the first PUSCH transmission can be understood as a PUSCH transmission in a PUSCH repetition Type B transmission mode, and the second PUSCH transmission can be understood as a PUSCH transmission in a PUSCH repetition Type A transmission mode. In the case where K first PUSCH transmissions and M second PUSCH transmissions all occupy MN time units, and the sum of the i-th element, the K / M+i-th element, the 2K / M+i-th element, …, and the (M-1)K / M+i-th element of the orthogonal cover code is 0, the amplitudes of the signals on the i-th first PUSCH transmission, the K / M+i-th first PUSCH transmission, the 2K / M+i-th first PUSCH transmission, …, and the (M-1)K / M+i-th first PUSCH transmission after superposition can be as small as possible (such as tending to 0), which can ensure as much as possible that the signals on the M second PUSCH transmissions after superposition are not interfered by the signals on the first PUSCH transmission, that is, the interference of the signals on the first PUSCH transmission to the signals on the second PUSCH transmission can be reduced, and correspondingly, the interference of the signals on the second PUSCH transmission to the signals on the first PUSCH transmission can be reduced, which can improve the reliability of communication. In addition, the first PUSCH transmission and the second PUSCH transmission can coexist (that is, a terminal device based on the first PUSCH transmission carrying a data block and a terminal device based on the second PUSCH transmission carrying a data block can simultaneously communicate with the network device), which can effectively improve the capacity of uplink coverage and the throughput of the communication system, thereby improving the communication performance.

[0008] In a second aspect, the present application provides a communication method, which can be executed by a network device. In the present application, the network device can refer to the network device itself, a component (for example, a processor, a chip, or a chip system) in the network device, or a logic module or software capable of realizing all or part of the functions of the network device. The method comprises the following steps: the network device sends first signaling; and the network device acquires a kth signal on a kth first PUSCH transmission. The first signaling is used for scheduling the first PUSCH transmission, the first PUSCH transmission carries a first transport block, the maximum transmission number of the first PUSCH transmission is K, the single transmission of the first transport block occupies MN / K time units, M is the maximum transmission number of a second PUSCH transmission, the second PUSCH transmission carries a second transport block, the single transmission of the second transport block occupies N time units, M, N, and K are positive integers, the kth signal is determined according to the first transport block and a kth element in an orthogonal cover code, k = 1, 2, …, K, the sum of an ith element, a K / M+i element, a 2K / M+i element, …, a (M-1)K / M+i element in the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

[0009] Based on the second aspect, the first transport block occupies MN / K time units in a single transmission, and the first PUSCH transmission carries the first transport block, the second transport block occupies N time units in a single transmission, and the second PUSCH transmission carries the second transport block, so the first PUSCH transmission can be understood as the PUSCH transmission in the PUSCH repetition Type B transmission mode, and the second PUSCH transmission can be understood as the PUSCH transmission in the PUSCH repetition Type A transmission mode. In the case that the K first PUSCH transmissions and the M second PUSCH transmissions all occupy MN time units, and the sum of the i th element, the K / M+i th element, the 2K / M+i th element, …, and the (M-1)K / M+i th element of the orthogonal cover code is 0, the amplitudes of the signals on the i th first PUSCH transmission, the K / M+i th first PUSCH transmission, the 2K / M+i th first PUSCH transmission, …, and the (M-1)K / M+i th first PUSCH transmission after superposition can be as small as possible (such as tending to 0), which can ensure as much as possible that the signals on the M second PUSCH transmissions after superposition are not interfered by the signals on the first PUSCH transmissions, that is, the interference of the signals on the first PUSCH transmissions on the signals on the second PUSCH transmissions can be reduced, and correspondingly, the interference of the signals on the second PUSCH transmissions on the signals on the first PUSCH transmissions can be reduced, which can improve the reliability of communication. In addition, the first PUSCH transmission and the second PUSCH transmission can coexist (that is, the terminal device based on the first PUSCH transmission carrying the data block and the terminal device based on the second PUSCH transmission carrying the data block can simultaneously communicate with the network device), which can effectively improve the capacity of uplink coverage and the throughput of the communication system, thereby improving the communication performance.

[0010] In combination with the first aspect and the second aspect, in a possible implementation, M is 2, N is 1, K is 4, the maximum transmission number of the second PUSCH transmission is 2, and the second transport block occupies 1 time unit in a single transmission; or the maximum transmission number of the first PUSCH transmission is 4, and the first transport block occupies 1 / 2 time unit in a single transmission.

[0011] In combination with the first aspect and the second aspect, in a possible implementation, the sum of the 1 st element and the 3 rd element in the orthogonal cover code is 0; and the sum of the 2 nd element and the 4 th element in the orthogonal cover code is 0.

[0012] In combination with the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is any one of the following: [1, j, -1, -j], [1, -j, -1, j], [1, -1, -1, 1], or [1, 1, -1, -1].

[0013] In a possible implementation of the first aspect and the second aspect, the orthogonal cover code is [1, j, -1, -j] in a discrete fourier transform (DFT) matrix of length 4; or the orthogonal cover code is [1, -j, -1, j] in the DFT matrix of length 4.

[0014] In a possible implementation of the first aspect and the second aspect, the orthogonal cover code is [1, 1, -1, -1] in a Walsh matrix of length 4; or the orthogonal cover code is [1, -1, -1, 1] in the Walsh matrix of length 4.

[0015] In a possible implementation of the first aspect and the second aspect, the orthogonal cover code is [1, 1, -1, -1] in a permutation DFT matrix of length 4.

[0016] Based on the above six possible implementations, a possible coexistence configuration is provided for coexistence of the first PUSCH transmission and the second PUSCH transmission, that is, two second PUSCH transmissions and four first PUSCH transmissions each occupy two time slots, one first PUSCH transmission occupies 1 / 2 time slot, and one second PUSCH transmission occupies one time slot.

[0017] Since the sum of the first element and the third element in the orthogonal cover code is 0, and the sum of the second element and the fourth element in the orthogonal cover code is 0, the amplitude of the signal after superposition of the signal on the first first PUSCH transmission and the signal on the third first PUSCH transmission can be as small as possible (for example, tends to 0), and similarly, the amplitude of the signal after superposition of the signal on the second first PUSCH transmission and the signal on the fourth first PUSCH transmission can be as small as possible (for example, tends to 0), so that the signal after superposition on the second PUSCH transmission can be as much as possible to be free from interference of the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission on the signal on the second PUSCH transmission can be reduced), and at the same time, the SNR of the signal on the second PUSCH transmission can be improved, the reliability of communication can be effectively improved, and the communication performance can be improved.

[0018] In addition, the orthogonal cover code can be multiplexed with the existing orthogonal cover code, and the implementation complexity can be reduced.

[0019] In a possible implementation of the first aspect and the second aspect, M is 2, N is 1, K is 8, the maximum transmission number of the second PUSCH transmission is 2, and one-time transmission of the second transport block occupies 1 time unit; or the maximum transmission number of the first PUSCH transmission is 8, and one-time transmission of the first transport block occupies 1 / 4 time unit.

[0020] With reference to the first aspect and the second aspect, in a possible implementation, a sum of a first element and a fifth element in the orthogonal cover code is 0; a sum of a second element and a sixth element in the orthogonal cover code is 0; a sum of a third element and a seventh element in the orthogonal cover code is 0; and a sum of a fourth element and an eighth element in the orthogonal cover code is 0.

[0021] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is any one of the following: [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ], [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e 5π / 4 -j, e j3π / 4 ], [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0022] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; the orthogonal cover code is [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ] in the discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j5π / 4 j, e j7π / 4 -1, e 5π / 4 -j, e j3π / 4 ] in the discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ] in the discrete Fourier transform matrix of length 8.

[0023] In combination with the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in a length-8 Walsh matrix; or, the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in the length-8 Walsh matrix; or, the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in the length-8 Walsh matrix; or, the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in the length-8 Walsh matrix.

[0024] Based on the above five possible implementations, a possible coexistence configuration is provided for coexistence of the first PUSCH transmission and the second PUSCH transmission, that is, two second PUSCH transmissions and eight first PUSCH transmissions each occupy two time slots, one first PUSCH transmission occupies 1 / 4 time slot, and one second PUSCH transmission occupies one time slot.

[0025] Since the sum of the first element and the fifth element in the orthogonal cover code is 0, the sum of the second element and the sixth element in the orthogonal cover code is 0, the sum of the third element and the seventh element in the orthogonal cover code is 0, and the sum of the fourth element and the eighth element in the orthogonal cover code is 0, the amplitude of the signal after superposition of the signal on the first first PUSCH transmission and the signal on the fifth first PUSCH transmission can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after superposition of the signal on the second first PUSCH transmission and the signal on the sixth first PUSCH transmission can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after superposition of the signal on the third first PUSCH transmission and the signal on the seventh first PUSCH transmission can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after superposition of the signal on the fourth first PUSCH transmission and the signal on the eighth first PUSCH transmission can be as small as possible (such as tending to 0), so that the signal superimposed on the second PUSCH transmission can be as much as possible to be not interfered by the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission on the signal on the second PUSCH transmission can be reduced), and at the same time, the SNR of the signal on the second PUSCH transmission can be improved, the reliability of communication can be effectively improved, and the communication performance can be improved.

[0026] In addition, the orthogonal cover code can be multiplexed with the existing orthogonal cover code, and the implementation complexity can be reduced.

[0027] With reference to the first aspect and the second aspect, in a possible implementation, M is 4, N is 1, K is 8, the maximum number of transmission times of the second PUSCH transmission is 4, and the first transport block occupies 1 time unit in a single transmission; or the maximum number of transmission times of the first PUSCH transmission is 8, and the first transport block occupies 1 / 2 time unit in a single transmission.

[0028] With reference to the first aspect and the second aspect, in a possible implementation, a sum of a first element, a third element, a fifth element, and a seventh element in the orthogonal cover code is 0; and a sum of a second element, a fourth element, a sixth element, and an eighth element in the orthogonal cover code is 0.

[0029] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is any one of the following: [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ], [1, j, -1, -j, 1, j, -1, -j], [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ], [1, e j5π / 4 ,j, e j7π / 4 ,-1, e jπ / 4 ,-j, e j3π / 4 ], [1, -j, -1, j, 1, -j, -1, j], [1, e j7π / 4 ,-j, e j5π / 4 ,-1, e j3π / 4 ,j, e jπ / 4 ], [1, 1, -1, -1, 1, 1, -1, -1], [1, -1, -1, 1, 1, -1, -1, 1], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0030] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, j, -1, -j, 1, j, -1, -j] in the discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j3π / 4 ,-j, e jπ / 4-1, e j7π / 4 j, e j5π / 4 ]; or the orthogonal cover code is [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ]; or the orthogonal cover code is [1, -j, -1, j, 1, -j, -1, j] in the discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ].

[0031] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, 1, -1, -1, 1, 1, -1, -1] in the Walsh matrix of length 8; the orthogonal cover code is [1, -1, -1, 1, 1, -1, -1, 1] in the Walsh matrix of length 8; the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in the Walsh matrix of length 8; or the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in the Walsh matrix of length 8; or the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in the Walsh matrix of length 8; or the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in the Walsh matrix of length 8.

[0032] Based on the above five possible implementations, a possible coexistence configuration is provided for coexistence of the first PUSCH transmission and the second PUSCH transmission, that is, four second PUSCH transmissions and eight first PUSCH transmissions each occupy four time slots, one first PUSCH transmission occupies 1 / 2 time slot, and one second PUSCH transmission occupies one time slot.

[0033] Since the sum of the 1st, 3rd, 5th, and 7th elements in the orthogonal covering code is 0, and the sum of the 2nd, 4th, 6th, and 8th elements in the orthogonal covering code is 0, the amplitude of the signal superimposed from the first, third, fifth, and seventh PUSCH transmissions can be as small as possible (e.g., approaching 0). Similarly, the amplitude of the signal superimposed from the second, fourth, sixth, and eighth PUSCH transmissions can be as small as possible (e.g., approaching 0). This ensures that the superimposed signal from the second PUSCH transmission is not interfered with by the signal from the first PUSCH transmission (i.e., it reduces the interference of the first PUSCH transmission signal on the second PUSCH transmission signal), and at the same time improves the SNR of the second PUSCH transmission signal, effectively improving communication reliability and performance.

[0034] In addition, orthogonal covering codes can reuse existing orthogonal covering codes, which can reduce implementation complexity.

[0035] Combining the first and second aspects, one possible implementation is that M is 2, N is 2, K is 8, the maximum number of transmissions for the second PUSCH transmission is 2, and the second transmission block occupies 2 time units per transmission; or, the maximum number of transmissions for the first PUSCH transmission is 8, and the first transmission block occupies 1 / 2 time unit per transmission.

[0036] Combining the first and second aspects, one possible implementation is that the sum of the 1st and 5th elements in the orthogonal covering code is 0; the sum of the 2nd and 6th elements in the orthogonal covering code is 0; the sum of the 3rd and 7th elements in the orthogonal covering code is 0; and the sum of the 4th and 8th elements in the orthogonal covering code is 0.

[0037] Combining the first and second aspects, one possible implementation is that the orthogonal covering code is any of the following: [1, e jπ / 4 ,j,e j3π / 4 ,-1,e j5π / 4 ,-j,e j7π / 4 ]、[1,e j3π / 4 ,-j,e jπ / 4 ,-1,e j7π / 4 ,j,e j5π / 4 ]、[1,e j5π / 4 ,j,e j7π / 4 ,-1,e jπ / 4 ,-j,e j3π / 4 ]、[1,ej7π / 4 - j, e j5π / 4 - 1, e j3π / 4 j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0038] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, e jπ / 4 - j, e j3π / 4 - 1, e j5π / 4 - j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j3π / 4 - j, e jπ / 4 - 1, e j7π / 4 j, e j5π / 4 ] in a discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j5π / 4 - j, e j7π / 4 - 1, e 5π / 4 - j, e j3π / 4 ] in a discrete Fourier transform matrix of length 8; or the orthogonal cover code is [1, e j7π / 4 - j, e j5π / 4 - 1, e j3π / 4 j, e jπ / 4 ] in a discrete Fourier transform matrix of length 8.

[0039] With reference to the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in a Walsh matrix of length 8; or the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in a Walsh matrix of length 8; or the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in a Walsh matrix of length 8; or the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in a Walsh matrix of length 8.

[0040] Based on the above five possible implementations, a possible coexistence configuration is provided for coexistence of the first PUSCH transmission and the second PUSCH transmission, that is, two second PUSCH transmissions and eight first PUSCH transmissions each occupy four time slots, one first PUSCH transmission occupies 1 / 2 time slot, and one second PUSCH transmission occupies two time slots.

[0041] Since the sum of the first element and the fifth element in the orthogonal cover code is 0, the sum of the second element and the sixth element in the orthogonal cover code is 0, the sum of the third element and the seventh element in the orthogonal cover code is 0, and the sum of the fourth element and the eighth element in the orthogonal cover code is 0, the amplitude of the signal after the signal on the first first PUSCH transmission and the signal on the fifth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the second first PUSCH transmission and the signal on the sixth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the third first PUSCH transmission and the signal on the seventh first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the fourth first PUSCH transmission and the signal on the eighth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), so that the signal superimposed on the second PUSCH transmission can be as small as possible. Guarantee that the signal on the first PUSCH transmission does not interfere (that is, the signal on the first PUSCH transmission can reduce the interference to the signal on the second PUSCH transmission), while improving the SNR of the signal on the second PUSCH transmission, which can effectively improve the reliability of communication and improve the communication performance.

[0042] In addition, the orthogonal cover code can be multiplexed with the existing orthogonal cover code, which can reduce the implementation complexity.

[0043] In combination with the first aspect and the second aspect, in a possible implementation, the orthogonal cover code is indicated by the indication information.

[0044] Based on the possible implementation, the network device can indicate the orthogonal cover code to the terminal device according to the actual communication scene or communication situation through the indication information. The indication information can directly indicate the orthogonal cover code, or can indicate the index (or identifier) of the orthogonal cover code, providing a feasible scheme for determining the orthogonal cover code for the terminal device.

[0045] In combination with the first aspect and the second aspect, in a possible implementation, M is an integer power of 2.

[0046] Based on the possible implementation, a feasible scheme is provided for the value of M.

[0047] In combination with the first aspect and the second aspect, in a possible implementation, K is an integer power of 2.

[0048] Based on the possible implementation, a feasible scheme is provided for the value of K.

[0049] In a third aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the terminal device in the first aspect to implement the functions performed by the terminal device. The communication apparatus can be the terminal device, a chip or chip system or system on chip, etc. of the terminal device. The communication apparatus can perform the functions of the terminal device through hardware or by executing corresponding software through hardware. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the following transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the following processing operations independently or in cooperation with the transceiver module.

[0050] For example, the transceiver module is configured to receive first signaling. The first signaling is used to schedule first PUSCH transmission. The first PUSCH transmission carries a first transport block. The maximum number of transmissions of the first PUSCH transmission is K. The first transport block occupies MN / K time units in a single transmission. M is the maximum number of transmissions of second PUSCH transmission. The second PUSCH transmission carries a second transport block. The second transport block occupies N time units in a single transmission. M, N and K are positive integers. The transceiver module is further configured to output a kth signal on the kth first PUSCH transmission. The kth signal is determined according to the first transport block and a kth element of an orthogonal cover code. K is equal to 1, 2, …, K. The sum of an i th element, a K / M+i th element, a 2K / M+i th element, …, a (M-1)K / M+i th element of the orthogonal cover code is 0. I is a positive integer less than or equal to K / M.

[0051] Optionally, the transceiver module and the processing module of the communication apparatus in the third aspect can perform the corresponding functions in the first aspect or any possible design of the first aspect. For details, refer to the detailed description in the method examples. The beneficial effects that can be achieved are described above.

[0052] In a fourth aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the network device in the second aspect to implement the functions performed by the network device. The communication apparatus can be the network device, a chip or chip system or system on chip, etc. of the network device. The communication apparatus can perform the functions of the network device through hardware or by executing corresponding software through hardware. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the following transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the following processing operations independently or in cooperation with the transceiver module.

[0053] An example transceiver module is configured to transmit first signaling, wherein the first signaling is used to schedule a first PUSCH transmission, the first PUSCH transmission carries a first transport block, a maximum number of transmission times of the first PUSCH transmission is K, a single transmission of the first transport block occupies MN / K time units, M is a maximum number of transmission times of a second PUSCH transmission, the second PUSCH transmission carries a second transport block, a single transmission of the second transport block occupies N time units, M, N, and K are positive integers; a processing module is configured to obtain a kth signal on a kth first PUSCH transmission, wherein the kth signal is determined according to the first transport block and a kth element of an orthogonal cover code, k=1, 2, …, K, a sum of an ith element, a K / M+i th element, a 2K / M+i th element, …, a (M-1)K / M+i th element of the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

[0054] Optionally, the transceiver module and the processing module of the communication apparatus in the fourth aspect can also perform the corresponding functions in the second aspect or any possible design of the second aspect, and the details are described in the method examples. The beneficial effects achieved can also be seen from the foregoing related content.

[0055] In the fifth aspect, the embodiments of the present application provide a communication apparatus, which comprises one or more processors; the one or more processors are configured to run computer programs or instructions, and when the one or more processors execute the computer programs or instructions, the communication method described in any one of the first aspect to the second aspect is executed.

[0056] In a possible design, the communication apparatus further comprises one or more memories, the one or more memories are coupled to the one or more processors, and the one or more memories are configured to store the computer programs or instructions. In a possible implementation, the memory is located outside the communication apparatus. In another possible implementation, the memory is located inside the communication apparatus. In the embodiments of the present application, the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together. In a possible implementation, the communication apparatus further comprises a transceiver, and the transceiver is configured to receive information and / or send information.

[0057] In a possible design, the communication apparatus further comprises one or more communication interfaces, the one or more communication interfaces are coupled to the one or more processors, and the one or more communication interfaces are configured to communicate with other modules outside the communication apparatus.

[0058] In a sixth aspect, an embodiment of the present application provides a communication apparatus, the communication apparatus comprising an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to perform the communication method according to any one of the first aspect or the second aspect, process and / or generate information according to the information.

[0059] In a seventh aspect, an embodiment of the present application provides a computer readable storage medium, the computer readable storage medium storing computer instructions or programs, when the computer instructions or programs are run on a computer, the communication method according to any one of the first aspect or the second aspect is performed.

[0060] In an eighth aspect, an embodiment of the present application provides a computer program product containing computer instructions, when the computer instructions are run on a computer, the communication method according to any one of the first aspect or the second aspect is performed.

[0061] In a ninth aspect, an embodiment of the present application provides a computer program, when the computer program is run on a computer, the communication method according to any one of the first aspect or the second aspect is performed.

[0062] In a tenth aspect, an embodiment of the present application provides a chip, comprising: a processor, the processor being coupled with a memory, the memory being configured to store programs or instructions, when the programs or instructions are executed by the processor, the communication method according to any one of the first aspect or the second aspect is performed.

[0063] The technical effects brought by any one of the third aspect to the tenth aspect can refer to the technical effects brought by any one of the first aspect or the second aspect, and will not be described herein.

[0064] In an eleventh aspect, an embodiment of the present application provides a communication system, the communication system can comprise a communication apparatus for performing the communication method according to the first aspect or any possible design of the first aspect, and a communication apparatus for performing the communication method according to the second aspect or any possible design of the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0065] FIG. 1 is a schematic diagram of signal transmission according to an embodiment of the present application;

[0066] FIG. 2 is a schematic diagram of orthogonal cover code spreading according to an embodiment of the present application;

[0067] FIG. 3 is a schematic diagram of orthogonal cover code spreading according to an embodiment of the present application;

[0068] FIG. 4 is a schematic diagram of orthogonal cover code spreading according to an embodiment of the present application;

[0069] FIG. 5 is a schematic diagram of a communication system according to an embodiment of the present application;

[0070] FIG. 6 is a schematic diagram of an architecture of a network device according to an embodiment of the present application;

[0071] FIG. 7 is a schematic diagram of a structure of a communication apparatus according to an embodiment of the present application;

[0072] FIG. 8 is a schematic diagram of a flow of a communication method according to an embodiment of the present application;

[0073] FIG. 9 is a schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission according to an embodiment of the present application;

[0074] FIG. 10 is a schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission according to an embodiment of the present application;

[0075] FIG. 11 is a schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission according to an embodiment of the present application;

[0076] FIG. 12 is a schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission according to an embodiment of the present application;

[0077] FIG. 13 is a schematic diagram of a structure of a terminal device according to an embodiment of the present application;

[0078] FIG. 14 is a schematic diagram of a structure of a network device according to an embodiment of the present application;

[0079] FIG. 15 is a schematic diagram of a structure of another communication apparatus according to an embodiment of the present application;

[0080] FIG. 16 is a schematic diagram of a baseband hardware according to an embodiment of the present application. DETAILED DESCRIPTION

[0081] Before describing the embodiments of the present application, technical terms related to the embodiments of the present application are described.

[0082] PUSCH: PUSCH can be transmitted multiple times to improve uplink coverage strength. There are two types of multiple PUSCH transmissions in a communication system: repeated transmission and transport block of multiple slot (TBoMS) mapping transmission across multiple slots.

[0083] The repeated transmission is to carry the same data in multiple PUSCH transmissions, that is, the data can be encapsulated in a transport block, and the transport block is mapped on the PUSCH for repeated transmission. Therefore, the repeated transmission can also be understood as that one transport block is repeatedly transmitted through multiple PUSCH transmissions. For example, in the PUSCH repetition Type A mode, a single transmission of a transport block can occupy one slot (i.e., one PUSCH transmission occupies one slot), or in the PUSCH repetition Type B mode, a single transmission of a transport block can occupy half a slot or multiple symbols (i.e., one PUSCH transmission occupies half a slot or multiple symbols). That is, each PUSCH transmission in the repeated transmission can map all the information of one transport block on all or part of the symbols in one slot.

[0084] The TBoMS is to map one transport block on the PUSCH in multiple slots for transmission, that is, all the information of one transport block can be jointly carried through the PUSCH transmissions in different slots.

[0085] The process in which the terminal device outputs a signal on the PUSCH can be as shown in FIG. 1. The terminal device can block encode and scramble a transport block to obtain sequences d(0), d(1), …, d(n), modulate the sequences d(0), d(1), …, d(n) to obtain modulated symbols x(0), x(1), …, x(n), and then perform DFT on the modulated symbols x(0), x(1), …, x(n) to obtain y'(0), y'(1), …, y'(n), perform inverse fast Fourier transform (IFFT) on y'(0), y'(1), …, y'(n) to obtain a signal, and map the signal on the PUSCH for output.

[0086] Orthogonal cover code: In the 3rd generation partnership project (3GPP) Release (Rel) 19 Non-Terrestrial Networks for NR Phase 3, it is proposed to enhance the PUSCH transmission of DFT-spread-OFDM (DFT-s-OFDM) through orthogonal cover code to improve the capacity of uplink multiplexing.

[0087] Wherein, the radio access network (RAN) 1#116 aligns the evaluation parameters of uplink capacity and throughput enhancement, including channel model, physical resource block, length of orthogonal cover code, orthogonal cover code, timing offset, frequency offset, block error rate (BLER) = 0.1 corresponding to the working point of SNR of low code rate data, and BLER = 0.02 corresponding to the working point of SNR of voice signal. Further, RAN1#116b agrees that the NR non-terrestrial network (NTN) PUSCH supports orthogonal cover code, for example, inter-slot time domain orthogonal cover code (OCC) based on PUSCH repetition Type A, inter-symbol time domain OCC, intra-symbol pre-DFT-s OCC (such as comb structure of PUCCH format 4), and combination of OCC technology. RAN1#117 agrees to support at least one of the following OCC technologies in the standard stage: inter-slot time domain OCC with orthogonal cover code length of 2 or 4 based on PUSCH repetition Type A, inter-symbol time domain OCC with orthogonal cover code length of 2 or 4, and intra-symbol pre-DFT-s OCC with orthogonal cover code length of 2 or 4.

[0088] For inter-slot time domain OCC based on PUSCH repetition Type A, all symbols in the corresponding slot of PUSCH can be spread by orthogonal cover code, that is, each corresponding modulation symbol of the slot can be spread by orthogonal cover code after DFT to obtain y(0), y(1), …, y(n), and y(0), y(1), …, y(n) can output signal z(0), z(1), …, z(n) by orthogonal cover code spreading.

[0089] Specifically, Wherein,

[0090] Wherein, represents the number of resource blocks (RBs) allocated for PUSCH, represents the number of subcarriers contained in each RB, represents the number of DFT-s-OFDM symbols contained in each slot, represents the length of the orthogonal cover code, w i(m) is the mth element in the i th orthogonal cover code, i is an integer greater than or equal to 0.

[0091] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0092] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0093] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0094] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0095] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n). For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0096] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0097] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0098] For example, as shown in the following FIG. 2, the length of the orthogonal cover code is 2, w0(0) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 0) in the time slot 0, w0(1) can be multiplied by y(0), y(1), …, y(n), and the obtained sequence can be mapped on the 12 symbols (such as the symbols marked as 0-11 in the time slot 1) in the time slot 1, so as to realize the spreading of y(0), y(1), …, y(n).

[0099] For the OFDM symbol within the discrete Fourier transform spread orthogonal cover code, the PUSCH modulation symbol is spread by the orthogonal cover code, i.e., each DFT-s-OFDM symbol is spread by the orthogonal cover code before DFT to obtain the output signal x(0), x(1), …, x(n).

[0100] Specifically, Wherein,

[0101] Wherein, Msymb represents the number of modulation symbols, w n represents the nth orthogonal cover code.

[0102] For example, as shown in the following FIG. 4, the length of the orthogonal cover code is 2, and the number of modulation symbols is 6. One copy of the 6 modulation symbols can be multiplied by w0(0) for the first 6 modulation symbols, and multiplied by w0(1) for the last 6 modulation symbols. This step is located after modulation, i.e., the block spreading part shown in FIG. 4, and after DFT, the PUSCH shown in FIG. 4 can be obtained. The comb structure in the frequency domain is used to spread d(0), d(1), …, d(n).

[0103] It can be understood that the orthogonal cover code can be a Walsh-Hadamard sequence (also known as a Walsh sequence), a discrete Fourier transform sequence, or a Zadoff-Chu sequence. Among them, the Walsh sequence can be any row in the Walsh-Hadamard matrix (the sequence composed of elements in any row in the Walsh matrix is the Walsh sequence), the discrete Fourier transform sequence can be any row in the discrete Fourier transform matrix (the sequence composed of elements in any row in the discrete Fourier transform matrix is the discrete Fourier transform sequence), and the Zadoff-Chu sequence can be any row in the Zadoff-Chu matrix (the sequence composed of elements in any row in the Zadoff-Chu matrix is the Zadoff-Chu sequence).

[0104] Wherein, the Walsh matrix with a length of 2 is: The Walsh matrix with a length of 4 is: The Walsh matrix with a length of 8 is:

[0105] Wherein, the discrete Fourier transform matrix with a length of 2 is: The discrete Fourier transform matrix with a length of 4 is: The discrete Fourier transform matrix with a length of 8 is:

[0106] wherein the Zadoff-Chu matrix with length 3 is: the Zadoff-Chu matrix with length 6 is:

[0107] It can be understood that any two rows in any of the above matrices are orthogonal to each other (i.e., the inner product is 0), for example, the first row (1, 1, 1, 1) and the second row (1, j, -1, -j) in H4 are orthogonal to each other (i.e., 1*1+1*j+1*(-1)+1*(-j)=0).

[0108] For example, taking one of the Walsh sequences in the Walsh matrix with length 4 (such as H4 above) as an example, assuming that the Walsh sequence is (1, 1, 1, 1), the orthogonal cover code is w0=(1, 1, 1, 1) (i.e., w0(0)=1, w0(1)=1, w0(2)=1, w0(3)=1); or, assuming that the Walsh sequence is (1, -1, 1, -1), the orthogonal cover code is w1=(1, -1, 1, -1) (i.e., w1(0)=1, w1(0)=-1, w1(2)=1, w1(3)=-1); or, assuming that the Walsh sequence is (1, 1, -1, -1), the orthogonal cover code is w2=(1, 1, -1, -1) (i.e., w2(0)=1, w2(1)=1, w2(2)=-1, w2(3)=-1); or, assuming that the Walsh sequence is (1, -1, -1, 1), the orthogonal cover code is w3=(1, -1, -1, 1) (i.e., w3(0)=1, w3(1)=-1, w3(2)=-1, w3(3)=1).

[0109] Based on the above description of PUSCH repetition transmission and orthogonal cover code, PUSCH repetition type A is supported before Rel-19, and orthogonal cover code is introduced after Rel-19 to improve the capacity of uplink multiplexing. However, when the uplink multiplexing capacity is enhanced by using inter-symbol time domain orthogonal cover code, the transmission block in the transmission mode of PUSCH repetition type A will be interfered, which reduces the communication performance.

[0110] wherein the inter-symbol time domain orthogonal cover code can be applied to the PUSCH repetition Type B transmission mode.

[0111] Therefore, how to reduce the interference between the transmission block in the PUSCH repetition Type B transmission mode and the transmission block in the PUSCH repetition Type A transmission mode to improve the communication performance has become a problem to be solved.

[0112] The application provides a communication method, which comprises: a terminal device receiving first signaling; and outputting a kth signal on a kth first PUSCH transmission. The first signaling is used for scheduling the first PUSCH transmission, the first PUSCH transmission carries a first transport block, the maximum transmission number of the first PUSCH transmission is K, a single transmission of the first transport block occupies MN / K time units, M is the maximum transmission number of a second PUSCH transmission, the second PUSCH transmission carries a second transport block, a single transmission of the second transport block occupies N time units, M, N and K are positive integers, the kth signal is determined according to the first transport block and a kth element in an orthogonal cover code, k=1, 2, …, K, and the sum of an ith element, a K / M+i element, a 2K / M+i element, …, and a (M-1)K / M+i element in the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

[0113] In the embodiments of the application, a single transmission of the first transport block occupies MN / K time units, the first PUSCH transmission carries the first transport block, a single transmission of the second transport block occupies N time units, and the second PUSCH transmission carries the second transport block, so the first PUSCH transmission can be understood as a PUSCH transmission in a PUSCH repetition Type B transmission mode, and the second PUSCH transmission can be understood as a PUSCH transmission in a PUSCH repetition Type A transmission mode. In the case where the K first PUSCH transmissions and the M second PUSCH transmissions all occupy MN time units, and the sum of the ith element, the K / M+i element, the 2K / M+i element, …, and the (M-1)K / M+i element in the orthogonal cover code is 0, the amplitudes of the signals on the ith first PUSCH transmission, the K / M+i first PUSCH transmission, the 2K / M+i first PUSCH transmission, …, and the (M-1)K / M+i first PUSCH transmission after superposition can be as small as possible (such as tending to 0), which can ensure as much as possible that the signals on the M second PUSCH transmissions after superposition are not interfered by the signals on the first PUSCH transmissions, that is, the interference of the signals on the first PUSCH transmissions on the signals on the second PUSCH transmissions can be reduced, correspondingly, the interference of the signals on the second PUSCH transmissions on the signals on the first PUSCH transmissions can be reduced, and the reliability of communication can be improved. In addition, the first PUSCH transmission and the second PUSCH transmission can coexist (that is, a terminal device based on the first PUSCH transmission carrying a data block and a terminal device based on the second PUSCH transmission carrying a data block can simultaneously communicate with a network device), which can effectively improve the capacity of uplink coverage and the throughput of a communication system, thereby improving the communication performance.

[0114] Embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0115] The communication method provided by the embodiments of the present application can be applied to any communication system, which can be a 3GPP communication system, for example, a long term evolution (LTE) system, or a 5G mobile communication system, a system of mixed networking of LTE and 5G, an NR system, an NR vehicle to everything (V2X) system, a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an internet of things (IoT), a narrow band-internet of things (NB-IoT) system, a global system for mobile communications (GSM) system, an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access (CDMA2000) system, a time division-synchronization code division multiple access (TD-SCDMA) system, an enhanced mobile broadband (eMBB) system, an ultra-reliable and low-latency communication (URLLC) system, an enhanced machine-type communication (eMTC) system, and various types of future communication systems, or an NTN system (such as a satellite communication system), a non-3GPP communication system, etc., without limitation.

[0116] The communication method provided by the embodiments of the present application can be applied to various communication scenarios, for example, can be applied to one or more of the following communication scenarios: encoding of a control channel, encoding of a data channel, etc., without limitation.

[0117] The communication system provided by the embodiments of the present application will be described below taking FIG. 5 as an example.

[0118] FIG. 5 is a schematic diagram of a communication system provided by an embodiment of the present application. As shown in FIG. 5, the communication system can include at least one terminal device and at least one network device.

[0119] In FIG. 5, the terminal device can be located in the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device.

[0120] The terminal device can be a device with wireless transceiving function or a chip or chip system that can be provided in the device, and can allow a user to access a network and be a device for providing voice and / or data connectivity to the user. The terminal device can also be referred to as a user equipment (UE), a subscriber unit, a terminal, a mobile station (MS), or a mobile terminal (MT), etc.

[0121] For example, the terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiving function. The terminal device can also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user apparatus, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, a processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote medical treatment, a wireless terminal in smart grid, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, a smart connected vehicle, a drone with UAV to UAV (U2U) communication capability, a terminal device in future network, or a terminal device in future evolved public land mobile network (PLMN), etc., without limitation.

[0122] In the figure 5, the network device can be any device deployed in the access network and capable of wireless communication with the terminal device, can also be a chip or chip system provided in the above device, can also be a logic node or logic module or a function implemented in software, and is mainly responsible for the functions of wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be a device supporting wired access or a device supporting wireless access.

[0123] For example, the network device can be composed of one or more access network (AN) / radio access network (RAN) nodes. The AN / RAN node can be various forms of base stations, such as satellite base stations, continued evolution of NodeB (gNB), transmission reception point (TRP), evolved NodeB (eNB), radio network controller (RNC), NodeB (NB), base station controller (BSC), base transceiver station (BTS), home base station (such as home evolved NodeB or home NodeB, HNB), macro base station, micro base station, pico base station, small station, relay station, balloon station, unmanned aerial vehicle station, wireless backhaul node, baseband unit (BBU), or wireless fidelity (Wi-Fi) access point (AP), etc. It can be understood that the network device can be a device placed on the ground or a non-ground device (such as a satellite, an unmanned aerial vehicle, a high-altitude communication device, etc.). In addition, in a communication system using different wireless access technologies, the name of the network device with the function of the base station can be different, which is not limited in the present application.

[0124] In another example, the network device can include a BBU and a remote radio unit (RRU). The BBU and the RRU can be placed in different places, for example, the RRU is pulled away and placed in a high traffic area, and the BBU is placed in a central machine room. The BBU and the RRU can also be placed in the same machine room. The BBU and the RRU can also be different components under one rack.

[0125] In another example, the network device can also be a device including a centralized unit (CU) node, or including a distributed unit (DU) node, or including a CU node and a DU node. For example, the network device can be divided into a CU and a DU from a logical function perspective, functions of part of protocol layers are centrally controlled in the CU, and the rest of the protocol layers are distributed in the DU and controlled by the CU. The CU and the DU can be separately arranged, or can be included in the same network element, such as a BBU. Further, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP).

[0126] In another example, the network device can also be a device including a radio unit (RU), or including a CU, a DU and an RU. The RU can be included in a radio frequency device or a radio frequency unit, such as a RRU, an active antenna unit (AAU) or a remote radio head (RRH).

[0127] It can be understood that the CU (or CU-CP and CU-UP), DU or RU can also have different names in different systems, but those skilled in the art can understand their meanings. For example, in an open radio access network (O-RAN) system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, the CU-CP, the CU-UP, the DU and the RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), the DU and the RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0128] Exemplarily, FIG. 6 below shows a schematic diagram of an architecture of a network device. The network device can include one or more functional modules to implement processing of signals. Taking a physical layer function as an example, the network device includes one or more of the following functions: encoding, rate matching, scrambling, modulation, layer mapping, precoding, resource element (RE) mapping, digital beamforming (BF), IFFT / addition of cyclic prefix (CP), decoding, de-rate matching, de-scrambling, demodulation, inverse discrete Fourier transformation (IDFT), channel equalization (or channel estimation), de-RE mapping, digital BF, fast Fourier transform (FFT) / CP removal; or taking a radio frequency function as an example, the network device includes one or more of the following functions: digital to analog (DA) conversion, analog BF, analog to digital (AD) conversion, or analog BF.

[0129] Wherein, the interface between the radio frequency and the physical layer can be a common public radio interface (CPRI), the interface between the scrambling and the modulation can be an extended common public radio interface (eCPRI) Cat D / E / F, the interface between the layer mapping and the precoding can be an eCPRI Cat B, the interface between the precoding and the RE mapping can be an eCPRI Cat C, the interface between the RE mapping and the BF can be an eCPRI Cat A, the interface between the de-RE mapping and the digital BF can be an eCPRI Cat A / B, the interface between the channel equalization and the de-RE mapping can be an eCPRI Cat C / F, the interface between the IDFT and the channel equalization can be an eCPRI Cat E, and the interface between the demodulation and the IDFT can be an eCPRI Cat D.

[0130] Based on the above description of the terminal device and the network device, optionally, the communication method provided by the embodiments of the present application can be implemented by the terminal device or the network device, or by components of the terminal device or the network device, such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or software (such as program code in a memory), without limitation.

[0131] In a specific implementation, each of the terminal device and the network device shown in FIG. 5 can adopt the component structure shown in FIG. 7, or include the components shown in FIG. 7. FIG. 7 is a component diagram of a communication apparatus 700 provided by an embodiment of the present application. The communication apparatus 700 can be a terminal device or a chip or system on chip in the terminal device, or a network device or a chip or system on chip in the network device. As shown in FIG. 7, the communication apparatus 700 includes a processor 701, a transceiver 702, and a communication line 703.

[0132] Further, the communication apparatus 700 can further include a memory 704. The processor 701, the memory 704, and the transceiver 702 can be connected through the communication line 703.

[0133] The processor 701 can be a central processing unit (CPU), a general processor network processor (NP), a digital signal processing (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 701 can also be other devices with processing functions, such as a circuit, a device, or a software module, without limitation.

[0134] The transceiver 702 is configured to communicate with other devices or other communication networks. The other communication networks can be an Ethernet, a radio access network (RAN), a wireless local area network (WLAN), etc. The transceiver 702 can be a module, a circuit, a transceiver, or any device capable of communication.

[0135] The communication line 703 is configured to transmit information between components included in the communication apparatus 700.

[0136] The memory 704 is configured to store instructions. The instructions can be a computer program.

[0137] The memory 704 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions, or a random access memory (RAM), or other type of dynamic storage device that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or other optical disk storage, a magneto-optical disk, a magnetic disk storage, or other magnetic storage devices, etc., without limitation.

[0138] It is noted that the memory 704 can be independent of the processor 701, or integrated with the processor 701. The memory 704 can be configured to store instructions or program codes or some data, etc. The memory 704 can be located in the communication apparatus 700, or located outside the communication apparatus 700, without limitation. The processor 701 is configured to execute the instructions stored in the memory 704, to implement the communication method provided by the embodiments described below.

[0139] In an example, the processor 701 can include one or more CPUs, such as CPU0 and CPU1 in FIG. 7.

[0140] As an optional implementation, the communication apparatus 700 includes multiple processors, for example, in addition to the processor 701 in FIG. 7, the communication apparatus 700 can further include a processor 707.

[0141] As an optional implementation, the communication apparatus 700 further includes an output device 705 and an input device 706. For example, the input device 706 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 705 is a display screen, a speaker, or the like.

[0142] It is noted that the communication apparatus 700 can be a desktop computer, a laptop computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device having a similar structure to that in FIG. 7. In addition, the constituent structure shown in FIG. 7 does not constitute a limitation on the communication apparatus, and the communication apparatus can include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0143] In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0144] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referred to and are not limited. The message names or parameter names in the messages exchanged between various devices in the embodiments of the present application are only examples, and other names can also be used in specific implementations, which are not limited.

[0145] The communication method provided by the embodiments of the present application will be described below with reference to the communication system shown in FIG. 5 and FIG. 8 described below. The terminal device or network device described in the following embodiments can have the components shown in FIG. 7.

[0146] FIG. 8 is a flowchart of a communication method provided by an embodiment of the present application. As shown in FIG. 8, the method can include the following steps.

[0147] S801, the network device sends first signaling to the terminal device; correspondingly, the terminal device receives the first signaling from the network device.

[0148] The first signaling is used to schedule first PUSCH transmission, and the first PUSCH transmission carries a first transport block.

[0149] The maximum number of transmissions of the first PUSCH transmission is K, that is, the transport block carried by each of the K first PUSCH transmissions is the first transport block, which can also be understood as that the first transport block is repeatedly transmitted K times.

[0150] K is a positive integer.

[0151] For example, K can be an integer power of 2.

[0152] For example, K can be 4, or K can be 8.

[0153] The single transmission of the first transport block occupies MN / K time units, which can also be understood as that one first PUSCH transmission occupies MN / K time units.

[0154] M is the maximum number of transmissions of the second PUSCH transmission.

[0155] The second PUSCH transmission carries a second transport block, that is, the transport block carried by each of the M second PUSCH transmissions is the second transport block, which can also be understood as that the second transport block is repeatedly transmitted M times.

[0156] M is a positive integer.

[0157] For example, M can be an integer power of 2.

[0158] For example, M can be 2, or M can be 4.

[0159] Optionally, M can be less than or equal to K.

[0160] The second transport block occupies N time units in a single transmission, which can also be understood as the second PUSCH transmission occupying N time units.

[0161] N is a positive integer.

[0162] For example, N can be 1, or N can be 2.

[0163] The second transport block occupies N (N is a positive integer) time units in a single transmission, and the second PUSCH transmission carries the second transport block, that is, the second PUSCH transmission occupies one or more time units, and the second PUSCH transmission can be understood as PUSCH transmission in PUSCH repetition type A.

[0164] The first transport block occupies MN / K time units in a single transmission, and the first PUSCH transmission carries the first transport block, and the first PUSCH transmission can be understood as PUSCH transmission in PUSCH repetition type B.

[0165] For example, when N is 1, M is 2, and K is 4, the first transport block can occupy 1 / 2 time units in a single transmission; or when N is 1, M is 2, and K is 8, the first transport block can occupy 1 / 4 time units in a single transmission.

[0166] It can be understood that the time unit can be a slot (i.e., one time unit is one slot), or the time unit can be a symbol (i.e., one time unit is one symbol), or the time unit can be a millisecond (ms) (i.e., one time unit is 1 ms), or the time unit can be a second (s) (i.e., one time unit is 1 s). The present application does not limit this.

[0167] Optionally, MN can be less than K.

[0168] For example, when M is 2 and N is 1, K can be 4 or K can be 8; when M is 4 and N is 1, K can be 8; when M is 2 and N is 2, K can be 8.

[0169] It can be understood that the K first PUSCH transmissions and the M second PUSCH transmissions can occupy the same time-frequency resources, that is, the K first PUSCH transmissions and the M second PUSCH transmissions occupy the same number of time units in the time domain (that is, the K first PUSCH transmissions occupy MN time units in the time domain, and the M second PUSCH transmissions occupy MN time units in the time domain), and the positions of the time units occupied by the two are also the same; the K first PUSCH transmissions and the M second PUSCH transmissions occupy the same number of frequency domain units (such as frequency domain units can be subcarriers or RBs) in the frequency domain, and the positions of the frequency domain units occupied by the two are also the same.

[0170] Wherein, the number of time units occupied by one first PUSCH transmission is less than the number of time units occupied by one second PUSCH transmission.

[0171] S802, the terminal device outputs the kth signal on the kth first PUSCH transmission; correspondingly, the network device obtains the kth signal on the kth first PUSCH transmission.

[0172] Wherein, k=1,2,…,K.

[0173] Specifically, the terminal device can output the first signal on the first first PUSCH transmission, output the second signal on the second first PUSCH transmission, output the third signal on the third first PUSCH transmission, and output the Kth signal on the Kth first PUSCH transmission.

[0174] Wherein, the kth signal is determined according to the first transport block and the kth element in the orthogonal cover code.

[0175] For example, when K is 4, the first signal can be determined according to the first transport block and the first element in the orthogonal cover code, the second signal can be determined according to the first transport block and the second element in the orthogonal cover code, the third signal can be determined according to the first transport block and the third element in the orthogonal cover code, and the fourth signal can be determined according to the first transport block and the fourth element in the orthogonal cover code.

[0176] Specifically, the first transport block can be block encoded, scrambled, modulated, and DFTed to obtain y(0), y(1), …, y(n), and multiplying y(0), y(1), …, y(n) by the kth element in the orthogonal cover code can obtain the kth signal.

[0177] Wherein, the specific way of determining the kth signal can refer to the content shown in the above FIG. 3, which will not be repeated here.

[0178] The sum of the i-th element, the K / M+i-th element, the 2K / M+i-th element, the (M-1)K / M+i-th element of the orthogonal cover code is 0.

[0179] The i is a positive integer less than or equal to K / M.

[0180] For example, the first element of the orthogonal cover code is 1, the second element of the orthogonal cover code is 1, the third element of the orthogonal cover code is 1, and the fourth element of the orthogonal cover code is 1.

[0181] For example, when M is 2 and K is 4, i can be 1, or i can be 2.

[0182] For example, when M is 2 and K is 4, if i is 1, the sum of the first element and the third element of the orthogonal cover code can be 0; if i is 2, the sum of the second element and the fourth element of the orthogonal cover code can be 0.

[0183] Based on the communication method shown in FIG. 8, a single transmission of the first transport block occupies MN / K time units, and the first PUSCH transmission carries the first transport block, a single transmission of the second transport block occupies N time units, and the second PUSCH transmission carries the second transport block, so the first PUSCH transmission can be understood as a PUSCH transmission in the PUSCH repetition Type B transmission mode, and the second PUSCH transmission can be understood as a PUSCH transmission in the PUSCH repetition Type A transmission mode. In the case where K first PUSCH transmissions and M second PUSCH transmissions all occupy MN time units, and the sum of the i-th element, the K / M+i-th element, the 2K / M+i-th element, …, and the (M-1)K / M+i-th element of the orthogonal cover code is 0, the amplitudes of the signals on the i-th first PUSCH transmission, the K / M+i-th first PUSCH transmission, the 2K / M+i-th first PUSCH transmission, …, and the (M-1)K / M+i-th first PUSCH transmission after superposition can be as small as possible (such as approaching 0), which can ensure as much as possible that the signals on the M second PUSCH transmissions after superposition are not interfered by the signals on the first PUSCH transmissions, that is, the interference of the signals on the first PUSCH transmissions to the signals on the second PUSCH transmissions can be reduced, and correspondingly, the interference of the signals on the second PUSCH transmissions to the signals on the first PUSCH transmissions can be reduced, which can improve the reliability of communication; in addition, the first PUSCH transmission and the second PUSCH transmission can coexist (that is, a terminal device based on the first PUSCH transmission carrying a data block and a terminal device based on the second PUSCH transmission carrying a data block can simultaneously communicate with the network device), which can effectively improve the capacity of uplink coverage and improve the throughput of the communication system, thereby improving the communication performance.

[0184] Based on the communication method shown in FIG. 8, the first PUSCH and the second PUSCH can be transmitted on the same time-frequency resource, that is, the PUSCH can be transmitted based on the PUSCH repetition type B mode and the PUSCH can be transmitted based on the PUSCH repetition type A mode on the same time-frequency resource. It can also be described that the PUSCH transmitted based on the PUSCH repetition type B mode and the PUSCH transmitted based on the PUSCH repetition type A mode can coexist, and specifically, the following four possible cases can exist:

[0185] In the first possible scenario, PUSCH repetition Type B (PUSCH repetition Type B w / o TBoMS) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) coexist.

[0186] In the first possible scenario, there is no coexistence configuration, meaning that regardless of the values ​​of M, N, and K, the interference between the signals on the first PUSCH transmission and the signals on the second PUSCH transmission cannot be reduced in the first possible scenario.

[0187] Here, w / o means without.

[0188] In the second possible scenario, PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) coexist with PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0189] Here, w / means "with".

[0190] Among them, there are three coexisting configurations in the second possible case. For details, please refer to the first possible design, the second possible design, and the third possible design below, which will not be elaborated here.

[0191] In the third possible scenario, PUSCH repetition Type B (PUSCH repetition Type B w / o TBoMS) and PUSCH repetition Type A (PUSCH repetition Type A w / TBoMS) coexist.

[0192] In the third possible scenario, there is no coexistence configuration. That is, regardless of the values ​​of M, N, and K, it is impossible to reduce the interference between the signals on the first PUSCH transmission and the signals on the second PUSCH transmission in the third possible scenario.

[0193] In the fourth possible scenario, PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) coexist with PUSCH repetition Type A (PUSCH repetition Type A w / TBoMS).

[0194] In the fourth possible case, there is one coexistence configuration, which can be seen from the fourth possible design below, and will not be described here.

[0195] Based on the communication method shown in FIG. 8, optionally, the orthogonal cover code can be included in a subset of the orthogonal cover code set.

[0196] The orthogonal cover code set can be determined according to a discrete Fourier transform matrix, or the orthogonal cover code set can be determined according to a Walsh matrix, or the orthogonal cover code set can be determined according to a permuted discrete Fourier transform matrix.

[0197] Specifically, the orthogonal cover code set can include a sequence of elements on each row of any of the above matrices. The present application provides two possible implementations.

[0198] In the first possible implementation, when the length of the orthogonal cover code is 4, the orthogonal cover code set can be determined according to a discrete Fourier transform matrix of length 4 (such as determining the orthogonal cover code set 11), or the orthogonal cover code set can be determined according to a Walsh matrix of length 4 (such as determining the orthogonal cover code set 12), or the orthogonal cover code set can be determined according to a permuted discrete Fourier transform matrix of length 4 (such as determining the orthogonal cover code set 13).

[0199] The discrete Fourier transform matrix of length 4 is: The orthogonal cover code set 11 can include: [1, 1, 1, 1], [1, j, -1, -j], [1, -1, 1, -1], and [1, -j, -1, j].

[0200] The Walsh matrix of length 4 is: The orthogonal cover code set 12 can include: [1, 1, 1, 1], [1, -1, 1, -1], [1, 1, -1, -1], and [1, -1, -1, 1].

[0201] The permuted discrete Fourier transform matrix of length 4 can be: The permuted discrete Fourier transform matrix of length 4 can be obtained by swapping the 2nd column and the 3rd column of the discrete Fourier transform matrix of length 4. The orthogonal cover code set 13 can include: [1, 1, 1, 1], [1, -1, j, -j], [1, 1, -1, -1], and [1, -1, -j, j].

[0202] In a second possible implementation, in the case that the length of the orthogonal cover code is 8, the orthogonal cover code set can be determined according to a discrete Fourier transform matrix of length 8 (e.g., to determine the orthogonal cover code set 21), or the orthogonal cover code set can be determined according to a Walsh matrix of length 8 (e.g., to determine the orthogonal cover code set 22).

[0203] where the discrete Fourier transform matrix of length 8 is: The orthogonal cover code set 21 can include: [1, 1, 1, 1, 1, 1, 1, 1], [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ], [1, j, -1, -j, 1, j, -1, -j], [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ], [1, -1, 1, -1, 1, -1, 1, -1], [1, e j5π / 4 ,j, e j7π / 4 ,-1, e jπ / 4 ,-j, e j3π / 4 ], [1, -j, -1, j, 1, -j, -1, j], [1, e j7π / 4 ,-j, e j5π / 4 ,-1, e j3π / 4 ,j, e jπ / 4 ].

[0204] where the Walsh matrix of length 8 is: The orthogonal cover code set 22 can include: [1, 1, 1, 1, 1, 1, 1, 1], [1, -1, 1, -1, 1, -1, 1, -1], [1, 1, -1, -1, 1, 1, -1, -1], [1, -1, -1, 1, 1, -1, -1, 1], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0205] It can be understood that the orthogonal cover code set can be predefined, or the orthogonal cover code set can be indicated by a network device.

[0206] The network device can indicate the set of orthogonal cover codes through configuration information of the set of orthogonal cover codes. The configuration information of the set of orthogonal cover codes can be located in a system message, or the configuration information of the set of orthogonal cover codes can be located in a radio resource control (RRC) message, or the configuration information of the set of orthogonal cover codes can be transmitted separately, which is not limited in the present application.

[0207] The subset of the set of orthogonal cover codes can include one or more orthogonal cover codes in the set of orthogonal cover codes.

[0208] The sum of the i-th element, the K / M+i-th element, the 2K / M+i-th element, …, the (M-1)K / M+i-th element of the orthogonal cover codes in the subset of the set of orthogonal cover codes is 0.

[0209] For example, assuming that the set of orthogonal cover codes 11 includes [1, 1, 1, 1], [1, j, -1, -j], [1, -1, 1, -1], and [1, -j, -1, j], M is 2, N is 1, and K is 4, the sum of the first element and the third element of the orthogonal cover codes in the subset of the set of orthogonal cover codes 11 is 0, the sum of the second element and the fourth element of the orthogonal cover codes in the subset of the set of orthogonal cover codes 11 is 0, and the subset of the set of orthogonal cover codes 11 can include [1, j, -1, -j] and [1, -j, -1, j].

[0210] It can be understood that the subset of the set of orthogonal cover codes can be predefined, or the subset of the set of orthogonal cover codes can be configured by the network device.

[0211] The network device can configure the subset of the set of orthogonal cover codes through configuration information of the subset of the set of orthogonal cover codes. The configuration information of the subset of the set of orthogonal cover codes can be located in a system message, or the configuration information of the set of orthogonal cover codes can be located in a radio resource control (RRC) message, or the configuration information of the set of orthogonal cover codes can be transmitted separately, which is not limited in the present application.

[0212] The specific way of determining the subset of the set of orthogonal cover codes can refer to the description of the subset of the set of orthogonal cover codes in the following four possible designs, which is not described herein.

[0213] Optionally, the network device can indicate the orthogonal cover code through the indication information.

[0214] The indication information can directly indicate the orthogonal cover code, or the indication information can indicate the index of the orthogonal cover code.

[0215] In an example, the indication information can indicate the index of the orthogonal cover code in the set of orthogonal cover codes.

[0216] For example, taking the example that the orthogonal cover code set 11 includes [1, 1, 1, 1], [1, j, -1, -j], [1, -1, 1, -1], and [1, -j, -1, j], the indication information can indicate the index of the orthogonal cover code through two bits, the bit value can be set to 00 to represent the index of [1, 1, 1, 1]; the bit value can be set to 01 to represent the index of [1, j, -1, -j]; the bit value can be set to 10 to represent the index of [1, -1, 1, -1]; and the bit value can be set to 11 to represent the index of [1, -j, -1, j].

[0217] In another example, the indication information can indicate the index of the orthogonal cover code in the subset of the orthogonal cover code set.

[0218] For example, taking the example that the subset of the orthogonal cover code set 11 includes [1, j, -1, -j] and [1, -j, -1, j], the indication information can indicate the index of the orthogonal cover code through one bit, the bit value can be set to 0 to represent the index of [1, j, -1, -j]; and the bit value can be set to 1 to represent the index of [1, -j, -1, j].

[0219] Based on the above two possible examples, when the indication information indicates the index of the orthogonal cover code in the subset of the orthogonal cover code set, the transmission overhead can be reduced, and thus the communication performance can be improved. In addition, the subset of the orthogonal cover code set is included in the orthogonal cover code set, and thus the existing orthogonal cover code can be compatible, and thus the implementation complexity can be reduced.

[0220] Optionally, for different values of M, N and K, different coexistence configurations can be determined to implement the coexistence of the PUSCH repetition Type B transmission mode and the PUSCH repetition Type A transmission mode. The present application provides four possible designs:

[0221] In a first possible design, M can be 2, N can be 1, and K can be 4.

[0222] Specifically, as shown in FIG. 9, the same transport block can be transmitted through two time units (e.g., time unit 0 and time unit 1). In the PUSCH repetition Type B transmission mode, the maximum number of transmissions of the first PUSCH transmission can be 4 (the first PUSCH transmission carries the first transport block), and a single transmission of the first transport block can occupy 1 / 2 time units, i.e., the first first PUSCH transmission and the second first PUSCH transmission are located in time unit 0, and the third first PUSCH transmission and the fourth first PUSCH transmission are located in time unit 1, and the transport blocks carried by different first PUSCH transmissions are all the first transport block; in the PUSCH repetition Type A transmission mode, the maximum number of transmissions of the second PUSCH transmission can be 2 (the second PUSCH transmission carries the second transport block), and a single transmission of the second transport block can occupy 1 time unit, i.e., the first second PUSCH transmission is located in time unit 0, and the second second PUSCH transmission is located in time unit 1, and the transport blocks carried by different second PUSCH transmissions are all the second transport block.

[0223] In the coexistence configuration shown in FIG. 9, the coexistence of the PUSCH repetition Type B and the TBoMS-2 inter-symbol OCC-4 length-4 orthogonal cover code (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-4) and the PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) can be referred to as.

[0224] In the coexistence configuration shown in FIG. 9, the coexistence of the PUSCH repetition Type B and the TBoMS-2 inter-symbol OCC-4 length-4 orthogonal cover code (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-4) and the PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) can be referred to as.

[0225] In the first possible design, the sum of the first element and the third element in the orthogonal cover code is 0, and the sum of the second element and the fourth element in the orthogonal cover code is 0.

[0226] For example, the orthogonal cover code can be any one of the following: [1, j, -1, -j], [1, -j, -1, j], [1, -1, -1, 1], or [1, 1, -1, -1].

[0227] Optionally, the orthogonal cover code can be included in a subset of an orthogonal cover code set.

[0228] For example, the orthogonal cover code set can be any one of the following: orthogonal cover code set 11, orthogonal cover code set 12, or orthogonal cover code set 13.

[0229] The orthogonal covering code set 11, orthogonal covering code set 12, or orthogonal covering code set 13 can be referred to the above description of orthogonal covering code set 11, orthogonal covering code set 12, or orthogonal covering code set 13, and will not be repeated here.

[0230] In the subset of the orthogonal covering codes, the sum of the first and third elements of the orthogonal covering codes is 0, and the sum of the second and fourth elements is 0.

[0231] In the first example, a subset of the orthogonal covering code set 11 may include [1,j,-1,-j] and [1,-j,-1,j].

[0232] It is understandable that a subset of the orthogonal covering code set 11 may include a sequence of elements in the second row and a sequence of elements in the fourth row of a discrete Fourier transform matrix of length 4.

[0233] It is understandable that the orthogonal covering code can be [1,j,-1,-j] in a subset of the orthogonal covering code set 11 (or it can be described as [1,j,-1,-j] in a discrete Fourier transform matrix of length 4), or the orthogonal covering code can be [1,-j,-1,j] in a subset of the orthogonal covering code set 11 (or it can be described as [1,-j,-1,j] in a discrete Fourier transform matrix of length 4).

[0234] In the second example, a subset of the orthogonal covering code set 12 may include [1,1,-1,-1] and [1,-1,-1,1].

[0235] Understandably, a subset of the orthogonal covering code set 12 may include a sequence of elements in the third row and a sequence of elements in the fourth row of a Walsh code of length 4.

[0236] It is understandable that the orthogonal covering code can be [1,1,-1,-1] in a subset of the orthogonal covering code set 12 (or it can be described as [1,1,-1,-1] in a Walsh matrix of length 4), or the orthogonal covering code can be [1,-1,-1,1] in a subset of the orthogonal covering code set 12 (or it can be described as [1,-1,-1,1] in a Walsh matrix of length 4).

[0237] In the third example, a subset of the orthogonal covering code set 13 may include [1,1,-1,-1].

[0238] Understandably, a subset of the orthogonal covering code set 13 may include a sequence of elements in the third row of a permutation discrete Fourier transform matrix of length 4.

[0239] It can be understood that the orthogonal cover code can be [1, 1, -1, -1] in a subset of the orthogonal cover code set 13 (which can also be described as the orthogonal cover code being [1, 1, -1, -1] in a permutation discrete Fourier transform matrix of length 4).

[0240] Based on the first possible design, since the sum of the first element and the third element in the orthogonal cover code is 0, and the sum of the second element and the fourth element in the orthogonal cover code is 0, the amplitude of the signal after the signal on the first first PUSCH transmission and the signal on the third first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the second first PUSCH transmission and the signal on the fourth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), so that the signal after superposition on the second PUSCH transmission can be guaranteed as much as possible not to be interfered by the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission on the signal on the second PUSCH transmission can be reduced), while the SNR of the signal on the second PUSCH transmission can be improved, the reliability of the communication can be effectively improved, and the communication performance can be improved.

[0241] The second possible design is that M can be 2, N can be 1, and K can be 8.

[0242] Specifically, as shown in the following FIG. 10, the same transport block can be transmitted through two time units (such as time unit 0 and time unit 1). In the PUSCH repetition Type B transmission mode, the maximum number of transmissions of the first PUSCH transmission can be 8 (the first PUSCH transmission carries the first transport block), and a single transmission of the first transport block can occupy 1 / 4 time unit, that is, the first first PUSCH transmission, the second first PUSCH transmission, the third first PUSCH transmission, and the fourth first PUSCH transmission are located in time unit 0, the fifth first PUSCH transmission, the sixth first PUSCH transmission, the seventh first PUSCH transmission, and the eighth first PUSCH transmission are located in time unit 1, and the transport blocks carried by different first PUSCH transmissions are all first transport blocks; in the PUSCH repetition Type A transmission mode, the maximum number of transmissions of the second PUSCH transmission can be 2 (the second PUSCH transmission carries the second transport block), and a single transmission of the second transport block can occupy 1 time unit, that is, the first second PUSCH transmission is located in time unit 0, and the second second PUSCH transmission is located in time unit 1, and the transport blocks carried by different second PUSCH transmissions are all second transport blocks.

[0243] In the coexistence configuration shown in FIG. 10, the coexistence of the PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8 and the PUSCH repetition Type A w / o TBoMS can be referred to as PUSCH repetition Type B and TBoMS-2 inter-symbol orthogonal cover code length 8 (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0244] In the coexistence configuration shown in FIG. 10, the coexistence of the PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8 and the PUSCH repetition Type A w / o TBoMS can be referred to as PUSCH repetition Type B and TBoMS-2 inter-symbol orthogonal cover code length 8 (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0245] In the coexistence configuration shown in FIG. 10, the coexistence of the PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8 and the PUSCH repetition Type A w / o TBoMS can be referred to as PUSCH repetition Type B and TBoMS-2 inter-symbol orthogonal cover code length 8 (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0246] For example, the orthogonal cover code can be any one of the following: [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ], [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ], [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0247] Optionally, the orthogonal cover code can be included in a subset of an orthogonal cover code set.

[0248] For example, the orthogonal cover code set can be any one of the following: the orthogonal cover code set 21 or the orthogonal cover code set 22.

[0249] The orthogonal cover code set 21 or the orthogonal cover code set 22 can refer to the description of the orthogonal cover code set 21 or the orthogonal cover code set 22 described above, and details are not repeated here.

[0250] The sum of the first element and the fifth element of the orthogonal cover code in the subset of the orthogonal cover code set is 0, the sum of the second element and the sixth element is 0, the sum of the third element and the seventh element is 0, and the sum of the fourth element and the eighth element is 0.

[0251] In the first example, the subset 1 of the orthogonal cover code set 21 can include [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ], [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ], [1, e j5π / 4 ,j, e j7π / 4 ,-1, e jπ / 4 ,-j, e j3π / 4 ], and [1, e j7π / 4 ,-j, e j5π / 4 ,-1, e 53π / 4 ,j, e jπ / 4 ].

[0252] It can be understood that the subset 1 of the orthogonal cover code set 21 can include a sequence composed of elements on the second row, a sequence composed of elements on the fourth row, a sequence composed of elements on the sixth row, and a sequence composed of elements on the eighth row of the discrete Fourier transform matrix with a length of 8.

[0253] It can be understood that the orthogonal cover code can be [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ] in the subset 1 of the orthogonal cover code set 21 (which can also be described as the orthogonal cover code being [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ] in the discrete Fourier transform matrix with a length of 8); or the orthogonal cover code can be [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ] in the subset 1 of the orthogonal cover code set 21 (which can also be described as the orthogonal cover code being [1, e j3π / 4-1, e jπ / 4 -1, e j7π / 4 -1, e j5π / 4 ]) or, the orthogonal cover code can be [1, e j5π / 4 -1, e j7π / 4 -1, e 5π / 4 -1, e j3π / 4 ]) or, the orthogonal cover code can be [1, e j5π / 4 -1, e j7π / 4 -1, e jπ / 4 -1, e j3π / 4 ]) or, the orthogonal cover code can be [1, e j7π / 4 -1, e j5π / 4 -1, e j3π / 4 -1, e jπ / 4 ]) or, the orthogonal cover code can be [1, e j7π / 4 -1, e j5π / 4 -1, e 53π / 4 -1, e jπ / 4 ]).

[0254] In the second example, the subset of the set of orthogonal cover codes 22 can include [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], and [1, -1, -1, 1, -1, 1, 1, -1].

[0255] It can be appreciated that the subset of the set of orthogonal cover codes 22 can include a sequence of elements on the 5th row, a sequence of elements on the 6th row, a sequence of elements on the 7th row, and a sequence of elements on the 8th row of a Walsh matrix of length 8.

[0256] It can be understood that the orthogonal cover code can be [1, 1, 1, 1, -1, -1, -1, -1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, 1, 1, 1, -1, -1, -1, -1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, -1, 1, -1, -1, 1, -1, 1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, -1, 1, -1, -1, 1, -1, 1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, 1, -1, -1, -1, -1, 1, 1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, 1, -1, -1, -1, -1, 1, 1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, -1, -1, 1, -1, 1, 1, -1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, -1, -1, 1, -1, 1, 1, -1] in the Walsh matrix of length 8).

[0257] Since the sum of the first element and the fifth element in the orthogonal cover code is 0, the sum of the second element and the sixth element in the orthogonal cover code is 0, the sum of the third element and the seventh element in the orthogonal cover code is 0, and the sum of the fourth element and the eighth element in the orthogonal cover code is 0, the amplitude of the signal after the signal on the first first PUSCH transmission and the signal on the fifth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the second first PUSCH transmission and the signal on the sixth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the third first PUSCH transmission and the signal on the seventh first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the fourth first PUSCH transmission and the signal on the eighth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), so that the signal after superposition on the second PUSCH transmission can be guaranteed to be as little as possible. Interference of the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission to the signal on the second PUSCH transmission can be reduced), and at the same time, the SNR of the signal on the second PUSCH transmission can be improved, the reliability of communication can be effectively improved, and the communication performance can be improved.

[0258] The third possible design is that M can be 4, N can be 1, and K can be 8.

[0259] Specifically, as shown in the following FIG. 11, the same transport block can be transmitted through four time units (e.g., time unit 0, time unit 1, time unit 2, and time unit 3). In the PUSCH repetition Type B transmission manner, the maximum number of transmission times of the first PUSCH transmission can be 8 (the first PUSCH transmission carries the first transport block), and a single transmission of the first transport block can occupy 1 / 2 time units, i.e., the first first PUSCH transmission and the second first PUSCH transmission are located in time unit 0, the third first PUSCH transmission and the fourth first PUSCH transmission are located in time unit 1, the fifth first PUSCH transmission and the sixth first PUSCH transmission are located in time unit 2, and the seventh first PUSCH transmission and the eighth first PUSCH transmission are located in time unit 3. The transport blocks carried by different first PUSCH transmissions are all the first transport block; in the PUSCH repetition Type A transmission manner, the maximum number of transmission times of the second PUSCH transmission can be 4 (the second PUSCH transmission carries the second transport block), and a single transmission of the second transport block can occupy 1 time unit, i.e., the first second PUSCH transmission is located in time unit 0, the second second PUSCH transmission is located in time unit 1, the third second PUSCH is located in time unit 2, and the fourth second PUSCH transmission is located in time unit 3. The transport blocks carried by different second PUSCH transmissions are all the second transport block.

[0260] In the coexistence configuration shown in FIG. 11, the coexistence of the PUSCH repetition Type B and the TBoMS-4 inter-symbol orthogonal cover code length 8 symbol orthogonal cover code (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) and the PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) can be referred to as.

[0261] In the coexistence configuration shown in FIG. 11, the coexistence of the PUSCH repetition Type B and the TBoMS-4 inter-symbol orthogonal cover code length 8 symbol orthogonal cover code (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) and the PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) can be referred to as.

[0262] In the second possible design, the sum of the 1st element, the 3rd element, the 5th element, and the 7th element in the orthogonal cover code is 0; and the sum of the 2nd element, the 4th element, the 6th element, and the 8th element in the orthogonal cover code is 0.

[0263] For example, the orthogonal cover code can be any one of the following: [1, e jπ / 4 , j, e j3π / 4 , -1, e j5π / 4 , -j, ej7π / 4 [1, -j, -1, j, 1, -j, -1, j], [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e 55π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e 53π / 4 ], [1, -j, -1, j, 1, -j, -1, j], [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ], [1, 1, -1, -1, 1, 1, -1, -1], [1, -1, -1, 1, 1, -1, -1, 1], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0264] Optionally, the orthogonal cover code can be included in a subset of the set of orthogonal cover codes.

[0265] The set of orthogonal cover codes can be any one of the following: the set of orthogonal cover codes 21, or the set of orthogonal cover codes 22.

[0266] In the subset of the set of orthogonal cover codes, the sum of the first element, the third element, the fifth element, and the seventh element of the orthogonal cover code is 0, and the sum of the second element, the fourth element, the sixth element, and the eighth element of the orthogonal cover code is 0.

[0267] In the first example, the subset 2 of the set of orthogonal cover codes 21 can include [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e 57π / 4 ], [1, e j3π / 4 j, e jπ / 4 -1, e j7π / 4 -j, e j5π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ], [1, e j7π / 4 j, e j5π / 4 -1, e j3π / 4 j, ejπ / 4 ]。

[0268] It is appreciated that the subset 2 of the set 21 of orthogonal cover codes can include a sequence of elements on the 2nd row, a sequence of elements on the 3rd row, a sequence of elements on the 4th row, a sequence of elements on the 6th row, a sequence of elements on the 7th row, and a sequence of elements on the 8th row of the length-8 Discrete Fourier Transform matrix.

[0269] It is appreciated that the orthogonal cover code can be [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ] in the subset 2 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e jπ / 4 ,j, e j3π / 4 ,-1, e j5π / 4 ,-j, e j7π / 4 ] in the length-8 Discrete Fourier Transform matrix); or, the orthogonal cover code can be [1, j, -1, -j, 1, j, -1, -j] in the subset 2 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, j, -1, -j, 1, j, -1, -j] in the length-8 Discrete Fourier Transform matrix); or, the orthogonal cover code can be [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ] in the subset 2 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e j3π / 4 ,-j, e jπ / 4 ,-1, e j7π / 4 ,j, e j5π / 4 ] in the length-8 Discrete Fourier Transform matrix); or, the orthogonal cover code can be [1, e j5π / 4 ,j, e j7π / 4 ,-1, e 5π / 4 ,-j, e j3π / 4 ] in the subset 2 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e j5π / 4 ,j, e j7π / 4 ,-1, e jπ / 4 ,-j, e j3π / 4]) or, the orthogonal cover code can be [1, -j, -1, j, 1, -j, -1, j] in subset 2 of orthogonal cover code set 21 (which can also be described as the orthogonal cover code being [1, -j, -1, j, 1, -j, -1, j] in a length-8 Discrete Fourier Transform matrix) or, the orthogonal cover code can be [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ] in subset 2 of orthogonal cover code set 21 (which can also be described as the orthogonal cover code being [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ] in a length-8 Discrete Fourier Transform matrix).

[0270] In a second example, the subset of orthogonal cover code set 22 can include [1, 1, -1, -1, 1, 1, -1, -1], [1, -1, -1, 1, 1, -1, -1, 1], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], and [1, -1, -1, 1, -1, 1, 1, -1].

[0271] It can be appreciated that the subset of orthogonal cover code set 22 can include a sequence of elements on the 3rd row, a sequence of elements on the 4th row, a sequence of elements on the 5th row, a sequence of elements on the 6th row, a sequence of elements on the 7th row, and a sequence of elements on the 8th row of a length-8 Walsh matrix.

[0272] It can be understood that the orthogonal cover code can be [1, 1, -1, -1, 1, 1, -1, -1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, 1, -1, -1, 1, 1, -1, -1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, -1, -1, 1, 1, -1, -1, 1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, -1, -1, 1, 1, -1, -1, 1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, 1, 1, 1, -1, -1, -1, -1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, 1, 1, 1, -1, -1, -1, -1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, -1, 1, -1, -1, 1, -1, 1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, -1, 1, -1, -1, 1, -1, 1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, 1, -1, -1, -1, -1, 1, 1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, 1, -1, -1, -1, -1, 1, 1] in the Walsh matrix of length 8); or, the orthogonal cover code can be [1, -1, -1, 1, -1, 1, 1, -1] in the subset of the orthogonal cover code set 22 (which can also be described as the orthogonal cover code being [1, -1, -1, 1, -1, 1, 1, -1] in the Walsh matrix of length 8).

[0273] Based on the third possible design, since the sum of the 1st element, the 3rd element, the 5th element, and the 7th element in the orthogonal cover code is 0, and the sum of the 2nd element, the 4th element, the 6th element, and the 8th element in the orthogonal cover code is 0, the amplitudes of the signals after superposition of the signal on the first time first PUSCH transmission, the signal on the third time first PUSCH transmission, the signal on the fifth time first PUSCH transmission, and the signal on the seventh time first PUSCH transmission can be as small as possible (such as tending to 0), and similarly, the amplitudes of the signals after superposition of the signal on the second time first PUSCH transmission, the signal on the fourth time first PUSCH transmission, the signal on the sixth time first PUSCH transmission, and the signal on the eighth time first PUSCH transmission can be as small as possible (such as tending to 0), so that the signal after superposition on the second PUSCH transmission can be guaranteed to be as little as possible affected by the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission on the signal on the second PUSCH transmission can be reduced), and meanwhile the SNR of the signal on the second PUSCH transmission can be improved, and the reliability of the communication can be effectively improved, and the communication performance can be improved.

[0274] In a fourth possible design, M can be 2, N can be 2, and K can be 8.

[0275] Specifically, as shown in FIG. 12, the same transport block can be transmitted through four time units (e.g., time unit 0, time unit 1, time unit 2, and time unit 3). In the PUSCH repetition Type B transmission manner, the maximum number of transmissions of the first PUSCH transmission can be 8 (the first PUSCH transmission carries a first transport block), and a single transmission of the first transport block can occupy 1 / 2 time units, i.e., the first first PUSCH transmission and the second first PUSCH transmission are located in time unit 0, the third first PUSCH transmission and the fourth first PUSCH transmission are located in time unit 1, the fifth first PUSCH transmission and the sixth first PUSCH transmission are located in time unit 2, and the seventh first PUSCH transmission and the eighth first PUSCH transmission are located in time unit 3. The transport blocks carried by different first PUSCH transmissions are all the first transport block. In the PUSCH repetition Type A transmission manner, the maximum number of transmissions of the second PUSCH transmission can be 2 (the second PUSCH transmission carries a second transport block), and a single transmission of the second transport block can occupy 2 time units, i.e., the first second PUSCH transmission is located in time unit 0 and time unit 1, and the second second PUSCH transmission is located in time unit 2 and time unit 3. The transport blocks carried by different second PUSCH transmissions are all the second transport block.

[0276] In the coexistence configuration shown in FIG. 12, the coexistence of the PUSCH repetition Type B and TBoMS-2 (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) and the PUSCH repetition Type A and TBoMS-2 (PUSCH repetition Type A w / TBoMS-2) can be referred to as a symbol inter-time domain orthogonal cover code (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) with an orthogonal cover code length of 8.

[0277] In the coexistence configuration shown in FIG. 12, the coexistence of the PUSCH repetition Type B and TBoMS-2 (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) and the PUSCH repetition Type A and TBoMS-2 (PUSCH repetition Type A w / TBoMS-2) can be referred to as a symbol inter-time domain orthogonal cover code (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) with an orthogonal cover code length of 8.

[0278] In the fourth possible design, the sum of the first element and the fifth element in the orthogonal cover code is 0; the sum of the second element and the sixth element in the orthogonal cover code is 0; the sum of the third element and the seventh element in the orthogonal cover code is 0; and the sum of the fourth element and the eighth element in the orthogonal cover code is 0.

[0279] For example, the orthogonal cover code can be any one of: [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ], [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ], [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

[0280] Optionally, the orthogonal cover code can be included in a subset of the set of orthogonal cover codes.

[0281] wherein the set of orthogonal cover codes can be any one of: the set of orthogonal cover codes 21, or the set of orthogonal cover codes 22.

[0282] wherein a sum of a first element and a fifth element of the orthogonal cover code in the subset of the set of orthogonal cover codes is 0, a sum of a second element and a sixth element is 0, a sum of a third element and a seventh element is 0, and a sum of a fourth element and an eighth element is 0.

[0283] In a first example, the subset 1 of the set of orthogonal cover codes 21 can include [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e 57π / 4 ], [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ], [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ], and [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ].

[0284] It is appreciated that the subset 1 of the set 21 of orthogonal cover codes can include a sequence of elements on the 2nd row, a sequence of elements on the 4th row, a sequence of elements on the 6th row, and a sequence of elements on the 8th row of the length-8 Discrete Fourier Transform matrix.

[0285] It is appreciated that the orthogonal cover code can be [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in the subset 1 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in the length-8 Discrete Fourier Transform matrix); or the orthogonal cover code can be [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ] in the subset 1 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e j3π / 4 -j, e jπ / 4 -1, e j7π / 4 j, e j5π / 4 ] in the length-8 Discrete Fourier Transform matrix); or the orthogonal cover code can be [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ] in the subset 1 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ] in the length-8 Discrete Fourier Transform matrix); or the orthogonal cover code can be [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ] in the subset 1 of the set 21 of orthogonal cover codes (which can also be described as the orthogonal cover code being [1, e j7π / 4 -j, e j5π / 4 -1, e j3π / 4 j, e jπ / 4 ] in the length-8 Discrete Fourier Transform matrix).

[0286] In a second example, the subset of the set of orthogonal cover codes 22 can include [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], and [1, -1, -1, 1, -1, 1, 1, -1].

[0287] It can be appreciated that the subset of the set of orthogonal cover codes 22 can include a sequence of elements on the 5th row, a sequence of elements on the 6th row, a sequence of elements on the 7th row, and a sequence of elements on the 8th row of a length-8 Walsh matrix.

[0288] It can be appreciated that the orthogonal cover code can be [1, 1, 1, 1, -1, -1, -1, -1] in the subset of the set of orthogonal cover codes 22 (which can also be described as the orthogonal cover code being [1, 1, 1, 1, -1, -1, -1, -1] in a length-8 Walsh matrix); or, the orthogonal cover code can be [1, -1, 1, -1, -1, 1, -1, 1] in the subset of the set of orthogonal cover codes 22 (which can also be described as the orthogonal cover code being [1, -1, 1, -1, -1, 1, -1, 1] in a length-8 Walsh matrix); or, the orthogonal cover code can be [1, 1, -1, -1, -1, -1, 1, 1] in the subset of the set of orthogonal cover codes 22 (which can also be described as the orthogonal cover code being [1, 1, -1, -1, -1, -1, 1, 1] in a length-8 Walsh matrix); or, the orthogonal cover code can be [1, -1, -1, 1, -1, 1, 1, -1] in the subset of the set of orthogonal cover codes 22 (which can also be described as the orthogonal cover code being [1, -1, -1, 1, -1, 1, 1, -1] in a length-8 Walsh matrix).

[0289] Based on the fourth possible design, since the sum of the first element and the fifth element in the orthogonal cover code is 0, the sum of the second element and the sixth element in the orthogonal cover code is 0, the sum of the third element and the seventh element in the orthogonal cover code is 0, and the sum of the fourth element and the eighth element in the orthogonal cover code is 0, the amplitude of the signal after the signal on the first first PUSCH transmission and the signal on the fifth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the second first PUSCH transmission and the signal on the sixth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the third first PUSCH transmission and the signal on the seventh first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), and similarly, the amplitude of the signal after the signal on the fourth first PUSCH transmission and the signal on the eighth first PUSCH transmission are superimposed can be as small as possible (such as tending to 0), so that the signal after superposition on the second PUSCH transmission can be guaranteed to be as small as possible. The interference of the signal on the first PUSCH transmission (that is, the interference of the signal on the first PUSCH transmission to the signal on the second PUSCH transmission can be reduced), while the SNR of the signal on the second PUSCH transmission can be improved, the communication reliability can be effectively improved, and the communication performance can be improved.

[0290] Among the first possible design, the second possible design, and the third possible design, the coexistence configuration can be understood as the coexistence of PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS); the coexistence configuration in the fourth possible design can be understood as the coexistence of PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) and PUSCH repetition Type A and TBoMS (PUSCH repetition Type A w / TBoMS).

[0291] The various embodiments of the present application can be independently implemented or combined for implementation, without limitation. If there is no special description and logical conflict, the terms and / or descriptions provided in different embodiments of the present application are consistent and can be mutually referred to. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0292] It can be understood that, in the embodiments of the present application, the execution subject can execute part or all of the steps in the embodiments of the present application, and these steps or operations are only examples, and the embodiments of the present application can also execute other operations or various modifications of the operations. In addition, each step can be executed in a different order from that presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application are executed.

[0293] The above mainly introduces the scheme provided by the embodiments of the present application from the perspective of interaction between devices. It can be understood that, in order to realize the above functions, each device comprises a hardware structure and / or a software module for executing each function. Those skilled in the art can easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0294] The embodiments of the present application can divide the functional modules of each device according to the above method examples, for example, each functional module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or software functional module. The division of modules in the embodiments of the present application is illustrative, and is only a logical functional division. When actually implemented, there can be another division method.

[0295] In the case of dividing each functional module according to each function, FIG. 13 shows a terminal device 130 which can execute the actions performed by the terminal device in the method shown in FIG. 8, and all related contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained are referred to the above method embodiment, which will not be described here again.

[0296] The terminal device 130 can include a transceiver module 1301 and a processing module 1302. The terminal device 130 can be a communication device, or a chip applied to a communication device, or other combination device, component, etc. having the above terminal device functions. When the terminal device 130 is a communication device, the transceiver module 1301 can be a transceiver, which can include an antenna and a radio frequency circuit, etc. The processing module 1302 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the terminal device 130 is a component having the above terminal device functions, the transceiver module 1301 can be a radio frequency unit. The processing module 1302 can be a processor (or processing circuit), for example, a baseband processor. When the terminal device 130 is a chip system, the transceiver module 1301 can be an input / output interface of a chip (for example, a baseband chip). The processing module 1302 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. The transceiver module 1301 in the embodiments of the present application can be implemented by a transceiver or a transceiver related circuit component. The processing module 1302 can be implemented by a processor or a processor related circuit component (or processing circuit).

[0297] For example, the transceiver module 1301 can be configured to perform all the transceiver operations performed by the terminal device in the embodiments shown in FIG. 8, and / or other processes for supporting the technologies described herein. The processing module 1302 can be configured to perform all the operations performed by the terminal device in the embodiments shown in FIG. 8, except for the transceiver operations, and / or other processes for supporting the technologies described herein.

[0298] FIG. 14 shows a network device 140, which can perform the actions performed by the network device in the above-described method embodiments shown in FIG. 8. All related contents of the steps involved in the above-described method embodiments can be referred to the function description of the corresponding functional modules, and the technical effects that can be obtained can be referred to the above-described method embodiments, which will not be described here again.

[0299] The network device 140 can include a transceiver module 1401 and a processing module 1402. For example, the network device 140 can be a communication device, or a chip or other combination device or component having the above network device functions applied in the communication device. When the network device 140 is a communication device, the transceiver module 1401 can be a transceiver, which can include an antenna and a radio frequency circuit, etc. The processing module 1402 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the network device 140 is a component having the above network device functions, the transceiver module 1401 can be a radio frequency unit, and the processing module 1402 can be a processor (or processing circuit), for example, a baseband processor. When the network device 140 is a chip system, the transceiver module 1401 can be an input / output interface of a chip (for example, a baseband chip), and the processing module 1402 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. The transceiver module 1401 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component, and the processing module 1402 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0300] For example, the transceiver module 1401 can be configured to perform all the transceiver operations performed by the network device in the embodiments shown in FIG. 8, and / or other processes for supporting the technologies described herein; and the processing module 1402 can be configured to perform all the operations performed by the network device in the embodiments shown in FIG. 8, except for the transceiver operations, and / or other processes for supporting the technologies described herein.

[0301] As another implementation manner, the transceiver module 1301 in FIG. 13 can be replaced by a transceiver which can integrate the functions of the transceiver module 1301, and the processing module 1302 can be replaced by a processor which can integrate the functions of the processing module 1302. Further, the terminal device 130 shown in FIG. 13 can further include a memory. Alternatively, the transceiver module 1401 in FIG. 14 can be replaced by a transceiver which can integrate the functions of the transceiver module 1401, and the processing module 1402 can be replaced by a processor which can integrate the functions of the processing module 1402. Further, the network device 140 shown in FIG. 14 can further include a memory.

[0302] Alternatively, when the processing module 1302 is replaced by a processor and the transceiver module 1301 is replaced by a transceiver, the terminal device 130 involved in the embodiments of the present application can also be a communication apparatus 150 shown in FIG. 15. Alternatively, when the processing module 1402 is replaced by a processor and the transceiver module 1401 is replaced by a transceiver, the network device 140 involved in the embodiments of the present application can also be a communication apparatus 150 shown in FIG. 15.

[0303] The processor can be a logic circuit 1501, and the transceiver can be an interface circuit 1502. Further, the communication device 150 shown in FIG. 15 can further include a memory 1503.

[0304] The present application provides an implementation block diagram of baseband hardware, which can support the functions of any of the above method embodiments. As shown in FIG. 16, the baseband hardware can be implemented by a processing system. The processing system can be implemented by a bus architecture, which is generally represented by a bus. The bus can include any number of interconnecting buses, which depends on the specific application of the processing system and overall design constraints. The bus communicatively couples various circuits including one or more processors (generally represented by a processor), memory, and one or more computer-readable storage media (generally represented by a computer-readable storage medium). The bus can also link various other circuits, such as timing sources, peripherals, voltage regulators, and power management circuits, which are well-known in the art and thus, will not be further described. A bus interface provides an interface between the bus and a transceiver and between the bus and an interface.

[0305] The processor includes a microprocessor (such as X146, ARM), a microcontroller, a digital signal processor (DSP), an FPGA, a graphics processing unit (GPU), a programmable logic device (PLD), a state machine, gated logic, discrete hardware circuits, and other suitable hardware configured to perform various functions. That is, the processor used in the baseband can be used to implement the communication method shown in FIG. 8.

[0306] The processor is responsible for managing the bus and general processing, including the execution of software stored on the computer-readable medium. The software, when executed by the processor, causes the processing system to perform the various functions described below for any particular apparatus. The functions of the processor, the memory, and the computer-readable medium can be implemented by software, by firmware, by hardware, or by a combination of software, firmware, hardware, or by any combination thereof. The software can be stored on a computer-readable medium, which can be implemented by a memory, a computer-readable storage medium, or any other suitable tangible medium. The software can also be propagated as a signal over one or more computer networks, which can be implemented by a transceiver, an interface circuit, or any other suitable combination of hardware.

[0307] Exemplary, the processor can include communication and processing circuitry, which can include one or more hardware components that provide the physical structure that performs various processes related to wireless communication (e.g., signal reception and / or signal transmission). The communication and processing circuitry can include two or more transmit / receive chains. The functions implemented by the communication and processing circuitry can also be processed on a computer-readable medium.

[0308] The processing system can also include a transceiver that provides a communication interface or means for communicating with various other apparatus over a wireless transmission medium. The transceiver can be coupled to an antenna array, and the transceiver and antenna array can together function as a communication interface or means for communicating with a corresponding network type. At least one interface (e.g., network interface and / or user interface) provides a communication interface or means for communicating over the internal bus or via an external transmission medium.

[0309] The embodiments of the present application further provide a computer program product, which can realize the functions of any of the above-mentioned method embodiments when executed by a computer.

[0310] The embodiments of the present application further provide a computer program, which can realize the functions of any of the above-mentioned method embodiments when executed by a computer.

[0311] The embodiments of the present application further provide a computer readable storage medium. All or part of the flow of the above-mentioned method embodiments can be instructed by a computer program to relevant hardware to complete, and the program can be stored in the above-mentioned computer readable storage medium. When the program is executed, the program can include the flow of the above-mentioned method embodiments. The computer readable storage medium can be an internal storage unit of the terminal (including the data sending terminal and / or the data receiving terminal) of any of the above-mentioned embodiments, such as a hard disk or a memory of the terminal. The above-mentioned computer readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card and the like equipped on the terminal. Further, the above-mentioned computer readable storage medium can include both the internal storage unit and the external storage device of the terminal. The above-mentioned computer readable storage medium is used to store the above-mentioned computer program and other programs and data required by the terminal. The above-mentioned computer readable storage medium can also be used to temporarily store data that has been output or will be output.

[0312] The terms "first" and "second" and the like in the description, claims and drawings of the application are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. The terms "first" and "second" are used anecdotally and exemplarily, and do not imply a relative importance or a specific order. Therefore, a feature defined with "first" and "second" can include one or more of the features. In the description of the embodiments, the meaning of "a plurality of" is two or more unless otherwise specified.

[0313] Furthermore, the terms "comprise" and "comprising" and the like are used in the sense of "including" and "including but not limited to", respectively. The terms "consist of and "consisting of" are used in the sense of "including and including but not limited to" respectively, and the like. The terms "have", "has", and the like are used in the sense of "comprising". The terms "include", "including", and the like are used in the sense of "comprising".

[0314] In the present application, "at least one" means one or more. "Multiple" means two or more. "At least two" means two or three or more. "And / or", used to describe the relationship between associated objects, means that there can be three relationships. For example, "A and / or B" can mean that there are three cases: only A, only B, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one" or the like means any combination of these items, including single or multiple items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be singular or plural. "When" and "if" both mean that under certain objective circumstances, the corresponding processing will be done, not limited by time, and does not require a judgment action when implemented, nor does it mean that there are other limitations.

[0315] In the embodiments of the present application, the words "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of "exemplary" or "for example" is intended to present concepts in a concrete manner, facilitating understanding.

[0316] In the present application, "sending information to (a terminal device)" can be understood as that the destination of the information is the terminal device. It can include directly or indirectly sending information to the terminal device. "Receiving information from (a terminal device)" can be understood as that the source of the information is the terminal device. It can include directly or indirectly receiving information from the terminal device. The information can be processed between the source and the destination of the information sending, for example, format change, etc., but the destination can understand the valid information from the source.

[0317] Through the description of the above embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of functional modules is taken as an example, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0318] In several embodiments provided in the present application, the disclosed device and method can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the modules or units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0319] The units described as separate components can or can not be physically separated, and the components shown as units can be one physical unit or multiple physical units, that is, can be located in one place, or can be distributed to multiple different places. According to actual needs, part or all of the units can be selected to achieve the purpose of the present embodiment scheme.

[0320] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0321] The integrated unit, if in the form of a software function unit and sold or used as an independent product, can be stored in a readable storage medium. Based on such an understanding, the technical solutions of the embodiments of the present application can essentially or partially be embodied in the form of a software product, which is stored in a storage medium, includes several instructions to make an apparatus (which can be a single-chip microcomputer, a chip, etc.) or a processor execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various media that can store program codes.

Claims

1. A communication method characterized by comprising: Comprising: receiving first signaling; wherein the first signaling is used to schedule first physical uplink shared channel (PUSCH) transmission, the first PUSCH transmission carries a first transport block, the maximum number of transmissions of the first PUSCH transmission is K, and a single transmission of the first transport block occupies MN / K time units, M is the maximum number of transmissions of second PUSCH transmission, the second PUSCH transmission carries a second transport block, and a single transmission of the second transport block occupies N time units; M, N, and K are positive integers; on the kth first PUSCH transmission, output the kth signal; wherein the kth signal is determined according to the first transport block and the kth element in the orthogonal cover code, k = 1, 2, …, K, and the sum of the i th element, the K / M+i th element, the 2K / M+i th element, …, the (M-1)K / M+i th element in the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

2. A communication method characterized by comprising: Comprising: sending first signaling; wherein the first signaling is used to schedule first physical uplink shared channel (PUSCH) transmission, the first PUSCH transmission carries a first transport block, the maximum number of transmissions of the first PUSCH transmission is K, and a single transmission of the first transport block occupies MN / K time units, M is the maximum number of transmissions of second PUSCH transmission, the second PUSCH transmission carries a second transport block, and a single transmission of the second transport block occupies N time units; M, N, and K are positive integers; on the kth first PUSCH transmission, output the kth signal; wherein the kth signal is determined according to the first transport block and the kth element in the orthogonal cover code, k = 1, 2, …, K, and the sum of the i th element, the K / M+i th element, the 2K / M+i th element, …, the (M-1)K / M+i th element in the orthogonal cover code is 0, i is a positive integer less than or equal to K / M.

3. The method according to claim 1 or 2, characterized in that, M is 2, N is 1, and K is 4, the maximum number of transmissions of the second PUSCH transmission is 2, and a single transmission of the second transport block occupies 1 time unit; or the maximum number of transmissions of the first PUSCH transmission is 4, and a single transmission of the first transport block occupies 1 / 2 time unit.

4. The method of claim 3, wherein: the sum of the 1st element and the 3rd element in the orthogonal cover code is 0; and the sum of the 2nd element and the 4th element in the orthogonal cover code is 0.

5. The method of claim 3 or 4, wherein: the orthogonal cover code is any one of [1, j, -1, -j], [1, -j, -1, j], [1, -1, -1, 1], or [1, 1, -1, -1].

6. The method of any one of claims 3-5, wherein: the orthogonal cover code is [1, j, -1, -j] in a discrete Fourier transform matrix of length 4; or the orthogonal cover code is [1, -j, -1, j] in a discrete Fourier transform matrix of length 4.

7. The method of any one of claims 3-5, wherein the orthogonal cover code is [1, 1, -1, -1] in a Walsh matrix of length 4; or the orthogonal cover code is [1, -1, -1, 1] in a Walsh matrix of length 4.

8. The method of any one of claims 3-5, wherein the orthogonal cover code is [1, 1, -1, -1] in a permutation DFT matrix of length 4. M is 2, N is 1, and K is 8, the maximum number of transmissions of the second PUSCH transmission is 2, and each of the second transport blocks occupies one time unit in a single transmission; or 9. The method of claim 1 or 2, wherein, the maximum number of transmissions of the first PUSCH transmission is 8, and each of the first transport blocks occupies 1 / 4 time unit in a single transmission.

10. The method of claim 9, wherein a sum of a first element and a fifth element in the orthogonal cover code is 0; a sum of a second element and a sixth element in the orthogonal cover code is 0; a sum of a third element and a seventh element in the orthogonal cover code is 0; a sum of a fourth element and an eighth element in the orthogonal cover code is 0.

11. The method of claim 9 or 10, wherein 12. The method of any one of claims 9-11, wherein 13. The method of any one of claims 9-11, wherein the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in a Walsh matrix of length 8; or the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in a Walsh matrix of length 8; or The orthogonal cover code is any one of: [1, e jπ / 4 , j, e j3π / 4 , -1, e j5π / 4 , -j, e j7π / 4 ], [1, e j3π / 4 , -j, e jπ / 4 , -1, e j7π / 4 , j, e j5π / 4 ], [1, e j5π / 4 , j, e j7π / 4 , -1, e jπ / 4 , -j, e j3π / 4 ], [1, e j7π / 4 , -j, e j5π / 4 , -1, e j3π / 4 , j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1]. the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in a Walsh matrix of length 8; or The orthogonal cover code is [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j3π / 4 - j, e jπ / 4 - 1, e j7π / 4 j, e j5π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j7π / 4 - j, e j5π / 4 - 1, e j3π / 4 j, e jπ / 4 ] in a discrete Fourier transform matrix of length 8. the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in a Walsh matrix of length 8. M is 4, N is 1, and K is 8, the maximum number of transmissions of the second PUSCH transmission is 4, and each of the second transport blocks occupies one time unit in a single transmission; or the maximum number of transmissions of the first PUSCH transmission is 8, and each of the first transport blocks occupies 1 / 2 time unit in a single transmission.

15. The method of claim 14, wherein a sum of a first element, a third element, a fifth element, and a seventh element in the orthogonal cover code is 0; 14. The method of claim 1 or 2, wherein, a sum of a second element, a fourth element, a sixth element, and an eighth element in the orthogonal cover code is 0.

16. The method of claim 14 or 15, wherein 17. The method of any one of claims 14-16, wherein the orthogonal cover code is [1, j, -1, -j, 1, j, -1, -j] in a DFT matrix of length 8; or the orthogonal cover code is [1, -j, -1, j, 1, -j, -1, j] in a DFT matrix of length 8; or ​ ​ ​ The orthogonal cover code is any one of: [1, e jπ / 4 , j, e j3π / 4 , -1, e j5π / 4 , -j, e j7π / 4 ], [1, j, -1, -j, 1, j, -1, -j], [1, e j3π / 4 , -j, e jπ / 4 , -1, e j7π / 4 , j, e j5π / 4 ], [1, e j5π / 4 , j, e j7π / 4 , -1, e jπ / 4 , -j, e j3π / 4 ], [1, -j, -1, j, 1, -j, -1, j], [1, e j7π / 4 , -j, e j5π / 4 , -1, e j3π / 4 , j, e jπ / 4 ], [1, 1, -1, -1, 1, 1, -1, -1], [1, -1, -1, 1, 1, -1, -1, 1], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1]. ​ The orthogonal cover code is [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; or ​ The orthogonal cover code is [1, e j3π / 4 - j, e jπ / 4 - 1, e j7π / 4 j, e j5π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ] in a discrete Fourier transform matrix of length 8; or ​ The orthogonal cover code is [1, e j7π / 4 - j, e j5π / 4 - 1, e j3π / 4 j, e jπ / 4 ] in a discrete Fourier transform matrix of length 8.

18. The method of any one of claims 14-16, wherein the orthogonal cover code is [1, 1, -1, -1, 1, 1, -1, -1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, -1, -1, 1, 1, -1, -1, 1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in a length-8 Walsh matrix. M is 2, N is 2, and K is 8, 19. The method of claim 1 or 2, wherein, the maximum number of transmissions of the second PUSCH transmission is 2, and each transmission of the second transport block occupies 2 time units; or the maximum number of transmissions of the first PUSCH transmission is 8, and each transmission of the first transport block occupies 1 / 2 time units.

20. The method of claim 19, wherein a sum of a first element and a fifth element of the orthogonal cover code is 0; a sum of a second element and a sixth element of the orthogonal cover code is 0; a sum of a third element and a seventh element of the orthogonal cover code is 0; and a sum of a fourth element and an eighth element of the orthogonal cover code is 0.

21. The method of claim 19 or 20, wherein 22. The method of any one of claims 19-21, wherein 23. The method of any one of claims 19-21, wherein the orthogonal cover code is [1, 1, 1, 1, -1, -1, -1, -1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, -1, 1, -1, -1, 1, -1, 1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, 1, -1, -1, -1, -1, 1, 1] in a length-8 Walsh matrix; or the orthogonal cover code is [1, -1, -1, 1, -1, 1, 1, -1] in a length-8 Walsh matrix. The orthogonal cover code is any one of: [1, e jπ / 4 , j, e j3π / 4 , -1, e j5π / 4 , -j, e j7π / 4 ], [1, e j3π / 4 , -j, e jπ / 4 , -1, e j7π / 4 , j, e j5π / 4 ], [1, e j5π / 4 , j, e j7π / 4 , -1, e jπ / 4 , -j, e j3π / 4 ], [1, e j7π / 4 , -j, e j5π / 4 , -1, e j3π / 4 , j, e jπ / 4 ], [1, 1, 1, 1, -1, -1, -1, -1], [1, -1, 1, -1, -1, 1, -1, 1], [1, 1, -1, -1, -1, -1, 1, 1], or [1, -1, -1, 1, -1, 1, 1, -1].

24. The method of any one of claims 1-23, wherein the orthogonal cover code is indicated by indication information. The orthogonal cover code is [1, e jπ / 4 j, e j3π / 4 -1, e j5π / 4 -j, e j7π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j3π / 4 - j, e jπ / 4 - 1, e j7π / 4 j, e j5π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j5π / 4 j, e j7π / 4 -1, e jπ / 4 -j, e j3π / 4 ] in a discrete Fourier transform matrix of length 8; or The orthogonal cover code is [1, e j7π / 4 - j, e j5π / 4 - 1, e j3π / 4 j, e jπ / 4 ] in a discrete Fourier transform matrix of length 8.

25. The method of any one of claims 1-24, wherein M is a power of 2.

26. The method of any one of claims 1-25, wherein K is a power of 2. the communication device comprises a processor configured to execute a computer program or instructions to cause the communication method of any one of claims 1, 3-26 to be performed, or to cause the communication method of any one of claims 2-26 to be performed. ​ ​ ​ ​ ​ ​ ​ ​ 27. A communications device, characterized by ​ 28. A communications device, characterized by The communication apparatus comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to perform the communication method according to any one of claims 1, 3-26, process and / or generate the information according to the information, or perform the communication method according to any one of claims 2-26, process and / or generate the information according to the information.

29. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are run on a computer, the communication method according to any one of claims 1, 3-26 is performed, or the communication method according to any one of claims 2-26 is performed.

30. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, the communication method according to any one of claims 1, 3-26 is performed, or the communication method according to any one of claims 2-26 is performed.

Images