Communication method and related device

Abstract

A communication method and a related device. In the method, a first communication device may send, on a first resource, data repeatedly transmitted K times, wherein the data repeatedly transmitted K times is processed on the basis of a first orthogonal sequence among M orthogonal sequences. In other words, data carried on a data channel may be processed by means of an orthogonal sequence. In this way, data sent on the data channel by different communication devices using different orthogonal sequences can be orthogonal to each other. That is, a data receiver can distinguish, on the basis of orthogonal sequences, data sent by different communication devices, such that the different communication devices multiplex a same resource on the data channel for data transmission, thereby improving the resource utilization and enhancing the transmission performance of the data channel. In some implementations, the M orthogonal sequences comprise Q orthogonal sequences. For any sequence among the Q orthogonal sequences, first N / 2 elements and last N / 2 elements contained therein are identical.

Description

A communication method and related apparatus

[0001] This application claims priority from the Chinese Patent Application No. CN202411376866.2 filed on September 29, 2024, and entitled "A communication method and related apparatus", the content of which is incorporated herein in its entirety. TECHNICAL FIELD

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

[0003] Wireless communication can be transmission communication between two or more communication devices without propagation through a conductor or cable. Generally, the two or more communication devices include a network device and a terminal device, or the two or more communication devices include different terminal devices. Generally, different communication devices can transmit data through a data channel.

[0004] However, how to improve the transmission performance of the data channel is a technical problem to be solved. SUMMARY

[0005] The present application provides a communication method and related apparatus for improving the transmission performance of the data channel.

[0006] The first aspect of the present application provides a communication method, which is applied to a first communication device. For example, the first communication device can be a communication device (such as a terminal device or a network device), or the first communication device can be a part of the communication device (such as a processor or circuit or chip responsible for communication function (such as a Modem chip, also known as a baseband chip, or a system on chip (SoC) chip containing a modem core or a system in package (SIP) chip), etc.), or the first communication device can also be a logic module or software that can realize all or part of the communication device function. The following takes the first communication device as an example to illustrate that, in the method, the first communication device determines a first resource of a data channel, the first resource is used to carry K times of repeated transmission data, K is a positive integer; the first communication device transmits the K times of repeated transmission data, the K times of repeated transmission data is obtained based on a first orthogonal sequence in M orthogonal sequences, any sequence of the M orthogonal sequences contains N elements, M is a positive integer, and N is an integer greater than 1.

[0007] Based on the above scheme, the first communication apparatus can transmit K times of repeated transmission data on the first resource, wherein the K times of repeated transmission data is processed based on a first orthogonal sequence in the M orthogonal sequences. In other words, the data carried on the data channel can be obtained by processing the orthogonal sequence. In this way, the data transmitted by different communication apparatuses on the data channel using different orthogonal sequences can be orthogonal to each other, i.e., the data receiver can distinguish the data transmitted by different communication apparatuses based on the orthogonal sequence, so that different communication apparatuses can multiplex the same resource on the data channel for data transmission, which can improve the resource utilization and improve the transmission performance of the data channel.

[0008] In addition, in the above scheme, the K times of repeated transmission data carried on the data channel can be obtained by processing the orthogonal sequence, i.e., the data of different times of repeated transmission can be processed based on the elements with the same (or different) values contained in the orthogonal sequence, so that the data receiver can obtain at least two copies of the same (or different) repeated transmission data, which can help the receiver to detect and correct transmission errors to improve the reception performance.

[0009] Optionally, the K times of repeated transmission data can be obtained by processing the data based on the first orthogonal sequence, which can be spread spectrum processing, or code division multiplexing processing, etc. For example, the data can be uplink data, downlink data, or sidelink data, etc. For example, the data can be data after discrete Fourier transformation (DFT) processing and before inverse fast Fourier transformation (IFFT) processing, so that the above scheme can be applied to the scenario of inter-slot orthogonal cover code (OCC), or inter-symbol OCC.

[0010] It should be understood that the M orthogonal sequences can be orthogonal to each other, which can be understood as that the inner product of any two sequences in the M orthogonal sequences is 0 or does not exceed a threshold, or, in the case that the frequency offset of signal transmission is small or no frequency offset occurs, the inner product of two signals obtained based on any two sequences in the M orthogonal sequences is 0; or, in the case that the frequency offset of signal transmission is large (such as non-terrestrial network (NTN) scenario), the inner product of two signals obtained based on any two sequences in the M orthogonal sequences is less than or equal to a threshold.

[0011] Optionally, the inner product of any two sequences can be understood as the dot product or scalar product of the two sequences, for example, the inner product can be obtained by multiplying the elements at corresponding positions of the two sequences and summing the results. Generally, if two sequences are orthogonal, the inner product of the two sequences is 0; if the two sequences are the same, the inner product is the square of the modulus of the sequence.

[0012] It should be understood that any sequence of the M orthogonal sequences contains N elements, which can be understood as the sequence length of any sequence of the M orthogonal sequences being N.

[0013] Optionally, the sequence involved in the present application can be replaced by other terms, such as vector, code, orthogonal code, orthogonal information, orthogonal matrix, orthogonal sequence, orthogonal spread spectrum code, orthogonal spread spectrum sequence or orthogonal cover code, etc.

[0014] In a possible implementation of the first aspect, in the case where K is less than N, the K times of repeated transmission data are obtained by processing the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

[0015] Based on the above scheme, in the case where the number of repeated transmissions K is less than the sequence length N, the K times of repeated transmission data are obtained by processing the first orthogonal sequence containing the first K elements or the last K elements of the N elements. In this way, in the case where the other communication device transmits data using other orthogonal sequences of the M orthogonal sequences, the data transmitted by the first communication device can still maintain orthogonality with the data transmitted by the other communication device, so as to improve the data transmission performance.

[0016] In a possible implementation of the first aspect, in the case where K is greater than or equal to N, the K times of repeated transmission correspond to a plurality of time units, representing the ceiling; in the first N time units in each of the plurality of time units are used to carry N times of repeated transmission data in the K times of repeated transmission, and the N times of repeated transmission data in the K times of repeated transmission are obtained by processing the N elements contained in the first orthogonal sequence.

[0017] Based on the above scheme, in the case where the number of repeated transmissions K is greater than or equal to the sequence length N, different repeated transmissions can be carried by different time units, and the first N times of repeated transmission data carried by each of the plurality of time units are obtained by processing the N elements contained in the first orthogonal sequence, which can enable different communication devices to use different orthogonal sequences to transmit data in the The data transmitted in each time unit maintains orthogonality, so as to improve data transmission performance.

[0018] Optionally, the K times of repeated transmission correspond to the first resource containing time units, it can be understood that the K times of repeated transmission are carried by the first resource containing time units, each of the first P-1 time units contains N time units, and the N time units are used to carry data of N times of repeated transmission in the K times of repeated transmission. time units, each of the first P-1 time units contains N time units, and the N time units are used to carry data of N times of repeated transmission in the K times of repeated transmission.

[0019] For example, when the number of repetitions K is 30 and the sequence length N is 4, the 30 times of repeated transmission correspond to time units, the first 4 time units of the 8 time units carry the first 4 times of repeated transmission in the 30 times of repeated transmission, the second 4 time units of the 8 time units carry the fifth 4 times of repeated transmission in the 30 times of repeated transmission, and so on, the seventh 4 time units of the 8 time units carry the twenty-fifth 4 times of repeated transmission in the 30 times of repeated transmission.

[0020] For example, when the number of repetitions K is 30 and the sequence length N is 4, the 30 times of repeated transmission correspond to time units, the first 4 time units of the 8 time units carry the first 4 times of repeated transmission in the 30 times of repeated transmission, the second 4 time units of the 8 time units carry the fifth 4 times of repeated transmission in the 30 times of repeated transmission, and so on, the seventh 4 time units of the 8 time units carry the twenty-fifth 4 times of repeated transmission in the 30 times of repeated transmission.

[0021] In a possible implementation of the first aspect, in the time units, the last time unit contains P time units, P is equal to N, and the data carried by the last time unit is obtained by processing N elements contained in the first orthogonal sequence; or, P is less than N, and the data carried by the last time unit is obtained by processing the first P elements or the last P elements in the N elements contained in the first orthogonal sequence.

[0022] Based on the above scheme, in the ​​​​​The repeatedly transmitted data carried on the last time unit in the time units can be processed based on part or all of the N elements included in the first orthogonal sequence. In this way, in the case that the other communication device transmits data using other orthogonal sequences in the M orthogonal sequences, the data transmitted by the first communication device can still be orthogonal to the data transmitted by the other communication device, so as to improve the data transmission performance.

[0023] In a possible implementation of the first aspect, the M orthogonal sequences include Q orthogonal sequences, any sequence of the Q orthogonal sequences includes the same first N / 2 elements and the same last N / 2 elements, and Q is less than or equal to M.

[0024] Generally, in the implementation of the two types of orthogonal sequences (denoted as the first type of sequence, for example, the first type of sequence can include the four sequences corresponding to Table 3 below, and the other type of orthogonal sequence with a sequence length of N / 2 (denoted as the second type of sequence, for example, the second type of sequence can include the two sequences corresponding to Table 2 below)), in the case that the number of repeated transmissions is greater than or equal to N, there is a sequence in the first type of sequence that has the same processing result as a sequence in the second type of sequence for K times of repeated transmission of data, which requires indication of the sequence length (for example, by downlink control information (DCI) or sidelink control information (SCI), etc.), resulting in a large transmission overhead.

[0025] In the above scheme, any sequence of the Q orthogonal sequences includes the same first N / 2 elements and the same last N / 2 elements, and in the case that K is greater than or equal to N, the processing result of K times of repeated transmission of data based on the first N / 2 elements included in the sequence, the processing result of K times of repeated transmission of data based on the last N / 2 elements included in the sequence, and the processing result of K times of repeated transmission of data based on the N elements included in the sequence are all the same. In this way, the first communication device does not need to obtain the indication of the sequence length, and can achieve the same implementation result as in the above implementation of the first type of sequence and the second type of sequence, thereby reducing the indication overhead of the sequence length and improving the communication efficiency.

[0026] For example, any sequence of the Q orthogonal sequences includes the same first N / 2 elements and the same last N / 2 elements, including: any sequence of the Q orthogonal sequences includes the same i th element and the same (N / 2+i) th element, where i is an integer from 1 to N / 2; or any sequence of the Q orthogonal sequences includes the same i th element of the first N / 2 elements and the same i th element of the last N / 2 elements, where i is an integer from 1 to N / 2; or any sequence of the Q orthogonal sequences includes one element of the first N / 2 elements that is the same as any element of the last N / 2 elements.

[0027] It should be noted that the M orthogonal sequences can be implemented in various ways, which will be described below in conjunction with some examples.

[0028] In example A, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

[0029] In example A, any sequence of the M orthogonal sequences is determined by a row of a DFT matrix.

[0030] Optionally, a sequence is determined based on a row of a matrix, including: a plurality of elements of the sequence are the same as a row of one or more rows of the matrix; and / or an arrangement order of the plurality of elements of the sequence is the same as an arrangement order of the row of the one or more rows of the matrix.

[0031] Optionally, the matrix involved in the present application can be replaced by other terms, such as sequence set, vector set, code set, orthogonal code set, orthogonal information set, orthogonal matrix set, orthogonal sequence set, orthogonal spreading code set, orthogonal spreading sequence set, or orthogonal cover code set.

[0032] Generally, exchanging any two rows of a matrix does not change the OCC sequence set. For example, any matrix corresponds to a group of sequences (or a group of OCC sequence sets), and after exchanging any two rows of the matrix to obtain another matrix, the other matrix can correspond to another group of sequences (or a group of OCC sequence sets), where the group of sequences and the other group of sequences can be understood as the same group of OCC sequences. In other words, any matrix provided in the present application can be replaced by another matrix, which can be obtained by one or more transformations of the any matrix, and each transformation can exchange any two rows of the matrix.

[0033] In example A, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0034] In Example B, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

[0035] In Example B, any sequence of the M orthogonal sequences is determined by one row of a Walsh-Hadamard matrix.

[0036] In Example B, Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0037] In Example C, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

[0038] In Example C, any sequence of the M orthogonal sequences is determined by one row of a first matrix. The first matrix is determined based on a DFT matrix, for example, the first matrix can be obtained by performing matrix permutation, matrix interleaving, matrix elementary transformation, etc. on the DFT matrix. Optionally, the first matrix can be a permutation DFT matrix.

[0039] For example, the first matrix can be obtained by permuting the 2nd column and the 3rd column of the DFT matrix.

[0040] In Example C, Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0041] In a possible implementation of the first aspect, the method further includes: receiving or transmitting, by the first communication device, first information, the first information indicating the first orthogonal sequence (for example, the first information including a sequence index of the first orthogonal sequence in the M orthogonal sequences); or the first orthogonal sequence is determined based on a first rule in the M orthogonal sequences.

[0042] Based on the above scheme, the first communication device can determine the first orthogonal sequence in any of the above manners, so as to improve the flexibility of the scheme implementation.

[0043] Optionally, in the implementation manner of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e., N / 2+N), that is, the data transceiving parties need to configure / indicate one of the 3N / 2 sequences. In the above scheme, the maximum number of the M orthogonal sequences is N sequences (as in the foregoing example A and example B) or N+1 sequences (as in the foregoing example C). Therefore, the first information can indicate that the first orthogonal sequence is one of the N sequences or one of the N+1 sequences. In this way, in the case where N is greater than 2, the configuration / indication overhead of a certain orthogonal sequence can be reduced to improve communication efficiency.

[0044] For example, in the case where N is 4, in the implementation manner of the first type of sequence, the data transceiving parties need to configure / indicate the first type by 1 bit and indicate one of the 4 sequences included in the first type of sequence by 2 bits, a total of 3 bits corresponding to 6 values indicating the 4 sequences included in the first type. In the implementation manner of the second type of sequence, the data transceiving parties need to configure / indicate the second type by 1 bit and indicate one of the 2 sequences included in the second type of sequence by 1 bit, a total of 2 bits corresponding to 4 values indicating the 2 sequences included in the second type.

[0045] In the above scheme, the first information can indicate that the first orthogonal sequence is one of the 4 (N=4) sequences or one of the 5 (N+1=5) sequences, and 2 bits corresponding to 4 values are needed to indicate the 4 sequences or 3 bits corresponding to 5 values are needed to indicate the 5 sequences. Different values of the same or fewer bits can be used to indicate more sequences, which can reduce the number of different values or the number of bits and reduce the overhead and complexity.

[0046] Optionally, the first rule can be implemented in various ways.

[0047] As an example, the first rule indicates that the first orthogonal sequence is associated with a random number, for example, the sequence index of the first orthogonal sequence in the M orthogonal sequences can be determined based on the random number.

[0048] As another example, the first rule indicates that the first orthogonal sequence is associated with the identity of the first communication device (or the identity of the communication device corresponding to the first communication device), for example, the sequence index of the first orthogonal sequence in the M orthogonal sequences can be determined based on the identity of the first communication device (or the identity of the communication device corresponding to the first communication device).

[0049] In a possible implementation manner of the first aspect, the method further includes: the first communication device receiving or sending second information, the second information being used to indicate the M orthogonal sequences.

[0050] Based on the above scheme, the first communication device can receive or send the second information, so that the receiver of the second information can determine the M orthogonal sequences based on the second information, so that the data transmitting and receiving parties can implement the transmission and reception of data based on the M orthogonal sequences.

[0051] In addition, in the implementation manner of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e., N / 2+N), that is, the data transmitting and receiving parties need to configure / indicate 3N / 2 sequences. In the above scheme, the M orthogonal sequences indicated by the second information are at most N sequences (as in the above examples A and B) or N+1 sequences (as in the above example C). In this way, in the case where N is greater than 2, the configuration / indication overhead of the orthogonal sequences can be reduced to improve the communication efficiency.

[0052] In a possible implementation manner of the first aspect, the method further includes that the first communication device receives or sends third information, the third information being used to determine that data of each of the K repeated transmissions is carried in 1 slot or 1 / 2 slot.

[0053] Based on the above scheme, the first communication device can receive or send the third information, so that the receiver of the third information can determine the time domain resource carrying the data of each of the K repeated transmissions based on the third information, so that the data transmitting and receiving parties can implement the transmission and reception of data based on the specified time domain resource to improve the success rate of data transmission and reception.

[0054] Optionally, the third information is used to indicate the resource type of the first resource; in the case where the resource type of the first resource is a first type, the third information is used to determine that the time unit is 1 slot; or, in the case where the resource type of the first resource is a second type, the third information is used to determine that the time unit is 1 / 2 slot.

[0055] Optionally, the first type is a physical uplink shared channel (PUSCH) repetition type A (PUSCH Type A), and the second type is a PUSCH repetition type B (PUSCH Type B).

[0056] In a possible implementation manner of the first aspect, the method further includes that the first communication device receives or sends fourth information, the fourth information being used to indicate the first resource.

