Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can reduce interference between a transmission block in a PUSCH (Physical Uplink Shared Channel) reposition Type B transmission mode and a transmission block in a PUSCH reposition Type A transmission mode. The method comprises: a terminal device receives a first signaling; and outputting the kth signal on the kth first PUSCH transmission. Wherein the first signaling is used for scheduling first physical uplink shared channel (PUSCH) transmission, the first PUSCH transmission bears a first transmission block, the maximum transmission number of times of the first PUSCH transmission is K, single transmission of the first transmission block occupies MN / K time units, M is the maximum transmission number of times of the second PUSCH transmission, the second PUSCH transmission bears a second transmission block, and the first transmission block and the second transmission block occupy MN / K time units. The single transmission of the second transmission block occupies N time units; m, N and K are positive integers; the kth signal is determined according to the first transmission block and the kth element in the orthogonal cover code, k = 1, 2,..., K, the sum of the ith element, the K / M + i element, the 2K / M + i element,..., and the (M-1) K / M + i element of the orthogonal cover code is 0, and i is a positive integer smaller than or equal to K / M.

Description

TECHNICAL FIELD

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

[0002] 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 using an orthogonal cover code (OCC) to improve uplink coverage capacity.

[0003] 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 communication performance. SUMMARY

[0004] The present application provides a communication method and apparatus, which can reduce 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 communication performance.

[0005] 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,..., and 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.

[0006] 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.

[0007] 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.

[0008] 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 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, 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.

[0009] 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.

[0010] 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.

[0011] 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].

[0012] With the first aspect and the second aspect, in a possible implementation, 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.

[0013] With the first aspect and the second aspect, in a possible implementation, 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.

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

[0015] 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.

[0016] 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 (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 fourth 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 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.

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

[0018] With the first aspect and the second aspect, in a possible implementation, 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.

[0019] With the first aspect and the second aspect, in a possible implementation, a sum of the 1st element and the 5th element in the orthogonal cover code is 0; a sum of the 2nd element and the 6th element in the orthogonal cover code is 0; a sum of the 3rd element and the 7th element in the orthogonal cover code is 0; and a sum of the 4th element and the 8th element in the orthogonal cover code is 0.

[0020] With 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 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].

[0021] With 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 jπ / 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.

[0022] 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.

[0023] 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.

[0024] 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 superposition on the second PUSCH transmission can be as small as possible. guarantee that it is 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), while 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.

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

[0026] 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.

[0027] 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.

[0028] 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].

[0029] 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, ejπ / 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 ].

[0030] 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 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.

[0031] 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.

[0032] 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 on the first first-PUSCH transmission, the third first-PUSCH transmission, the fifth first-PUSCH transmission and the seventh first-PUSCH transmission after superposition can be as small as possible (e.g., tend to 0), and similarly, the amplitudes of the signals on the second first-PUSCH transmission, the fourth first-PUSCH transmission, the sixth first-PUSCH transmission and the eighth first-PUSCH transmission after superposition can be as small as possible (e.g., tend to 0), so that the signal on the second PUSCH transmission after superposition can be guaranteed to be as little as possible interfered by the signal on the first PUSCH transmission (i.e., the interference of the signal on the first PUSCH transmission to 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, the reliability of communication can be effectively improved, and the communication performance can be improved.

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

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

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

[0036] 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, 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, ej3π / 4 [1, e j7π / 4 , j, e j5π / 4 , -1, e j3π / 4 , -j, e jπ / 4 ] or [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].

[0037] 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 iπ / 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 jπ / 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.

[0038] 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 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.

[0039] 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.

[0040] 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.

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

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

[0043] 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.

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

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

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

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

[0048] In a third aspect, the embodiments of the present application provide a communication apparatus, which can be applied to the terminal device in the first aspect to implement the functions of 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 implement the functions of the terminal device through hardware or corresponding software. The hardware or software includes one or more modules corresponding to the functions. For example, the transceiver module and the processing module. The transceiver module can complete the following transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can complete the following processing operations independently or in cooperation with the transceiver module. No limitation is imposed.

[0049] For example, the transceiver module is configured to receive the first signaling. The first signaling is used to schedule the first PUSCH transmission. The first PUSCH transmission carries the 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 the second PUSCH transmission. The second PUSCH transmission carries the 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 the kth signal on the kth first PUSCH transmission. The kth signal is determined according to the first transport block and the kth element of the orthogonal cover code. K is equal to 1, 2,..., K. The sum of the ith element, the K / M+i element, the 2K / M+i element,..., and the (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.

[0050] Optionally, the transceiver module and the processing module of the communication apparatus in the third aspect can also 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 can also be found in the foregoing related content.

[0051] In a fourth aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the network device of the second aspect to implement the functions performed by the network device. The communication apparatus can be the network device, a chip or a chip system or a system on chip, etc. The communication apparatus can perform the functions of the network device through hardware or by executing corresponding software. 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 transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the processing operations independently or in cooperation with the transceiver module.

[0052] For example, the transceiver module is configured to send the first signaling. The first signaling is used to schedule the first PUSCH transmission. The first PUSCH transmission carries the 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 the second PUSCH transmission. The second PUSCH transmission carries the second transport block. The second transport block occupies N time units in a single transmission. M, N and K are positive integers. The processing module is configured to obtain the kth signal on the kth first PUSCH transmission. The kth signal is determined according to the first transport block and the kth element of the orthogonal cover code. K is equal to 1, 2, …, K. The sum of the ith element, the K / M+i element, the 2K / M+i element, …, the (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.

[0053] 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. For details, refer to the detailed description in the method examples. The beneficial effects achieved can also be found in the foregoing related content.

[0054] In a fifth aspect, an embodiment of the present application provides a communication apparatus, which includes one or more processors. The one or more processors are configured to run computer programs or instructions. When the one or more processors execute the computer programs or instructions, the communication method in any one of the first aspect to the second aspect is performed.

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

[0056] In a possible design, the communication apparatus further includes one or more communication interfaces 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.

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

[0058] In a seventh aspect, an embodiment of the present application provides a computer readable storage medium, which stores computer instructions or programs, and when the computer instructions or programs are run on a computer, the communication method in any one of the first aspect or the second aspect is performed.

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

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

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

[0062] The technical effects brought by any one of the third aspect to the tenth aspect can be referred to the technical effects brought by any one of the first aspect or the second aspect, which will not be repeated here.

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

[0064] Figure 1 A schematic diagram of signal transmission provided by an embodiment of the present application;

[0065] Figure 2 A schematic diagram of orthogonal cover code spreading provided by an embodiment of the present application;

[0066] Figure 3 A schematic diagram of orthogonal cover code spreading provided by an embodiment of the present application;

[0067] Figure 4 A schematic diagram of orthogonal cover code spreading provided by an embodiment of the present application;

[0068] Figure 5 A schematic diagram of a communication system provided by an embodiment of the present application;

[0069] Figure 6 A schematic diagram of an architecture of a network device provided by an embodiment of the present application;

[0070] Figure 7 A schematic diagram of a structure of a communication device provided by an embodiment of the present application;

[0071] Figure 8 A schematic diagram of a flow of a communication method provided by an embodiment of the present application;

[0072] Figure 9 A schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission provided by an embodiment of the present application;

[0073] Figure 10 A schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission provided by an embodiment of the present application;

[0074] Figure 11 A schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission provided by an embodiment of the present application;

[0075] Figure 12 A schematic diagram of coexistence of a first PUSCH transmission and a second PUSCH transmission provided by an embodiment of the present application;

[0076] Figure 13 A schematic diagram of a structure of a terminal device provided by an embodiment of the present application;

[0077] Figure 14 A structural schematic diagram of a network device provided by an embodiment of the present application is provided.

[0078] Figure 15 A structural schematic diagram of another communication device provided by an embodiment of the present application is provided.

[0079] Figure 16 A schematic diagram of a baseband hardware provided by an embodiment of the present application is provided. DETAILED DESCRIPTION

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

[0081] 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 slots (TBoMS) mapping transmission.

[0082] Among them, 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, repeated transmission can also be understood as a transport block being repeatedly transmitted by 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 repeated transmission can map all the information of a transport block on all or part of the symbols in a slot.

[0083] Among them, TBoMS is to map a transport block on the PUSCH in multiple slots for transmission, that is, all the information of a transport block can be jointly carried by the PUSCH transmissions in different slots.

[0084] Among them, the process of the terminal device outputting a signal on the PUSCH transmission can be as follows Figure 1As shown, the terminal device can block encode, scramble the 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, map the signal on the PUSCH, and output.

[0085] 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) by orthogonal cover code to improve the capacity of uplink multiplexing.

[0086] The radio access network (RAN) 1#116 aligns the evaluation parameters for uplink capacity and throughput enhancements, 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 techniques. RAN1#117 agrees to support at least one of the following OCC techniques 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.

[0087] 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 DFT to obtain y(0), y(1),..., y(n), y(0), y(1),..., y(n), and y(0), y(1),..., y(n) can be spread by orthogonal cover code to output signal z(0), z(1),..., z(n).

[0088] Specifically, wherein,

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

[0090] As shown in the following example Figure 2 As shown in the following example

[0091] The spreading of y(0), y(1),..., y(n) can be understood as block spreading in y(0), y(1),..., y(n). Figure 2

[0092] The demodulation reference signal (DMRS) in y(0), y(1),..., y(n) is used for channel estimation by the network device. Figure 2

[0093] For the inter-symbol time domain orthogonal cover code, the PUSCH corresponding symbol can be spread by the orthogonal cover code, that is, each DFT-s-OFDM symbol is obtained after DFT y(0), y(1),..., y(n), y(0), y(1),..., y(n) is spread by the orthogonal cover code, and the output signal z(0), z(1),..., z(n) can be output.

[0094] Specifically,

[0095] K represents the number of DFT-s-OFDM symbols contained in each partial slot.

[0096] As shown in the following example Figure 3 As shown in the following example

[0097] The spreading of y(0), y(1),..., y(n) can be understood as block spreading in y(0), y(1),..., y(n). Figure 3 ​​​Block diffusion in the middle.

[0098] For the orthogonal covering code before the in-symbol discrete Fourier transform, the PUSCH modulation symbol is spread by the orthogonal covering code. That is, each DFT-s-OFDM symbol is spread by the orthogonal covering code before the DFT to obtain the output signal x(0), x(1), ..., x(n).

[0099] Specifically, in,

[0100] in, M symb w represents the number of modulation symbols. n This represents the nth orthogonal covering code.

[0101] For example, as follows Figure 4 As shown, the orthogonal covering code has a length of 2 and a modulation symbol count of 6. Six modulation symbols can be copied; for example, the first six modulation symbols are multiplied by w0(0), and the last six modulation symbols are multiplied by w0(1). This step occurs after modulation, i.e. Figure 4 The block diffusion portion shown can be obtained after DFT as follows: Figure 4 The PUSCH shown has a comb-like structure in the frequency domain to achieve spread spectrum of d(0), d(1), ..., d(n).

[0102] Understandably, orthogonal covering codes can be Walsh-Hadamard sequences (also known as Walsh sequences), Discrete Fourier Transform sequences, or Zadoff-Chu sequences. Specifically, a Walsh sequence can be any row of a Walsh-Hadamard matrix (also known as a Walsh matrix; the sequence of elements in any row of a Walsh matrix is ​​a Walsh sequence), a Discrete Fourier Transform sequence can be any row of a Discrete Fourier Transform matrix (the sequence of elements in any row of a Discrete Fourier Transform matrix is ​​a Discrete Fourier Transform sequence), and a Zadoff-Chu sequence can be any row of a Zadoff-Chu matrix (the sequence of elements in any row of a Zadoff-Chu matrix is ​​a Zadoff-Chu sequence).

[0103] The Walsh matrix of length 2 is: The Walsh matrix of length 4 is: The Walsh matrix of length 8 is:

[0104] The discrete Fourier transform matrix of length 2 is: The discrete Fourier transform matrix of length 4 is: The discrete Fourier transform matrix with a length of 8 is:

[0105] The Zadoff-Chu matrix with a length of 3 is: The Zadoff-Chu matrix with a length of 6 is:

[0106] 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).

[0107] For example, taking one of the Walsh sequences in the Walsh matrix with a length of 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).

[0108] 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 inter-symbol time domain orthogonal cover code is used to realize the capacity enhancement of uplink multiplexing, it will cause interference to the transmission block in the transmission mode of PUSCH repetition type A, and reduce the communication performance.

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