[0057] Based on the above scheme, the first communication device can receive or send the fourth information, so that the receiver of the fourth information can determine the first resource based on the fourth information, so that the data transmitting and receiving parties can implement the transmission and reception of data in the specified first resource to improve the success rate of data transmission and reception.

[0058] Optionally, the fourth information comprises first indication information and / or second indication information, the first indication information is used to indicate the number of repeated time slots corresponding to the first resource, and the second indication information is used to indicate the number of transmission blocks across time slots corresponding to the first resource.

[0059] The second aspect of the present application provides a communication method, which is applied to a second communication device. The second communication device can be a communication device (e.g., a terminal device or a network device), or a part of the communication device (e.g., a processor or a circuit or a chip responsible for communication functions (e.g., a Modem chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a modem core, etc.), or a logic module or software capable of realizing all or part of the functions of the communication device. The following takes the second communication device as an example. In the method, the second communication device determines a first resource of a data channel, the first resource is used to carry K times of repeated transmission data, K is a positive integer; the second communication device receives part or all of the repeated transmission data in the K times of repeated transmission, the K times of repeated transmission data is processed based on a first orthogonal sequence in M orthogonal sequences, any sequence of the M orthogonal sequences contains N elements, M is a positive integer, and N is an integer greater than 1.

[0060] Based on the above scheme, the second communication device can receive part or all of the repeated transmission data in the K times of repeated transmission on the first resource, wherein the K times of repeated transmission data is processed based on a first orthogonal sequence in M orthogonal sequences. In other words, the data carried on the data channel can be obtained by processing the orthogonal sequence. In this way, the data sent by different communication devices on the data channel using different orthogonal sequences can be orthogonal to each other, i.e., the second communication device can distinguish the data sent by different communication devices based on the orthogonal sequence, so that different communication devices can multiplex the same resource on the data channel for data transmission, which can improve the resource utilization and the transmission performance of the data channel.

[0061] In addition, in the above scheme, the K times of repeated transmission data carried on the data channel can be obtained by processing the orthogonal sequence, i.e., the data of different times of repeated transmission can be obtained by processing the elements with the same (or different) values contained in the orthogonal sequence, so that the second communication device can obtain at least two copies of the same (or different) repeated transmission data, which can help the receiving end to detect and correct transmission errors, thereby improving the receiving performance.

[0062] In a possible implementation of the second aspect, in a case where K is less than N, the K times of repeated transmission data are processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

[0063] Based on the above scheme, in a case where the number of repeated transmissions K is less than the sequence length N, the K times of repeated transmission data are processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements. In this way, in a case where the other communication device transmits data using other orthogonal sequences of the M orthogonal sequences, the data transmitted by the first communication device can still be orthogonal to the data transmitted by the other communication device, so as to improve the data transmission performance.

[0064] In a possible implementation of the second aspect, in a case where K is greater than or equal to N, the K times of repeated transmission correspond to a time unit, indicates that the data transmitted by the first communication device is orthogonal to the data transmitted by the other communication device. round up; in the first N time units in each time unit of the time units are used to carry N times of repeated transmission data in the K times of repeated transmission, and the N times of repeated transmission data in the K times of repeated transmission are processed by the first orthogonal sequence containing N elements.

[0065] Based on the above scheme, in a case where the number of repeated transmissions K is greater than or equal to the sequence length N, different repeated transmissions can be carried by different time units, and the first N times of repeated transmission data carried by each time unit of the time units are processed by the N elements contained in the first orthogonal sequence, so that the data transmitted by different communication devices using different orthogonal sequences in the time units can be kept orthogonal, so as to improve the data transmission performance.

[0066] In a possible implementation of the second aspect, in the time units, the last time unit contains P time units; P is equal to N, and the data carried by the last time unit is processed by the N elements contained in the first orthogonal sequence; or, P is less than N, and the data carried by the last time unit is processed by the first P elements or the last P elements of the N elements contained in the first orthogonal sequence. Based on the above scheme, in the time units,

[0067] ​​The repeatedly transmitted data carried on the last time unit in the time units can be processed based on part or all of the N elements included in the first orthogonal sequence. In this way, in the case that the other communication device transmits data using other orthogonal sequences in the M orthogonal sequences, the data transmitted by the first communication device can still be orthogonal to the data transmitted by the other communication device, so as to improve the data transmission performance.

[0068] In a possible implementation of the second aspect, the M orthogonal sequences include Q orthogonal sequences, any sequence of the Q orthogonal sequences includes the first N / 2 elements and the last N / 2 elements that are the same, and Q is less than or equal to N.

[0069] Generally, in the implementation of the two types of orthogonal sequences (denoted as the first type of sequence, for example, the first type of sequence can include the four sequences corresponding to Table 3 below) with the sequence length of N and the other type of orthogonal sequences (denoted as the second type of sequence, for example, the second type of sequence can include the two sequences corresponding to Table 2 below) with the sequence length of N / 2, in the case that the number of repeated transmissions is greater than or equal to N, there is a sequence in the first type of sequence that has the same processing result of the K times of repeated transmissions as a certain sequence in the second type of sequence, which needs to indicate the sequence length (for example, by downlink control information (DCI) or sidelink control information (SCI) or the like), resulting in a large transmission overhead.

[0070] In the above scheme, any sequence of the Q orthogonal sequences includes the first N / 2 elements and the last N / 2 elements that are the same, in the case that K is greater than or equal to N, the processing result of the K times of repeated transmissions based on the first N / 2 elements included in the sequence, the processing result of the K times of repeated transmissions based on the last N / 2 elements included in the sequence, and the processing result of the K times of repeated transmissions based on the N elements included in the sequence are all the same. In this way, the first communication device does not need to obtain the indication of the sequence length, and the same implementation result as in the above implementation of the first type of sequence and the second type of sequence can be achieved, which can reduce the indication overhead of the sequence length, so as to improve the communication efficiency.

[0071] Optionally, the first N / 2 elements and the last N / 2 elements included in any sequence of the Q orthogonal sequences are the same, including that the i th element and the N / 2+i th element of any sequence of the Q orthogonal sequences are the same, i is 1 to N / 2; or the i th element of the first N / 2 elements and the i th element of the last N / 2 elements are the same, i is 1 to N / 2.

[0072] It is to be noted that the M orthogonal sequences can be implemented in various ways, which will be described in connection with some examples.

[0073] In example A, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

[0074] In example A, any sequence of the M orthogonal sequences is determined by one row of a DFT matrix.

[0075] Optionally, a sequence is determined based on one row of a matrix, including: the sequence includes a plurality of elements which are identical to one row of a plurality of rows of the matrix; and / or, the sequence includes a plurality of elements which are arranged in an order identical to one row of a plurality of rows of the matrix.

[0076] Optionally, the matrix can be replaced by other terms, such as a sequence set, a vector set, a code set, an orthogonal code set, an orthogonal information set, an orthogonal matrix set, an orthogonal sequence set, an orthogonal spreading code set, an orthogonal spreading sequence set, or an orthogonal cover code set.

[0077] Generally, exchanging any two rows of a matrix does not change the OCC sequence set. For example, any matrix corresponds to a group of sequences (or a group of OCC sequence sets), and after exchanging any two rows of the matrix to obtain another matrix, the other matrix can correspond to another group of sequences (or a group of OCC sequence sets), wherein the group of sequences and the other group of sequences can be understood as the same group of OCC sequences. In other words, any matrix provided by the present application can be replaced by other matrices, which can be obtained by one or more transformations of the any matrix, and each transformation can exchange any two rows of the matrix.

[0078] In example A, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0079] In example B, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

[0080] In example B, any sequence of the M orthogonal sequences is determined by one row of a Walsh-Hadamard matrix.

[0081] In Example B, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0082] In Example C, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

[0083] In Example C, any sequence of the M orthogonal sequences is determined by a row of a first matrix. The first matrix is determined based on a DFT matrix, for example, the first matrix can be obtained by performing matrix permutation, matrix interleaving, matrix elementary transformation, etc. on the DFT matrix. Alternatively, the first matrix can be a permutation DFT matrix.

[0084] For example, the first matrix can be obtained by permuting the 2nd column and the 3rd column of the DFT matrix.

[0085] In Example C, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0086] In a possible implementation of the second aspect, the method further includes: receiving or sending, by the second communication device, first information, the first information indicating the first orthogonal sequence; or the first orthogonal sequence is determined based on a first rule from the M orthogonal sequences.

[0087] Based on the above scheme, the second communication device can determine the first orthogonal sequence in any of the above manners, so as to improve the flexibility of the scheme implementation.

[0088] Alternatively, in the implementation of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e. N / 2+N), that is, the data transceiver needs to configure / indicate one of the 3N / 2 sequences. In the above scheme, the M orthogonal sequences are at most N sequences (as in Example A and Example B) or N+1 sequences (as in Example C), therefore, the first information can indicate that the first orthogonal sequence is one of the N sequences or one of the N+1 sequences. In this way, in the case where N is greater than 2, the configuration / indication overhead of a certain orthogonal sequence can be reduced, so as to improve the communication efficiency.

[0089] For example, in the implementation manner of the first type of sequence, when N is 4, the data transceiving parties need to configure / indicate the first type by 1 bit, and need to indicate one of the 4 sequences included in the first type of sequence by 2 bits, a total of 3 bits corresponding to 6 values indicating the 4 sequences included in the first type. In the implementation manner of the second type of sequence, the data transceiving parties need to configure / indicate the second type by 1 bit, and need to indicate one of the 2 sequences included in the second type of sequence by 1 bit, a total of 2 bits corresponding to 4 values indicating the 2 sequences included in the second type.

[0090] In the above scheme, the first information can indicate one of the 4 (N=4) sequences or one of the 5 (N+1=5) sequences, 2 bits corresponding to 4 values indicating the 4 sequences or 3 bits corresponding to 5 values indicating the 5 sequences, which can indicate more sequences by different values of the same or fewer bits, can reduce the number of different values or the number of bits, and reduce the overhead and complexity.

[0091] Optionally, the first rule can be implemented in various ways.

[0092] As an example, the first rule indicates that the first orthogonal sequence is associated with a random number, for example, the sequence index of the first orthogonal sequence in the M orthogonal sequences can be determined based on the random number.

[0093] As another example, the first rule indicates that the first orthogonal sequence is associated with an identifier of the first communication device (or an identifier of a communication device corresponding to the first communication device), for example, the sequence index of the first orthogonal sequence in the M orthogonal sequences can be determined based on the identifier of the first communication device (or the identifier of the communication device corresponding to the first communication device).

[0094] In a possible implementation manner of the second aspect, the method further includes: receiving or sending, by the second communication device, second information, the second information being used to indicate the M orthogonal sequences.

[0095] Based on the above scheme, the second communication device can receive or send the second information, so that the receiver of the second information can determine the M orthogonal sequences based on the second information, so that the data transceiving parties can implement data transceiving based on the M orthogonal sequences.

[0096] In addition, in the implementation manners of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e., N / 2+N), that is, the data transceiver needs to configure / indicate 3N / 2 sequences. In the above scheme, the M orthogonal sequences indicated by the second information are at most N sequences (as in the example A and the example B) or N+1 sequences (as in the example C). In this way, in the case where N is greater than 2, the configuration / indication overhead of the orthogonal sequences can be reduced, so as to improve the communication efficiency.

[0097] In a possible implementation manner of the second aspect, the method further includes: the second communication apparatus receiving or sending third information, the third information being used to determine that data of each of the K times of repeated transmissions is carried in 1 time slot or 1 / 2 time slots.

[0098] Based on the above scheme, the first communication apparatus can receive or send the third information, so that the receiver of the third information can determine the time domain resource carrying data of each of the K times of repeated transmissions based on the third information, so that the data transceiver can implement the data transceiving in the specified time domain resource, so as to improve the success rate of the data transceiving.

[0099] Optionally, the third information is used to indicate the resource type of the first resource; in the case where the resource type of the first resource is a first type, the third information is used to determine that the time unit is 1 time slot; or, in the case where the resource type of the first resource is a second type, the third information is used to determine that the time unit is 1 / 2 time slots.

[0100] Optionally, the first type is a physical uplink shared channel (PUSCH) repetition type A (PUSCH Type A), and the second type is a PUSCH repetition type B (PUSCH Type B).

[0101] In a possible implementation manner of the second aspect, the method further includes: the second communication apparatus receiving or sending fourth information, the fourth information being used to indicate the first resource.

[0102] Based on the above scheme, the second communication apparatus can receive or send the fourth information, so that the receiver of the fourth information can determine the first resource based on the fourth information, so that the data transceiver can implement the data transceiving in the specified first resource, so as to improve the success rate of the data transceiving.

[0103] Optionally, the fourth information includes first indication information and / or second indication information, the first indication information being used to indicate the number of repeated time slots corresponding to the first resource, and the second indication information being used to indicate the number of time slot spans of a transport block corresponding to the first resource.

[0104] The third aspect of the application provides a communication device, comprising a transceiver unit and a processing unit; the processing unit is configured to determine a first resource of a data channel, the first resource being used to carry K times of repeated transmission data, K being a positive integer; the transceiver unit is configured to transmit the K times of repeated transmission data, the K times of repeated transmission data being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, and N being an integer greater than 1.

[0105] In a possible implementation of the third aspect, when K is less than N, the K times of repeated transmission data are processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

[0106] In a possible implementation of the third aspect, when K is greater than or equal to N, the K times of repeated transmission correspond to the N elements contained in the first resource each time unit of the time units, representing the rounding up; the first K elements of the N elements in the first time unit, each time unit of the time units contains N time units used to carry data of N times of repeated transmission in the K times of repeated transmission, the data of N times of repeated transmission in the K times of repeated transmission being processed by the N elements contained in the first orthogonal sequence.

[0107] In a possible implementation of the third aspect, in the the last time unit of the time units contains P time units, P being equal to N, the data carried by the last time unit being processed by the N elements contained in the first orthogonal sequence, or P being less than N, the data carried by the last time unit being processed by the first P elements or the last P elements of the N elements contained in the first orthogonal sequence.

[0108] In a possible implementation of the third aspect, the M orthogonal sequences comprise Q orthogonal sequences, any sequence of the Q orthogonal sequences containing the first N / 2 elements and the last N / 2 elements being the same, Q being less than or equal to N.

[0109] In a possible implementation of the third aspect, any sequence of the Q orthogonal sequences contains the first N / 2 elements and the last N / 2 elements being the same, comprising: the i th element of the first N / 2 elements and the i th element of the last N / 2 elements being the same, i taking a value from 1 to N / 2.

[0110] In a possible implementation form of the third aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

[0111] In a possible implementation form of the third aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

[0112] In a possible implementation form of the third aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

[0113] In a possible implementation form of the third aspect, the transceiver is further configured to receive or transmit first information, the first information being used to indicate the first orthogonal sequence; or the first orthogonal sequence being determined based on a first rule from the M orthogonal sequences.

[0114] In a possible implementation form of the third aspect, the transceiver is further configured to receive or transmit second information, the second information being used to indicate the M orthogonal sequences.

[0115] In a possible implementation form of the third aspect, the transceiver is further configured to receive or transmit third information, the third information being used to determine that data of each of the K repeated transmissions is carried in 1 slot or 1 / 2 slot.

[0116] In a possible implementation form of the third aspect, the third information is used to indicate a resource type of the first resource; in a case where the resource type of the first resource is a first type, the third information is used to determine that the time unit is 1 slot; or in a case where the resource type of the first resource is a second type, the third information is used to determine that the time unit is 1 / 2 slot.

[0117] In a possible implementation form of the third aspect, the transceiver is further configured to receive or transmit fourth information, the fourth information being used to indicate the first resource.

[0118] The fourth aspect of the application provides a communication device, which comprises a transceiver unit and a processing unit; the processing unit is configured to determine a first resource of a data channel, the first resource being used to carry data of K times of repeated transmission, K being a positive integer; and the transceiver unit is configured to receive data of part or all of the K times of repeated transmission, the data of the K times of repeated transmission being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer and N being an integer greater than 1.

[0119] In a possible implementation of the fourth aspect, when K is less than N, the data of the K times of repeated transmission is processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

[0120] In a possible implementation of the fourth aspect, when K is greater than or equal to N, the K times of repeated transmission correspond to time units in the first resource, representing the ceiling; and the first K elements or the last K elements of the N elements in the first resource. each of the time units contains N time units used to carry data of N times of repeated transmission in the K times of repeated transmission, the data of the N times of repeated transmission in the K times of repeated transmission being processed by the N elements contained in the first orthogonal sequence.

[0121] In a possible implementation of the fourth aspect, in the time units in the last time unit, P is equal to N, and the data carried by the last time unit is processed by the N elements contained in the first orthogonal sequence; or P is less than N, and the data carried by the last time unit is processed by the first P elements or the last P elements of the N elements contained in the first orthogonal sequence.

[0122] In a possible implementation of the fourth aspect, the M orthogonal sequences comprise Q orthogonal sequences, any sequence of the Q orthogonal sequences containing the first N / 2 elements and the last N / 2 elements being the same, and Q is less than or equal to N.