[0110] Therefore, how to reduce the interference between the transport blocks in the PUSCH repetition Type B transmission mode and the transport blocks in the PUSCH repetition Type A transmission mode to improve the communication performance becomes a problem to be solved.

[0111] The application provides a communication method, which comprises the following steps: a terminal device receives first signaling; and the terminal device outputs 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 M*N / 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,..., 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.

[0112] In the embodiments of the present application, 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 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 amplitude of the signal on the i th first PUSCH transmission, the signal on the K / M+i th first PUSCH transmission, the signal on the 2K / M+i th first PUSCH transmission, …, and the signal on 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, accordingly, the interference of the signals on the second PUSCH transmission to the signals on the first PUSCH transmission 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, 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 improve the throughput of the communication system, thereby improving the communication performance.

[0113] The implementation manners of the embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0114] 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, and the like, without limitation.

[0115] 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, and the like, without limitation.

[0116] In the following, the communication system provided by the embodiments of the present application is described taking Figure 5 as an example.

[0117] Figure 5A schematic diagram of a communication system is provided for embodiments of the present application, as shown in Figure 5 The communication system can include at least one terminal device and at least one network device.

[0118] Among them, Figure 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.

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

[0120] For example, the terminal device can be a mobile phone, a tablet computer or a computer with wireless transceiver 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 device, 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.

[0121] Among them,Figure 5 The network device in the network device can be any kind of device deployed in an access network capable of wireless communication with terminal devices, can also be a chip or chip system that can be provided in the above device, can also be a logical node or a logical module or a software-implemented function, and is mainly responsible for wireless physical control functions, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management functions. Specifically, the network device can be a device supporting wired access, or a device supporting wireless access.

[0122] 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 station, 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) and the like. It can be understood that the network device can be a device set 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 base station function may be different, which is not limited in the present application.

[0123] 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.

[0124] 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).

[0125] In another example, the network device can also be a device including a radio unit (RU), or including a CU, a DU and a 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).

[0126] 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.

[0127] For example, the following Figure 6An architecture diagram of a network device is shown. The network device can include one or more functional modules to implement processing of signals. Taking physical layer functions 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 / adding a cyclic prefix (CP), decoding, de-rate matching, descrambling, demodulation, inverse discrete Fourier transformation (IDFT), channel equalization (or channel estimation), de-RE mapping, digital BF, fast Fourier transform (FFT) / CP removal; or taking radio frequency functions 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.

[0128] 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.

[0129] 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) deployed in the terminal device or the network device, a field programmable gate array (FPGA), or software (such as program code in a memory), without limitation.

[0130] In particular implementations, Figure 5 As shown in the figures: each terminal device, network device can adopt Figure 7 The composition structure shown, or include Figure 7 The components shown. Figure 7 The composition of a communication device 700 provided by the embodiment of the application is shown. The communication device 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 the figure, Figure 7 The communication device 700 includes a processor 701, a transceiver 702 and a communication line 703.

[0131] Further, the communication device 700 can also include a memory 704. Among them, the processor 701, the memory 704 and the transceiver 702 can be connected through the communication line 703.

[0132] Among them, the processor 701 is 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 circuits, devices or software modules, which are not limited.

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

[0134] The communication line 703 is used to transmit information between the components included in the communication device 700.

[0135] The memory 704 is used to store instructions. Among them, the instructions can be computer programs.

[0136] 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 that are not to be changed by the device, or a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions for execution by or processing with the processor 701, and can be a electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or other optical disk storage, a magnetic disk storage or other magnetic storage devices, etc., without limitation.

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

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

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

[0140] As an optional implementation, the communication device 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, etc., and the output device 705 is a display screen, a speaker, etc.

[0141] It should be noted that the communication device 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 as Figure 7 . In addition, the constituent structures shown in Figure 7 do not constitute a limitation on the communication device. The communication device can include more or fewer components than shown, or combine certain components, or have different component arrangements, in addition to the components shown in Figure 7 .

[0142] 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.

[0143] 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 name or parameter name in the message between the devices in the embodiments of the present application is only an example, and other names can also be used in the specific implementation, which is not limited.

[0144] The following will be described in combination with Figure 5 the communication system shown in the following Figure 8 The communication method provided by the embodiments of the present application is described, and the terminal device or network device described in the following embodiments can be provided with Figure 7 the components shown.

[0145] Figure 8 The flowchart of the communication method provided by the embodiments of the present application is shown in Figure 8 The method can include:

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

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

[0148] The maximum transmission number of the first PUSCH transmission is K, that is, the transport block carried by each first PUSCH transmission in 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.

[0149] K is a positive integer.

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

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

[0152] 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.

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

[0154] The second PUSCH transmission carries the second transport block, that is, the transport block carried by each second PUSCH transmission in 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.

[0155] Wherein, M is a positive integer.

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

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

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

[0159] Wherein, the second transport block occupies N time units in single transmission, which can also be understood as that the second PUSCH transmission occupies N time units.

[0160] Wherein, N is a positive integer.

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

[0162] Wherein, the second transport block occupies N (N is a positive integer) time units in 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.

[0163] Wherein, the first transport block occupies MN / K time units in 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.

[0164] For example, taking N as 1, M as 2, and K as 4 as an example, the first transport block can occupy 1 / 2 time unit in single transmission; or taking N as 1, M as 2, and K as 8 as an example, the first transport block can occupy 1 / 4 time unit in single transmission.

[0165] 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), which is not limited in the present application.

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

[0167] 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.

[0168] 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.

[0169] 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.

[0170] 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.

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

[0172] 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.

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

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

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

[0176] Wherein, the specific way of determining the kth signal can refer to the above Figure 3 The content is not described here.

[0177] 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.

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

[0179] For example, taking the orthogonal cover code [1, 1, 1, 1] as an 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.

[0180] For example, taking M as 2 and K as 4 as an example, i can be 1, or i can be 2.

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

[0182] Based on Figure 8The communication method shown, the first transport block occupies MN / K time units for single transmission, and the first PUSCH transmission carries the first transport block, the second transport block occupies N time units for single transmission, and the second PUSCH transmission carries the second transport, 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 K times of first PUSCH transmission and M times of second PUSCH transmission 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 amplitude of the signal on the i-th first PUSCH transmission, the signal on the K / M+i-th first PUSCH transmission, the signal on the 2K / M+i-th first PUSCH transmission, …, and the signal on 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 M times of second PUSCH transmission 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, 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.