[0123] In a possible implementation of the fourth aspect, any sequence of the Q orthogonal sequences contains the first N / 2 elements and the last N / 2 elements being the same, which comprises: the i th element of the first N / 2 elements is the same as the i th element of the last N / 2 elements, i being 1 to N / 2.

[0124] In a possible implementation form of the fourth aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

[0125] In a possible implementation form of the fourth aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

[0126] In a possible implementation form of the fourth aspect, the M orthogonal sequences comprise at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1+j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

[0127] In a possible implementation form of the fourth aspect, the transceiver is further configured to receive or transmit first information, the first information indicating the first orthogonal sequence; or the first orthogonal sequence is determined based on a first rule from the M orthogonal sequences.

[0128] In a possible implementation form of the fourth aspect, the transceiver is further configured to receive or transmit second information, the second information indicating the M orthogonal sequences.

[0129] In a possible implementation form of the fourth aspect, the transceiver is further configured to receive or transmit third information, the third information indicating that data of each of the K repeated transmissions is carried in 1 slot or 1 / 2 slot.

[0130] In a possible implementation form of the fourth aspect, the third information indicates a resource type of the first resource; in a case where the resource type of the first resource is a first type, the third information indicates that the time unit is 1 slot; or in a case where the resource type of the first resource is a second type, the third information indicates that the time unit is 1 / 2 slot.

[0131] In a possible implementation form of the fourth aspect, the transceiver is further configured to receive or transmit fourth information, the fourth information indicating the first resource.

[0132] The fifth aspect of the present application provides a communication apparatus, comprising at least one processor configured to execute computer programs or instructions to enable the communication apparatus to implement the method in any possible implementation form of the first aspect or the second aspect.

[0133] Optionally, the communication apparatus can comprise the memory, and / or the at least one processor is coupled with the memory; wherein the memory is configured to store programs or instructions.

[0134] The sixth aspect of the present application provides a communication apparatus, comprising at least one logic circuit; the logic circuit is configured to execute the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0135] The seventh aspect of the present application provides a communication system, comprising the first communication apparatus and a second communication apparatus.

[0136] The eighth aspect of the present application provides a computer readable storage medium, configured to store one or more computer-executable instructions, when the computer-executable instructions are executed by a processor, the processor executes the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0137] The ninth aspect of the present application provides a computer program product (or computer program), when the computer program in the computer program product is executed by the processor, the processor executes the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0138] The tenth aspect of the present application provides a chip system, comprising at least one processor, configured to support the communication apparatus to implement the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0139] In a possible design, the chip system can further comprise a memory, the memory is configured to store necessary programs and data of the communication apparatus. The chip system can be composed of a chip, or can comprise the chip and other discrete devices. Optionally, the chip system further comprises an interface circuit, the interface circuit is configured to provide programs and / or data for the at least one processor.

[0140] The technical effects brought by any one of the third aspect to the tenth aspect can be referred to the technical effects brought by different design manners of the first aspect to the second aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0141] FIG. 1 is a schematic diagram of a communication system provided by the present application;

[0142] FIG. 2a to FIG. 2b are some schematic diagrams of a network device provided by the present application;

[0143] FIG. 3a to FIG. 3e are some schematic diagrams of a satellite communication process provided by the present application;

[0144] FIG. 4a to FIG. 4c are some schematic diagrams of application of OCC provided by the present application;

[0145] FIG. 5 is a schematic diagram of a communication method provided by the present application;

[0146] FIG. 6 to FIG. 10 are some schematic diagrams of a communication device provided by the present application. DETAILED DESCRIPTION

[0147] First, some terms in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

[0148] (1) Terminal device: can be a wireless terminal device capable of receiving network device scheduling and indication information, the wireless terminal device can be a device providing voice and / or data connectivity to a user, or a handheld device with wireless connection function, or other processing devices connected to a wireless modem.

[0149] The terminal device can be various communication kits (a kit can include, for example, an antenna, a power supply template, a cable, and a Wi-Fi module, etc.) with wireless communication functions, and can also be a communication module with satellite communication functions, a satellite phone or its components, a very small aperture terminal (VSAT), etc. The terminal device can be a mobile terminal device, such as a mobile phone (or called "cellular" phone, mobile phone), a computer, and a data card, for example, a portable, pocket-sized, handheld, computer-built-in, or vehicle-mounted mobile device that exchanges voice and / or data with a wireless access network. For example, a personal communication service (PCS) phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a tablet computer (Pad), a computer with wireless transceiver function, etc. The wireless terminal device can also be called a subscriber unit, a subscriber station, a mobile station, a mobile station (MS), a remote station, an access point (AP), a remote terminal, an access terminal, a user terminal, a user agent, a subscriber station (SS), customer premises equipment (CPE), a terminal, user equipment (UE), a mobile terminal (MT), a drone, etc. The terminal device can also be a wearable device and a next-generation communication system, for example, a terminal device in a future communication system or a terminal device in a future evolved public land mobile network (PLMN), etc. Of course, the terminal device in this application can also refer to a chip, a modem, a system on a chip (SoC) mainly responsible for the relevant communication function in the device, or a communication platform that can include a radio frequency (RF) part, etc.

[0150] (2) Network device: can be a device in a wireless network, for example, the network device can be a RAN node (or device) for accessing a terminal device to a wireless network, which can also be referred to as a base station. At present, some examples of RAN devices are: base station (base station), evolved NodeB (eNodeB), base station gNB (gNodeB) in 5G communication system, transmission reception point (transmission reception point, TRP), evolved Node B (eNB), radio network controller (radio network controller, RNC), Node B (Node B, NB), home base station (for example, home evolved Node B, or home Node B, HNB), baseband unit (baseband unit, BBU), or wireless fidelity (wireless fidelity, Wi-Fi) access point AP, etc. In addition, in a network structure, the network device can include a centralized unit (centralized unit, CU) node, or a distributed unit (distributed unit, DU) node, or a RAN device including a CU node and a DU node.

[0151] Optionally, the RAN node can also be a macro base station, a micro base station or an indoor station, a relay node or a donor node, or a wireless controller in a cloud radio access network (cloud radio access network, CRAN) scenario. The RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in vehicle to everything (vehicle to everything, V2X) technology can be a road side unit (road side unit, RSU).

[0152] In another possible scenario, multiple RAN nodes cooperate to assist a terminal to implement wireless access, and different RAN nodes respectively implement part of functions of a base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can also be included in the same network element, for example, in a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0153] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in an open RAN (O-RAN or ORAN) 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, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and 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.

[0154] The communication between the access network device and the terminal device follows a certain protocol layer structure. The protocol layer can include a control plane protocol layer and a user plane protocol layer. The control plane protocol layer can include at least one of a radio resource control (RRC) layer, a packet data convergence protocol (PDCP) layer, a radio link control (RLC) layer, a media access control (MAC) layer, or a physical (PHY) layer, etc. The user plane protocol layer can include at least one of a service data adaptation protocol (SDAP) layer, a PDCP layer, an RLC layer, a MAC layer, or a physical layer, etc.

[0155] For the network element in the ORAN system and the corresponding relationship of the protocol layer functions that can be implemented, refer to Table 1 below.

[0156] Table 1

[0157] The network device can be other devices that provide wireless communication functions for terminal devices. Embodiments of the present application do not limit the specific technology and specific device form adopted by the network device. For the convenience of description, the embodiments of the present application do not limit.

[0158] The network device can also include a core network device, which can include, for example, a mobility management entity (MME) in a fourth generation (4G) network, a home subscriber server (HSS), a serving gateway (S-GW), a policy and charging rules function (PCRF), a public data network gateway (P-GW), an access and mobility management function (AMF) in a 5G network, a user plane function (UPF), a session management function (SMF), and other network elements. In addition, the core network device can also include other core network devices in a 5G network and a next-generation network of the 5G network.

[0159] In the embodiments of the present application, the network device can also be a network node with artificial intelligence (AI) capability, which can provide AI services for terminals or other network devices, for example, AI nodes, computing power nodes, AI-capable RAN nodes, AI-capable core network elements, etc. on the network side (access network or core network).

[0160] In the embodiments of the present application, the device for implementing the function of the network device can be a network device or a device capable of supporting the network device to implement the function, such as a chip system, which can be installed in the network device. In the technical solutions provided in the embodiments of the present application, the device for implementing the function of the network device is taken as an example to describe the technical solutions provided in the embodiments of the present application.

[0161] (3) Configuration and pre-configuration: In the present application, configuration and pre-configuration will be used simultaneously. Configuration refers to that the network device sends some parameter configuration information or parameter values to the terminal device through messages or signaling, so that the terminal device determines the communication parameters or transmission resources according to the values or information. Pre-configuration is similar to configuration, which can be parameter information or parameter values agreed by the network device and the terminal device in advance, or parameter information or parameter values adopted by the network device or the terminal device according to the standard protocol, or parameter information or parameter values pre-stored in the network device or the terminal device. The present application does not make any limitation.

[0162] Further, these values and parameters can be changed or updated.

[0163] (4) The terms "system" and "network" in the embodiments of the present application can be used interchangeably. "At least one" means one or more, and "multiple" means two or more. "And / or" describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which means that A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one of the following" or similar expressions means any combination of these items, including any combination of single item or multiple items. For example, "at least one of A, B and C" includes A, B, C, AB, AC, BC or ABC. In addition, unless otherwise specified, the ordinal numbers "first", "second", etc. mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, time sequence, priority or importance of the multiple objects.

[0164] (5) In embodiments of the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, which can include direct sending through the air interface, or indirect sending through the air interface by other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, which can include direct receiving from YY through the air interface, or indirect receiving from YY through the air interface by other units or modules. "Sending" can also be understood as "output" of a chip interface, and "receiving" can also be understood as "input" of a chip interface.

[0165] In other words, sending and receiving can be between devices, such as between network devices and terminal devices, or within devices, such as between components, modules, chips, software modules or hardware modules within a device through a bus, wire or interface.

[0166] It can be understood that the information can be processed as necessary between the source and the destination of the information transmission, such as encoding and modulation, but the destination can understand the valid information from the source. Similar expressions in the present application can be similarly understood and will not be repeated.

[0167] (6) In embodiments of the present application, "indicating" can include direct indication and indirect indication, and can also include explicit indication and implicit indication. The information indicated by a certain information (indication information as described below) is referred to as to-be-indicated information. In the implementation process, there are many ways to indicate the to-be-indicated information, for example but not limited to, the to-be-indicated information can be directly indicated, such as the to-be-indicated information itself or an index of the to-be-indicated information. The to-be-indicated information can also be indirectly indicated by indicating other information, where the other information and the to-be-indicated information have an association relationship. The to-be-indicated information can also be indicated only by a part of the to-be-indicated information, and the other part of the to-be-indicated information is known or agreed in advance, for example, the arrangement order of each information can be used to indicate a specific information, thereby reducing the indication overhead to a certain extent. The present application does not limit the specific manner of indication. It can be understood that for the sender of the indication information, the indication information can be used to indicate the to-be-indicated information, and for the receiver of the indication information, the indication information can be used to determine the to-be-indicated information.

[0168] In the present application, the same or similar parts among various embodiments can be mutually referred to, unless otherwise specified. In the present application, the various embodiments, and the various methods / designs / implementation manners in the various embodiments, the terms and / or descriptions are consistent and can be mutually referred to, unless otherwise specified and there is no logical conflict. The technical features in the various embodiments, and the various methods / designs / implementation manners in the various embodiments can be combined to form new embodiments, methods, or implementation manners according to their inherent logical relationship. The implementation manners of the present application described below do not constitute a limitation on the protection scope of the present application.

[0169] (7) Commonly used orthogonal cover code (OCC) sequences include: Walsh-Hadamard sequences, DFT sequences, Zadoff-Chu sequences. Each row of the following matrix represents a sequence, and any two rows are orthogonal to each other (inner product is zero).

[0170] For example, the Walsh-Hadamard sequence can be determined by the following matrix, which is the matrix H2 of the sequence length 2, the matrix H4 of the sequence length 4, and the matrix H8 of the sequence length 8, respectively.

[0171] For another example, the DFT sequence can be determined by the following matrix (j is the imaginary unit), which is the matrix F2 of the sequence length 2, the matrix F4 of the sequence length 4, and the matrix F8 of the sequence length 8, respectively.

[0172] For another example, the Zadoff-Chu sequence can be determined by the following matrix, which is the matrix Z3 of the sequence length 3 and the matrix Z6 of the sequence length 6, respectively.

[0173] The present application can be applied to a long term evolution (LTE) system, a new radio (NR) system, or a new radio vehicle to everything (NR V2X) system; can also be applied to a system in which LTE and 5G are hybrid networked; or a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an Internet of Things (IoT), or a drone communication system; or a communication system supporting multiple wireless technologies, such as a communication system supporting LTE technology and NR technology; or a non-ground communication system, such as a satellite communication system, a high-altitude communication platform, etc. In addition, the communication system can also be applied to a narrow band-internet of things (NB-IoT) system or other communication systems, wherein the communication system includes a network device and a terminal device, the network device as a configuration information sending entity, and the terminal device as a configuration information receiving entity. Specifically, there are entities in the communication system that send configuration information to another entity, and send data to another entity or receive data sent by another entity; another entity receives configuration information and sends data to the configuration information sending entity or receives data sent by the configuration information sending entity according to the configuration information. Wherein, the present application can be applied to a terminal device in a connected state or an active state, and can also be applied to a terminal device in an inactive state or an idle state.

[0174] Referring to FIG. 1, there is shown a schematic diagram of an architecture of a communication system 1000 to which embodiments of the present application can be applied. As shown in FIG. 1, the communication system includes a radio access network (RAN) 100 and a core network 200. Optionally, the communication system 1000 can further include an Internet 300. The RAN 100 includes at least one RAN node (e.g., 110a and 110b in FIG. 1, collectively referred to as 110) and at least one terminal (e.g., 120a-120j in FIG. 1, collectively referred to as 120). The RAN 100 can further include other RAN nodes, such as a wireless relay device and / or a wireless backhaul device (not shown in FIG. 1). The terminals 120 are wirelessly connected to the RAN nodes 110, and the RAN nodes 110 are connected to the core network 200 wirelessly or wiredly. The core network devices in the core network 200 and the RAN nodes 110 in the RAN 100 can be independent and different physical devices, or can be the same physical device integrated with the logical functions of the core network devices and the logical functions of the RAN nodes. The terminals and the terminals, and the RAN nodes and the RAN nodes can be connected to each other by wire or wirelessly.

[0175] As an implementation example, as shown in FIG. 2a, the access network device can include at least one CU and at least one DU. This design can be referred to as CU and DU separation. One CU can be connected to one or more DUs. The CU and the DU can be divided according to the protocol layers of the wireless network: for example, the functions of the PDCP layer and above protocol layers (such as the RRC layer and the SDAP layer, etc.) are arranged in the CU, and the functions of the protocol layers below the PDCP layer (such as the RLC layer, the MAC layer, and the PHY layer, etc.) are arranged in the DU; for another example, the functions of the protocol layers above the PDCP layer are arranged in the CU, and the functions of the protocol layers at and below the PDCP layer are arranged in the DU, which is not limited. When the CU includes a CU-CP and a CU-UP, the CU-CP is used to implement the control plane function of the CU, and the CU-UP is used to implement the user plane function of the CU. For example, when the CU is configured to implement the functions of the PDCP layer, the RRC layer, and the SDAP layer, the CU-CP is used to implement the RRC layer function and the control plane function of the PDCP layer, and the CU-UP is used to implement the SDAP layer function and the user plane function of the PDCP layer. The name of the CU and the DU is not limited in the present application, for example, the CU can be referred to as a first access network element, and the DU can be referred to as a second access network element, etc.

[0176] The above-mentioned processing functions of the CU and the DU are merely examples according to the protocol layer division, and can be divided in other manners. For example, the CU or the DU can be divided into more protocol layers, or the CU or the DU can be divided into partial processing functions of the protocol layers. For example, partial functions of the RLC layer and functions of the protocol layers above the RLC layer are arranged in the CU, and the remaining functions of the RLC layer and functions of the protocol layers below the RLC layer are arranged in the DU. For another example, the functions of the CU or the DU can be divided according to service types or other system requirements, for example, according to time delay. Functions that require a shorter time delay can be arranged in the DU, and functions that do not require the time delay can be arranged in the CU.

[0177] The CU can be connected to the core network. Optionally, the CU can have partial functions of the core network.