[0183] Based on Figure 8 The communication method shown, the first transport block occupies MN / K time units for single transmission, and the first PUSCH transmission carries the first transport block, the second transport block occupies N time units for single transmission, and the second PUSCH transmission carries the second transport, 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 K times of first PUSCH transmission and M times of second PUSCH transmission 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 amplitude of the signal on the i-th first PUSCH transmission, the signal on the K / M+i-th first PUSCH transmission, the signal on the 2K / M+i-th first PUSCH transmission, …, and the signal on 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 M times of second PUSCH transmission 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, 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.

[0184] In the first possible case, PUSCH repetition Type B (PUSCH repetition Type B w / o TBoMS) coexists with PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0185] wherein there is no coexistence configuration in the first possible case, i.e., no matter what values M, N, and K take, the interference between the signal on the first PUSCH transmission and the signal on the second PUSCH transmission in the first possible case cannot be reduced.

[0186] wherein w / o means without.

[0187] In the second possible case, PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) coexists with PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0188] wherein w / means with.

[0189] wherein there are three coexistence configurations in the second possible case, which can be seen from the first possible design, the second possible design, and the third possible design below, which are not described herein.

[0190] In the third possible case, PUSCH repetition Type B (PUSCH repetition Type B w / o TBoMS) coexists with PUSCH repetition Type A (PUSCH repetition Type A w / TBoMS).

[0191] wherein there is no coexistence configuration in the third possible case, i.e., no matter what values M, N, and K take, the interference between the signal on the first PUSCH transmission and the signal on the second PUSCH transmission in the third possible case cannot be reduced.

[0192] In the fourth possible case, PUSCH repetition Type B and TBoMS (PUSCH repetition Type B w / TBoMS) coexists with PUSCH repetition Type A (PUSCH repetition Type A w / TBoMS).

[0193] 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.

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

[0195] In which, the orthogonal cover code set can be determined according to the discrete Fourier transform matrix, or the orthogonal cover code set can be determined according to the Walsh matrix, or the orthogonal cover code set can be determined according to the permutation discrete Fourier transform matrix.

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

[0197] 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 the discrete Fourier transform matrix with length 4 (such as determining the orthogonal cover code set 11), or the orthogonal cover code set can be determined according to the Walsh matrix with length 4 (such as determining the orthogonal cover code set 12), or the orthogonal cover code set can be determined according to the permutation discrete Fourier transform matrix with length 4 (such as determining the orthogonal cover code set 13).

[0198] In which, the discrete Fourier transform matrix with 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].

[0199] In which, the Walsh matrix with 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].

[0200] In which, the permutation discrete Fourier transform matrix with length 4 can be: The permutation discrete Fourier transform matrix with length 4 can be obtained by swapping the 2nd column and the 3rd column of the discrete Fourier transform matrix with 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].

[0201] 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).

[0202] wherein 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 ].

[0203] wherein 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].

[0204] 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.

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

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

[0207] 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 orthogonal cover code set is 0.

[0208] For example, the orthogonal cover code set 11 includes [1, 1, 1, 1], [1, j, -1, -j], [1, -1, 1, -1], and [1, -j, -1, j], assuming that 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 orthogonal cover code set 11 is 0, the sum of the second element and the fourth element of the orthogonal cover codes in the subset of the orthogonal cover code set 11 is 0, and the subset of the orthogonal cover code set 11 can include [1, j, -1, -j] and [1, -j, -1, j].

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

[0210] The network device can configure the subset of the orthogonal cover code set through configuration information of the subset of the orthogonal cover code set. The configuration information of the subset of the orthogonal cover code set can be located in a system message, or the configuration information of the subset of the orthogonal cover code set can be located in an RRC message, or the configuration information of the subset of the orthogonal cover code set can be transmitted separately, which is not limited in the present application.

[0211] The specific determination of the subset of the orthogonal cover code set can refer to the description of the subset of the orthogonal cover code set in the following four possible designs, which is not described herein.

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

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

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

[0215] 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].

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

[0217] 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].

[0218] 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.

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

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

[0221] Specifically, as follows Figure 9As shown, 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 manner, 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 manner, 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.

[0222] wherein, Figure 9 The coexistence configuration shown can be referred to as PUSCH repetition Type B and TBoMS-2 inter-symbol orthogonal cover code length 4 symbol (PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-4) and PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS) coexistence.

[0223] wherein, the kth signal on the kth first PUSCH transmission can be determined according to the kth element in the first transport block and the orthogonal cover code.

[0224] In the first possible design, 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.

[0225] 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].

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

[0227] wherein, 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.

[0228] The subset of the orthogonal cover code set 11, the subset of the orthogonal cover code set 12, or the subset of the orthogonal cover code set 13 can refer to the description of the orthogonal cover code set 11, the orthogonal cover code set 12, or the orthogonal cover code set 13 described above, and will not be described here.

[0229] The first element and the third element of the orthogonal cover code in the subset of the orthogonal cover code set are 0, and the second element and the fourth element are 0.

[0230] In the first example, the subset of the orthogonal cover code set 11 can include [1, j, -1, -j] and [1, -j, -1, j].

[0231] It can be understood that the subset of the orthogonal cover code set 11 can include a sequence composed of elements on the second row and a sequence composed of elements on the fourth row in the length-4 discrete Fourier transform matrix.

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

[0233] In the second example, the subset of the orthogonal cover code set 12 can include [1, 1, -1, -1] and [1, -1, -1, 1].

[0234] It can be understood that the subset of the orthogonal cover code set 12 can include a sequence composed of elements on the third row and a sequence composed of elements on the fourth row in the length-4 Walsh matrix.

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

[0236] In the third example, the subset of the orthogonal cover code set 13 can include [1, 1, -1, -1].

[0237] It can be understood that the subset of the orthogonal cover code set 13 can include a sequence composed of elements on the third row in the length-4 permutation discrete Fourier transform matrix.

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