[0178] Further, partial functions of the DU can be arranged separately. As shown in FIG. 2a, the partial functions can be implemented by a radio unit (RU). The RU can have a radio frequency function. The name of the RU is not limited in the present application, for example, the RU can be referred to as a third access network element, etc. The DU and the RU can be split or separated at the PHY layer. For example, the DU can implement high-layer functions in the PHY layer, and the RU can implement low-layer functions in the PHY layer or implement the low-layer functions and the radio frequency functions. The high-layer functions in the PHY layer include functions closer to the MAC layer, and the low-layer functions in the PHY layer include functions closer to the radio frequency. For example, the high-layer functions in the PHY layer include one or more of the following: forward error correction (FEC) encoding / decoding, scrambling, or modulation / demodulation. The low-layer functions in the PHY layer include one or more of the following: fast Fourier transform (FFT) transform / inverse fast Fourier transform (iFFT) transform, beamforming, or extraction and filtering of a physical random access channel (PRACH), etc. The RU can perform radio frequency signal communication with the terminal device through an air interface. The precoding function in the PHY layer can be located in the DU or in the RU. The split manner between the DU and the RU can be various possible manners, which are not limited.

[0179] There is an interface between the DU and the RU. For example, according to different splitting manners, the interface between the DU and the RU can be a common public radio interface (CPRI) interface or an enhanced common public radio interface (eCPRI) interface.

[0180] As shown in FIG. 2b, an architecture of an access network device is shown. The access network device includes one or more functional modules to implement processing of signals. As shown in FIG. 2b, taking a physical layer function as an example, the access 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), inverse fast Fourier transformation (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, digital to analog (DA) conversion, analog BF, analog to digital (AD) conversion, or analog BF.

[0181] The one or more functional modules can be implemented by software, hardware, or a combination of software and hardware. They can be discrete or integrated. It can be understood that the functional modules are only examples, and the access network device can include more other modules (such as a scheduling module, a power control module, a hybrid automatic repeat request (HARQ) module, a flow control module, a mobility management module, or an artificial intelligence (AI) module, etc.) or not include some functional modules (such as not including a digital BF module) according to design. The access network device further includes a fronthaul interface between the DU and the RU, for realizing communication between the DU and the RU. The fronthaul interface includes but is not limited to CPRI or eCPRI. In a possible implementation, the DU is located in a BBU, and the RU is located in a RRU / AAU / RRH. The interface between the BBU and the RRU / AAU / RRH can also be referred to as a fronthaul interface. To realize the fronthaul interface, the BBU and the RRU / AAU / RRH can be connected through a fronthaul network, or the DU and the RU can be connected through a fronthaul network. For example, the fronthaul network includes but is not limited to a fiber direct connection or a wavelength division network.

[0182] The access network device can support one or more types of fronthaul interfaces, and different fronthaul interfaces correspond to DUs and RUs with different functions. As shown in FIG. 2b, if the fronthaul interface between the DU and the RU is CPRI, the DU is configured to implement one or more of baseband functions, and the RU is configured to implement one or more of radio frequency functions. If the fronthaul interface between the DU and the RU is eCPRI, part of the baseband functions of the downlink and / or uplink are moved from the DU to the RU for implementation, compared with CPRI. The splitting manner between the DU and the RU is different, corresponding to different types (Cat) of eCPRI. FIG. 2b gives six examples of eCPRI, denoted as Cat A, B, C, D, E, and F (which can also be denoted as Option A to F, or Option 1 to 6, or other manners). It can be understood that there can be other splitting manners between the DU and the RU, that is, there can be other types of eCPRI.

[0183] For eCPRI Cat A, for downlink transmission, the DU is configured to implement layer mapping and one or more functions before layer mapping (i.e., one or more of encoding, rate matching, scrambling, modulation, layer mapping), while other functions after layer mapping (e.g., one or more of RE mapping, digital BF, or IFFT / add CP) are implemented in the RU. For uplink transmission, the DU is configured to implement de-mapping and one or more functions before de-mapping (i.e., one or more of decoding, de-rate matching, de-scrambling, de-modulation, IDFT, channel equalization, de-RE mapping), while other functions after de-mapping (e.g., one or more of digital BF or FFT / CP removal) are implemented in the RU.

[0184] Similarly, for eCPRI Cat B, Cat C, Cat D, Cat E, Cat F, different DUs and RUs are configured for different splitting manners. For the splitting point and the functions before the splitting point are implemented by the DU, while the functions after the splitting point are implemented by the RU. The splitting points of different types of eCPRI are shown in FIG. 2b, and will not be described one by one. For example, for eCPRI Cat B, RE mapping is used as the splitting point for downlink transmission, and de-RE mapping is used as the splitting point for uplink transmission. For uplink transmission, RE mapping and the functions before RE mapping are implemented by the DU, while the functions after RE mapping and the radio frequency functions are implemented by the RU. For downlink transmission, de-RE mapping and the functions before de-RE mapping are implemented by the DU, while the functions after de-RE mapping and the radio frequency functions are implemented by the RU.

[0185] The splitting manners of eCPRI can be symmetric for uplink and downlink, such as eCPRI Cat B and Cat C shown in FIG. 2b, or the splitting manners of eCPRI can be asymmetric for uplink and downlink, such as eCPRI Cat A, Cat D, Cat E and Cat F shown in FIG. 2b, without limitation. Optionally, for uplink and / or downlink, different splitting manners can be configured for different channels or different channel groups, i.e., different types of eCPRI are configured. One or more channels can be included in a channel group.

[0186] In a possible design, the DU is located in the BBU, and the RU is located in the RRU / AAU / RRH. The processing module in the BBU for implementing baseband functions is referred to as a base band high (BBH) unit, and the processing module in the RRU / AAU / RRH for implementing baseband functions is referred to as a base band low (BBL) unit.

[0187] It should be noted that the technical solutions of the embodiments of the present application are applicable to a ground communication system. Alternatively, the technical solutions of the embodiments of the present application are applicable to a communication system integrating ground communication and satellite communication, which can also be referred to as a non-terrestrial network (NTN) communication system. For example, the RAN 100 in FIG. 1 can include a ground base station, where the ground base station can include a TN cell (i.e., signals of the TN cell can be transmitted and received by the ground base station); and the RAN 100 in FIG. 1 can also include a non-ground base station, for example, a satellite, which can include an NTN cell (i.e., signals of the NTN cell can be transmitted and received by the satellite). The ground communication system can be, for example, a long term evolution (LTE) system, a universal mobile telecommunication system (UMTS), a 5G communication system, a new radio (NR) system, or a next-generation communication system of the 5G communication system, without limitation.

[0188] Among them, compared with the traditional mobile communication system, the satellite communication has wider coverage, the communication cost is independent of the transmission distance, and can overcome the natural geographical obstacles such as ocean, desert and mountain. In order to overcome the shortcomings of the traditional communication network, the satellite communication can be an effective supplement to the traditional network. It is generally believed that compared with ground network communication, non-ground network communication has different channel characteristics, such as large transmission delay and large Doppler frequency offset. For example, the round-trip delay of GEO satellite communication is 238-270 milliseconds (ms). The round-trip delay of LEO satellite communication is 8-20 ms. According to the difference in orbital height, satellite communication systems can be divided into three types: geostationary earth orbit (GEO) satellite communication system, also known as synchronous orbit satellite system; medium earth orbit (MEO) satellite communication system and low earth orbit (LEO) satellite communication system.

[0189] Among them, GEO satellite is also commonly known as geostationary orbit satellite, and the orbit height can be 35786 kilometers (km). The main advantage is that it is relatively stationary on the ground and provides a large coverage area. However, the disadvantages of GEO satellite orbit satellite are also relatively prominent: such as the distance from the earth is too large, a larger diameter antenna is required; its transmission delay is larger, about 0.5 seconds, which cannot meet the demand of real-time service; at the same time, its orbit resource is relatively scarce, the launch cost is high and it cannot provide coverage for the two polar regions. MEO satellite, the orbit height is between 2000-35786km, has a relatively small number of satellites to achieve global coverage, but its transmission delay is higher than that of LEO satellite, and it is mainly used for positioning and navigation. In addition, the orbit height is between 300-2000km, which is called low earth orbit (LEO) satellite. LEO satellite has lower orbit height than MEO and GEO, smaller data propagation delay, less power loss, and relatively lower launch cost. Therefore, LEO satellite communication network has made great progress in recent years and has attracted attention.

[0190] In a possible implementation, the satellite device can be divided into transparent mode and regenerative mode according to the working mode.

[0191] The two modes will be exemplarily illustrated by the implementation modes shown in FIG. 3a, FIG. 3b, FIG. 3c and FIG. 3d.

[0192] As shown in the implementation mode of the transparent mode in FIG. 3a, the satellite and the gateway (i.e. NTN Gateway in FIG. 3a) act as a relay, that is, the radio remote unit (Remote Radio Unit) shown in FIG. 3a, and the terminal device and the gNB need to realize communication through the relay process. In other words, in the transparent mode, the satellite has the function of relay forwarding.

[0193] For example, in the implementation mode of the transparent mode shown in FIG. 3b, when the satellite (including GEO satellite, MEO satellite, LEO satellite, etc.) works in the transparent mode, the satellite has the function of relay forwarding. The gateway (or gateway station) has the function of the base station or part of the base station function, at this time, the gateway can be regarded as the base station. Alternatively, the base station can be deployed separately from the gateway, and then the delay of the feeder link includes the delay of the satellite to the gateway and the delay of the gateway to the gNB.

[0194] Optionally, the transparent mode can be taken as an example that the gateway and the gNB are together or close to each other. For the case that the gateway is far away from the gNB, the feeder link delay can be obtained by adding the delay of the satellite to the gateway and the delay of the gateway to the gNB.

[0195] As shown in the implementation mode of the regenerative mode in FIG. 3c, the satellite and the gateway (i.e., NTN Gateway in FIG. 3c) can communicate with the terminal device as a gNB. In other words, in the regenerative mode, the satellite has the function of a base station or part of the function of a base station, and at this time, the satellite can be regarded as a base station.

[0196] For example, in the implementation mode of the regenerative mode shown in FIG. 3d, the satellite (including GEO satellite, MEO satellite, LEO satellite, etc.) works in the regenerative mode, and compared with the implementation mode shown in FIG. 3b, the satellite has the function of a base station or part of the function of a base station, and at this time, the satellite can be regarded as a base station (i.e., an air base station).

[0197] Optionally, in FIG. 3b and / or FIG. 3d, the satellite can be implemented in other ways, such as a drone or a high-altitude platform in the figure.

[0198] It should be noted that the base stations of the NTN and the ground network can be interconnected through a common core network. Higher timeliness assistance and interconnection can also be achieved through interfaces defined between base stations. In NR, the interface between base stations is called Xn interface, and the interface between the base station and the core network is called NG interface. In the fusion network, the NTN node and the ground node can realize interworking and cooperation through the foregoing interfaces.

[0199] In addition, the satellite as a network device can send ephemeris information, so that the receiver of the ephemeris information (such as a terminal device or a base station thereof or other satellites, etc.) can determine the relevant information of the running track of the satellite based on the ephemeris information.

[0200] It should be noted that the present application can be applied to a long term evolution (LTE) system, a new radio (NR) system, or a future communication network / system.

[0201] Taking 5G as an example, a 5G satellite communication system architecture is shown in FIG. 3e. The ground terminal device accesses the network through the 5G new air interface, and the 5G base station is deployed on the satellite and connected to the ground core network through a wireless link. At the same time, there is a wireless link between the satellites to complete the signaling interaction and user data transmission between base stations. The devices and interfaces in FIG. 3e are described as follows:

[0202] 5G core network: user access control, mobility management, session management, user security authentication, billing and other services. It is composed of multiple functional units and can be divided into control plane and data plane functional entities. The access and mobility management unit (AMF) is responsible for user access management, security authentication, and mobility management. The user plane unit (UPF) is responsible for managing user plane data transmission, traffic statistics, and other functions. The session management function (SMF) is mainly used for session management in mobile networks, such as session establishment, modification, and release.

[0203] Ground station: responsible for forwarding signaling and service data between satellite base station and 5G core network.

[0204] 5G new radio: wireless link between terminal and base station.

[0205] Xn interface: interface between 5G base stations, mainly used for signaling interaction such as handover.

[0206] NG interface: interface between 5G base station and 5G core network, mainly interacting with core network non-access layer (NAS) signaling, etc., and user service data.

[0207] In addition, the network devices in the ground network communication system and the satellites in the NTN communication system can be unified as network devices. The device for implementing the function of the network device can be a network device; it can also be a device capable of supporting the network device to implement the function, such as a chip system, which can be installed in the network device. When describing the technical solutions provided in the embodiments of the present application, the device for implementing the function of the network device is taken as an example, and the technical solutions provided in the embodiments of the present application are described. It can be understood that when the method provided in the embodiments of the present application is applied to the ground network communication system, the actions performed by the satellite can be applied to the base station or the network device to perform.

[0208] In the embodiments of the present application, the device for implementing the function of the terminal device can be a terminal device; it can also be a device capable of supporting the terminal device to implement the function, such as a chip system, which can be installed in the terminal device. 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. In the technical solutions provided in the embodiments of the present application, the device for implementing the function of the terminal device is taken as an example, and the technical solutions provided in the embodiments of the present application are described.

[0209] In addition, the satellite described above can be a stationary satellite, a non-stationary satellite, an artificial satellite, a low-orbit satellite, a medium-orbit satellite, and a high-orbit satellite, etc., which are not specifically limited herein.

[0210] The above describes various scenarios of wireless communication involved in the present application. It should be understood that the above is only an exemplary description of the scenarios in which the present application can be applied, and the present application can also be applied to other application scenarios, which are not limited herein. The wireless communication process involved in the present application will be described below.

[0211] In a communication system (such as the communication system shown in FIG. 1 / FIG. 3a / FIG. 3b / FIG. 3c / FIG. 3d / FIG. 3e), different communication devices can obtain communication services through signal transmission. However, how to improve the signal transmission performance is a technical problem to be solved.

[0212] In a possible implementation, the signal transmission performance can be improved by using a sequence. The communication sequence is widely used in standard protocols (such as LTE / NR, etc.), and the correlation of the sequence can be used to realize downlink synchronization signals and uplink random access, and the orthogonality of the sequence can be used to realize pilot multiplexing. Common sequence evaluation indexes include autocorrelation, cross-correlation, sequence capacity, frequency offset resistance, peak-to-average power ratio, and two-domain constant modulus.

[0213] In the following, an orthogonal cover code (OCC) will be taken as an example to be described exemplarily in combination with some implementation examples. It should be understood that the sequence used in the following scheme can be a Walsh-Hadamard sequence, a DFT sequence, or a Zadoff-Chu sequence.

[0214] As an implementation example, through a scheme of inter-slot OCC, uplink coverage enhancement can be realized. In which, the inter-slot of PUSCH corresponds to OCC spreading. Specifically, the modulation symbol corresponding to each slot y(n) is spread through an orthogonal sequence w i (m) spread output signal z(n).

[0215] In which, represents the number of resource blocks (RB) allocated by PUSCH, represents the number of subcarriers per RB, represents the number of DFT-s-OFDM symbols contained by PUSCH per slot, represents the length of the orthogonal cover code.

[0216] As shown in FIG. 4a, the signal processing of the signal sending end includes the following processes:

[0217] The data obtained after the Block code processing and the Scramble processing is denoted as d(0), d(1), …, which can be input to the Modulation processing.

[0218] The data obtained after the Modulation processing is denoted as x(0), x(1), …, which can be input to the DFT processing.

[0219] The data obtained after the DFT processing is denoted as y(0), y(1), …, which can be input to the Block Spread processing (for example, y(n) above).

[0220] In the Block Spread processing shown in FIG. 4a, two orthogonal OCC sequences can be used to process the data in two slots, respectively. For example, w0 can be used to process the data in the first slot, including the data in the 12 symbols (the symbols occupied by the DMRS can be skipped) with the symbol index of 0 to 11 in the first slot; w1 can be used to process the data in the second slot, including the data in the 12 symbols (the symbols occupied by the DMRS can be skipped) with the symbol index of 0 to 11 in the second slot.

[0221] The data obtained after the Block Spread processing is denoted as z(0), z(1), …, which can be input to the IFFT processing. It should be understood that the data after the IFFT processing can be subjected to other radio frequency processing to obtain the communication signal transmitted on the air interface (or wireless channel), which can be referred to FIG. 2b and the related description above.

[0222] It should be noted that the symbols in FIGS. 4a-4c can be orthogonal frequency division multiplexing (OFDM) symbols, discrete Fourier transform-spread-orthogonal frequency division multiplexing (DFT-s-OFDM) symbols, single carrier-quadrature amplitude modulation (SC-QAM) symbols, or other symbols, which are not limited herein.

[0223] As another implementation example, uplink coverage enhancement can be implemented by a scheme of inter-symbol orthogonal cover code (Inter-symbol OCC). In this scheme, the PUSCH is spread by OCC across the symbols within a slot. Specifically, after transform precoding, y(n), each symbol is spread by an orthogonal sequence w i (m) spread output signal z(n).

[0224] wherein, denotes the number of RBs allocated for PUSCH, denotes the number of subcarriers per RB, and K denotes the number of DFT-s-OFDM symbols contained in each slot, denotes the length of OCC.

[0225] For example, as shown in FIG. 4b, an Inter-symbol OCC with length 2 is illustrated. As shown in FIG. 4b, the signal processing at the signal transmitting end includes the following processes:

[0226] The data obtained by scrambling the block code can be used as the input of the modulation process;

[0227] The data obtained by the modulation process can be used as the input of the DFT process;

[0228] The data obtained by the DFT process (for example, y(n) above) can be used as the input of the block spread process;

[0229] In the block spread process shown in FIG. 4b, two orthogonal OCC sequences can be used to process the data on different symbols within the same slot.

[0230] For example, for a slot, w0 can be used to process the data on the first six symbols (with symbol indices of 0 / 1 / 2 / 3 / 4 / 5) within the first slot (the symbols occupied by the demodulation reference signal (DMRS) can be skipped); and w1 can be used to process the data on the second six symbols (with symbol indices of 0 / 1 / 2 / 3 / 4 / 5) within the first slot (the symbols occupied by the DMRS can be skipped).

[0231] The data (e.g. z(n) above) obtained after the block spreading process can be input to the IFFT process. It should be understood that the data after the IFFT process can be further processed to obtain a communication signal transmitted over the air (or wireless channel), which can be referred to Fig. 2b and related description above.

[0232] As another implementation example, uplink coverage enhancement can be implemented by a scheme of intra-symbol orthogonal cover code (Intra-symbol OCC). In this scheme, the PUSCH is spread by OCC within the corresponding time slot. Specifically, each symbol d(n) is spread by an orthogonal sequence w i (m) the spread output signal x(n).

[0233] wherein, represents the number of subcarriers allocated for PUSCH, represents the number of RBs allocated for PUSCH, represents the number of subcarriers per RB, represents the length of OCC, M symb represents the number of modulation symbols.

[0234] As an example, Fig. 4c shows a diagram of Intra-symbol OCC with length 2. As shown in Fig. 4c, the signal processing at the signal transmitting end includes the following processes:

[0235] The data obtained after the scrambling process of the block code can be input to the modulation process.

[0236] The data obtained after the modulation process is denoted as d(0), d(1), …, which can be input to the block spreading process.

[0237] The data obtained after the block spreading process is denoted as x(0), x(1), …, which can be input to the DFT process.

[0238] In the block spreading process shown in Fig. 4c, two orthogonal OCC sequences can be used to process the data on different frequency domain resources within the same symbol.

[0239] For example, for a symbol, w0 can be used to process data on the frequency domain units with indexes of 0 / 1 / 2 / 3 / 4 / 5 on the higher frequency domain position of the symbol; w1 can be used to process data on the frequency domain units with indexes of 0 / 1 / 2 / 3 / 4 / 5 on the lower frequency domain position of the symbol.

[0240] The data obtained through the DFT processing can be used as the input of the IFFT processing. It should be understood that the data after the IFFT processing can be subjected to other radio frequency processing to obtain a communication signal transmitted on the air interface (or wireless channel), which can be referred to the foregoing FIG. 2b and related description.

[0241] In the schemes shown in FIGS. 4a-4c, different signals obtained based on the different OCC sequences (for example, different Walsh-Hadamard sequences, different DFT sequences, or different Zadoff-Chu sequences) can remain orthogonal, and have better signal transmission performance.

[0242] The following will take the implementation process of using OCC sequences on a physical uplink control channel (PUCCH) as an example, and describe some examples.

[0243] For example, PUCCH format 4 can use an intra-symbol OCC scheme based on a DFT sequence. The 3GPP 38.311 protocol PUCCH-Config defines the following parameters:

[0244] The number of slots, for example, 2, 4, 8 (denoted as nrofSlots ENUMERATED{n2, n4, n8});

[0245] The OCC length, for example, 2, 4 (denoted as occ-Length ENUMERATED{n2, n4});

[0246] The OCC index, for example, 0, 1, 2, 3 (denoted as occ-Index ENUMERATED{n0, n1, n2, n3}).

[0247] As shown in FIG. 4c, for example, the PUCCH format 4 can occupy 1 RB of frequency domain resources (i.e., 12 subcarriers, including 6 subcarriers with higher frequency domain element indexes of "0 / 1 / 2 / 3 / 4 / 5" in FIG. 4c, and 6 subcarriers with lower frequency domain element indexes of "0 / 1 / 2 / 3 / 4 / 5"). And the terminal device can use an OCC sequence on the 1 RB of frequency domain resources based on the indication information of the network device. For example, the indication information can determine the OCC sequence specified by the network device for the terminal device in combination with Table 2 (see 3GPP 38.211 Table 6.3.2.6.3-1) and Table 3 (see 3GPP 38.211 Table 6.3.2.6.3-2) below.

[0248] Table 2

[0249] Table 3

[0250] Specifically, the indication information sent by the network device to the terminal device includes indication A and indication B, the indication A is used to determine that the OCC sequence length is 2 or 4 (or the indication A is used to indicate that the specified OCC sequence is determined by Table 2 or Table 3), and the indication B is used to determine the index of the OCC sequence (or the indication B is used to indicate that the specified OCC sequence is at the index of Table 2 or at the index of Table 3).

[0251] As an example, for the transmission of PUCCH format 4, the OCC sequence specified by the network device for terminal device A is [+1+1], and the OCC sequence specified by the network device for terminal device B is [+1-1].

[0252] Wherein, the indication A contained in the indication information received by the terminal device A is used to indicate that the OCC length is 2 (or the indication A is used to indicate Table 2), and the indication B contained in the indication information received by the terminal device A is used to indicate the index "0".

[0253] Similarly, the indication A contained in the indication information received by the terminal device B is used to indicate that the OCC length is 2 (or the indication A is used to indicate Table 2), and the indication B contained in the indication information received by the terminal device B is used to indicate the index "1".

[0254] For example, the terminal device A sends 6 modulation symbols a(0), a(1), a(2), a(3), a(4), a(5), and the spread spectrum symbols before discrete Fourier transform spreading are a(0), a(1), a(2), a(3), a(4), a(5), a(0), a(1), a(2), a(3), a(4), a(5).

[0255] For another example, terminal device B sends 6 modulated symbols b(0), b(1), b(2), b(3), b(4), b(5), and the spread spectrum symbols before discrete Fourier transform spreading are b(0), b(1), b(2), b(3), b(4), b(5), -b(0), -b(1), -b(2), -b(3), -b(4), -b(5).

[0256] As another example, for the transmission of PUCCH format 4, the OCC sequence specified by the network device to terminal device A is [+1 +1 +1 +1], the OCC sequence specified by the network device to terminal device B is [+1 -j -1 +j], the OCC sequence specified by the network device to terminal device C is [+1 -1 +1 -1], and the OCC sequence specified by the network device to terminal device D is [+1 +j -1 -j].

[0257] Wherein, the indication A contained in the indication information received by terminal device A is used to indicate that the OCC length is 4 (or the indication A is used to indicate Table 3), and the indication B contained in the indication information received by terminal device A is used to indicate the index “0”.

[0258] Similarly, the indication A contained in the indication information received by terminal device B is used to indicate that the OCC length is 4 (or the indication A is used to indicate Table 3), and the indication B contained in the indication information received by terminal device B is used to indicate the index “1”.

[0259] Similarly, the indication A contained in the indication information received by terminal device C is used to indicate that the OCC length is 4 (or the indication A is used to indicate Table 3), and the indication B contained in the indication information received by terminal device C is used to indicate the index “2”.

[0260] Similarly, the indication A contained in the indication information received by terminal device D is used to indicate that the OCC length is 4 (or the indication A is used to indicate Table 3), and the indication B contained in the indication information received by terminal device D is used to indicate the index “3”.

[0261] For example, terminal device A sends 3 modulated symbols a(0), a(1), a(2), and the spread spectrum symbols before discrete Fourier transform spreading are a(0), a(1), a(2), a(0), a(1), a(2), a(0), a(1), a(2), a(0), a(1), a(2).

[0262] For another example, terminal device B sends 3 modulated symbols b(0), b(1), b(2), and the spread spectrum symbols before discrete Fourier transform spreading are b(0), b(1), b(2), -jb(0), -jb(1), -jb(2), -b(0), -b(1), -b(2), jb(0), jb(1), jb(2).

[0263] For example, terminal device C transmits 3 modulation symbols c(0), c(1), c(2), and the spread spectrum symbols before discrete Fourier transform spreading are c(0), c(1), c(2), -c(0), -c(1), -c(2), c(0), c(1), c(2), -c(0), -c(1), -c(2).

[0264] For example, terminal device D transmits 3 modulation symbols d(0), d(1), d(2), and the spread spectrum symbols before discrete Fourier transform spreading are d(0), d(1), d(2), jd(0), jd(1), jd(2), -d(0), -d(1), -d(2), -jd(0), -jd(1), -jd(2).

[0265] It can be seen that, in the transmission of PUCCH format 4, the results generated by different spreading factors and orthogonal cover code indexes are different for the two types of sequences with a sequence length of 2 and a sequence length of 4. Therefore, in the transmission process of PUCCH format 4, the network device needs to indicate the OCC sequence length and the OCC sequence index, so that the terminal device can determine a unique processing result based on the OCC sequence length and the OCC sequence index.

[0266] In a communication system, different communication devices can not only transmit signaling and / or data on a control channel (such as PUCCH), but also transmit data through a data channel (such as PUSCH). How to improve the data transmission performance on the data channel is a technical problem to be solved.

[0267] As an implementation example, taking the data channel as PUSCH for example, if the PUSCH follows the transmission mode of the above-mentioned PUCCH format 4, the use gain of the OCC sequence can be obtained to realize uplink coverage enhancement. However, in the PUSCH transmission, different OCC sequence lengths and OCC indexes for processing the same data can correspond to the same result, and if the above-mentioned transmission mode of PUCCH format 4 is followed, unnecessary signaling overhead will be caused.

[0268] For example, in the scenario of carrying repeated transmission data on the PUSCH, if the number of repetitions is large (for example, greater than 4), then using different OCC sequence lengths and OCC indexes can generate the same processing result.

[0269] For example, assuming that a terminal device needs to repeatedly send data a(0), if the network device indicates that the number of repetitions is 8, then the terminal device actually sends data a(0), -a(0), a(0), -a(0), a(0), -a(0), a(0), -a(0), a total of 8 data a(0). That is, the spreading sequence used by the terminal device in different repeated transmissions is [+1 -1 +1 -1 +1 -1 +1 -1].

[0270] Taking the manner shown in Table 2 as an example, the network device can indicate that the OCC sequence length is 2 and indicate that the OCC sequence index is 1, so that the terminal device E can generate a(0), -a(0) based on a(0) and the number of repetitions (8 times) every 2 (OCC length is 2) repeated transmissions, a total of 4 (8 / 2=4) identical data, so that the terminal device E actually sends data a(0), -a(0), a(0), -a(0), a(0), -a(0), a(0), -a(0), and the corresponding spreading sequence is [+1 -1 +1 -1 +1 -1 +1 -1].

[0271] Taking the manner shown in Table 3 as an example, the network device can indicate that the OCC sequence length is 4 and indicate that the OCC sequence index is 2, so that the terminal device F can generate a(0), -a(0), a(0), -a(0) based on a(0) and the number of repetitions (8 times) every 4 (OCC length is 4) repeated transmissions, a total of 2 (8 / 2=4) identical data, so that the terminal device F actually sends data a(0), -a(0), a(0), -a(0), a(0), -a(0), a(0), -a(0), and the corresponding spreading sequence is [+1 -1 +1 -1 +1 -1 +1 -1].

[0272] As can be seen from the above two examples, in the case of using the transmission manner of the above PUCCH format 4 in PUSCH, different OCC sequence lengths and OCC indexes for processing data can correspond to the same corresponding spreading sequence, so that the network device has a large indication overhead for simultaneously indicating the OCC sequence length and the OCC index, which leads to the fact that the transmission manner of the above PUCCH format 4 can no longer be applicable to the PUSCH transmission scenario.

[0273] In order to solve the above problem, the present application provides a communication method and related devices, which will be described in detail below in combination with the drawings.

[0274] Please refer to FIG. 5, which is an implementation schematic diagram of a communication method provided by the present application, and the method comprises the following steps.

[0275] It should be understood that, in the following, the method is exemplified by taking the first communication device and the second communication device as the execution subject of the interaction in FIG. 5, but the application is not limited to the execution subject of the interaction. For example, the communication device can be a communication apparatus, or a chip, a baseband chip, a modem chip, a system on chip (SoC) chip containing a modem core, a system in package (SIP) chip, a communication module, a chip system, a processor, a logic module or software in the communication apparatus, etc. Optionally, the communication apparatus can be a terminal device or a network device (for example, the network device can be an access network device, an access network element, etc.).

[0276] S501. The first communication device determines a first resource of a data channel. The first resource is used to carry K times of repeated transmission data, where K is a positive integer.

[0277] As an example, the first resource used to carry K times of repeated transmission data can be understood as that the first resource contains K time domain resources, and different time domain resources are used to carry data of different repeated transmissions in K times of repeated transmission, that is, data of different repeated transmissions is carried in different time domain resources. Each of the K time domain resources can include one or more time units, which can be a symbol, a time slot, a subframe, a frame, or other time units defined in a future network.

[0278] As another example, the first resource used to carry K times of repeated transmission data can be understood as that the first resource contains K frequency domain resources, and different frequency domain resources are used to carry data of different repeated transmissions in K times of repeated transmission, that is, data of different repeated transmissions is carried in different frequency domain resources. Each of the K frequency domain resources can include one or more frequency domain units, which can be a subcarrier, a resource block (RB), a physical resource block (PRB), or other frequency domain units defined in a future network.

[0279] As another example, the first resource used to carry K times of repeated transmission data can be understood as that the first resource contains K time-frequency domain resources, and different time-frequency domain resources are used to carry data of different repeated transmissions in K times of repeated transmission, that is, data of different repeated transmissions is carried in different time-frequency domain resources. Each of the K time-frequency domain resources can include one or more time-frequency units, which can be a resource element (RE) or other time-frequency units defined in a future network.

[0280] S502. The first communication device transmits the K times repeated transmission data, and correspondingly, the second communication device receives part or all of the repeated transmission data in the K times repeated transmission. The K times repeated transmission data is processed based on a first orthogonal sequence in M orthogonal sequences, any sequence of the M orthogonal sequences contains N elements, M is a positive integer, and N is an integer greater than 1.

[0281] It should be noted that, since transmission errors or transmission failures may occur in signal transmission, after the first communication device transmits the K times repeated transmission data, the second communication device can receive part or all of the repeated transmission data in the K times repeated transmission.

[0282] It should be noted that, in step S502, the first communication device can transmit the K times repeated transmission data in multiple ways.

[0283] Option 1: The first communication device can transmit the K times repeated transmission data in a wired transmission manner.

[0284] For example, in option 1, the first communication device and the second communication device can both be network devices. For example, the first communication device can be used for processing of baseband signals, and the second communication device can be used for processing of radio frequency signals, i.e., the first communication device can be the DU / O-DU described above, and the second communication device can be the RU / O-RU described above. Correspondingly, the first communication device and the second communication device can communicate with each other through a CPRI interface, an eCPRI interface, or other interfaces defined in future networks, to realize transmission of the K times repeated transmission data.

[0285] Optionally, in option 1, after the second communication device receives the K times repeated transmission data, the second communication device can perform other signal processing processes (such as one or more of the RE mapping, digital BF, or IFFT / add CP described above) on the K times repeated transmission data to obtain a second signal, and transmit the K times repeated transmission data to a terminal device through a wireless link (or air interface).

[0286] It can be understood that, in option 1, the data channel can be a downlink channel between the network device and the terminal device, for example, the data channel can be a physical downlink shared channel (PDSCH), or other data channels defined in future networks, which are not limited here.

[0287] Option 2: The first communication device can transmit the K times repeated transmission data in a wireless transmission manner.

[0288] As an implementation example of the second approach, the transmission resource of the first signal can be pre-configured.

[0289] As another implementation example of the second approach, the transmission resource of the first signal can be configured. For example, in the method shown in FIG. 5, before step S501, either party of the data transceiving parties can send fourth information (to be described in detail later) indicating the first resource, so that the data transceiving parties can implement data transceiving at the specified first resource, to improve the success rate of data transceiving.

[0290] For example, in the case where the first communication device is a terminal device and the second communication device is a network device, the data channel can be an uplink channel between the terminal device and the network device, for example, the data channel can be a PUSCH, or other data channel defined by future network, which is not limited here.

[0291] For another example, in the case where the first communication device is a terminal device and the second communication device is another terminal device, the data channel can be a sidelink channel between different terminal devices, for example, the data channel can be a physical sidelink shared channel (PSSCH), or other data channel defined by future network, which is not limited here.

[0292] Optionally, the K times repeated data can be obtained by processing the data based on the first orthogonal sequence, which can be spread spectrum processing, or code division multiplexing processing, etc. For example, the data can be uplink data, downlink data, or sidelink data, etc. For example, the data can be data after discrete Fourier transformation (DFT) processing and before inverse fast Fourier transformation (IFFT) processing, so that the above scheme can be applied to the scenario of inter-slot orthogonal cover code (OCC) (for example, the scenario shown in FIG. 4a), or the scenario of inter-symbol OCC (for example, the scenario shown in FIG. 4b).

[0293] It should be understood that the M orthogonal sequences can be mutually orthogonal, which can be understood as that the inner product of any two sequences in the M orthogonal sequences is 0 or does not exceed a threshold, or, in the case that the frequency offset of signal transmission is small or does not exist, the inner product of two signals obtained based on any two sequences in the M orthogonal sequences is 0; or, in the case that the frequency offset of signal transmission is large (for example, in a non-terrestrial network (NTN) scenario), the inner product of two signals obtained based on any two sequences in the M orthogonal sequences is less than or equal to a threshold.

[0294] Optionally, the inner product of any two sequences can be understood as the dot product or scalar product of the two sequences, for example, the inner product can be a scalar value obtained by multiplying the elements at corresponding positions in one sequence and the elements in another sequence and then summing. Generally, if two sequences are orthogonal, the inner product of the two sequences is 0; if the two sequences are the same, the inner product is the square of the modulus of the sequence.

[0295] It should be understood that any sequence of the M orthogonal sequences contains N elements, which can be understood as that the sequence length of any sequence of the M orthogonal sequences is N.

[0296] Optionally, the sequence involved in the present application can be replaced by other terms, such as vector, code, orthogonal code, orthogonal information, orthogonal matrix, orthogonal sequence, orthogonal spread spectrum code, orthogonal spread spectrum sequence or orthogonal cover code, etc.

[0297] Based on the scheme shown in FIG. 5, the first communication device can transmit K times of repeated transmission data on the first resource, wherein the K times of repeated transmission data is processed based on a first orthogonal sequence in the M orthogonal sequences. In other words, the data carried on the data channel can be obtained by processing the orthogonal sequence. In this way, the data transmitted by different communication devices on the data channel using different orthogonal sequences can be mutually orthogonal, i.e., the data receiver can distinguish the data transmitted by different communication devices based on the orthogonal sequence, so that different communication devices can multiplex the same resource on the data channel for data transmission, which can improve the resource utilization and improve the transmission performance of the data channel.

[0298] In addition, in the above scheme, the K times of repeated transmission data carried on the data channel can be obtained by processing the orthogonal sequence, i.e., the data of different repeated transmissions can be processed based on the elements with the same (or different) values contained in the orthogonal sequence, so that the data receiver can obtain at least two copies of the same (or different) repeated transmission data, which can help the receiver to detect and correct transmission errors to improve the reception performance.

[0299] In a possible implementation, there can be different mathematical relationships between the number of repeated transmissions K and the sequence length N, and correspondingly, the first communication device can have different processing manners when processing the data of K repeated transmissions, which will be described below in combination with some implementation examples.

[0300] Implementation example A: the number of repeated transmissions K is less than the sequence length N.

[0301] In the implementation example A, when the number of repeated transmissions K is less than the sequence length N, the data of K repeated transmissions can be processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements. In this way, when the other communication device transmits data using other orthogonal sequences of the M orthogonal sequences, the data transmitted by the first communication device can still maintain mutual orthogonality with the data transmitted by the other communication device, so as to improve the data transmission performance.

[0302] Implementation example B: the number of repeated transmissions K is greater than or equal to the sequence length N.

[0303] In the implementation example B, when the number of repeated transmissions K is greater than or equal to the sequence length N, the K repeated transmissions correspond to time units contained in the first resource. , which indicates that the first resource contains elements of the first orthogonal sequence. elements of the first orthogonal sequence. In other words, when the number of repeated transmissions K is greater than or equal to the sequence length N, different repeated transmissions can be carried by different time units, and the data of N repeated transmissions carried by each time unit of the first time units are processed by the N elements of the first orthogonal sequence, so that the data transmitted by different communication devices using different orthogonal sequences in the first time units can all maintain orthogonality, so as to improve the data transmission performance.

[0304] Optionally, the K repeated transmissions correspond to time units contained in the first resource, which can be understood as that the K repeated transmissions are carried by the first resource containing time units, and each time unit of the first time units contains N time units for carrying the data of N repeated transmissions of the K repeated transmissions.

[0305] For example, the first to Nth repetitions in K repetitions are carried on this The first time unit of the time segment, the (N+1)th repeated transmission to the 2Nth repeated transmission of the K repeated transmissions are carried in this... The second time unit of a time period... and so on, the Kth time period of repeated transmissions... The transmission is repeated to the [number]th [number]. The repeated transmission is carried by this The first unit of time A time unit.

[0306] For example, taking a repetition count of K=30 and a sequence length of N=4 as an example, 30 repetitions correspond to The first to fourth repeated transmissions in 30 repeated transmissions are carried in the first time unit of the 8 time units, the fifth to eighth repeated transmissions in 30 repeated transmissions are carried in the second time unit of the 8 time units, and so on. The 25th to 28th repeated transmissions in 30 repeated transmissions are carried in the seventh time unit of the 8 time units.

[0307] Optionally, in implementation example B, in this In a time unit, the last time unit contains P time units; if P equals N, the data carried by this last time unit is obtained by processing the N elements contained in the first orthogonal sequence; or, if P is less than N, the data carried by this last time unit is obtained by processing either the first P elements or the last P elements of the N elements contained in the first orthogonal sequence. In other words, in this... The repeatedly transmitted data carried in the last time period of a time period can be obtained by processing some or all of the N elements contained in the first orthogonal sequence. In this way, when other communication devices use other orthogonal sequences from the M orthogonal sequences to send data, the data sent by the first communication device can still remain orthogonal to the data sent by those other communication devices, thereby improving data transmission performance.

[0308] In one possible implementation, the data transmitted K times repeatedly can be obtained by processing the first orthogonal sequence among M orthogonal sequences, wherein the M orthogonal sequences include Q orthogonal sequences, and any sequence of the Q orthogonal sequences contains the same first N / 2 elements and last N / 2 elements, and Q is less than or equal to M.

[0309] Generally, in the implementation of the first type of orthogonal sequences (denoted as the first type of sequences, for example, the first type of sequences can include the four sequences corresponding to Table 3 in the foregoing) and the second type of orthogonal sequences (denoted as the second type of sequences, for example, the second type of sequences can include the two sequences corresponding to Table 2 in the foregoing) with a sequence length of N / 2, in the case where the number of repeated transmissions is greater than or equal to N, there is a sequence in the first type of sequences that has the same processing result as a sequence in the second type of sequences for K times of repeated transmission of data, which requires indication of the sequence length (for example, indication by downlink control information (DCI) or sidelink control information (SCI), etc.), resulting in a large transmission overhead.

[0310] In the above scheme, any sequence of the Q orthogonal sequences contains the same first N / 2 elements and the same last N / 2 elements, and in the case where K is greater than or equal to N, the first communication device has the same processing result based on the first N / 2 elements of the any sequence, the same processing result based on the last N / 2 elements of the any sequence, and the same processing result based on the N elements of the any sequence for K times of repeated transmission of data. In this way, the first communication device can achieve the same implementation result as in the above implementation of the first type of sequences and the second type of sequences without obtaining the indication of the sequence length, thereby reducing the indication overhead of the sequence length and improving the communication efficiency.

[0311] For example, the first N / 2 elements of any sequence of the Q orthogonal sequences are the same as the last N / 2 elements, including: the i th element of any sequence of the Q orthogonal sequences is the same as the N / 2+i th element, i is 1 to N / 2; or the i th element of the first N / 2 elements is the same as the i th element of the last N / 2 elements, i is 1 to N / 2; or there is an element in the first N / 2 elements that is the same as any element in the last N / 2 elements.

[0312] In a possible implementation, the method shown in FIG. 5 further includes: the first communication device receives or transmits first information, the first information indicating the first orthogonal sequence (for example, the first information includes the sequence index of the first orthogonal sequence in the M orthogonal sequences); or the first orthogonal sequence is determined based on a first rule among the M orthogonal sequences. Thus, the first communication device can determine the first orthogonal sequence in any of the above manners, thereby improving the flexibility of the implementation of the scheme.

[0313] Optionally, in the implementation of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e., N / 2+N), that is, the data transceiver needs to configure / indicate one of the 3N / 2 sequences. In the above scheme, the M orthogonal sequences are at most N sequences (such as the previous examples A and B) or N+1 sequences (such as the previous example C), therefore, the first information can indicate that the first orthogonal sequence is one of the N sequences or one of the N+1 sequences, in this way, in the case of N greater than 2, the configuration / indication overhead of a certain orthogonal sequence can be reduced to improve communication efficiency.