[0239] Based on the first possible design, since the sum of the first and third elements in the orthogonal covering code is 0, and the sum of the second and fourth elements in the orthogonal covering code is 0, the amplitude of the signal after superimposed on the first PUSCH transmission in the first and third transmissions can be as small as possible (e.g., approaching 0). Similarly, the amplitude of the signal after superimposed on the second and fourth transmissions can be as small as possible (e.g., approaching 0). This ensures that the superimposed signal on the second PUSCH transmission is not interfered with by the signal on the first PUSCH transmission (i.e., the interference of the signal on the first PUSCH transmission to the signal on the second PUSCH transmission can be reduced), while improving the SNR of the signal on the second PUSCH transmission. This can effectively improve the reliability and performance of communication.

[0240] In the second possible design, M can be 2, N can be 1, and K can be 8.

[0241] Specifically, as follows: Figure 10 As shown, the same transport block can be transmitted through two time units (such as time unit 0 and time unit 1). In PUSCH repetition Type B transmission mode, the maximum number of transmissions for the first PUSCH transmission can be 8 (the first PUSCH transmission carries the first transport block). A single transmission of the first transport block can occupy 1 / 4 of a time unit. That is, the first, second, third, and fourth first PUSCH transmissions are located in time unit 0, and the fifth, sixth, seventh, and eighth first PUSCH transmissions are located in time unit 1. The transport blocks carried by different first PUSCH transmissions are all first transport blocks. In PUSCH repetition Type A transmission mode, the maximum number of transmissions for the second PUSCH transmission can be 2 (the second PUSCH transmission carries the second transport block). 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. The transport blocks carried by different second PUSCH transmissions are all second transport blocks.

[0242] in, Figure 10The coexistence configuration shown can be referred to as PUSCH repetition Type B w / TBoMS-2 Inter-symbol OCC-8 and PUSCH repetition Type A coexistence.

[0243] wherein the kth signal on the kth first PUSCH transmission can be determined according to the kth element of the first transport block and the orthogonal cover code.

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

[0245] 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].

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

[0247] wherein 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.

[0248] wherein 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 above, which will not be repeated here.

[0249] 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.

[0250] In the 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 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 j3π / 4 , j, e jπ / 4 ].

[0251] It can be appreciated that the subset 1 of the set of orthogonal cover codes 21 can include a sequence of elements on a second row, a sequence of elements on a fourth row, a sequence of elements on a sixth row, and a sequence of elements on an eighth row of a discrete Fourier transform matrix of length 8.

[0252] It can be 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 of orthogonal cover codes 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 of length 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 set of orthogonal cover codes 21 (which can also be described as the orthogonal cover code being [1, e j3π / 4 , -j, e jπ / 4 , -1, e j7π / 4 , j, ej5π / 4 ]) ; or, the orthogonal cover code can be [1, e j5π / 4 , j, e j7π / 4 , -1, e jπ / 4 , -j, e j3π / 4 ] (also 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, e j7π / 4 , -j, e j5π / 4 , -1, e j3π / 4 , j, e jπ / 4 ] (also described as the orthogonal cover code being [1, e j7π / 4 , -j, e j5π / 4 , -1, e j3π / 4 , j, e jπ / 4 ]).

[0253] 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].

[0254] 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.

[0255] 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).

[0256] 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 by analogy, 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 by analogy, 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 by analogy, 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 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.

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

[0258] Specifically, as follows Figure 11As shown, 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 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 first transport blocks. 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 a 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 second transport blocks.

[0259] wherein, Figure 11 The coexistence configuration shown can be referred to as PUSCH repetition Type B and TBoMS-4 inter-symbol orthogonal cover code length 8 (PUSCH repetition Type B w / TBoMS-4 Inter-symbol OCC-8) coexisting with PUSCH repetition Type A (PUSCH repetition Type A w / o TBoMS).

[0260] wherein, the kth signal on the kth first PUSCH transmission can be determined according to the kth element in the first transport block and the orthogonal cover code.

[0261] In a 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.

[0262] 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 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].

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

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

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

[0266] In a first example, the subset 2 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, 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], and [1, e j7π / 4 , -j, e j5π / 4, -1, e j3π / 4 , j, e jπ / 4 .

[0267] 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.

[0268] 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 ] (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] (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 ] (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 ] (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π / 4Alternatively, the orthogonal covering code can be [1, -j, -1, j, 1, -j, -1, j] in subset 2 of the orthogonal covering code set 21 (or it can be described as [1, -j, -1, j, 1, -j, -1, j] in a discrete Fourier transform matrix of length 8); or, the orthogonal covering code can be [1, e] in subset 2 of the orthogonal covering code set 21. j7π / 4 -j,e j5π / 4 -1,e j3π / 4 ,j,e jπ / 4 (It can also be described as an orthogonal covering code in the [1, e] of a discrete Fourier transform matrix of length 8.) j7π / 4 -j,e j5π / 4 -1,e j3π / 4 ,j,e jπ / 4 ]).

[0269] In the second example, a subset of the orthogonal covering code set 22 may 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], and [1, -1, -1, 1, -1, 1, 1, -1, 1, -1].

[0270] Understandably, a subset of the orthogonal covering code set 22 may include the sequence of elements in the 3rd row, the 4th row, the 5th row, the 6th row, the 7th row, and the 8th row of an 8-row Walsh matrix.

[0271] It is understandable that the orthogonal covering code can be [1, 1, -1, -1, 1, 1, -1, -1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, 1, -1, -1, 1, 1, -1, -1] in an 8-length Walsh matrix); or, the orthogonal covering code can be [1, -1, -1, 1, 1, -1, -1, 1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, -1, -1, 1, 1, -1, -1, 1] in an 8-length Walsh matrix); or, the orthogonal covering code can be [1, 1, 1, 1, -1, -1, -1, -1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, 1, 1, 1, -1, -1, -1, -1] in an 8-length Walsh matrix). Alternatively, the orthogonal covering code can be [1, -1, 1, -1, -1, 1, -1, 1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, -1, 1, -1, -1, 1, -1, 1] in a Walsh matrix of length 8); or, the orthogonal covering code can be [1, 1, -1, -1, -1, -1, 1, 1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, 1, -1, -1, -1, -1, 1, 1] in a Walsh matrix of length 8); or, the orthogonal covering code can be [1, -1, -1, 1, -1, 1, 1, -1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, -1, -1, 1, -1, 1, 1, -1] in a Walsh matrix of length 8).

[0272] Based on the third possible design, 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 from the second, third, fifth, and seventh PUSCH transmissions can also be minimized. The amplitude of the signal superimposed from the signals of the four first PUSCH transmissions, the sixth first PUSCH transmission, and the eighth first PUSCH transmission can be kept 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 signal from the first PUSCH transmission on the signal from the second PUSCH transmission). At the same time, it can improve the SNR of the signal from the second PUSCH transmission, effectively improving the reliability and performance of communication.

[0273] The fourth possible design is that M can be 2, N can be 2, and K can be 8.

[0274] Specifically, as follows: Figure 12 As shown, the same transport block can be transmitted through four time units (such as time unit 0, time unit 1, time unit 2, and time unit 3). In PUSCH repetition Type B transmission mode, the maximum number of transmissions for the first PUSCH transmission can be 8 (the first PUSCH transmission carries the first transmission block). A single transmission of the first transmission block can occupy 1 / 2 time unit, that is, the first and second first PUSCH transmissions are located in time unit 0, the third and fourth first PUSCH transmissions are located in time unit 1, the fifth and sixth first PUSCH transmissions are located in time unit 2, and the seventh and eighth first PUSCH transmissions are located in time unit 3. The transmission blocks carried by different first PUSCH transmissions are all first transmission blocks. In PUSCH repetition Type A transmission mode, the maximum number of transmissions for the second PUSCH transmission can be 2 (the second PUSCH transmission carries the second transmission block). A single transmission of the second transmission block can occupy 2 time units, that is, the first second PUSCH transmission is located in time units 0 and 1, and the second second PUSCH transmission is located in time units 2 and 3. The transmission blocks carried by different second PUSCH transmissions are all second transmission blocks.

[0275] in, Figure 12 The coexistence configuration shown can be referred to as the coexistence of inter-symbol time-domain orthogonal covering codes with an orthogonal covering code length of 8 in PUSCH repetition Type B and TBoMS-2 (PUSCH repetition Type B w / TBoMS-4Inter-symbo1 OCC-8) with PUSCH repetition Type A and TBoMS-2 (PUSCH repetition Type A w / TBoMS-2).

[0276] The kth signal in the kth first PUSCH transmission is determined based on the kth element in the first transmission block and the orthogonal overlay code.

[0277] In the fourth possible design, the sum of the 1st and 5th elements of the orthogonal covering code is 0; the sum of the 2nd and 6th elements of the orthogonal covering code is 0; the sum of the 3rd and 7th elements of the orthogonal covering code is 0; and the sum of the 4th and 8th elements of the orthogonal covering code is 0.

[0278] For example, the orthogonal covering code can be 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,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, 1, -1].

[0279] Optionally, orthogonal covering codes may be included in a subset of the set of orthogonal covering codes.

[0280] The set of orthogonal covering codes can be either of the following: orthogonal covering code set 21 or orthogonal covering code set 22.

[0281] In the subset of the orthogonal covering codes, the sum of the 1st and 5th elements, the sum of the 2nd and 6th elements, the sum of the 3rd and 7th elements, and the sum of the 4th and 8th elements are all 0.

[0282] In the first example, a subset 1 of the orthogonal covering code set 21 may 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 j3π / 4 ,j,e jπ / 4 ].

[0283] It is understandable that subset 1 of the orthogonal covering code set 21 may include the sequence of elements in the second row, the sequence of elements in the fourth row, the sequence of elements in the sixth row, and the sequence of elements in the eighth row of a discrete Fourier transform matrix of length 8.

[0284] It is understandable that orthogonal covering codes can be subsets of orthogonal covering codes 21, specifically [1, e]. jπ / 4 ,j,e j3 π / 4 -1,e j5π / 4 -j,e j7π / 4 (It can also be described as an orthogonal covering code in the [1, e] of a discrete Fourier transform matrix of length 8.) jπ / 4 ,j,e j3π / 4 -1,e j5π / 4 -j,e j7π / 4 Alternatively, the orthogonal covering code can be a subset 1 of the orthogonal covering code set 21, [1, e]. j3π / 4 -j,e jπ / 4 -1,e j7π / 4 ,j,e j5π / 4 (It can also be described as an orthogonal covering code in the [1, e] of a discrete Fourier transform matrix of length 8.) j3π / 4 -j,e jπ / 4 -1,e j7π / 4 ,j,e j5π / 4 Alternatively, the orthogonal covering code can be a subset 1 of the orthogonal covering code set 21, [1, e]. j5π / 4 ,j,e j7π / 4 -1,e jπ / 4 -j,e j3π / 4 (It can also be described as an orthogonal covering code in the [1, e] of a discrete Fourier transform matrix of length 8.) j5π / 4 ,j,e j7π / 4 -1,e jπ / 4 -j,e j3π / 4 Alternatively, the orthogonal covering code can be a subset 1 of the orthogonal covering code set 21, [1, e]. j7π / 4 -j,e j5π / 4 -1,e j3π / 4 ,j,e jπ / 4 (It can also be described as an orthogonal covering code in the [1, e] of a discrete Fourier transform matrix of length 8.) j7π / 4 -j,e j5π / 4 -1,e j3π / 4 ,j,e jπ / 4 ]).

[0285] In the second example, a subset of the orthogonal covering code set 22 may 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].

[0286] Understandably, a subset of the orthogonal covering code set 22 may include the sequence of elements in the 5th row, the 6th row, the 7th row, and the 8th row of an 8-row Walsh matrix.

[0287] It is understandable that the orthogonal covering code can be [1, 1, 1, 1, -1, -1, -1, -1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, 1, 1, 1, -1, -1, -1, -1] in an 8-length Walsh matrix); or, the orthogonal covering code can be [1, -1, 1, -1, -1, 1, -1, 1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, -1, 1, -1, -1, 1, -1, 1] in an 8-length Walsh matrix). Alternatively, the orthogonal covering code can be [1, 1, -1, -1, -1, -1, 1, 1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, 1, -1, -1, -1, -1, 1, 1] in an 8-length Walsh matrix); or the orthogonal covering code can be [1, -1, -1, 1, -1, 1, 1, -1] in a subset of the orthogonal covering code set 22 (or it can be described as [1, -1, -1, 1, -1, 1, 1, -1] in an 8-length Walsh matrix).

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

[0289] Among them, the coexistence configurations in the first, second, and third possible designs 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).