[0314] Optionally, in the implementation of the first type of sequence and the second type of sequence, the total number of sequences is 3N / 2 (i.e., N / 2+N), that is, the data transceiver needs to configure / indicate one of the 3N / 2 sequences. In the above scheme, the M orthogonal sequences are at most N sequences (such as the previous examples A and B) or N+1 sequences (such as the previous example C), therefore, the first information can indicate that the first orthogonal sequence is one of the N sequences or one of the N+1 sequences, in this way, in the case of N greater than 2, the configuration / indication overhead of a certain orthogonal sequence can be reduced to improve communication efficiency.

[0315] For example, in the case of N=4, in the implementation of the first type of sequence, the data transceiver needs to configure / indicate the first type by 1 bit, and needs to indicate one of the 4 sequences included in the first type of sequence by 2 bits, a total of 3 bits corresponding to 6 values indicating the 4 sequences included in the first type. In the implementation of the second type of sequence, the data transceiver needs to configure / indicate the second type by 1 bit, and needs to indicate one of the 2 sequences included in the second type of sequence by 1 bit, a total of 2 bits corresponding to 4 values indicating the 2 sequences included in the second type.

[0316] In the above scheme, the first information can indicate that the first orthogonal sequence is one of the 4 (N=4) sequences or one of the 5 (N+1=5) sequences, 2 bits corresponding to 4 values indicating the 4 sequences or 3 bits corresponding to 5 values indicating the 5 sequences, the same or fewer number of bits can be used to indicate more sequences, which can reduce the number of different values or the number of bits, and reduce the overhead and complexity.

[0317] Optionally, the above first rule can be implemented in various ways.

[0318] As an example, the first rule indicates that the first orthogonal sequence is associated with a random number, for example, the sequence index of the first orthogonal sequence in the M orthogonal sequences can be determined based on the random number.

[0319] As another example, the first rule indicates that the first orthogonal sequence is associated with an identity of the first communication device (or an identity of a communication device corresponding to the first communication device), e.g., a sequence index of the first orthogonal sequence among the M orthogonal sequences can be determined based on the identity of the first communication device (or the identity of the communication device corresponding to the first communication device).

[0320] In a possible implementation, the method shown in FIG. 5 further includes that the first communication device receives or transmits second information, the second information being used to indicate the M orthogonal sequences. Thus, the first communication device can receive or transmit the second information, so that a receiver of the second information can determine the M orthogonal sequences based on the second information, so that the data transmitting and receiving parties can implement data transmitting and receiving based on the M orthogonal sequences.

[0321] In addition, in the implementation of the first type of sequence and the second type of sequence described above, the total number of sequences is 3N / 2 (i.e., N / 2+N), i.e., the data transmitting and receiving parties need to configure / indicate 3N / 2 sequences. In the above scheme, the second information indicates M orthogonal sequences, which are at most N sequences (as in the example A and example B described above) or N+1 sequences (as in the example C described above). In this way, in the case where N is greater than 2, the configuration / indication overhead of the orthogonal sequences can be reduced to improve the communication efficiency.

[0322] In a possible implementation, the method shown in FIG. 5 further includes that the first communication device receives or transmits third information, the third information being used to determine that data of each of the K repeated transmissions is carried in 1 slot or 1 / 2 slot. Thus, the first communication device can receive or transmit the third information, so that a receiver of the third information can determine time domain resources carrying data of each of the K repeated transmissions based on the third information, so that the data transmitting and receiving parties can implement data transmitting and receiving in the specified time domain resources to improve the success rate of data transmitting and receiving.

[0323] Optionally, the third information is used to indicate a resource type of the first resource; in a case where the resource type of the first resource is a first type, the third information is used to determine that the time unit is 1 slot; or, in a case where the resource type of the first resource is a second type, the third information is used to determine that the time unit is 1 / 2 slot.

[0324] Optionally, the first type is a physical uplink shared channel (PUSCH) repetition type A (PUSCH Type A), and the second type is a PUSCH repetition type B (PUSCH Type B).

[0325] In a possible implementation, the method shown in FIG. 5 further includes: the first communication device receiving or sending fourth information, the fourth information being used for indicating the first resource. Thus, the first communication device can receive or send the fourth information, so that the receiver of the fourth information can determine the first resource based on the fourth information, so that the data transmitting and receiving parties can implement data transmitting and receiving in the specified first resource, so as to improve the success rate of data transmitting and receiving.

[0326] Optionally, the fourth information includes first indication information and / or second indication information, the first indication information being used for indicating a number of repeated time slots corresponding to the first resource, and the second indication information being used for indicating a number of transport block cross time slots corresponding to the first resource.

[0327] For example, in a case where the first resource is a PUSCH resource, both the first indication information and the second indication information can be indicated by a time domain parameter of the PUSCH.

[0328] For example, the time domain parameter of the PUSCH can include a number of repetitions extension (numberOfRepetitionsExt) defined by a physical uplink shared channel-time domain resource allocation list (PUSCH-TimeDomainResourceAllocationList), and accordingly, the number of repeated time slots indicated by the first indication information can be {n1, n2, n3, n4, n7, n8, n12, n16, n20, n24, n28, n32, spare4, spare3, spare2, spare1}; and the number of transport block cross time slots indicated by the second indication information can be a number of slots TBoMS (numberOfSlotsTBoMS) of transport block processing over multi-slots PUSCH (TBoMS), and the indicated value can be {n1, n2, n4, n8, spare4, spare3, spare2, spare1}. For example, the number of repeated time slots indicated by the first indication information is n8, and the number of transport block cross time slots indicated by the second indication information is n2, and then the transport block needs to be repeated 4 times (8 / 2=4).

[0329] It should be noted that the M orthogonal sequences can be implemented in various ways, which will be described in combination with some examples.

[0330] Example A: the M orthogonal sequences include at least one of the following: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

[0331] In Example A, any sequence of the M orthogonal sequences is determined by one row of a DFT matrix.

[0332] Optionally, a certain sequence is determined based on one row of a certain matrix, including: the elements of the sequence are the same as one row of the elements of the matrix; and / or, the arrangement order of the elements of the sequence is the same as the arrangement order of one row of the elements of the matrix.

[0333] Optionally, the matrix involved in the present application can be replaced by other terms, such as sequence set, vector set, code set, orthogonal code set, orthogonal information set, orthogonal matrix set, orthogonal sequence set, orthogonal spreading code set, orthogonal spreading sequence set, or orthogonal cover code set, etc.

[0334] Generally, exchanging any two rows of a matrix does not change the OCC sequence set. For example, any matrix corresponds to a group of sequences (or a group of OCC sequence sets), and after exchanging any two rows of the matrix to obtain another matrix, the other matrix can correspond to another group of sequences (or a group of OCC sequence sets), wherein the group of sequences and the other group of sequences can be understood as the same group of OCC sequences. In other words, any matrix provided in the present application can be replaced by other matrices, which can be obtained by one or more transformations of the any matrix, and each transformation can exchange any two rows of the matrix.

[0335] For example, in Example A, after obtaining a target matrix by exchanging any two rows of a DFT matrix one or more times, any sequence of the M orthogonal sequences is determined by one row of the target matrix.

[0336] In Example A, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0337] As a possible implementation of Example A, taking the PUSCH repetition type A as an example for K times of repeated transmission. If the number of PUSCH repetition slots is 4, and each element of the spreading sequence corresponds to 1 slot, the following gives the correspondence between the OCC sequence, the OCC index and the spreading sequence when using the DFT matrix.

[0338] Based on the DFT matrix, if the OCC length (occ-Length) is configured as 2 (or n2), as shown in Table 2, there are the following two possible cases:

[0339] Case one, if the OCC index (occ-Index) is configured as n0, then the spreading sequence is +1, +1, +1, +1.

[0340] Case two, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1.

[0341] Based on the DFT matrix, if the OCC length (occ-Length) is configured as 4 (or n4), as shown in Table 3, there are the following four possible cases:

[0342] Case three, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1.

[0343] Case four, if the occ-Index is configured as n1, the spreading sequence is +1, +j, -1, -j.

[0344] Case five, if the occ-Index is configured as n2, the spreading sequence is +1, -1, +1, -1.

[0345] Case six, if the occ-Index is configured as n3, the spreading sequence is +1, -j, -1, +j.