[0290] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0291] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0292] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, in conjunction with the algorithm steps of the examples described in the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0293] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0294] When dividing each function into modules according to its corresponding function. Figure 13 A terminal device 130 is shown, which can perform the above-described actions. Figure 8 The actions performed by the terminal device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0295] The terminal device 130 may include a transceiver module 1301 and a processing module 1302. Exemplarily, the terminal device 130 may be a communication device, or a chip or other combination device or component having the aforementioned terminal device functions applied in a communication device. When the terminal device 130 is a communication device, the transceiver module 1301 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the terminal device 130 is a component having the aforementioned terminal device functions, the transceiver module 1301 may be a radio frequency unit; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor. When the terminal device 130 is a chip system, the transceiver module 1301 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1302 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1301 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1302 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0296] For example, transceiver module 1301 can be used to perform... Figure 8 In the illustrated embodiment, all transmit and receive operations performed by the terminal device, and / or other processes used to support the techniques described herein; the processing module 1302 can be used to execute Figure 8 The embodiments shown include all operations performed by the terminal device other than sending and receiving operations, and / or other processes used to support the techniques described herein.

[0297] Figure 14 A network device 140 is shown that can perform the above-described functions. Figure 8 The actions performed by the network device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0298] The network device 140 may include a transceiver module 1401 and a processing module 1402. Exemplarily, the network device 140 may be a communication device, or a chip or other combination of devices or components with the aforementioned network device functions applied in a communication device. When the network device 140 is a communication device, the transceiver module 1401 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1402 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the network device 140 is a component with the aforementioned network device functions, the transceiver module 1401 may be a radio frequency unit; the processing module 1402 may be a processor (or processing circuit), such as a baseband processor. When the network device 140 is a chip system, the transceiver module 1401 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1402 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1401 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1402 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0299] For example, transceiver module 1401 can be used to perform... Figure 8 In the illustrated embodiment, all transmit and receive operations performed by the network device, and / or other processes used to support the techniques described herein; processing module 1402 can be used to perform Figure 8 The embodiments shown include all operations performed by the network device other than sending and receiving operations, and / or other processes used to support the techniques described herein.

[0300] As another feasible approach Figure 13 The transceiver module 1301 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1301; the processing module 1302 can be replaced by a processor, which can integrate the functions of the processing module 1302. Furthermore, Figure 13 The terminal device 130 shown may also include a memory. Alternatively, Figure 14 The transceiver module 1401 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1401; the processing module 1402 can be replaced by a processor, which can integrate the functions of the processing module 1402. Furthermore, Figure 14 The network device 140 shown may also include a memory.

[0301] 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 this application can also be... Figure 15The communication device 150 shown. 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 this application can also be... Figure 15 The communication device 150 shown.

[0302] The processor can be logic circuit 1501, and the transceiver can be interface circuit 1502. Furthermore, Figure 15 The communication device 150 shown may also include a memory 1503.

[0303] This application provides a block diagram of a baseband hardware implementation, which can support the functionality of any of the above-described method embodiments. For example... Figure 16 As shown, baseband hardware can be implemented using a processing system. This processing system can be implemented using a bus architecture, typically represented by a bus. The bus can include any number of interconnect buses, depending on the specific application and overall design constraints of the processing system. The bus communicatively couples various circuits together, including one or more processors (typically represented by a processor), memory, and one or more computer-readable storage media (typically represented by a computer-readable storage media). 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 therefore will not be described further. The bus interface provides the interface between the bus and the transceiver, as well as between the bus and the interface.

[0304] The processor includes microprocessors (such as X146, ARM), microcontrollers, digital signal processors (DSPs), FPGAs, graphics processing units (GPUs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform various functions. In other words, the processor used in the baseband can be used to implement... Figure 8 The communication method shown.

[0305] The processor manages the bus and general processing, including executing software stored on a computer-readable medium. When the processor executes the software, it causes the processing system to perform the various functions described below for any particular device. The functions that the processor, memory, and computer-readable medium can perform include: encoding, decoding, rate matching, rate dematching, scrambling, descrambling, modulation, demodulation, layer mapping, FFT, IFFT, IDFT, precoding, RE mapping, channel equalization, RE mapping, BF, adding a cyclic prefix (CP), removing the CP, etc.

[0306] For example, the processor may include communication and processing circuitry, which may include one or more hardware components providing a physical structure that performs various processes related to wireless communication (e.g., signal reception and / or signal transmission). The communication and processing circuitry may include two or more transmit / receive links. The functionality implemented by the communication and processing circuitry may also be processed on a computer-readable medium.

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

[0308] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0309] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0310] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0311] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0312] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0313] In this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) 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 single or multiple. "...when" and "if" both mean that a corresponding action will be taken under certain objective circumstances, not a time limit, nor do they require a judgment action at the time of implementation, nor do they imply any other limitations.

[0314] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0315] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0316] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0317] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0318] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0319] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0320] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

1. A communication method, characterized in that, include: Receive first signaling; wherein, the first signaling is used to schedule the transmission of the first physical uplink shared channel (PUSCH), the first PUSCH transmission carries the first transmission block, the maximum number of transmissions of the first PUSCH transmission is K, the first transmission block occupies MN / K time units per transmission, M is the maximum number of transmissions of the second PUSCH transmission, the second PUSCH transmission carries the second transmission block, the second transmission block occupies n time units per transmission; M, N, and K are all positive integers; On the kth first PUSCH transmission, the kth signal is output; wherein the kth signal is determined according to the first transmission block and the kth element in the orthogonal cover code, k = 1, 2, ..., K, 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, and i is a positive integer less than or equal to K / N.

2. A communication method, characterized in that, include: Send a first signaling instruction; wherein the first signaling instruction is used to schedule the transmission of the first physical uplink shared channel (PUSCH), the first PUSCH transmission carries a first transmission block, the maximum number of transmissions of the first PUSCH transmission is K, the first transmission block occupies MN / K time units per transmission, M is the maximum number of transmissions of the second PUSCH transmission, the second PUSCH transmission carries a second transmission block, the second transmission block occupies N time units per transmission; M, N, and K are all positive integers; On the kth first PUSCH transmission, the kth signal is acquired; wherein the kth signal is determined based on the first transmission block and the kth element of 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 of the orthogonal cover code is 0, and 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 for the second PUSCH is 2, and each transmission of the second transport block occupies 1 time unit; or The maximum number of transmissions for the first PUSCH transmission is 4, and each transmission of the first transmission block occupies 1 / 2 time unit.