[0346] It can be seen that the first row of DFT-2 (i.e. case one) and the first row of DFT-4 (i.e. case three) generate the same spreading sequence, and the second row of DFT-2 (i.e. case two) and the third row of DFT-4 (i.e. case five) generate the same spreading sequence. Although the OCC length and OCC index are different, they correspond to the same spreading sequence, and the signaling indication can be combined. Table 4 below shows the indication of the DFT spreading sequence by RRC signaling or DCI signaling, it should be noted that the number of PUSCH repetition slots can be extended to 8, 12, 16, 20, 24, 28, 32 or other values. For the case of 2 PUSCH repetition slots, the spreading sequence is determined by the first two elements of the first two rows of Table 4, i.e. RRC(n0) or DCI(00) corresponds to w n = [+1 -1]. n = [+1 -1].

[0347] Table 4

[0348] As another possible implementation of example A, taking the type of K times repetition transmission as PUSCH repetition type B as an example. If the number of PUSCH repetition slots is 4, the spreading sequence corresponds to 1 / 2 slots per element, the following gives the correspondence between the OCC sequence, the OCC index and the spreading sequence when using the DFT matrix.

[0349] Based on the DFT matrix, if the configured OCC length (occ-Length) is 2 (or n2) and the numberOfSlotsTBoMS is n1, as shown in Table 2 above, there are the following 2 possible cases:

[0350] Case Seven, if the configured occ-Index is n0, the spreading sequence is +1, +1, +1, +1, +1, +1, +1, +1.

[0351] Case Eight, if the configured occ-Index is n1, the spreading sequence is +1, -1, +1, -1, +1, -1, +1, -1.

[0352] Based on the DFT matrix, if the configured OCC length (occ-Length) is 4 (or n4) and the numberOfSlotsTBoMS is n2, as shown in Table 3 above, there are the following 4 possible cases:

[0353] Case Nine, if the configured occ-Index is n0, the spreading sequence is +1, +1, +1, +1, +1, +1, +1, +1.

[0354] Case Ten, if the configured occ-Index is n1, the spreading sequence is +1, +j, -1, -j, +1, +j, -1, -j.

[0355] Case Eleven, if the configured occ-Index is n2, the spreading sequence is +1, -1, +1, -1, +1, -1, +1, -1.

[0356] Case Twelve, if the configured occ-Index is n3, the spreading sequence is +1, -j, -1, +j, +1, -j, -1, +j.

[0357] It can be seen that the first row of DFT-2w / o TBoMS (i.e. Case Seven) and the first row of DFT-4TBoMS-2 (i.e. Case Nine) generate the same spreading sequence, and the second row of DFT-2w / o TBoMS (i.e. Case Eight) and the third row of DFT-4TBoMS-2 (i.e. Case Eleven) generate the same spreading sequence. Although the OCC length and OCC index are different, they correspond to the same spreading sequence, and the signaling indication can be combined. As shown in Table 4 above, Table 4 shows the indication of the DFT spreading sequence by RRC signaling or DCI signaling, and it should be noted that the number of PUSCH repetition slots can be extended to 2, 8, 12, 16, 20, 24, 28, 32 or other values. For the case of 1 PUSCH repetition slot and 2 OCC length, the spreading sequence is determined by the first two elements of the first two rows of Table 1, i.e. RRC(n0) or DCI(00) corresponds to w n= [+1+1], RRC(n1) or DCI(01) corresponds to w n = [+1 -1].

[0358] In example B, any sequence of the M orthogonal sequences is determined by one of the rows contained by a Walsh-Hadamard matrix.

[0359] In example B, any sequence of the M orthogonal sequences is determined by one of the rows contained by a target matrix after the target matrix is obtained by swapping any two rows of a Walsh-Hadamard matrix one or more times.

[0360] In example B, any sequence of the M orthogonal sequences is determined by one of the rows contained by a target matrix after the target matrix is obtained by swapping any two rows of a Walsh-Hadamard matrix one or more times.

[0361] In example B, Q orthogonal sequences of the M orthogonal sequences can include [+1+1+1+1] and / or [+1 -1+1 -1].

[0362] As a possible implementation of example B, taking PUSCH repetition type A as an example of K times of repeated transmission. If the number of PUSCH repetition slots is 4, and each element of the spreading sequence corresponds to 1 slot, the following gives the correspondence between the OCC sequence, the OCC index and the spreading sequence under the condition of using the Walsh-Hadamard matrix.

[0363] Based on the Walsh-Hadamard matrix, if the OCC length (occ-Length) is configured as 2 (or n2), there are the following 2 possible cases:

[0364] Case A, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1.

[0365] Case B, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1.

[0366] Based on the Walsh-Hadamard matrix, if the OCC length (occ-Length) is configured as 4 (or n4), there are the following 4 possible cases:

[0367] Case C, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1.

[0368] Case D, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1.

[0369] Case E, if the occ-Index is configured as n2, the spreading sequence is +1, +1, -1, -1.

[0370] Case F, if the occ-Index is configured as n3, the spreading sequence is +1, -1, -1, +1.

[0371] It can be seen that the first row of Walsh-2 (i.e. Case A) and the first row of Walsh-4 (i.e. Case C) generate the same spreading sequence, and the second row of Walsh-2 (i.e. Case B) and the second row of Walsh-4 (i.e. Case D) generate the same spreading sequence. Although the OCC length and OCC index are different, they correspond to the same spreading sequence, and the signaling indication can be combined. Table 5 shows the Walsh spreading sequence indicated by RRC signaling or DCI signaling. It should be noted that the PUSCH repetition slot number can be extended to 8, 12, 16, 20, 24, 28, 32 or other values. For the case of PUSCH repetition slot number 2, the spreading sequence is determined by the first two elements of the first two rows of Table 5, i.e. RRC(n0) or DCI(00) corresponds to w n = [ +1 +1 ], RRC(n1) or DCI(01) corresponds to w n = [ +1 -1 ].

[0372] Table 5

[0373] As another possible implementation of Example B, taking the type of K times repeated transmission as PUSCH repetition type B as an example. If the PUSCH repetition slot number is 4, the spreading sequence corresponds to 1 / 2 slot per element, the following gives the correspondence between the OCC sequence, the OCC index and the spreading sequence when using the Walsh-Hadamard matrix.

[0374] Based on the Walsh-Hadamard matrix, if the OCC length (occ-Length) is configured as 2 (or n2) and the numberOfSlotsTBoMS is n1, there are the following 2 possible cases:

[0375] Case G, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1, +1, +1, +1, +1.

[0376] Case H, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1, +1, -1, +1, -1.

[0377] Based on Walsh-Hadamard matrix, if OCC length (occ-Length) is 4 (or n4) and numberOfSlotsTBoMS is n2, there are following 4 possible cases:

[0378] Case I, if configured occ-Index is n0, the spreading sequence is +1, +1, +1, +1, +1, +1, +1, +1.

[0379] Case J, if configured occ-Index is n1, the spreading sequence is +1, -1, +1, -1, +1, -1, +1, -1.

[0380] Case K, if configured occ-Index is n2, the spreading sequence is +1, +1, -1, -1, +1, +1, -1, -1.

[0381] Case L, if configured occ-Index is n3, the spreading sequence is +1, -1, -1, +1, +1, -1, -1, +1.

[0382] It can be seen that the first row of Walsh-2w / o TBoMS (i.e. Case G) and the first row of Walsh-4 TBoMS-2 (i.e. Case I) generate the same spreading sequence, and the second row of Walsh-2w / o TBoMS (i.e. Case H) and the second row of Walsh-4 TBoMS-2 (i.e. Case J) generate the same spreading sequence. Although OCC length and OCC index are different, they correspond to the same spreading sequence, and signaling indication can be combined. Table 5 shows the indication of Walsh spreading sequence by RRC signaling or DCI signaling, it is noted that the number of PUSCH repetition slots can be extended to 2, 8, 12, 16, 20, 24, 28, 32 or other values. For the case of PUSCH repetition slot number 1 and OCC length 2, the spreading sequence is determined by the first two elements of the first two rows of Table 5, i.e. RRC(n0) or DCI(00) corresponds to w n = [+1 +1], RRC(n1) or DCI(01) corresponds to w n = [+1 -1].

[0383] Example C, the M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

[0384] In Example C, any sequence of the M orthogonal sequences is determined by one row of a first matrix. The first matrix is determined based on a DFT matrix, for example, the first matrix can be obtained by matrix permutation, matrix interleaving, matrix elementary transformation, etc. based on the DFT matrix. Optionally, the first matrix can be a permutation DFT matrix.

[0385] For example, the first matrix can be obtained by permuting the 2nd column and the 3rd column of the DFT matrix.

[0386] For example, in Example C, after obtaining a target matrix by exchanging any two rows of the permutation DFT matrix one or more times, any sequence of the M orthogonal sequences is determined by one row of the target matrix.

[0387] In Example C, the Q orthogonal sequences of the M orthogonal sequences can include [+1 +1 +1 +1] and / or [+1 -1 +1 -1].

[0388] As a possible implementation of Example C, taking the PUSCH repetition type A as an example for K times of repeated transmission. If the number of PUSCH repetition slots is 4, and each element of the spreading sequence corresponds to 1 slot, the following gives the correspondence between the OCC sequence, the OCC index and the spreading sequence when using the permutation DFT matrix.

[0389] Based on the permutation DFT matrix, if the OCC length (occ-Length) is configured as 2 (or n2), there are the following two possible cases:

[0390] Case ①, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1.

[0391] Case ②, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1.

[0392] Based on the permutation DFT matrix, if the OCC length (occ-Length) is configured as 4 (or n4), there are the following four possible cases:

[0393] Case ③, if the occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1.

[0394] Case ④, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +j, -j.

[0395] Case ⑤, if the occ-Index is configured as n2, the spreading sequence is +1, +1, -1, -1.

[0396] Case 6, if occ-Index is configured as n3, the spreading sequence is +1, -1, -j, +j.

[0397] It can be seen that the first row of the permutation DFT-2 (i.e. Case 1) and the first row of the permutation DFT-4 (i.e. Case 3) generate the same spreading sequence. Although the OCC length and OCC index are different, they correspond to the same spreading sequence, and the signaling indication can be combined. Table 6 shows the permutation DFT spreading sequence indicated by RRC signaling or DCI signaling. It should be noted that the number of PUSCH repetition slots can be extended to 8, 12, 16, 20, 24, 28, 32 or other values. For the case of 2 PUSCH repetition slots, the spreading sequence is determined by the first two elements of the first two rows of Table 6, i.e. RRC(n0) or DCI(00) corresponds to w n = [+1 -1], RRC(n1) or DCI(01) corresponds to w n = [+1 -1].

[0398] Table 6

[0399] As another possible implementation of Example C, taking the type of K-time repetition transmission as PUSCH repetition type B as an example. If the number of PUSCH repetition slots is 4, the spreading sequence corresponds to 1 slot per element, the following gives the correspondence between OCC sequence, OCC index and spreading sequence when using the permutation DFT matrix.

[0400] Based on the permutation DFT matrix, if the OCC length (occ-Length) is configured as 2 (or n2) and the numberOfSlotsTBoMS is n1, there are the following 2 possible cases:

[0401] Case 6, if occ-Index is configured as n3, the spreading sequence is +1, -1, -j, +j.

[0402] Case 7, if occ-Index is configured as n1, the spreading sequence is +1, -1, +1, -1, +1, -1, +1, -1.

[0403] Based on the permutation DFT matrix, if the OCC length (occ-Length) is configured as 4 (or n4) and the numberOfSlotsTBoMS is n2, there are the following 4 possible cases:

[0404] Case 8, if occ-Index is configured as n0, the spreading sequence is +1, +1, +1, +1, +1, +1, +1, +1.

[0405] Case 10, if the occ-Index is configured as n1, the spreading sequence is +1, -1, +j, -j, +1, -1, +j, -j.

[0406] Case , if the occ-Index is configured as n2, the spreading sequence is +1, +1, -1, -1, +1, +1, -1, -1.

[0407] Case , if the occ-Index is configured as n3, the spreading sequence is +1, -1, -j, +j, +1, -1, -j, +j.

[0408] It can be seen that the first row of the permutation DFT-2w / o TBoMS (i.e. case 10) and the spreading sequence generated by the first row of the permutation DFT-4TBoMS-2 (i.e. case 11) are the same. Although the OCC length and OCC index are different, both correspond to the same spreading sequence, and the signaling indication can be combined. Table 6 shows the permutation DFT spreading sequence indicated by RRC signaling or DCI signaling, it should be noted that the number of PUSCH repetition slots can be extended to 2, 8, 12, 16, 20, 24, 28, 32 or other values. For the case of 1 PUSCH repetition slot and 2 OCC length, the spreading sequence is determined by the first two elements of the first two rows of Table 6, that is, RRC(n0) or DCI(00) corresponds to w n =[+1 +1], RRC(n1) or DCI(01) corresponds to w n =[+1 -1].

[0409] Referring to FIG. 6, the communication apparatus 600 provided in an embodiment of the present application can realize the functions of the second communication apparatus or the first communication apparatus in the above-mentioned method embodiments, and thus can also realize the beneficial effects possessed by the above-mentioned method embodiments. In the embodiment of the present application, the communication apparatus 600 can be the first communication apparatus (or the second communication apparatus), or an integrated circuit or element etc. inside the first communication apparatus (or the second communication apparatus), such as a chip.

[0410] It should be noted that the transceiver unit 602 can include a sending unit and a receiving unit, which are respectively used for performing sending and receiving.

[0411] In a possible implementation, when the apparatus 600 is configured to perform the method performed by the first communication device in the foregoing embodiments, the processing unit 601 is configured to determine a first resource of a data channel, the first resource being used to carry K times of repeated transmission data, K being a positive integer; and the transceiver 602 is configured to send the K times of repeated transmission data, the K times of repeated transmission data being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, and N being an integer greater than 1.

[0412] In a possible implementation, when the apparatus 600 is configured to perform the method performed by the second communication device in the foregoing embodiments, the processing unit 601 is configured to determine a first resource of a data channel, the first resource being used to carry K times of repeated transmission data, K being a positive integer; and the transceiver 602 is configured to receive part or all of the K times of repeated transmission data, the K times of repeated transmission data being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, and N being an integer greater than 1.

[0413] It should be noted that the information execution process and the like of the units of the communication apparatus 600 are described in the foregoing method embodiments of the present application, which will not be described here again.

[0414] Please refer to FIG. 7, which is another schematic structural diagram of a communication apparatus 700 provided by the present application. The communication apparatus 700 includes a logic circuit 701 and an input-output interface 702. The communication apparatus 700 can be a chip or an integrated circuit.

[0415] The transceiver 602 shown in FIG. 6 can be a communication interface, which can be the input-output interface 702 in FIG. 7. The input-output interface 702 can include an input interface and an output interface. Alternatively, the communication interface can be a transceiver circuit, which can include an input interface circuit and an output interface circuit.

[0416] Optionally, the logic circuit 701 is configured to determine a first resource of a data channel, the first resource being used to carry K times of repeated transmission data, K being a positive integer; and the input-output interface 702 is configured to send part or all of the K times of repeated transmission data, the K times of repeated transmission data being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, and N being an integer greater than 1.

[0417] Optionally, the logic circuit 701 is configured to determine a first resource of the data channel, the first resource being used to carry data of K repeated transmissions, K being a positive integer; and the input and output interface 702 is configured to receive part or all of the data of the K repeated transmissions, the data of the K repeated transmissions being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer and N being an integer greater than 1.

[0418] The logic circuit 701 and the input and output interface 702 can also perform other steps performed by the first communication device or the second communication device in any of the embodiments and achieve the corresponding beneficial effects, which will not be described here.

[0419] In a possible implementation, the processing unit 601 shown in FIG. 6 can be the logic circuit 701 in FIG. 7.

[0420] Optionally, the logic circuit 701 can be a processing device, and the functions of the processing device can be partially or entirely implemented through software.

[0421] Optionally, the processing device can include a memory and a processor, where the memory is configured to store a computer program, and the processor is configured to read and execute the computer program stored in the memory to perform the corresponding processing and / or steps in any one of the method embodiments.

[0422] Optionally, the processing device can only include the processor. The memory for storing the computer program is located outside the processing device, and the processor is connected with the memory through a circuit / wire to read and execute the computer program stored in the memory. The memory and the processor can be integrated together or can be physically independent of each other.

[0423] Optionally, the processing device can be one or more chips, or one or more integrated circuits. For example, the processing device can be one or more field-programmable gate arrays (FPGA), application specific integrated circuits (ASIC), system on chips (SoC), central processor units (CPU), network processors (NP), digital signal processors (DSP), micro controller units (MCU), programmable logic devices (PLD), or other integrated circuits, or any combination of the above chips or processors, etc.

[0424] Referring to FIG. 8, a communication device 800 involved in the above embodiments provided by the embodiments of the present application is shown, which can be the communication device as the terminal device in the above embodiments, and the communication device in the example shown in FIG. 8 is implemented by the terminal device (or components in the terminal device).

[0425] Optionally, the communication device 800 can include but is not limited to at least one processor 801 and a communication port 802.

[0426] Optionally, the transceiver unit 602 shown in FIG. 6 can be a communication interface, which can be the communication port 802 in FIG. 8, and the communication port 802 can include an input interface and an output interface. Alternatively, the communication port 802 can also be a transceiver circuit, which can include an input interface circuit and an output interface circuit.

[0427] Further optionally, the device can further include at least one of a memory 803 and a bus 804, and in the embodiments of the present application, the at least one processor 801 is configured to control and process the actions of the communication device 800.

[0428] Further, the processor 801 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, transistor logic, hardware components, or any combination thereof. It can implement or execute various example logical blocks, modules, and circuits described in connection with the disclosure. The processor can also be a combination of computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, and the like. For the convenience and brevity of the description, the specific working processes of the above-described system, device, and unit can be referred to the corresponding processes in the foregoing method embodiments, which will not be described herein.

[0429] It should be noted that the communication device 800 shown in FIG. 8 can be specifically used to implement the steps implemented by the terminal device in the foregoing method embodiments, and achieve the corresponding technical effects of the terminal device. The specific implementation of the communication device shown in FIG. 8 can be referred to the description in the foregoing method embodiments, which will not be described herein.

[0430] Please refer to FIG. 9, which is a structural schematic diagram of a communication device 900 involved in the foregoing embodiments provided by the embodiments of the present application. The communication device 900 can be specifically the communication device as the network device in the foregoing embodiments. The communication device in the example shown in FIG. 9 is implemented by a network device (or a component in the network device). The structure of the communication device can be referred to the structure shown in FIG. 9.

[0431] The communication device 900 includes at least one processor 911 and at least one network interface 914. Further optionally, the communication device further includes at least one memory 912, at least one transceiver 913, and one or more antennas 915. The processor 911, the memory 912, the transceiver 913, and the network interface 914 are connected, for example, through a bus. In the embodiments of the present application, the connection can include various interfaces, transmission lines, or buses, etc., which are not limited in the embodiments of the present application. The antenna 915 is connected to the transceiver 913. The network interface 914 is used to enable the communication device to communicate with other communication devices through a communication link. For example, the network interface 914 can include a network interface between the communication device and a core network device, such as an S1 interface. The network interface can include a network interface between the communication device and other communication devices (such as other network devices or core network devices), such as an X2 or Xn interface.

[0432] The transceiver unit 602 shown in FIG. 6 can be a communication interface, which can be the network interface 914 in FIG. 9. The network interface 914 can include an input interface and an output interface. Alternatively, the network interface 914 can be a transceiver circuit, which can include an input interface circuit and an output interface circuit.

[0433] The processor 911 is mainly used for processing communication protocols and communication data, and controlling the whole communication device, executing software programs, processing data of the software programs, for example, for supporting the communication device to perform the actions described in the embodiments. The communication device can include a baseband processor mainly used for processing communication protocols and communication data, and a central processor mainly used for controlling the whole terminal device, executing software programs, and processing data of the software programs. The processor 911 in FIG. 9 can integrate the functions of the baseband processor and the central processor, and those skilled in the art can understand that the baseband processor and the central processor can also be independent processors interconnected by a bus or the like. Those skilled in the art can understand that the terminal device can include multiple baseband processors to adapt to different network modes, and the terminal device can include multiple central processors to enhance its processing capability, and various components of the terminal device can be connected by various buses. The baseband processor can also be referred to as a baseband processing circuit or a baseband processing chip. The central processor can also be referred to as a central processing circuit or a central processing chip. The function of processing communication protocols and communication data can be built into the processor, or stored in the memory in the form of a software program, and the processor executes the software program to realize the baseband processing function.

[0434] The memory is mainly used for storing software programs and data. The memory 912 can exist independently and be connected to the processor 911. Alternatively, the memory 912 can be integrated with the processor 911, for example, integrated in a chip. The memory 912 can store program codes for executing the technical solutions of the embodiments of the present application, and the processor 911 controls the execution. Various computer programs executed can also be regarded as a driver of the processor 911.

[0435] FIG. 9 only shows one memory and one processor. In actual terminal devices, there can be multiple processors and multiple memories. The memory can also be referred to as a storage medium or a storage device, etc. The memory can be a storage element on the same chip as the processor, that is, an on-chip storage element, or an independent storage element, and the embodiments of the present application do not limit this.

[0436] The transceiver 913 can be configured to support the receiving or transmitting of radio frequency signals between the communication device and a terminal. The transceiver 913 can be connected with the antenna 915. The transceiver 913 includes a transmitter Tx and a receiver Rx. Specifically, the one or more antennas 915 can receive radio frequency signals, the receiver Rx of the transceiver 913 is configured to receive the radio frequency signals from the antenna and convert the radio frequency signals into digital baseband signals or digital intermediate frequency signals, and provide the digital baseband signals or the digital intermediate frequency signals to the processor 911 for further processing, such as demodulation processing and decoding processing, by the processor 911. In addition, the transmitter Tx in the transceiver 913 is also configured to receive modulated digital baseband signals or digital intermediate frequency signals from the processor 911, and convert the modulated digital baseband signals or digital intermediate frequency signals into radio frequency signals, and transmit the radio frequency signals through the one or more antennas 915. Specifically, the receiver Rx can selectively perform one or more levels of down-mixing processing and analog-to-digital conversion processing on the radio frequency signals to obtain the digital baseband signals or the digital intermediate frequency signals, and the order of the down-mixing processing and the analog-to-digital conversion processing can be adjustable. The transmitter Tx can selectively perform one or more levels of up-mixing processing and digital-to-analog conversion processing on the modulated digital baseband signals or the digital intermediate frequency signals to obtain the radio frequency signals, and the order of the up-mixing processing and the digital-to-analog conversion processing can be adjustable. The digital baseband signals and the digital intermediate frequency signals can be collectively referred to as digital signals.

[0437] The transceiver 913 can also be referred to as a transceiving unit, a transceiver, a transceiving device, etc. Optionally, the devices in the transceiving unit for implementing the receiving function can be regarded as a receiving unit, and the devices in the transceiving unit for implementing the transmitting function can be regarded as a transmitting unit, i.e., the transceiving unit includes the receiving unit and the transmitting unit, the receiving unit can also be referred to as a receiver, an input port, a receiving circuit, etc., and the transmitting unit can be referred to as a transmitter, a transmitter, or a transmitting circuit, etc.

[0438] It should be noted that the communication device 900 shown in FIG. 9 can be specifically configured to implement the steps implemented by the network device in the foregoing method embodiments, and achieve the corresponding technical effects of the network device. The specific implementation mode of the communication device 900 shown in FIG. 9 can be referred to the description in the foregoing method embodiments, which will not be described here one by one.

[0439] Please refer to FIG. 10, which is a structural schematic diagram of a communication device involved in the above embodiments provided by the embodiments of the present application.

[0440] It can be understood that the communication apparatus 10 comprises, for example, modules, units, elements, circuits, or interfaces, and the like, which are properly configured together to perform the technical solutions provided in the present application. The communication apparatus 10 can be a terminal device or a network device as described above, or can be a component (for example, a chip) of the devices, to implement the methods described in the following method embodiments. The communication apparatus 10 comprises one or more processors 101. The processor 101 can be a general processor or a special-purpose processor, and the like. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control the communication apparatus (such as a RAN node, a terminal, or a chip, and the like), execute software programs, and process data of the software programs.

[0441] Optionally, in one design, the processor 101 can include a program 103 (which can also be referred to as code or instructions at times) that can be run on the processor 101, so that the communication apparatus 10 performs the methods described in the following embodiments. In yet another possible design, the communication apparatus 10 comprises a circuit (not shown in FIG. 10).

[0442] Optionally, the communication apparatus 10 can comprise one or more memories 102, which have a program 104 (which can also be referred to as code or instructions at times) stored thereon, and the program 104 can be run on the processor 101, so that the communication apparatus 10 performs the methods described in the above method embodiments.

[0443] Optionally, the processor 101 and / or the memory 102 can comprise an AI module 107, 108, which is used to implement AI-related functions. The AI module can be implemented in software, hardware, or a combination of software and hardware. For example, the AI module can comprise a radio intelligence control (RIC) module. For example, the AI module can be a near-real-time RIC or a non-real-time RIC.

[0444] Optionally, the processor 101 and / or the memory 102 can also store data. The processor and the memory can be separately arranged, or can be integrated together.

[0445] Optionally, the communication apparatus 10 can further comprise a transceiver 105 and / or an antenna 106. The processor 101 can also be referred to as a processing unit, which controls the communication apparatus (such as a RAN node or a terminal). The transceiver 105 can also be referred to as a transceiving unit, a transceiver, a transceiving circuit, or a transceiver, and the like, which is used to realize the transceiving function of the communication apparatus through the antenna 106.

[0446] The processing unit 601 shown in FIG. 6 can be the processor 101. The transceiving unit 602 shown in FIG. 6 can be a communication interface, which can be the transceiver 105 in FIG. 10. The transceiver 105 can include an input interface and an output interface. Alternatively, the transceiver 105 can be a transceiving circuit, which can include an input interface circuit and an output interface circuit.

[0447] The embodiments of the present application further provide a computer readable storage medium for storing one or more computer-executable instructions, which, when executed by a processor, cause the processor to perform the method described in the possible implementation manners of the first communication device or the second communication device.

[0448] The embodiments of the present application further provide a computer program product (or computer program), which, when executed by a processor, causes the processor to perform the method described in the possible implementation manners of the first communication device or the second communication device.

[0449] The embodiments of the present application further provide a chip system, which includes at least one processor for supporting the communication device to implement the functions involved in the possible implementation manners of the communication device. Optionally, the chip system further includes an interface circuit for providing program instructions and / or data for the at least one processor. In a possible design, the chip system can further include a memory for storing necessary program instructions and data of the communication device. The chip system can be composed of a chip, or can include a chip and other discrete components. The communication device can be the first communication device or the second communication device in the method embodiments.

[0450] The embodiments of the present application further provide a communication system, which includes the first communication device and the second communication device in any of the above embodiments.

[0451] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented by other means. For example, the device embodiments described above are merely illustrative, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or components shown or discussed can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0452] The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed on multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0453] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit. When the integrated unit is realized in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or say the part that contributes or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various storage program codes.

Claims

1. A communication method characterized by comprising: The method comprises: determining a first resource of a data channel, the first resource being used to carry K times of repeated transmission data, K being a positive integer; transmitting the K times of repeated transmission data, the K times of repeated transmission data being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, and N being an integer greater than 1.

2. The method of claim 1, wherein, In a case where K is less than N, the K times of repeated transmission data are processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

3. The method according to claim 1 or 2, characterized in that, In a case that K is greater than or equal to N, the K times of repeated transmissions correspond to a segment time unit, representing an operation of rounding up; In the foregoing Each time unit of each time unit segment contains N time units used to carry N times of repeated transmission data of the K times of repeated transmission data, the N times of repeated transmission data being processed by the first orthogonal sequence containing the N elements.

4. The method of claim 3, wherein, In the method In the segment time units, the last segment time unit contains P time units. P is equal to N, and the data carried by the last time unit segment is processed by the first orthogonal sequence containing the N elements; Or, P is less than N, and the data carried by the last time unit segment is processed by the first orthogonal sequence containing the first P elements or the last P elements of the N elements.

5. The method according to any one of claims 1 to 4, characterized in that, The M orthogonal sequences comprise Q orthogonal sequences, any sequence of the Q orthogonal sequences containing the first N / 2 elements and the last N / 2 elements being the same, Q being less than or equal to N.

6. The method of claim 5, wherein, Any sequence of the Q orthogonal sequences contains the first N / 2 elements and the last N / 2 elements which are the same, including: The i-th element and the N / 2+i-th element of any sequence of the Q orthogonal sequences are the same, i being 1 to N / 2.

7. The method according to any one of claims 1 to 6, characterized in that, The M orthogonal sequences comprise at least one of the following: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

8. The method according to any one of claims 1 to 6, characterized in that, The M orthogonal sequences comprise at least one of the following: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

9. The method according to any one of claims 1 to 6, characterized in that, The M orthogonal sequences comprise at least one of the following: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

10. The method according to any one of claims 1 to 9, wherein the method further comprises: receiving or transmitting first information, the first information indicating the first orthogonal sequence; or the first orthogonal sequence is determined based on a first rule among the M orthogonal sequences.

11. The method according to any one of claims 1 to 10, characterized in that, The method further comprises: receiving or transmitting second information, the second information being used to indicate the M orthogonal sequences.

12. The method according to any one of claims 1 to 11, characterized in that, The method further comprises: receiving or transmitting third information, the third information being used to determine that data of each of the K times of repeated transmission is carried in 1 time slot or 1 / 2 time slots.

13. The method of claim 12, wherein, The third information is used to indicate a resource type of the first resource; In a case where a resource type of the first resource is a first type, the third information is used to determine that the time unit is 1 slot; or, In a case where the resource type of the first resource is a second type, the third information is used to determine that the time unit is 1 / 2 slot.

14. The method according to any one of claims 1 to 13, characterized in that, The method further includes: receiving or sending fourth information, the fourth information being used to indicate the first resource.

15. A method of communication, comprising: comprising: determining a first resource of a data channel, the first resource being used to carry data of K times of repeated transmissions, K being a positive integer; receiving data of part or all of the K times of repeated transmissions, the data of the K times of repeated transmissions being processed based on a first orthogonal sequence of M orthogonal sequences, any sequence of the M orthogonal sequences containing N elements, M being a positive integer, N being an integer greater than 1.

16. The method of claim 15, wherein, In a case where K is less than N, the data of the K times of repeated transmissions is processed by the first orthogonal sequence containing the first K elements or the last K elements of the N elements.

17. The method of claim 15 or 16, wherein, In a case that K is greater than or equal to N, the K times of repeated transmissions correspond to a segment time unit, representing an operation of rounding up; Prior art Each of the P time units contains N time units, the N time units being used to carry data of N times of repeated transmissions of the K times of repeated transmissions, the data of the N times of repeated transmissions being processed by the first orthogonal sequence containing the N elements.

18. The method of claim 17, wherein, In the method In the segment time units, the last segment time unit contains P time units. P is equal to N, the data carried by the last time unit being processed by the first orthogonal sequence containing the N elements; or, P is less than N, the data carried by the last time unit being processed by the first orthogonal sequence containing the first P elements or the last P elements of the N elements.

19. The method according to any one of claims 15 to 18, characterized in that, The M orthogonal sequences include Q orthogonal sequences, any sequence of the Q orthogonal sequences containing the first N / 2 elements and the last N / 2 elements being the same, Q being less than or equal to N.

20. The method of claim 19, wherein, Any sequence of the Q orthogonal sequences contains the first N / 2 elements and the last N / 2 elements being the same, including: The i-th element and the N / 2+i-th element of any sequence of the Q orthogonal sequences are the same, i taking a value from 1 to N / 2.

21. The method according to any one of claims 15 to 20, characterized in that, The M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +j -1 -j]; or [+1 -j -1 +j].

22. The method according to any one of claims 15 to 20, characterized in that, The M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 +1 -1 -1]; or [+1 -1 -1 +1].

23. The method according to any one of claims 15 to 20, characterized in that, The M orthogonal sequences include at least one of: [+1 +1 +1 +1]; [+1 -1 +1 -1]; [+1 -1 +j -j]; [+1 +1 -1 -1]; or [+1 -1 -j +j].

24. The method of any of claims 15 to 23, further comprising: receiving or sending first information, the first information indicating the first orthogonal sequence; or, ​ The first orthogonal sequence is determined based on a first rule among the M orthogonal sequences.

25. The method according to any one of claims 15 to 24, characterized in that, The method further comprises: receiving or sending second information, the second information being used for indicating the M orthogonal sequences.

26. The method of any one of claims 15 to 25, wherein, The method further comprises: receiving or sending third information, the third information being used for determining that data of each of the K repeated transmissions is carried in 1 slot or 1 / 2 slot.

27. The method of claim 26, wherein, The third information is used for indicating a resource type of the first resource; in a case that the resource type of the first resource is a first type, the third information is used for determining that the time unit is 1 slot; or, in a case that the resource type of the first resource is a second type, the third information is used for determining that the time unit is 1 / 2 slot.

28. The method of any one of claims 15 to 27, wherein, The method further comprises: receiving or sending fourth information, the fourth information being used for indicating the first resource.

29. A communications device, characterized by A module for performing the method of any one of claims 1 to 28.

30. A communications device, characterized by At least one processor for performing the method of any one of claims 1 to 28.

31. The communication apparatus according to claim 30, wherein The communication device is a chip or a chip system.

32. A computer-readable storage medium, comprising: The computer readable storage medium stores a computer program or instructions, when the computer program or instructions are executed by a communication device, a method of any one of claims 1 to 28 is implemented.

33. A computer program product, characterised in that, A computer program or instructions, when the computer program or instructions are executed by a computer, a method of any one of claims 1 to 28 is implemented.

Images