4. The method according to claim 3, characterized in that, The sum of the first and third elements in the orthogonal covering code is 0; The sum of the second and fourth elements in the orthogonal covering code is 0.

5. The method according to claim 3 or 4, characterized in that, The orthogonal covering code is any one of the following: [1,j,-1,-j], [1,-j,-1,j], [1,-1,-1,1], or [1,1,-1,-1].

6. The method according to any one of claims 3-5, characterized in that, The orthogonal covering code is [1,j,-1,-j] in a discrete Fourier transform matrix of length 4; or The orthogonal covering code is [1,-j,-1,j] in the discrete Fourier transform matrix of length 4.

7. The method according to any one of claims 3-5, characterized in that, The orthogonal covering code is [1,1,-1,-1] in a Walsh matrix of length 4; or The orthogonal covering code is [1,-1,-1,1] in a Walsh matrix of length 4.

8. The method according to any one of claims 3-5, characterized in that, The orthogonal covering code is [1,1,-1,-1] in the permutation discrete Fourier transform matrix of length 4.

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

10. The method according to claim 9, characterized in that, The sum of the first and fifth elements in the orthogonal covering code is 0; The sum of the second and sixth elements in the orthogonal covering code is 0; The sum of the 3rd and 7th elements in the orthogonal covering code is 0; The sum of the 4th and 8th elements in the orthogonal covering code is 0.

11. The method according to claim 9 or 10, characterized in that, The orthogonal covering 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 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].

12. The method according to any one of claims 9-11, characterized in that, The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. jπ / 4 ,j,e j3π / 4 ,-1,e j5π / 4 ,-j,e j7π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j3π / 4 ,-j,e jπ / 4 ,-1,e j7π / 4 ,j,e j5π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j5π / 4 ,j,e j7π / 4 ,-1,e jπ / 4 ,-j,e j3π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j7π / 4 ,-j,e j5π / 4 ,-1,e j3π / 4 ,j,e jπ / 4 ].

13. The method according to any one of claims 9-11, characterized in that, The orthogonal covering code is [1,1,1,1,-1,-1,-1,-1,-1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,1,-1,-1,1,-1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,1,-1,-1,-1,-1,1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,-1,1,-1,1,1,-1] in a Walsh matrix of length 8.

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

15. The method according to claim 14, characterized in that, The sum of the 1st, 3rd, 5th, and 7th elements in the orthogonal covering code is 0; The sum of the 2nd, 4th, 6th, and 8th elements in the orthogonal covering code is 0.

16. The method according to claim 14 or 15, characterized in that, The orthogonal covering 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,-1].

17. The method according to any one of claims 14-16, characterized in that, The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. jπ / 4 ,j,e j3π / 4 ,-1,e j5π / 4 ,-j,e j7π / 4 ];or The orthogonal covering code is [1,j,-1,-j,1,j,-1,-j] in the discrete Fourier transform matrix of length 8; or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j3π / 4 ,-j,e jπ / 4 ,-1,e j7π / 4 ,j,e j5π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j5π / 4 ,j,e j7π / 4 ,-1,e jπ / 4 ,-j,e j3π / 4 ];or The orthogonal covering code is [1,-j,-1,j,1,-j,-1,j] in the discrete Fourier transform matrix of length 8; or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j7π / 4 ,-j,e j5π / 4 ,-1,e j3π / 4 ,j,e jπ / 4 ].

18. The method according to any one of claims 14-16, characterized in that, The orthogonal covering code is [1,1,-1,-1,1,1,-1,-1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,-1,1,1,-1,-1,-1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,1,1,1,-1,-1,-1,-1,-1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,1,-1,-1,1,-1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,1,-1,-1,-1,-1,1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,-1,1,-1,1,1,-1] in a Walsh matrix of length 8.

19. The method according to claim 1 or 2, characterized in that, M = 2, N = 2, K = 8 The maximum number of transmissions for the second PUSCH is 2, and each transmission of the second transport block occupies 2 time units; or The maximum number of transmissions for the first PUSCH transmission is 8, and each transmission of the first transmission block occupies 1 / 2 time unit.

20. The method according to claim 19, characterized in that, The sum of the first and fifth elements in the orthogonal covering code is 0; The sum of the second and sixth elements in the orthogonal covering code is 0; The sum of the 3rd and 7th elements in the orthogonal covering code is 0; The sum of the 4th and 8th elements in the orthogonal covering code is 0.

21. The method according to claim 19 or 20, characterized in that, The orthogonal covering 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 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].

22. The method according to any one of claims 19-21, characterized in that, The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. jπ / 4 ,j,e j3π / 4 ,-1,e j5π / 4 ,-j,e j7π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j3π / 4 ,-j,e jπ / 4 ,-1,e j7π / 4 ,j,e j5π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j5π / 4 ,j,e j7π / 4 ,-1,e jπ / 4 ,-j,e j3π / 4 ];or The orthogonal covering code is a discrete Fourier transform matrix of length 8 in the range [1, e]. j7π / 4 ,-j,e j5π / 4 ,-1,e j3π / 4 ,j,e jπ / 4 ].

23. The method according to any one of claims 19-21, characterized in that, The orthogonal covering code is [1,1,1,1,-1,-1,-1,-1,-1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,1,-1,-1,1,-1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,1,-1,-1,-1,-1,1,1] in a Walsh matrix of length 8; or The orthogonal covering code is [1,-1,-1,1,-1,1,1,-1] in a Walsh matrix of length 8.

24. The method according to any one of claims 1-23, characterized in that, The orthogonal overlay code is indicated by the indication information.

25. The method according to any one of claims 1-24, characterized in that, M is an integer power of 2.

26. The method according to any one of claims 1-25, characterized in that, K is an integer power of 2.

27. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1, 3-26 to be executed, or cause the communication method as described in any one of claims 2-26 to be executed.

28. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of claims 1, 3-26, to process and / or generate the information based on the information, or to execute the communication method as described in any one of claims 2-26, to process and / or generate the information based on the information.

29. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1, 3-26 to be executed, or cause the communication method as described in any one of claims 2-26 to be executed.

30. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the communication method as described in any one of claims 1, 3-26 to be executed, or cause the communication method as described in any one of claims 2-26 to be executed.

Images