Communication method and apparatus

Abstract

A communication method, which belongs to the technical field of communications. The method comprises: mapping a first sequence to L second sequences, wherein the L second sequences correspond to L layers on a one-to-one basis, an ith second sequence among the L second sequences comprises T first elements, the T first elements comprise Ni non-zero elements and T-Ni zero elements, the Ni non-zero elements belong to N symbols, i is an integer selected from among 1 to L, and the L second sequences are determined by means of performing power adjustment on the basis of a plurality of adjustment parameters, or, the L second sequences are used for determining a third sequence after power adjustment is performed on the basis of the plurality of adjustment parameters. In the solution, a user sequence is mapped to a plurality of layers, such that the probability of users being in the same layer is smaller, thereby effectively reducing the interference between the users. In addition, the solution allows for more granular power adjustment, which allows for the differentiation of a greater number of users, thereby increasing the channel capacity and reducing the interference between the users.

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202411017414.5, filed on July 26, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and more specifically, to a communication method and apparatus. Background Technology

[0003] Within the radio wave coverage area of ​​a wireless communication environment, it is necessary to establish wireless channel connections between users and base stations, as well as between users themselves. Multiple access (MA) technology can divide channel resources into different dimensions and allocate them to users, enabling multiple users to communicate using these channel resources. For example, the dimensions can include the time domain or the frequency domain.

[0004] However, with the increasing number of users, interference may occur between multiple users. Therefore, how to effectively reduce interference between multiple users in MA technology is an urgent problem to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that effectively reduces interference between multiple users in MA technology by mapping user sequences to multiple layers and performing fine-grained power adjustments on the sequences, thereby reducing the probability that each user is in the same dimension (e.g., the same layer and the same power).

[0006] In a first aspect, a communication method is provided. The method provided in the first aspect is applied to a first device. Unless otherwise specified, the first device in this application can be a terminal device (e.g., a first terminal device) or a network device, or it can be a component (e.g., a processor, chip, or chip system) within the terminal device or network device, or it can be a logic module or software capable of implementing all or part of the functions of the terminal device or network device. For ease of description, the following description uses the first device as an example.

[0007] The method includes: obtaining a first sequence, which includes N symbols, where N is a positive integer; mapping the first sequence to L second sequences, where the L second sequences correspond one-to-one with L layers, and the i-th second sequence in the L second sequences includes T first elements, where the T first elements include N... i Non-zero elements and TN i N zero elements, the N i There are N non-zero elements belonging to these N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L. The L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment based on the multiple adjustment parameters. The multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter. The first adjustment parameter and the second adjustment parameter are used to adjust the power of two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different. Output the third sequence or the L second sequences.

[0008] For example, N symbols can include N i N non-zero elements, where i is an integer from 1 to L. In other words, N i The non-zero element can be N out of N symbols. i The non-zero values ​​corresponding to each symbol.

[0009] The above scheme maps user sequences to multiple symbols across multiple layers. When multiple users reuse these multiple layers, the scheme reduces the probability of users sharing the same symbol at the same layer, thus reducing the probability of user collisions and effectively minimizing interference between multiple users in MA technology. Furthermore, while traditional power schemes adjust power at the user or layer level, the above scheme allows for finer-grained adjustments (e.g., symbol-level adjustments). This means that even if some users happen to be on the same symbol at the same layer, their power can be adjusted to have different power levels, thereby distinguishing more users and improving channel capacity while reducing user interference. Therefore, the above scheme enables more efficient multi-user transmission.

[0010] In some implementations, mapping the first sequence to L second sequences includes: dividing the first sequence into L seventh sequences, where the i-th seventh sequence among the L seventh sequences includes N... i 1 symbol; determine L eighth sequences, where the i-th eighth sequence includes the i-th seventh sequence and TN. i L zero elements; interweave the L eighth sequences to obtain the L second sequences.

[0011] Based on the above scheme, L second sequences can be obtained by splitting, padding with zeros, and interleaving the first sequence. These operations are simple and have low processing overhead.

[0012] In some implementations, the method further includes: receiving or sending first information, the first information being used to indicate at least one of the following: L, T, N, a first interleaving parameter, or L N's. i The first interleaving parameter is used to interleave the L eighth sequences.

[0013] Based on the above scheme, the first information can indicate the method of mapping the user's sequence to multiple layers. The first device can map the first sequence to L second sequences corresponding to L layers according to the first information, or the first device can send the first information to the data receiving end, so that the data receiving end can decode according to the first information to obtain the first sequence.

[0014] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the first information is also used to indicate the T time-frequency resources and / or the L layers.

[0015] Based on the above scheme, the first information can indicate the parameters of the mapping function (for example, each parameter includes at least one of the following: L, T, N, the first interleaving parameter, or L N). i The scope of application of the mapping function is thus defined. In this way, the first device can use the various parameters of the mapping function described above to map the first sequence into L second sequences within a specific time-frequency resource and / or layer range.

[0016] In some implementations, mapping the first sequence to L second sequences includes: mapping the first sequence to the L second sequences based on position information, wherein the position information is used to indicate the positions of the N non-zero elements corresponding to the N symbols in the L second sequences. Alternatively, the position information is used to indicate the positions of (L*TN) zero elements in the L second sequences.

[0017] Based on the above scheme, the first device can map the first sequence to L second sequences. The above scheme is simple to operate and has a small processing delay.

[0018] In some implementations, the location information includes a first matrix of size L*T, which includes N first indication information and (L*TN) second indication information, wherein the N first indication information are used to indicate the N non-zero elements, and the (L*TN) second indication information are used to indicate the (L*TN) zero elements.

[0019] Based on the above scheme, location information can be indicated in the form of a matrix. The first device can quickly map the first sequence to L second sequences according to the first matrix, with a small processing delay.

[0020] In some implementations, the number of symbols in any two of the L second sequences is the same. The method further includes: determining the first matrix based on the second matrix of size L*T and the binary sequence, wherein the binary sequence includes T indication information, the T indication information includes N / L first indication information and TN / L second indication information, and the i-th row of the second matrix includes T first position numbers, the T first position numbers being used to indicate the position of the T indication information in the i-th row of the first matrix.

[0021] Based on the above scheme, the first device can quickly determine the first matrix based on the binary sequence and the second matrix, without requiring other devices to send the complete first matrix. Therefore, the above scheme reduces processing latency while also reducing transmission overhead.

[0022] In some implementations, the method further includes: determining the second matrix based on a first position sequence and a second interleaving parameter, wherein the first position sequence includes T second position numbers, and the second matrix includes L second position sequences, wherein: the first position sequence is the first second position sequence among the L second position sequences; and when i is greater than 1, the i-th second position sequence among the L second position sequences is determined by interleaving the (i-1)-th second position sequence based on the second interleaving parameter.

[0023] Based on the above scheme, the first device can generate the second matrix through nesting or recursion, according to the first position sequence and the second interleaving parameters. This scheme requires fewer input parameters and is easy to implement.

[0024] In some implementations, the second matrix satisfies:

[0025] Among them, Pos i This represents the i-th second position sequence; "0:T-1" means 0, 1, ..., T-1; mod means modulo; f1 and f2 belong to this second interleaving parameter, f1 is an integer greater than or equal to 1 and less than or equal to T, f1 is coprime with T, and f2 is an integer greater than or equal to 0 and less than T.

[0026] Among them, f1Pos i-1 It can represent f1 and Pos i-1 Multiply.

[0027] In some implementations, the method further includes: receiving or transmitting second information for indicating at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence; or, in the case where the L second sequences are used to determine the third sequence, the second information is used to indicate a third matrix for adjusting the power of the L second sequences and for determining the position information.

[0028] In schemes where the second information indicates at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence, the number of parameters indicated by the second information is relatively small; for example, the number of parameters for the second interleaving parameter is less than the number of parameters for the first interleaving parameter. The parameters indicated by the second information can be used to determine a second matrix. The above scheme has lower transmission overhead. When the second information is used to indicate a third matrix, the first device can determine position information (e.g., a first matrix) based on the third matrix used for power adjustment. Thus, the second information serves both to indicate adjustment parameters and to indicate position information. Compared to indicating adjustment parameters and position information using different parameters, the above scheme saves transmission overhead.

[0029] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the second information is also used to indicate the T time-frequency resources and / or the L layers.

[0030] Based on the above scheme, the second information can indicate the scope of each parameter of the mapping function. Thus, the first device can use the parameters of the mapping function to map the first sequence into L second sequences within a specific time-frequency resource and / or layer range.

[0031] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the adjustment parameters of the non-zero elements corresponding to the two time-frequency resources are different.

[0032] Based on the above scheme, the first device can adjust the power of multiple second sequences on different time-frequency resources. Therefore, in a scenario with multiple users, the above scheme can enable multiple second sequences of multiple users to be transmitted at different powers on multiple time-frequency resources, thereby making the interference of multiple second sequences of multiple users different on different time-frequency resources, and thus obtaining different power gains on different time-frequency resources.

[0033] In some implementations, the total power of the L second sequences before power adjustment is equal to the total power of the L second sequences after power adjustment.

[0034] For example, without the above scheme, differentiating two users in the power domain requires two different total powers. However, with the above scheme, two users can have different power levels on different time-frequency resources at different layers while maintaining the same total power. This allows for differentiation between different users at different layers and time-frequency resources, thus enabling them to obtain different capacity gains in different power domains while maintaining the same total power. Based on this scheme, the communication system can accommodate more users with the same total power, improving channel capacity.

[0035] In some implementations, the method further includes: adjusting the power of the L second sequences according to the third matrix to determine the third sequence, wherein the third matrix satisfies:

[0036] Where M(i,j) represents the element in the i-th row and j-th column of the third matrix, T1 represents the number of time-frequency resources carrying symbols in the T time-frequency resources, L1(j) represents the number of symbols carried by the j-th time-frequency resource in the T time-frequency resources, and P0 represents the total power of the third sequence.

[0037] In some implementations, multiple parameters belong to the fourth matrix; wherein: the third sequence is determined by adjusting the power of the L second sequences according to the fourth matrix; or, mapping the first sequence to the L second sequences includes: adjusting the power of the first sequence according to the fourth matrix to determine the fourth sequence; and mapping the fourth sequence to the L second sequences.

[0038] Based on the above scheme, the first device can adjust the power of L second sequences or first sequences according to the fourth matrix. The granularity of the power adjustment of the fourth matrix is ​​flexible; it can be at the time-frequency resource level, the symbol level, or the layer level. Therefore, the above scheme allows the first device to flexibly adjust the power of each symbol, thereby further reducing interference between multiple users.

[0039] In some implementations, the method further includes receiving or sending third information, which indicates at least one of the following: the fourth matrix, the T time-frequency resources, or the L layers.

[0040] Based on the above scheme, the third information can indicate the scope of application of each parameter of the adjustment parameter mapping function. In this way, the first device can use the parameters of the mapping function to map the first sequence into L second sequences within a specific time-frequency resource and / or layer range.

[0041] In some implementations, the T first elements correspond one-to-one with T time-frequency resources, and the L second sequences or the third sequence correspond to the first non-orthogonal multiple access layer. The method further includes: obtaining a fifth sequence, which includes M symbols, where M is a positive integer; mapping the fifth sequence to L sixth sequences, which correspond one-to-one with the L layers, wherein the i-th sixth sequence in the L sixth sequences includes T second elements, and the T second elements include M... i The sum of non-zero elements (TM) i M has ) zero elements. i There are M non-zero elements belonging to these M symbols. The T second elements correspond one-to-one with the T time-frequency resources; output the L sixth sequences, which correspond to the second non-orthogonal multiple access layer.

[0042] Secondly, a communication method is provided. The method provided in this application is applied to a second device. Unless otherwise specified, the second device in this application can be a terminal device (e.g., a first terminal device or a second terminal device) or a network device, or it can be a component (e.g., a processor, chip, or chip system) within the terminal device or network device, or it can be a logic module or software capable of implementing all or part of the functions of the terminal device or network device. For ease of description, the following description uses a second device as an example.

[0043] The method includes: obtaining a third sequence or L second sequences, wherein the L second sequences correspond one-to-one with L layers, and the i-th second sequence among the L second sequences includes T first elements, wherein the T first elements include N i Non-zero elements and TN i N zero elements, the N i Each non-zero element belongs to one of N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L; the L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment based on the multiple adjustment parameters; wherein the multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter, the first adjustment parameter and the second adjustment parameter are respectively used to adjust the power of two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different; a first sequence is determined based on the third sequence or the L second sequences, and the first sequence includes the N symbols.

[0044] In some implementations, the method further includes: receiving or sending first information, the first information being used to indicate at least one of the following: L, T, N, a first interleaving parameter, or L N's. i The first interleaving parameter is used to determine the L second symbol sequences.

[0045] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the first information is also used to indicate the T time-frequency resources and / or the L layers.

[0046] In some implementations, determining the first symbol sequence based on the second symbol sequence includes: demodulating the second symbol sequence based on the first information to determine the first symbol sequence.

[0047] In some implementations, the method further includes receiving or sending second information for determining position information, which indicates the position of the N non-zero elements corresponding to the N symbols in the L second sequences.

[0048] In some implementations, the position information is a first matrix of size L*T, which includes N first indication information and (L*TN) second indication information. The N first indication information are used to indicate the N non-zero elements, and the (L*TN) second indication information are used to indicate the (L*TN) zero elements.

[0049] In some implementations, the second information is used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence, wherein the second interleaving parameter and / or the binary sequence is used to determine a first matrix; or, in the case where the L second sequences are used to determine the third sequence, the second information is used to indicate a third matrix, which is used to adjust the power of the L second sequences and to determine the position information.

[0050] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the second information is also used to indicate the T time-frequency resources and / or the L layers.

[0051] In some implementations, the method further includes: receiving or sending third information for indicating a fourth matrix for adjusting the power of the L second sequences, or the fourth matrix for adjusting the power of the first sequence, and determining a fourth sequence for mapping to the L second sequences.

[0052] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the third information is also used to indicate the T time-frequency resources and / or the L layers.

[0053] In some implementations, the T first elements correspond one-to-one with T time-frequency resources, and the L second sequences or the third sequence correspond to the first non-orthogonal access (NOMA) layer. The method further includes: obtaining L sixth sequences, each corresponding to a second NOMA layer, with each of the L sixth sequences corresponding to one of the L layers. The i-th sixth sequence in the L sixth sequences includes T second elements, and each of the T second elements includes M... i The sum of non-zero elements (TM) i M has ) zero elements. i M non-zero elements belong to M symbols. M is a positive integer, and the T second elements correspond one-to-one with the T time-frequency resources; based on the L sixth sequences, the fifth sequence is determined, and the fifth sequence includes the M symbols.

[0054] Thirdly, a communication device is provided, including processing circuitry (or a processor) and an input / output interface (also referred to as an interface circuit), the input / output interface being used for inputting and / or outputting signals, the processing circuitry being used to perform the first aspect and any possible method of the first aspect, or the processing circuitry being used to perform the second aspect and any possible method of the second aspect.

[0055] In some implementations, the processing circuitry is used to communicate with other devices via an interface circuitry and to perform the first aspect and any possible method of the first aspect, or to perform the second aspect and any possible method of the second aspect.

[0056] Fourthly, a communication device is provided. This communication device may include units or modules for performing the functions of the communication device.

[0057] In some implementations, the communication device may include modules, units, or means for performing the methods / operations / steps / actions described in the first aspect and any possible implementation of the first aspect. These modules, units, or means may be hardware circuits, software, or a combination of hardware circuits and software.

[0058] The device includes a processing unit and a transceiver unit. The processing unit can acquire a first sequence comprising N symbols, where N is a positive integer. The processing unit is also used to map the first sequence to L second sequences, each of which corresponds one-to-one with one of the L layers. The i-th second sequence in the L second sequences includes T first elements, where the T first elements include N symbols. i Non-zero elements and TN i N zero elements, the N i There are N non-zero elements belonging to these N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L. The L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine a third sequence after power adjustment based on the multiple adjustment parameters. The multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter, which are used to adjust the power of two non-zero elements in the L second sequences, respectively. The first adjustment parameter and the second adjustment parameter are different. The transceiver unit can be used to output the third sequence or the L second sequences.

[0059] In some implementations, the processing unit is specifically used to: divide the first sequence into L seventh sequences, wherein the i-th seventh sequence among the L seventh sequences includes N i 1 symbol; determine L eighth sequences, where the i-th eighth sequence includes the i-th seventh sequence and TN. i L zero elements; interweave the L eighth sequences to obtain the L second sequences.

[0060] In some implementations, the transceiver unit is further configured to: receive or transmit first information, the first information indicating at least one of the following: L, T, N, a first interleaving parameter, or L N's. i The first interleaving parameter is used to interleave the L eighth sequences.

[0061] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the first information is also used to indicate the T time-frequency resources and / or the L layers.

[0062] In some implementations, the processing unit is specifically used to: map the first sequence to the L second sequences based on position information, wherein the position information is used to indicate the positions of the N non-zero elements corresponding to the N symbols in the L second sequences. Alternatively, the position information is used to indicate the positions of (L*TN) zero elements in the L second sequences.

[0063] In some implementations, the location information includes a first matrix of size L*T, which includes N first indication information and (L*TN) second indication information, wherein the N first indication information are used to indicate the N non-zero elements, and the (L*TN) second indication information are used to indicate the (L*TN) zero elements.

[0064] In some implementations, the number of symbols in any two of the L second sequences is the same. The processing unit is further configured to: determine the first matrix based on the second matrix of size L*T and the binary sequence, wherein the binary sequence includes T indication information, the T indication information includes N / L first indication information and TN / L second indication information, the i-th row of the second matrix includes T first position numbers, the T first position numbers are used to indicate the position of the T indication information in the i-th row of the first matrix.

[0065] In some implementations, the processing unit is further configured to: determine the second matrix based on the first position sequence and the second interleaving parameter, wherein the first position sequence includes T second position numbers, and the second matrix includes L second position sequences, wherein: the first position sequence is the first second position sequence among the L second position sequences; and when i is greater than 1, the i-th second position sequence among the L second position sequences is determined by interleaving the (i-1)-th second position sequence based on the second interleaving parameter.

[0066] In some implementations, the second matrix satisfies:

[0067] Among them, Pos i This represents the i-th second position sequence; "0:T-1" means 0, 1, ..., T-1; mod means modulo; f1 and f2 belong to this second interleaving parameter, f1 is an integer greater than or equal to 1 and less than or equal to T, f1 is coprime with T, and f2 is an integer greater than or equal to 0 and less than T.

[0068] In some implementations, the transceiver unit is further configured to: receive or transmit second information, the second information being used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence; or, in the case where the L second sequences are used to determine the third sequence, the second information being used to indicate a third matrix, the third matrix being used to adjust the power of the L second sequences, and to determine the position information.

[0069] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the second information is also used to indicate the T time-frequency resources and / or the L layers.

[0070] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the adjustment parameters of the non-zero elements corresponding to the two time-frequency resources are different.

[0071] In some implementations, the total power of the L second sequences before power adjustment is equal to the total power of the L second sequences after power adjustment.

[0072] In some implementations, the processing unit is further configured to: adjust the power of the L second sequences according to the third matrix to determine the third sequence, wherein the third matrix satisfies:

[0073] Where M(i,j) represents the element in the i-th row and j-th column of the third matrix, T1 represents the number of time-frequency resources carrying symbols in the T time-frequency resources, L1(j) represents the number of symbols carried by the j-th time-frequency resource in the T time-frequency resources, and P0 represents the total power of the third sequence.

[0074] In some implementations, multiple parameters belong to the fourth matrix; wherein: the third sequence is determined by adjusting the power of the L second sequences according to the fourth matrix; or, the processing unit is further configured to: adjust the power of the first sequence according to the fourth matrix to determine the fourth sequence; and map the fourth sequence to the L second sequences.

[0075] In some implementations, the transceiver unit is also used to: receive or send third information, which indicates at least one of the following: the fourth matrix, the T time-frequency resources, or the L layers.

[0076] In some implementations, the T first elements correspond one-to-one with T time-frequency resources, and the L second sequences or the third sequence correspond to the first non-orthogonal multiple access layer. The processing unit is further configured to: obtain a fifth sequence, which includes M symbols, where M is a positive integer; map the fifth sequence to L sixth sequences, which correspond one-to-one with the L layers, wherein the i-th sixth sequence in the L sixth sequences includes T second elements, and the T second elements include M... i The sum of non-zero elements (TM) i M has ) zero elements. i There are M non-zero elements belonging to these M symbols. The T second elements correspond one-to-one with the T time-frequency resources; output the L sixth sequences, which correspond to the second non-orthogonal multiple access layer.

[0077] In some implementations, the communication device may include modules, units, or means for performing the methods / operations / steps / actions described in the second aspect and any possible implementation of the second aspect. These modules, units, or means may be hardware circuits, software, or a combination of hardware circuits and software.

[0078] The device includes a processing unit and a transceiver unit. The transceiver unit can acquire a third sequence or L second sequences, wherein the L second sequences correspond one-to-one with L layers, and the i-th second sequence among the L second sequences includes T first elements, and the T first elements include N... i Non-zero elements and TN i N zero elements, the N i Each non-zero element belongs to one of N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L; the L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment based on the multiple adjustment parameters; wherein, the multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter, the first adjustment parameter and the second adjustment parameter are respectively used to adjust the power of two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different; the processing unit can be used to determine a first sequence based on the third sequence or the L second sequences, the first sequence including the N symbols.

[0079] In some implementations, the transceiver unit is further configured to: receive or transmit first information, the first information indicating at least one of the following: L, T, N, a first interleaving parameter, or L N's. i The first interleaving parameter is used to determine the L second symbol sequences.

[0080] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the first information is also used to indicate the T time-frequency resources and / or the L layers.

[0081] In some implementations, the processing unit is specifically used to: demodulate the second symbol sequence based on the first information, and determine the first symbol sequence.

[0082] In some implementations, the transceiver unit is also used to: receive or send second information, which is used to determine position information, which is used to indicate the position of the N non-zero elements corresponding to the N symbols in the L second sequences.

[0083] In some implementations, the position information is a first matrix of size L*T, which includes N first indication information and (L*TN) second indication information. The N first indication information are used to indicate the N non-zero elements, and the (L*TN) second indication information are used to indicate the (L*TN) zero elements.

[0084] In some implementations, the second information is used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence, wherein the second interleaving parameter and / or the binary sequence is used to determine a first matrix; or, in the case where the L second sequences are used to determine the third sequence, the second information is used to indicate a third matrix, which is used to adjust the power of the L second sequences and to determine the position information.

[0085] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the second information is also used to indicate the T time-frequency resources and / or the L layers.

[0086] In some implementations, the transceiver unit is further configured to: receive or transmit third information, which is used to indicate a fourth matrix, which is used to adjust the power of the L second sequences, or the fourth matrix is ​​used to adjust the power of the first sequence, and determine a fourth sequence, which is used to map to the L second sequences.

[0087] In some implementations, the T first elements correspond one-to-one with the T time-frequency resources, and the third information is also used to indicate the T time-frequency resources and / or the L layers.

[0088] In some implementations, the T first elements correspond one-to-one with T time-frequency resources, the L second sequences or the third sequence correspond to the first NOMA layer, and the transceiver unit is further configured to: acquire L sixth sequences, the L sixth sequences correspond to the second NOMA layer, the L sixth sequences correspond one-to-one with the L layers, the i-th sixth sequence in the L sixth sequences includes T second elements, and the T second elements include M i The sum of non-zero elements (TM) i M has ) zero elements. i M non-zero elements belong to M symbols. M is a positive integer, and the T second elements correspond one-to-one with the T time-frequency resources; the processing unit is also used to determine the fifth sequence based on the L sixth sequences, and the fifth sequence includes the M symbols.

[0089] Fifthly, a computer-readable storage medium is provided that stores a computer program or instructions that, when executed, cause the first aspect and any possible method of the first aspect to be performed (or implemented), or cause the second aspect and any possible method of the second aspect to be performed (or implemented).

[0090] In a sixth aspect, a computer program product is provided, comprising a computer program or instructions that, when executed, cause the first aspect and any possible method of the first aspect to be performed (or implemented), or cause the second aspect and any possible method of the second aspect to be performed (or implemented).

[0091] A seventh aspect provides a communication device, including a processor for executing (or implementing) any of the possible methods of the first aspect above, or for executing (or implementing) any of the possible methods of the second aspect above, by executing a computer program (or computer-executable instructions) stored in a memory, and / or by logic circuitry.

[0092] In one possible implementation, the device also includes a memory. In another possible implementation, the processor and memory are integrated together. In yet another possible implementation, the memory is located outside the communication device. The processor can be one or more.

[0093] In one possible implementation, the communication device further includes a communication interface for communicating with other devices, such as transmitting or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0094] In one implementation, the communication device of the third, fourth, or seventh aspect mentioned above can be a chip or a chip system.

[0095] Eighthly, a chip is provided, including a processor for calling a computer program or computer instructions in memory to cause any of the implementations of the first aspect to be executed (or implemented), or to cause any of the implementations of the second aspect to be executed (or implemented).

[0096] In some implementations, the processor is coupled to the memory via an interface.

[0097] Ninth aspect, a communication system is provided, including a first device and a second device, the first device being configured to perform the first aspect and any possible implementation thereof, and the second device being configured to perform the third aspect and any possible implementation thereof.

[0098] The description of the beneficial effects of any of the second to ninth aspects can be referred to the description of the beneficial effects of the first aspect. Attached Figure Description

[0099] Figure 1 is a schematic diagram of a communication system.

[0100] Figure 2 is a schematic diagram of another communication system.

[0101] Figure 3 is a schematic flowchart of a communication method provided in an embodiment of this application.

[0102] Figure 4 is a schematic diagram of sparse mapping and power adjustment provided in an embodiment of this application.

[0103] Figure 5 is a schematic diagram of sparse mapping provided in an embodiment of this application.

[0104] Figure 6 is a schematic diagram of determining the first matrix provided in an embodiment of this application.

[0105] Figure 7 is a schematic block diagram of a communication device provided in an embodiment of this application.

[0106] Figure 8 is a schematic diagram of another communication device provided in an embodiment of this application.

[0107] Figure 9 is a schematic diagram of a chip system provided in an embodiment of this application.

[0108] Figure 10 is a schematic diagram of another chip system provided in an embodiment of this application. Detailed Implementation

[0109] In this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0110] I. In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, or B exists alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can each be single or multiple.

[0111] II. In this application, the terms "first," "second," and various numerical designations (e.g., #1, #2, etc.) indicate distinctions made for ease of description and are not intended to limit the scope of the embodiments of this application. For example, they may distinguish different messages, rather than describing a specific order or sequence. It should be understood that such descriptions can be interchanged where appropriate to describe solutions other than those in the embodiments of this application.

[0112] Third, in this application, descriptions such as "when," "under the circumstances," and "if" all refer to the device making corresponding processing under certain objective circumstances, and are not time-limited, nor do they require the device to make a judgment action when implementing it, nor do they imply any other limitations.

[0113] IV. In this application, "instruction" or "for instruction" can include both direct (or explicit) and indirect (or implicit) instruction. When describing instruction information as indicating A, it can include whether the instruction information directly or indirectly indicates A, but does not necessarily mean that the instruction information carries A. For example, in the case of indirect (or implicit) instruction, the receiving end of the instruction information can obtain A based on the parameters indicated by the instruction information, combined with other rules or parameters, or through deduction.

[0114] V. The indication methods involved in the embodiments of this application should be understood to cover various methods that enable the party to be indicated to obtain the information to be indicated. The information to be indicated can be sent as a whole or divided into multiple sub-information and sent separately. Moreover, the sending period and / or sending time of these sub-information can be the same or different. This application does not limit the sending method, for example.

[0115] VI. In this application, "protocol" can refer to standard protocols in the field of communications, such as 5G protocols, new radio (NR) protocols, and related protocols applied to future communication systems; this application does not limit this term. "Predefined" can include predefined terms, such as protocol definitions. "Preconfiguration" can be implemented by pre-storing corresponding codes, tables, or other means that can be used to indicate relevant information in the device; this application does not limit the implementation method.

[0116] VII. In this application, "communication" can also be described as "data transmission," "information transmission," "data processing," etc. "Transmission" includes "sending" and "receiving." For example, transmission can be uplink transmission, such as a terminal device sending a signal to a network device; transmission can also be downlink transmission, such as a network device sending a signal to a terminal device; transmission can also be sidelink transmission, such as a terminal device sending a signal to another terminal device. For example, "transmission" can be air interface level transmission, or it can be signal transmission from a chip input (I) / output (O) port, rather than air interface level transmission.

[0117] 8. In this application, terms such as “message”, “information”, “signal” or “information element (IE)” can be used interchangeably. There are no restrictions on the name of the message or information, as long as it can achieve the corresponding function.

[0118] 9. "Sending information to XX (device)" can be understood as the destination of the information being that device. This can include sending information directly or indirectly to that device. "Receiving information from XX (device), or receiving information from XX (device)" can be understood as the source of the information being that device. This can include receiving information directly or indirectly from that device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way, and will not be repeated here. Furthermore, "sending" can also be understood as the "output" of the chip interface, and "receiving" can also be understood as the "input" of the chip interface. In other words, "sending" or "receiving" can occur between devices, for example, between network devices and terminal devices via an air interface. "Sending" or "receiving" can also occur within a device, for example, between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.

[0119] 10. In this application, terms such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions to present concepts in a specific manner. Any embodiment or design described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. In the embodiments of this application, the terms "of," "corresponding (relevant)," "corresponding," and "associate" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinctions are emphasized.

[0120] XI. In this application, configuration can be signaling configuration or can be described as configuring signaling. For example, signaling configuration includes configuration using signaling sent by network devices, which can be radio resource control (RRC) messages, downlink control information (DCI) messages, or system information blocks (SIBs). Another example is signaling configuration between network devices. These network devices can include access network devices, core network devices, or management plane devices, etc. Optionally, signaling configuration can also be configured to terminal devices or network devices using pre-configured signaling, or configured to terminal devices or network devices through pre-configuration. Here, pre-configuration means defining or configuring the values ​​of corresponding parameters in advance using a protocol, and storing them in the terminal device or network device during communication. Pre-configured messages can be modified or updated when the terminal device or network device is connected to the network.

[0121] 12. This application will present various aspects, embodiments, or features relating to systems that may include multiple devices, components, modules, etc. Each system may include devices, components, modules, etc., other than those illustrated, and / or may not include all and all of the devices, components, modules, etc. discussed in conjunction with the accompanying drawings.

[0122] Thirteen, the business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0123] XIV. In the various embodiments of this application, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application. The terms "comprising," "including," "having," and their variations all mean "including but not limited to," unless otherwise specifically emphasized.

[0124] To facilitate understanding of the embodiments of this application, a brief, exemplary description of the concepts that may be involved in the embodiments will be provided first.

[0125] Multiple-input multiple-output (MIMO) technology: Traditional communication systems are single-input single-output (SISO) systems. MIMO technology can use multiple transmit antennas and multiple receive antennas at the transmitting and receiving ends, respectively. In this way, signals are transmitted and received through multiple antennas at both ends, thereby improving the user's quality of service (e.g., quality of service can include bit error rate or data rate). MIMO also includes multiple-input single-output (MISO) and single-input multiple-output (SIMO) based on transmit diversity and receive diversity.

[0126] A layer, also known as a transport layer, represents an independent path or stream of data transmission at the physical layer. Each layer can carry an independent data stream, which can be transmitted and received at both the transmitting and receiving ends using the same radio resources, thereby improving data transmission rate and spectral efficiency. Unless otherwise specified, a layer can be a MIMO layer; for example, a MIMO layer can be an independent data stream that is transmitted and received at both the transmitting and receiving ends using different antennas or antenna combinations, and is transmitted in parallel on the same time and frequency resources.

[0127] Precoding technology is a key technology for achieving parallel transmission of multiple MIMO layers. The transmitter can process the signal to be transmitted using a precoding matrix (or transmission weights) that matches the channel state, given the known channel conditions. This precoded signal is adapted to the channel, reducing the complexity of channel interference removal at the receiver. Precoding improves the quality of the received signal (e.g., signal-to-interference-plus-noise ratio, SINR). Using precoding technology, the transmitter and multiple receivers can transmit on the same time-frequency resources, achieving multiple-user multiple-input multiple-output (MU-MIMO). The descriptions of precoding technology in this application are illustrative only and are not intended to limit the scope of protection of the embodiments. In specific implementations, the transmitter can also perform precoding in other ways. For example, when channel information (e.g., but not limited to the channel matrix) is unknown, a pre-set precoding matrix or weighted processing method can be used for precoding.

[0128] Precoding Matrix: The precoding matrix can be determined based on the channel matrix of each frequency domain unit. The channel matrix can be determined by the transmitter through methods such as channel estimation, or based on channel reciprocity. For example, the precoding matrix can be obtained by performing singular value decomposition (SVD) on the channel matrix or its covariance matrix, or by performing eigenvalue decomposition (EVD) on the covariance matrix of the channel matrix.

[0129] Layer number: Also known as transport layer number, layer number, spatial stream number, antenna port number, or other names. Optionally, the network device can refer to the rank of the channel matrix fed back by the terminal device to determine the number of precoding layers used for data transmission between the network device and the terminal device. The terminal device can determine the rank of the channel matrix based on the channel obtained from channel estimation. For example, in the process of determining the precoding matrix through SVD, different precoding layers can be distinguished according to the magnitude of the eigenvalues. For example, the precoding vector determined by the eigenvector corresponding to the largest eigenvalue can be associated with the first precoding layer, and the precoding vector determined by the eigenvector corresponding to the smallest eigenvalue can be associated with the Zth precoding layer. That is, the eigenvalues ​​corresponding to the first transport layer to the Zth precoding layer decrease sequentially, where Z is an integer greater than 1.

[0130] A port, also known as an antenna port, can be understood as a virtual antenna recognized by the receiving device. A port is a logical concept; it can be a single physical transmit antenna or a combination of multiple physical transmit antennas. Signals transmitted through the same port, regardless of whether they are transmitted through the same or different physical antennas, can be considered to have the same or correlated channels along their transmission paths in space (e.g., large-scale channel characteristics—same channel matrix). In other words, for signals transmitted through the same port, the receiver can consider these signals to have the same or correlated channels during demodulation. The signal receiver can identify signals with different transmission channels through antenna ports. Optionally, a port refers to a transmit antenna port. For example, the reference signal for each port can be an uncoded reference signal or a precoded reference signal obtained by precoding the reference signal based on a time delay vector. The number of ports can refer to the number of transmit antenna ports or the number of transmit antennas. Optionally, a port refers to a reference signal port after beamforming. For example, the reference signal for each port can be a precoded reference signal obtained by precoding the reference signal based on an angle vector, or it can be a precoded reference signal obtained by precoding the reference signal based on an angle vector and a time delay vector. The number of ports can refer to the number of reference signal ports or the number of angle vectors. It is understood that the number of reference signal ports after beamforming can be less than the number of transmit antenna ports.

[0131] Multiple Access (MA) technology: MA technology divides channel resources into different dimensions and allocates them to users, enabling multiple users to communicate using these channel resources. Based on whether user access is related, MA can be divided into orthogonal MA (OMA) and NOMA. In an OMA system, each user can exclusively enjoy channel resources in a specific dimension; in a NOMA system, multiple users share channel resources and cannot be distinguished by a single dimension. MA that divides channel resources based on the carrier frequency of the transmitted signal is called Frequency Division Multiple Address (FDMA). MA that divides channel resources based on the duration of the transmitted signal is called Time Division Multiple Address (TDMA). MA that divides channel resources based on the code pattern of the transmitted signal is called Code Division Multiple Address (CDMA). MA technology can also take other forms, such as Spatial Division Multiple Address (SDMA) or Code Division (CD)-NOMA, etc.

[0132] Frequency domain unit: The unit of frequency domain resources, which can represent different granularities of frequency domain resources. Frequency domain units can include, but are not limited to: subband, resource block (RB), resource block group (RBG), or precoding resource block group (PRG), etc.

[0133] Non-orthogonal multiple access (NOMA) is a wireless communication technology that breaks the limitation of traditional multiple access technologies (such as orthogonal frequency-division multiple access, OFDMA, and time division multiple access, TDMA) where users must allocate time and frequency resources orthogonally (i.e., without overlap). NOMA allows multiple users to share a channel on the same time and frequency resources simultaneously. Through non-orthogonal signal superposition and decoding, it enables more efficient and flexible multi-user sharing and resource allocation. Different non-orthogonal signal superposition schemes correspond to different NOMA technologies, such as power domain NOMA and code domain NOMA.

[0134] Non-Orthogonal Multiple Access (NOMA) layer: Similar to the MIMO layer, the NOMA layer can transmit data streams using NOMA technology. Different NOMA layers can use different NOMA technologies or different parameter configurations of the same NOMA technology to transmit simultaneously on the same time-frequency resources. The NOMA layer and the MIMO layer can be independent of each other. That is, a NOMA layer can occupy more than one MIMO layer for transmission, or a MIMO layer can use multiple NOMA layers for transmission.

[0135] Power Domain NOMA: In NOMA, data from different users or NOMA layers can be multiplexed in the power domain. That is, signals can be superimposed at different power levels at the transmitting end, and the receiving end decodes user data one by one through successive interference cancellation (SIC) technology.

[0136] Code domain NOMA: NOMA can utilize code domain multiplexing techniques, such as sparse code multiple access (SCMA) and multi-user shared access (MUSA), to distinguish users in the code domain through different coding and modulation methods.

[0137] The technical solutions of this application embodiment can be applied to various communication systems, including but not limited to: Long Term Evolution (LTE) systems, NR systems, and other fifth-generation (5G) communication systems. th This includes various mobile communication systems such as 5G, narrowband Internet of Things (NB-IoT), enhanced machine-type communication (eMTC), enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), satellite communication systems, LTE-machine-to-machine (LTE-M) systems, and other systems that evolve after 5G, such as future mobile communication systems.

[0138] Figure 1 is a schematic diagram of a communication system 100. As shown in Figure 1, the communication system 100 includes a wireless access network 110 and a core network 120. Optionally, the communication system 100 may also include an Internet 130. The wireless access network 110 may include at least one network device (111a and 111b in Figure 1) and at least one terminal device (112a-112j in Figure 1). The terminal device is connected to the network device wirelessly. The network device is connected to the core network 120 wirelessly or via a wired connection. The core network 120 may include one or more core network devices. The core network device and the network device may be independent physical devices, or the functions of the core network device and the logical functions of the network device may be integrated on the same physical device, or a single physical device may integrate some of the functions of the core network device and some of the functions of the network device. Terminal devices and network devices can be interconnected via wired or wireless means. Terminal devices can communicate wirelessly with each other, network devices with each other, and terminal devices with each other via air interface resources. For example, air interface resources may include at least one of time-domain resources, frequency-domain resources, code resources, and spatial resources. It should be noted that Figure 1 is a schematic diagram; the communication system 100 may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1.

[0139] Network devices can be any type of device with wireless transceiver capabilities. For example, a network device can be a base station used to connect terminal devices to a radio access network (RAN). Network devices are sometimes also referred to as access network devices or access network nodes. It is understood that the names of devices with network device functionality may differ in systems employing different wireless access technologies. For ease of description, the embodiments of this application collectively refer to devices providing wireless communication access functionality to terminal devices as base stations. In the embodiments of this application, network devices include, but are not limited to: various forms of macro base stations (as shown in Figure 1, 111a), micro base stations or indoor stations (as shown in Figure 1, 111b), pico base stations, small stations, balloon stations, relay stations, access points, etc. Network equipment can include evolved node Bs (eNBs or eNodeBs) in LTE, access points (APs), wireless relay nodes, wireless backhaul nodes, transmission points (TPs), or transmission reception points (TRPs) in Wi-Fi systems. It can also include next-generation NodeBs (gNBs) or transmission points (TRPs or TPs) in 5G systems, one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, and network nodes constituting a gNB or transmission point, such as baseband units (BBUs) or distributed units (DUs). Furthermore, it can include network equipment, servers, or vehicle-mounted equipment in networks evolving after 5G. Network equipment can also be modules or units that perform some of the functions of a base station; for example, it can be a central unit (CU) or a DU.

[0140] In this embodiment, the means for implementing the function of the network device can be the network device itself, or it can be a means that enables the network device to implement the function, such as a chip system, which can be installed in the network device. The chip system can be composed of chips, or it can include chips and other discrete components.

[0141] In another possible scenario, multiple network devices collaborate to assist the terminal in achieving wireless access, with each network device performing a portion of the base station's functions. For example, network devices could be CUs, DUs, CUs (control plane, CP), CUs (user plane, UP), or radio units (RUs). CUs and DUs can be configured separately or included in the same network element, such as a BBU. RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0142] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open radio access network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules. The embodiments of this application do not limit the specific technology or specific device form used in the network device.

[0143] Terminal equipment can be a device that provides voice and / or data connectivity to users; it can also be a device with wireless connectivity. Terminal equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on water (such as on ships); and it can also be deployed in the air (such as on airplanes, balloons, and satellites). Terminal equipment can also be referred to as user equipment (UE), access terminal, terminal, subscriber unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, wireless network equipment, user agent, or user device. In this application embodiment, terminal devices include, but are not limited to: cellular phones, mobile phones, wireless data cards, wireless modems, tablets, laptop computers, notebook computers, handheld computers, mobile internet devices (MIDs), computers with wireless transceiver capabilities, cordless phones, session initiation protocol (SIP) phones, smartphones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handsets with wireless communication capabilities, computing devices or other devices connected to wireless modems, in-vehicle devices (e.g., cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), wearable devices (e.g., smartwatches, smart bracelets, pedometers, smart glasses, etc.), satellite terminals, terminal devices in the Internet of Things or the Internet of Vehicles, as well as any form of terminal in future networks, relay user equipment, or terminals in future evolved public land mobile networks (PLMNs), etc.Terminal devices can also be virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light UE, reduced capability UE (REDCAP UE), machine-type communication (MTC) terminals, terminal devices in industrial control, terminal devices in self-driving, terminal devices in telemedicine, terminal devices in smart grids, wireless terminals in transportation safety, terminal devices in smart cities, terminal devices in smart homes, tactile terminal devices, smart home devices (e.g., refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in self-driving, or flying devices (e.g., smart robots, hot air balloons, drones, airplanes), etc. The terminal device can also be a vehicle device, such as a complete vehicle device, an in-vehicle module, an in-vehicle chip, an on-board unit (OBU), or a telematics box (T-BOX). The terminal device can also be other devices with terminal functions; for example, it can be a device that functions as a terminal in device-to-device (D2D) communication. This application does not limit the scope of the embodiments in this regard.

[0144] In this application embodiment, the device for implementing the functions of the terminal device can be the terminal device itself, or it can be any device capable of supporting the terminal device in implementing the functions, such as a chip or chip system. This device can be installed in the terminal device. The chip system can consist of chips or include chips and other discrete components. In the technical solution of this application embodiment, the device for implementing the functions of the terminal device is referred to as the terminal device, which can also be called a terminal. The following description may use a UE (User Equipment) as an example to illustrate the technical solution provided in this application embodiment.

[0145] The roles of base stations and terminals can be relative. For example, the helicopter or drone 112i in Figure 1 can be configured as a mobile base station. For terminals 112j that access the wireless access network 110 via 112i, terminal 112i is a base station; however, for base station 111a, 112i is a terminal, meaning that 111a and 112i communicate via a wireless air interface protocol. Of course, 111a and 112i can also communicate via a base station-to-base station interface protocol. In this case, relative to 111a, 112i is also a base station. Therefore, both base stations and terminals can be collectively referred to as communication devices. 111a and 111b in Figure 1 can be called communication devices with base station functions, and 112a-112j in Figure 1 can be called communication devices with terminal functions.

[0146] Network devices and terminal devices can communicate via wireless links. The transmission link from a network device to a terminal device can be called a downlink (DL) or downlink channel, used for transmitting downlink signals. The transmission link from a terminal device to a network device can be called an uplink (UL) or uplink channel, used for transmitting uplink signals. The transmission link from one terminal device to another can be called a sidelink (SL) or sidelink channel, used for transmitting sidelink signals.

[0147] Figure 2 is a schematic diagram of another communication system 200. As shown in Figure 2, network device 210 and terminal device 230 can communicate through relay node 220. There can be one or more relay nodes 220. For example, system 200 can be a single-hop system or a multi-hop relay system.

[0148] For example, a relay node may include a small cell, an integrated access and backhauling (IAB) node, a DU, a terminal, a TRP, or other network or terminal equipment, etc. The relay node 220 can be used for uplink or downlink transmission, or for sidelink transmission between multiple terminal devices.

[0149] This application can be used in random access scenarios, unlicensed transmission scenarios, scenarios where multiple terminals use the same radio network temporary identifier (RNTI), scenarios for monitoring the physical downlink control channel (PDCCH), or scenarios where multiple terminals monitor the same physical downlink shared channel (PDSCH).

[0150] This application can be applied to terminals that are in a connected or active state, or to terminals that are in a disconnected or idle state.

[0151] As the number of users continues to increase, interference may occur between multiple users. Therefore, how to effectively reduce interference between multiple users in MA technology is an urgent problem to be solved.

[0152] Figure 3 is a schematic flowchart of a communication method 300 provided in an embodiment of this application. Method 300 effectively reduces interference between multiple users in MA technology by mapping user sequences to multiple layers and performing symbol-level power adjustment on the sequences, thereby reducing the probability that users are in the same dimension (e.g., the same layer and the same power). Optional operations in method 300 are shown in Figure 3 with dashed lines.

[0153] S340, the first device acquires the first sequence.

[0154] The first sequence may include N symbols, where N is a positive integer. These symbols may be referred to as data, information, modulation symbols, modulation data, modulation information, or other names; this application does not limit the specific name used.

[0155] For example, the first sequence can be a sequence of symbols determined after channel coding and constellation modulation. Alternatively, the first sequence can be determined based on N codewords.

[0156] As an example, the first sequence could be a symbol stream obtained by modulating the bit stream output after channel coding. As another example, the first sequence could be a portion of the data in the aforementioned symbol stream.

[0157] In some possible implementations, S340 includes: a first means determining a first sequence. For example, the first means may obtain a symbol sequence through channel coding and constellation modulation.

[0158] In some other possible implementations, S340 includes: the first device reading the first sequence. For example, the first device may read the first sequence from a memory (or a storage module). The memory may be located within or outside the first device; the memory may be located within or outside the device in which the first device is located, and this application is not limited in this regard.

[0159] For ease of description, the first sequence may be represented as s in embodiments of this application. k Among them, s k =[s k (1),…,s k (N)] T . s k (1) to s k (N) can be a complex number. The first sequence can also be represented as... in, This represents a complex number, ∈ indicates belonging to, and N×1 indicates a size of N rows and 1 column. The superscript " T " indicates transpose.

[0160] Here, k can represent a user identifier, such as the identifier of the first device. Thus, the first sequence can also be referred to as the sequence of user k. In some possible implementations, embodiments of this application can be applied to a communication system with multiple users, where the first device can be one of the multiple users. Each of the multiple users can use method 300 to send or receive data, thereby reducing interference between these users.

[0161] The following are examples of possible implementation scenarios for the first and second devices.

[0162] Scenario 1: The first device is a first terminal device, and the second device is a network device. In the relay scenario shown in Figure 2, the first device can be a relay node.

[0163] Scenario 2: The first device is a network device, and the second device is a first terminal device. In the relay scenario shown in Figure 2, the first device can be a relay node.

[0164] Scenario 3: The first device is a first terminal device, and the second device is a second terminal device. In the relay scenario shown in Figure 2, the first device can be a relay node.

[0165] In scenario 1, user k can represent a first device, and user l can represent another terminal device besides the first device. In scenario 2, user k can represent a second device, and user l can represent another terminal device besides the second device. In scenario 3, for example, user k can represent the first device, and the second device can represent user l.

[0166] For ease of understanding, user k may be used below to refer to the first device (or the second device).

[0167] This application does not limit the specific form of the first sequence, for example, the above s k =[s k (1),…,s k (N)] T It is a column vector; the first sequence can also be a row vector s. k =[s k (1),…,s k (N)].

[0168] This application does not limit the specific name of the first sequence, which may also be called a first symbol sequence, a first vector, a first symbol vector, or other names. When the first sequence is represented in vector form, it can be a row vector or a column vector; this application does not limit this.

[0169] S350, the first device maps the first sequence to L second sequences. Where L can be an integer greater than or equal to 2.

[0170] Among them, the L second sequences can correspond one-to-one with the L layers. The i-th second sequence among the L second sequences can include T first elements, where T can be a positive integer and i can be an integer from 1 to L (e.g., i = 1, ..., L). The T first elements can include N i Non-zero elements and TN i N zero elements. i A non-zero element can belong to N symbols.

[0171] Among them, the L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment based on multiple adjustment parameters.

[0172] The L second sequences correspond one-to-one with the L layers. This can be understood as the i-th second sequence in the L second sequences corresponding to the i-th layer in the L layers. Alternatively, it can be understood as one of the L second sequences corresponding to one of the L layers.

[0173] In some possible implementations, one of the L layers can correspond to one or more antenna ports. In some possible implementations, the sequence corresponding to one of the L layers is pre-coded and then mapped to one or more antenna ports for transmission. The sequence corresponding to a layer can be one of the L second sequences, or it can be a sequence obtained by processing a second sequence (e.g., a sequence obtained by power-adjusting a second sequence). For example, layer #1 is one of the L layers. Layer #1 can correspond to antenna port 1 and antenna port 2. Thus, the sequence corresponding to layer #1, after pre-coding, can be mapped to antenna port 1 and antenna port 2.

[0174] In some examples, L layers can correspond one-to-one with L antenna ports. Thus, the one-to-one correspondence between L second sequences and L layers can also be replaced by the one-to-one correspondence between L second sequences and L antenna ports.

[0175] In other examples, one of the L layers can correspond to multiple antenna ports.

[0176] In some other possible implementations, the L layers can be replaced by L antenna ports. That is, there is a one-to-one correspondence between the L second sequences and the L antenna ports.

[0177] The L mentioned above can be understood as the number of spatial streams, transmission layers, antenna ports, or ports for user k, etc.

[0178] The process of mapping the first sequence to L second sequences can also be understood as splitting all modulation symbols in the first sequence into L sub-data streams (or layers). Each layer can correspond to one or more antenna ports.

[0179] S360, the first device outputs a third sequence or L second sequences. Correspondingly, the second device acquires the third sequence or L second sequences.

[0180] S370, the second device determines the first sequence based on the third sequence or the L second sequences. The first sequence includes the N symbols.

[0181] For example, if the L second sequences are determined by power adjustment based on multiple adjustment parameters, in S360, the first device can output the L second sequences, and correspondingly, the second device can acquire the L second sequences. In S370, the second device can determine the first sequence based on the L second sequences.

[0182] For example, if a third sequence is determined after L second sequences are used to adjust power based on multiple adjustment parameters, in S360, the first device can output the third sequence, and correspondingly, the second device can acquire the third sequence. In S370, the second device can determine the first sequence based on the third sequence.

[0183] The following section introduces S360 and S370 with reference to Figure 4.

[0184] Figure 4 is a schematic diagram of sparse mapping and power adjustment provided in an embodiment of this application. The following describes, with reference to Figure 4, relevant examples of mapping a first sequence to L second sequences.

[0185] For ease of description, the L second sequences can be viewed as a matrix, for example, called a mapping matrix. In Figure 4(a), the mapping matrix formed by the L second sequences can be X. k In Figure 4(b), the mapping matrix formed by the L second sequences can be A. k Figure 4 uses L=3 as an example, but this application is not limited to this, and L can also be other values.

[0186] Mapping Scheme 1

[0187] The scheme shown in Figure 4(a) can be denoted as Mapping Scheme 1. In Mapping Scheme 1, the first sequence is sparsely mapped to obtain L second sequences. Furthermore, the L second sequences can be adjusted in power to obtain a third sequence. In Mapping Scheme 1, the L second sequences can be sequences without power adjustment. The L second sequences, after power adjustment, can obtain a third sequence.

[0188] In mapping scheme 1, the first device maps the first sequence to L second sequences, which can be understood as the first device performing sparse mapping on the first sequence to obtain L second sequences.

[0189] Mapping Scheme 2

[0190] The scheme shown in Figure 4(b) can be denoted as Mapping Scheme 2. In Mapping Scheme 2, the first sequence is adjusted by power to obtain the first sequence'. Furthermore, the first sequence' can be sparsely mapped to obtain L second sequences. In Mapping Scheme 2, the L second sequences can be sequences that have undergone power adjustment.

[0191] In mapping scheme 2, the first device maps the first sequence to L second sequences. This can be understood as the first device first adjusting the power of the first sequence, and then performing sparse mapping on the power-adjusted first sequence to obtain L second sequences.

[0192] The following describes an example of sparse mapping.

[0193] The i-th second sequence in the L second sequences may include T first elements. The i-th second sequence can be regarded as the i-th row or the i-th column of the mapping matrix. For ease of description, this application embodiment takes the i-th second sequence as the i-th row of the mapping matrix as an example for specific description, and the example of the i-th second sequence as the i-th column will not be elaborated.

[0194] The i-th second sequence is considered as the i-th row of the mapping matrix. Thus, the i-th row of the mapping matrix can include T first elements. That is, each row of the mapping matrix can include T first elements. Since the mapping matrix has L rows, it can be considered an L-row, T-column matrix. For example, in Figure 4(a), X... k For example, in Figure 4(b), A... k .

[0195] The T first elements can include N i Non-zero elements and TN i There are T zero elements. Those skilled in the art will understand that the aforementioned T first elements represent all elements of the i-th second sequence. Therefore, as i changes from 1 to L, the aforementioned T first elements can correspond to all elements of each row. Thus, as i changes from 1 to L, each second sequence can include N zero elements. i Non-zero elements and TN i There are N zero elements, or in other words, each row of the mapping matrix can include N zero elements. i Non-zero elements and TN i Zero elements.

[0196] In some examples, for some values ​​of i, N i It can be 0. Thus, for the values ​​of i mentioned above, the elements in the corresponding i-th second sequence can all be 0. That is, the mapping matrix can contain rows where all elements are 0.

[0197] Where, N i A non-zero element can belong to N symbols. Those skilled in the art will understand that, for different values ​​of i, N i The non-zero elements differ. For example, as i changes, N... i Each symbol can be taken from a subset of N symbols.

[0198] For example, in mapping scheme 1, This can be understood as the N symbols in the first sequence being distributed across the mapping matrix X through a sparse mapping. k In each row. For example, in mapping scheme 2, This can be understood as follows: the N symbols in the first sequence, after power adjustment, are distributed across the mapping matrix A through sparse mapping.k In each row.

[0199] In other examples, the mapping matrix can be an L-column T-row matrix, which will not be elaborated further.

[0200] Each of the T first elements can be one-to-one with a T time-frequency resource. Here, T can be the number of time-frequency resources occupied by the first device. Thus, the sparse mapping can also be called a two-dimensional sparse mapping between the spatial and time-frequency domains.

[0201] In some examples, the T time-frequency resources can be T different frequency domain units (e.g., subcarriers) from the same time domain unit (e.g., symbol, time slot, frame, second, or millisecond, etc.). In other examples, the T time-frequency resources can be T different time domain units from the same frequency domain unit. However, this application is not limited in this respect.

[0202] For example, taking the NR physical uplink shared channel (PUSCH) as an example, a resource element (RE) is the smallest scheduling unit in the resource grid. A RE can occupy the duration of one orthogonal frequency-division multiplexing (OFDM) symbol in time, and a RE can occupy the bandwidth of one subcarrier in frequency. In this case, the aforementioned T time-frequency resources can be T REs; depending on the time and subcarrier of the RE, the aforementioned T REs can be T REs located on different subcarriers within the same OFDM symbol, T REs located on different OFDM symbols within the same subcarrier, or T REs on different OFDM symbols and different subcarriers.

[0203] For example, the j-th second sequence among the T first elements corresponds to the j-th time-frequency resource among the T time-frequency resources, where j is an integer derived from T from 1. Alternatively, it can be understood that one of the T first elements corresponds to one of the T time-frequency resources.

[0204] Those skilled in the art will understand that the aforementioned T first elements represent all elements of the i-th second sequence. Therefore, as i progresses from 1 to L, the aforementioned T first elements can correspond to all elements in each row. Thus, as i progresses from 1 to L, each of the T first elements can correspond one-to-one with the T time-frequency resources.

[0205] For example, referring to Figure 4(a), the L second sequences can be viewed as a mapping matrix X. k Wherein, the mapping matrix X kThe T columns can be mapped one-to-one with T time-frequency resources. For example, the mapping matrix X k The j-th column in the matrix X corresponds to the j-th time-frequency resource in the T time-frequency resources. Alternatively, it can be understood as a mapping matrix X. k One column corresponds to one of the T time-frequency resources.

[0206] For example, referring to Figure 4(b), the L second sequences can be viewed as a mapping matrix A. k Wherein, the mapping matrix A k The T columns can be matched one-to-one with the T time-frequency resources. For an example, see Figure 4(a) above, which will not be repeated here.

[0207] In some possible implementations, there is a one-to-one correspondence between the T first elements and the T time-frequency resources. This can be understood as the fact that one of the T first elements (or a column of the mapping matrix) can be sent on the corresponding time-frequency resource among the T time-frequency resources.

[0208] Sparse mapping can be based on the mapping function Execution. For example, in mapping scheme 1, the first device can be based on the mapping function. Sparse mapping is applied to the first sequence to obtain L second sequences. For example, in mapping scheme 2, the first device can determine the sequence based on the mapping function. Sparse mapping is performed on the first sequence after power adjustment to obtain L second sequences.

[0209] Mapping function This can also be understood as a mapping rule. Thus, sparse mapping can be understood as the N symbols (or elements) of the first sequence being placed into L second sequences (or mapping matrices X) according to the mapping rule. k The different positions of ) and any symbol among the N symbols occupies only L second sequences (or can be regarded as a mapping matrix X). k A position of ). Thus, the first sequence to L second sequences (or viewed as a mapping matrix X) k ) is a one-to-one mapping relationship.

[0210] For example, the first device can map a sequence having the form of the first sequence but with different values ​​to L sequences having the form of the L second sequences but with different values ​​(or consider it as another mapping matrix).

[0211] Mapping function This is related to user k. For example, different users can have different mapping functions. For instance, for user l, the mapping function can be expressed as... Because sparse mapping introduces zero elements, In the case of different mapping functions, user l obtains a mapping matrix X by following the same process as in Figure 4(a). l The mapping matrix X with user k k The correlation also exhibits sparsity. That is, the mapping matrix X l The positions of non-zero elements and the mapping matrix X k The positions of non-zero elements are partially different, mostly different, or completely different, which helps to reduce interference between multiple users.

[0212] Mapping function The specific meaning of sparse mapping and specific implementation examples will be discussed later and will not be elaborated here.

[0213] The process of sparse mapping is similar to that of layer mapping. However, the difference lies at least in that traditional layer mapping is dense mapping.

[0214] Dense mapping can be understood as splitting a sequence into multiple sequences, each corresponding to a different layer. The sum of the data lengths of all layers after dense mapping equals the total data length before dense mapping. In other words, the combined data length of all layers after splitting equals the data length before splitting.

[0215] Sparse mapping can also be understood as splitting a sequence into multiple sequences, each corresponding to a different layer. In some examples of embodiments of this application, the first sequence can be sparsely and irregularly split, for example, by inserting zero elements at different positions in each layer. In this way, the data length of all layers after splitting is greater than the data length before splitting. In some possible implementation scenarios, the positions of the zero elements in each layer can be independent of each other.

[0216] It is evident that sparse mapping can be considered relative to dense mapping. For example, if a first sequence is densely mapped to obtain a certain sequence result, this sequence result often does not include zero elements. In the embodiments of this application, sparse mapping is performed on the first sequence or the first sequence after power adjustment, and the resulting L second sequences may include zero elements.

[0217] Sparse mapping can also be understood as L*T>N, meaning the total number of elements in the sequence after sparse mapping is greater than the total number of symbols before sparse mapping. In other words, sparse mapping adds zero elements.

[0218] In the embodiments of this application, both "*" and "×" can represent multiplication operations, and the two can be substituted for each other.

[0219] Sparse mapping can also be understood as L*T>>N, meaning that the total number of elements in the sequence after sparse mapping is much greater than the total number of symbols before sparse mapping. In other words, sparse mapping adds a significant number of zero elements.

[0220] For example, the L second sequences include (L*TN) zero elements. For instance, the mapping matrix X... k It includes (L*TN) zero elements.

[0221] The following is an example of power adjustment.

[0222] Referring to Figure 4(a), in mapping scheme 1, the L second sequences are used to determine the third sequence after power adjustment based on the multiple adjustment parameters. In Figure 4(a), the third matrix M is used. k Power adjustment is performed. Figure 4(a) is an example for ease of understanding; multiple adjustment parameters can also be arranged in other ways, such as vectors. This application does not limit the specific form of the adjustment parameters.

[0223] For example, the first device can map the matrix X k and the third matrix M k Performing Hadamard multiplication yields the third sequence A. k In this context, Hadamard multiplication can be represented by "⊙". For example, the third sequence A... k It can be represented as: A k =X k ⊙M k .

[0224] Among them, the third matrix M k It can be represented as:

[0225] Referring to Figure 4(b), in mapping scheme 2, the L second sequences are determined by power adjustment based on multiple adjustment parameters.

[0226] In Figure 4(a), the adjustment parameter M′ is used. k Power adjustment is performed. Figure 4(b) is an example for ease of understanding only and does not constitute a limitation of this application. For example, multiple adjustment parameters may have other arrangements.

[0227] For example, the first device can map the matrix X k and adjusting parameter M′ k Perform Hadamard multiplication to obtain the first sequence 's'. k For example, the first sequence 's' k It can be represented as: s′ k =s k⊙M′ k .

[0228] Among them, adjusting parameter M′ k It can be represented as:

[0229] Multiple adjustment parameters can be used to adjust all or some of the N symbols. In other words, power adjustment can be applied to all or some of the N symbols.

[0230] For example, multiple adjustment parameters can be represented as m in Figure 4. k (n). In some examples, n is an integer taken from N, starting from 1. For example, n = 1, ..., N. Thus, in m k When all n are not equal to 1, the power adjustment applies to all symbols out of N symbols; when m k When there is a 1 in (n), the power adjustment is applied to a subset of the N symbols, i.e., to m. k (n) is a symbol for parts that are not equal to 1.

[0231] In other examples, n can be taken from a subset of integers from 1 to N. For example, suppose N = 4, n = 1, 2, 4. Then s k (1), s k (2) and s k (4) After power adjustment, s k (3) No power adjustment was performed. The above scheme achieves power adjustment only for a portion of the N symbols by omitting some adjustment parameters.

[0232] In some possible implementations, the multiple adjustment parameters may include a first adjustment parameter and a second adjustment parameter. The first and second adjustment parameters can be used to adjust the power of two non-zero elements in the L second sequences, respectively. For example, the first adjustment parameter can be represented as m. k (1), used for non-zero elements s k (1) Perform power adjustment; the second adjustment parameter can be expressed as m k (2), used for non-zero elements s k (2) Adjust the power.

[0233] The first adjustment parameter and the second adjustment parameter are different. For example, if the values ​​of the first adjustment parameter and the second adjustment parameter are different, the power adjustments made to the two non-zero elements in the L second sequences will be different, so that the power of at least two non-zero elements in the L second sequences will be different.

[0234] The above scheme can be understood as follows: among multiple adjustment parameters, there are two adjustment parameters with different values; or it can be understood as multiple adjustment parameters not being completely identical.

[0235] Those skilled in the art will understand that, when multiple adjustment parameters are exactly the same, the same power adjustment is applied to each non-zero element. This approach can be referred to as "signal-granular" power adjustment.

[0236] In multiple adjustment parameters, the adjustment parameters for the non-zero elements corresponding to each time-frequency resource are exactly the same, but there are at least two sets of different adjustment parameters. These at least two sets of adjustment parameters correspond to the non-zero elements of at least two time-frequency resources, respectively. This scheme can be called "time-frequency resource granularity" power adjustment. For example, referring to Figure 4, the adjustment parameters corresponding to one column of the mapping matrix are the same, but there are at least two sets of different adjustment parameters. These at least two sets of adjustment parameters correspond to at least two columns in the mapping matrix, respectively. Furthermore, embodiments of this application can also support "layer granularity" power adjustment.

[0237] Among the multiple adjustment parameters, at least two are different. Whether these at least two adjustment parameters correspond to different time-frequency resources is not specified. This scheme can be called "symbol-level" power adjustment.

[0238] The following is an example of power adjustment at the "time-frequency resource granularity".

[0239] In some examples, among multiple adjustment parameters, the adjustment parameters corresponding to the same first element can be the same, and the adjustment parameters corresponding to different first elements can be different or the same. However, among the multiple adjustment parameters, there are at least two different sets of adjustment parameters, and these two different sets of adjustment parameters correspond to different first elements.

[0240] For example, referring to the example in Figure 4, the adjustment parameters corresponding to a column of the mapping matrix can be the same, and the adjustment parameters of two columns of the mapping matrix can be different or the same. However, in the mapping matrix, there are at least two columns with different adjustment parameters. As another example, the non-zero elements in a column of the third matrix can be the same, and the adjustment parameters of two columns of the third matrix can be different or the same. However, in the third matrix, there are at least two columns with different adjustment parameters. For yet another example, m... k (1) and m k (2) can be the same, while m k (1) with m k (N) can be different, m k (2) with m k (N) can be different; m k (1) with m k (N) can also be the same, m k(2) with m k (N) can also be the same. However, among multiple adjustment parameters, there are at least two different sets of adjustment parameters.

[0241] The following is an example of power adjustment at the "symbol granularity".

[0242] In some examples, at least two of the multiple adjustment parameters are different, regardless of whether the adjustment parameters refer to the same first element. For example, referring to the example in Figure 4, there are two non-zero elements in the mapping matrix that correspond to different adjustment parameters. Another example is the third matrix, where at least two non-zero elements are different. Yet another example is m... k (1) to m k In (N), at least two adjustment parameters are different.

[0243] This application does not limit the specific name of the adjustment parameter. For example, the adjustment parameter may also be called power factor, amplitude factor, power adjustment parameter, amplitude adjustment parameter, mask parameter (e.g., mask matrix) or other names.

[0244] This application does not limit the specific name of power adjustment. For example, power adjustment may also be called power masking, amplitude adjustment, amplitude masking or other names.

[0245] S360 is described below. S360 may include: a first device outputting a third sequence or L second sequences. Correspondingly, a second device acquiring the third sequence or L second sequences.

[0246] For example, in mapping scheme 1, the first device outputs the third sequence, and correspondingly, the second device acquires the third sequence. The third sequence is obtained by adjusting the power of L second sequences.

[0247] For example, in mapping scheme 2, the first device outputs L second sequences, and correspondingly, the second device acquires L second sequences. These L second sequences are obtained through power adjustment.

[0248] The following is an example of the first device outputting the third sequence.

[0249] Referring to Figure 4(a), the first device is used for the third sequence A. k Precoding yields the first signal.

[0250] For example, the first signal can be a signal transmitted by multiple antennas. The first signal can be represented as Z. k For example, Z k =F k A k .in, F k It can be a precoding matrix. For example, Where, N t This can represent the number of antennas in the first device. Here, the antennas can be actual physical antennas or equivalent transmitting antenna ports. For example, L can be greater than or equal to 1 and less than or equal to N. t .

[0251] In some examples, the first device outputting a third sequence may include: the first device outputting a first signal according to precoding processing, the first signal carrying (or including) the third sequence.

[0252] After the precoding process described above, the third sequence can be mapped to L or more antenna ports, thus allowing the first signal to carry the third sequence on L or more antenna ports. The rules for mapping the third sequence to the antenna ports can be found in the description above of "a one-to-one correspondence between L second sequences and L layers".

[0253] The following is an example of the first device outputting L second sequences.

[0254] Referring to Figure 4(b), the first device maps L second sequences (or can be viewed as a mapping matrix A) to L second sequences. k By precoding, the first signal can be obtained.

[0255] In some examples, the first device outputs L second sequences, which may include: the first device outputs a first signal according to precoding processing, the first signal carrying (or including) L second sequences.

[0256] After the precoding process described above, L second sequences can be mapped to L or more antenna ports, thus the first signal can carry L second sequences on L or more antenna ports. The rules for mapping L second sequences to antenna ports can be found in the description above that "L second sequences correspond one-to-one with L layers".

[0257] The following are examples of possible implementation scenarios for the first and second devices.

[0258] In scenario 1 (also known as the uplink scenario), the first device (i.e., the first terminal device) can perform uplink transmission to the second device (i.e., the network device), and the second device can receive data sent by the first device. The second device can send configuration information to the first device. For example, the configuration information may include the aforementioned mapping function. And / or, adjust parameters (e.g., the third matrix M) k Alternatively, adjust parameter M′ k ).

[0259] In scenario 2 (also known as the downlink scenario), the first device (i.e., the network device) can transmit data downlink to the second device (i.e., the first terminal device), and the second device can receive data sent by the first device. The first device can send configuration information to the second device. Further examples will not be provided.

[0260] In scenario 3 (also known as the side-link scenario), the first device (i.e., the first terminal device) can perform side-link transmission to the second device (i.e., the second terminal device), and the second device can receive data sent by the first device. The network device can send configuration information to both the first and second devices. Further examples will not be provided.

[0261] S370 is described below. S370 may include: a second device determining a first sequence based on the third sequence or the L second sequences. The first sequence includes the N symbols.

[0262] For example, in mapping scheme 1, the second device obtains the third sequence, and in S370, the second device determines the first sequence based on the third sequence.

[0263] For example, in mapping scheme 2, the second device acquires L second sequences, and in S370, the second device determines the first sequence based on the L second sequences.

[0264] The second device can demodulate the third sequence or L second sequences based on a mapping function and adjustment parameters to obtain the first sequence. Alternatively, the second device can demodulate the first signal carrying the third sequence or L second sequences based on a mapping function and adjustment parameters to obtain the first sequence.

[0265] The demodulation scheme can be a linear receiver scheme or a nonlinear receiver scheme. For example, the demodulation scheme can be the receiver scheme in technical report (TR) 38.812 in version (V) 16.0.0, which will not be elaborated further.

[0266] The above scheme maps user sequences to multiple symbols across multiple layers. When multiple users reuse these multiple layers, the scheme reduces the probability of users sharing the same symbol at the same layer, i.e., reduces the probability of user collisions, thereby effectively reducing interference between multiple users in MA technology. Furthermore, traditional power schemes adjust at the user or layer granularity, while the above scheme allows for finer-grained adjustments (e.g., symbol-level adjustments). This means that even if some users happen to be on the same symbol at the same layer, they are likely to have different power levels, thus distinguishing more users and improving channel capacity while reducing user interference. Therefore, the above scheme enables more efficient multi-user transmission.

[0267] The architectural benefits of mapping scheme 1 are analyzed below as an example.

[0268] Matrix A after sparse mapping and power adjustment k (The third sequence in mapping scheme 1, or the L second sequences in mapping scheme 2), can be processed by the precoding matrix F k The shaping forms N t The first signal Z transmitted on the physical antenna k The first signal Z k It can include N t ×T signals, or in other words, the first signal

[0269] Taking scenario 1 as an example, assuming that the frequency domain channels experienced by users on T time-frequency resources remain unchanged, the received signal Y of the second device superimposed with the signals of K users (which may include the first device, such as user k) can be expressed as:

[0270] Among them, y i (j) can represent the received signal of receiving antenna i on the j-th time-frequency resource out of T time-frequency resources. Here, receiving antenna i can be understood as antenna port i, that is, the i-th antenna port out of L antenna ports. H can represent the additive white Gaussian noise matrix received by the second device (i.e., the receiving side) on T time-frequency resources. k It can represent the frequency domain channel matrix between the k-th first device and the second device.

[0271] Vectorizing the received signal Y, we can obtain:

[0272] The function vec() can be used to vectorize the parameters within the parentheses. This can represent the Kronecker product. T It can represent an identity matrix of dimension T×T.

[0273] Define position vector b k for:

[0274] Among them, b k (i) represents the position vector b k The i-th element in t. k (i) represents the above vector t k The i-th element in.

[0275] From the above definition, we can obtain the position vector b k It includes (L*TN) zero elements. The mapping matrix X... kIt also includes (L*TN) zero elements. Therefore, the position vector b k With mapping matrix X k They have the same sparsity.

[0276] Thus, the correlation matrix P between user k and user l k,l It can be represented as:

[0277] Among them, the superscript " H " indicates conjugate transpose. H l and F l The meaning can be found in the aforementioned H. k and F k The meaning of . b l The meaning can be found in the previous b. k The meaning of H. The difference lies in the fact that H... l F l and b l These are the parameters for user l, while H... k F k and b k It is a parameter for user k.

[0278] From the correlation matrix P k,l As can be seen from the formula, the correlation matrix P k,l Not only affected by the inter-user channel correlation matrix Send weights and F l It is also affected by the position vector The impact. Even But as long as Therefore, user k and user l can have orthogonal transmission. Even if... Due to the position vector Including (L*TN) zero elements, b k With b l The less overlap of the element "1" in the matrix, the stronger the correlation matrix P between users. k,l The more zero elements there are, the lower the correlation. k With b l The less overlap of the element "1" in the mapping matrix, the less overlap of the non-zero elements (i.e., symbols) in the mapping matrix.

[0279] Based on the above analysis, interference between users can be represented by a sparse mapping vector b. k and b l Reconstruction and reduction can help improve channel capacity.

[0280] Furthermore, due to the introduction of the power vector m k =vec(M kIn this application embodiment, different m can be configured. k To achieve fine-grained (e.g., symbol-by-symbol, layer-by-layer, or time-frequency resource-by-time) power adjustment, that is, when the total transmit power P0 is the same, the power adjustment coefficient m at position i and position j is different. k (i)≠m k (j). For example, b at position j k When (j) = 0, m k (j) = 0. Therefore, the power originally transmitted at position j can be allocated to position b. k (i) At position i (i) ≠ 0, the signal-to-interference-plus-noise ratio (SINR) of user k at position i is increased, thereby increasing the channel capacity of user k. And the b of user k and user l... k ≠b l Even if user k and user l have the same total transmission power, they may still get different values ​​for m. k m l The method of adjusting the transmission power of users k and l at different locations. For example, b k (i)=b l When (i) = 1, both user k and user l occupy position i simultaneously, but only when m k (i)≠m l (i) Then, distinguishing between user k and user l in the power domain is beneficial for reducing interference between users and also improves channel capacity.

[0281] The analysis of the architectural benefits of scenarios 2 and 3 is similar to that of scenario 1 above, and will not be repeated here.

[0282] The analysis of the architectural benefits of mapping scheme 2 is similar to that of mapping scheme 1 above, and will not be repeated here.

[0283] The following are some examples of mapping a first sequence to L second sequences using mapping scheme 1, specifically S350. In the examples below, the first sequence can be split, padded with zeros, and interleaved to obtain L second sequences.

[0284] In some possible implementations, S350 includes: S351, the first device divides the first sequence into L seventh sequences, wherein the i-th seventh sequence among the L seventh sequences includes N i S352, the first device determines L eighth sequences, wherein the i-th eighth sequence includes the i-th seventh sequence and TN. i S353, the first device interweaves the L eighth sequences respectively to obtain the L second sequences.

[0285] As can be seen, the first sequence, after being segmented, padded with zeros, and interleaved, yields L second sequences. Therefore, those skilled in the art will understand that the first sequence is determined according to the segmentation parameter N. i The interleaving parameters (e.g., the first interleaving parameter) are mapped to L second sequences.

[0286] S351 can be understood as the first sequence s k Divide into L seventh sequences Among them, the i-th seventh sequence Including N i A symbol.

[0287] Here, the segmentation can be performed according to certain rules, which can be called segmentation rules. For example, the segmentation rule can be "sequential segmentation". The first N1 symbols of the first sequence can be used as the first seventh sequence. Among the remaining N-N1 symbols, the first N2 symbols can be used as the second seventh sequence. And so on.

[0288] However, this application does not limit this, and the segmentation rule can be any other rule.

[0289] For example, the i-th seventh sequence

[0290] S352 can be understood as the first device determining L eighth sequences, each with a length of T. The i-th eighth sequence may include the i-th seventh sequence. (that is, N) i (number of symbols) and length TN i All-zero sequences (i.e., TN) i (a zero element).

[0291] It is understandable that the i-th eighth sequence is obtained by padding the i-th seventh sequence with zeros. As i ranges from 1 to L, the first device can perform the aforementioned zero-padding operation on each of the L seventh sequences to obtain L eighth sequences. In other words, the first device can perform the aforementioned zero-padding operation on the i-th seventh sequence among the L seventh sequences to obtain the i-th eighth sequence among the L eighth sequences.

[0292] In some examples, the i-th seventh sequence It can be located in a length of TN i Before or after the all-zero sequence. For example, the i-th seventh sequence. It can be located in a length of TN i Before the all-zero sequence, the i-th eighth sequence can be represented as in, It can be of length TN iA sequence of all zeros.

[0293] In other examples, the i-th seventh sequence It can also be located at a length of TN i In the middle of a sequence of all zeros, for example, the i-th seventh sequence Previously, there was a sequence of all zeros containing a subset of zero elements; the i-th seventh sequence... Then there is another set of zero elements in this all-zero sequence.

[0294] In some other examples, the i-th seventh sequence With a length of TN i A sequence of all zeros can be interleaved.

[0295] S353 can be understood as the first device interleaving the eighth sequence obtained from each seventh sequence to obtain L second sequences.

[0296] In some possible implementations, S353 includes: a first device interleaving L eighth sequences according to a first interleaving parameter to obtain L second sequences.

[0297] For example, let x be the i-th second sequence among L second sequences. k,i ,but This formula represents the first interlacing parameter Para. k,i For the i-th eighth sequence Interleave the sequences to obtain the i-th second sequence out of the L second sequences, which is x. k,i .

[0298] This application does not limit the specific name of the first interleaving parameter. For example, the first interleaving parameter may also be called the first permutation parameter, the first interleaving permutation parameter, the first parameter, or have other names.

[0299] Where any N i It can be less than or equal to T, therefore, at least one x k,i Includes zero elements.

[0300] As i takes different values, N i They can be different. For example, N1 = 3, N2 = 4. That is, the first first sequence in the L second sequences includes 3 non-zero elements (i.e., symbols), and the second first sequence includes 4 non-zero elements (i.e., symbols).

[0301] The first interleaving parameter can have L values, where Para k,i It can be the i-th of L first interleaving parameters. As i takes different values, the first interleaving parameter Para... k,iThey can be different. Thus, the positions of the zero elements in two of the L second sequences are not exactly the same. For example, suppose... Due to Para k,1 ≠Para k,2 One possible result is x k,1 = [1,0,1], x k,2 =[0,1,1].

[0302] The following section, with reference to Figure 5, presents a specific example of how the first sequence is mapped to L second sequences through splitting, zero-padding, and interleaving.

[0303] Figure 5 is a schematic diagram of the sparse mapping provided in an embodiment of this application. Figure 5 assumes L = 2, T = 4, N = 3, N1 = 2, N2 = 1. By applying the first sequence s... k =[s k (1),s k (2),s k (3)] T By performing splitting, zero-padding, and interleaving, we can ultimately obtain L second sequences, the first of which can be x. k,1 =[s k (1), 0, s k (2),0], the second second sequence can be x k,2 =[s k (3),0,0,0].

[0304] For example, for the first sequence s k =[s k (1),s k (2),s k (3)] T After segmentation, two seventh sequences are obtained, namely the first seventh sequence. and the second seventh sequence Padding the two seventh sequences with zeros yields the first eighth sequence. and the second eighth sequence Interleave the two eighth sequences mentioned above to obtain the mapping matrix X. k As shown in Figure 5.

[0305] Based on the above scheme, L second sequences can be obtained by splitting, padding with zeros, and interleaving the first sequence. These operations are simple and have low processing overhead.

[0306] The above describes an example of mapping a first sequence to L second sequences using mapping scheme 1, which involves splitting, padding with zeros, and interleaving. The following describes an example of mapping a first sequence to L second sequences using mapping scheme 2, which involves splitting, padding with zeros, and interleaving.

[0307] For mapping scheme 2, in some possible implementations, S350 includes: S354, the first device adjusts the power of the first sequence according to multiple adjustment parameters to obtain the first sequence'; S355, the first device divides the first sequence' into L seventh sequences', where the i-th seventh sequence' among the L seventh sequences' includes N i S356, the first device determines L eighth sequences ', the i-th eighth sequence 'of the L eighth sequences ' includes the i-th seventh sequence ' and TN. i S357, the first device interweaves the L eighth sequences respectively to obtain the L second sequences.

[0308] For S354, please refer to the description of power adjustment above, and it will not be repeated here.

[0309] S355, S356 and S357 can be found in the descriptions of S351, S352 and S353 above, respectively. The difference is that the first sequence in front is replaced with the first sequence here.

[0310] The following are examples of parameters indicating splitting, zero-padding, and interleaving.

[0311] In some possible implementations, the method 300 further includes: S310, the first device receiving or transmitting first information, the first information being used to indicate at least one of the following: L, T, N, a first interleaving parameter, or L N's. i Correspondingly, the second device receives or sends the first information.

[0312] For example, in scenario 1 (i.e., the uplink scenario), the first device can receive the first information, and the second device can transmit the first information. Figure 3 shows an example of scenario 1, but this application can also be applied to other scenarios. In Figure 3, "L / T / N / first interleaving parameter / L times N" i "Can represent at least one of the following: L, T, N, the first interleaving parameter, or L N's i .

[0313] For example, in scenario 2 (i.e., downlink scenario), the first device can send the first information and the second device can receive the first information.

[0314] For example, in scenario 3 (i.e., side-view scenario), the first device can receive first information from the network device, and the second device can receive first information from the network device.

[0315] For example, in L, T, N, the first interleaving parameter or L N i In this context, content not indicated by the first information may be predefined or preconfigured.

[0316] The foregoing mapping function may include at least one of the following: L, T, N, the first interleaving parameter, or L Ns i . When the mapping function is for user k, the mapping function indicated by the first information can be expressed as For example, in Scenario 1, the first device may be user k. In Scenario 2, the second device may be user k. In Scenario 3, the first device may be user k.

[0317] Where N can be understood as the length of the original data (i.e., the length of the first sequence). L and T can be understood as mapping matrix parameters.

[0318] Optionally, the first information is further used to indicate a segmentation rule. The segmentation rule can be used to indicate the way of segmenting the first sequence into L sequences. For example, the segmentation rule can be "sequential segmentation". The segmentation rule can also be predefined or preconfigured, and the present application is not limited thereto.

[0319] L Ns i can also be understood as the i-th N i , or expressed as For example, when L = 3, L Ns i may include N1, N2, and N3.

[0320] The first information is used to indicate L Ns i It can be a direct indication. For example, the first information may include L Ns i . Exemplarily, when L = 3, the first information may include N1, N2, and N3. The first information is used to indicate L Ns i It can be an indirect indication. For example, the first information may include L - 1 Ns i . Exemplarily, when L = 3, the first information may include N1 and N2. The receiving end of the first information can determine N3 = N - N1 - N2. Another example is that the first information can indicate the identity (or index) of L Ns, and the receiving end of the first information can determine L Ns according to the identity (or index) and a predefined or preconfigured rule i . i .

[0321] The first interleaving parameter can be used to interleave L eighth sequences to obtain L second sequences. Exemplarily, the first interleaving parameter may include L Paras k,i , or understood as the i-th Para k,i , or expressed as

[0322] In some examples, the first interleaving parameter can be associated with a first device (or a second device). For example, the first interleaving parameter can be a parameter of user k; in other words, the first interleaving parameter can be for user k; in other words, the first interleaving parameter can correspond to user k.

[0323] For ease of description, the first interleaving parameter corresponding to user k is denoted as the first interleaving parameter k, which may belong to the first interleaving parameter set. For example, the first interleaving parameter set may also include the first interleaving parameter l, representing the first interleaving parameter associated with user l.

[0324] Each first interleaving parameter in the first interleaving parameter set can be configured at the granularity of per user, and different users can have different first interleaving parameters.

[0325] Optionally, the first information is further used to indicate a first mapping rule. The first mapping rule can indicate the aforementioned interleaving operation of the L sequences (e.g., the eighth sequence or the eighth sequence'). Thus, the first device can interleave the L eighth sequences or the L eighth sequences' according to the first mapping rule and the first interleaving parameters to obtain L second sequences.

[0326] This application does not limit the first mapping rule to be indicated only by the first information. For example, the first mapping rule can also be predefined or preconfigured.

[0327] Based on the above scheme, the first information can indicate the method of mapping the user's sequence to multiple layers. The first device can map the first sequence to L second sequences corresponding to L layers according to the first information, or the first device can send the first information to the data receiving end, so that the data receiving end can decode according to the first information to obtain the first sequence.

[0328] In some possible implementations, the first information is also used to indicate the T time-frequency resources and / or the L layers.

[0329] This scheme can be understood as follows: the first information, in addition to indicating the mapping function, can also indicate the scope of application of that mapping function. For example, the first information can indicate the time-frequency resources and / or the antenna ports to which the mapping function is applied.

[0330] For example, the first information may include indices of T time-frequency resources and / or indices of L layers. The indices can be replaced with location information, identifiers, information, sequence numbers, or other names.

[0331] In some examples, the first information indicates L layers, including: the first information includes information about L or more antenna ports. That is, the first information can indicate L layers in the form of antenna port information.

[0332] In other examples, the aforementioned L layers are replaced with L antenna ports; that is, the first information is also used to indicate T time-frequency resources and / or L antenna ports. For example, the first information may include the indices of the T time-frequency resources and / or information about the L antenna ports.

[0333] The antenna port information can indicate which antenna ports the first device specifically used to transmit the aforementioned first signal. The specific antenna ports used by the first device can be associated with a weight or reference signal.

[0334] Taking the NR PUSCH channel as an example, assume the first device has P antenna ports, denoted as antenna port 1, antenna port 2, ..., antenna port P. These P antenna ports can be indicated using a transmitted precoder matrix index (TPMI) or a sounding reference signal (SRS) resource indicator (SRI). For example, the antenna port information can include TPMI or SRI to indicate which of the P antenna ports are associated with the mapping function.

[0335] Based on the above scheme, the first information can indicate the parameters of the mapping function (for example, each parameter includes at least one of the following: L, T, N, the first interleaving parameter, or L N). i The scope of application of the mapping function is thus defined. In this way, the first device can use the various parameters of the mapping function described above to map the first sequence into L second sequences within a specific time-frequency resource and / or layer range.

[0336] The following describes an example of updating the mapping function described above. For instance, the network device can update the mapping function based on user (e.g., first terminal device or second terminal device) pairing and / or interference conditions.

[0337] The following description uses network equipment, a first terminal equipment, and a second terminal equipment as examples. The first terminal equipment is UE (denoted as UE1), and the second terminal equipment is also UE (denoted as UE2).

[0338] In scenario 1 (i.e., uplink transmission), the first device can be UE1, the second device can be a network device, and UE2 can be another UE different from the first device. In scenario 2 (i.e., downlink transmission), the first device can be a network device, the second device can be UE1, and UE2 can be another UE different from the second device. In scenario 3 (i.e., sidelink transmission), the first device can be UE1, the second device can be UE2, and the network device can be a device other than the first and second devices.

[0339] Assume UE1 accounts for N RE Each time-frequency resource is divided into N RE / T group time-frequency resources. For example, the mapping rules and / or mapping functions may include one of the following three methods (denoted as Method 1, Method 2 and Method 3 respectively).

[0340] Method 1: UE1 and UE2 reuse all the aforementioned time-frequency resources. Thus, for UE1, N RE Each group in group / T uses the same mapping rules and / or mapping functions. For example, N RE If / T = 2 groups, then both groups use the same mapping rules and / or mapping functions.

[0341] Method 2: UE1 and UE2 share a portion of time-frequency resources, while UE1 and UE3 share another portion of time-frequency resources. For example, N RE / T = 2 groups. The time-frequency resources of the first group are multiplexed with UE2, and the time-frequency resources of the second group are multiplexed with UE3. The mapping rules and / or mapping functions corresponding to the time-frequency resources multiplexed with UE2 can differ from those corresponding to the time-frequency resources multiplexed with UE3. For example, for UE1, assume N... RE / T = 2 groups, and the mapping rules and / or mapping functions corresponding to the first group can be different from the mapping rules and / or mapping functions corresponding to the second group.

[0342] Method 2 is merely an example and not a limitation. For instance, the time-frequency resources occupied by UE1 may be multiplexed with more UEs. Thus, UE1 may have more different mapping rules and / or mapping functions. In some possible cases, the mapping rules and / or mapping functions for each group of UE1 may be different. In other words, each group of time-frequency resources of UE1 may use its own independent mapping rules and / or mapping functions. In other words, the mapping rules and / or mapping functions for any two groups within the multiple groups of UE1 may be different.

[0343] Method 3: UE1 is multiplexed with UE2 in some time domain units (e.g., time slots 1 to K1, where K1 is an integer greater than 1), and multiplexed with UE3 in other time domain units (e.g., time slots K1+1 to K1+1+K2, where K2 is an integer greater than 2). The mapping rules and / or mapping functions used by UE1 for the time-frequency resources corresponding to the time domain units multiplexed with UE2 may differ from the mapping rules and / or mapping functions used by UE1 for the time-frequency resources corresponding to the time domain units multiplexed with UE3.

[0344] Method 3 is only an example and is not intended to limit the scope. For example, UE1 can reuse time-frequency resources corresponding to different time-domain units with more UEs.

[0345] In some examples, mapping rules and / or mapping functions can be associated with antenna ports. For instance, a mapping rule and / or mapping function can be associated with a set of antenna ports (including one or more antenna ports). In this way, a sequence sparsely mapped using the mapping rule and / or mapping function can be transmitted through that set of antenna ports.

[0346] Those skilled in the art will understand that mapping rules and / or mapping functions can be associated with antenna ports, but do not mean they are bound to antenna ports. That is, the same group of antenna ports can use different mapping rules and / or mapping functions on different time-frequency resource groups. The same mapping rules and / or mapping functions can also be associated with different antenna port groups on different time-frequency resource groups. For example, the determination of the above association can be made by the network device side, or by the terminal side based on an algorithm.

[0347] The aforementioned first information can be referred to as configuration information, or belongs to configuration information. First information is an example form of configuration information. Other forms of configuration information will be introduced later. Unless otherwise specified, descriptions of other forms of configuration information can be found in the example of first information above, and will not be repeated hereafter. For example, configuration information may include at least one of the following: first information, second information, or third information.

[0348] The following describes some further examples of how S350 in mapping scheme 1 maps a first sequence to L second sequences. In the examples below, the first device can map a first sequence to L second sequences based on position information.

[0349] In some possible implementations, S350 includes: S358, whereby the first device maps the first sequence to the L second sequences based on position information. The position information can be used to indicate the positions of the N non-zero elements corresponding to the N symbols in the L second sequences.

[0350] For example, the first device can place the symbols in the first sequence into L second sequences based on the positions indicated by the position information. Alternatively, the first device can divide the symbols in the first sequence into L groups, each group containing the same number of symbols. The first device can then, based on the position information, sequentially place the symbols from each group into one of the L second sequences. Yet another example: the first device can divide the symbols in the first sequence into L groups, each group containing the same number of symbols. The first device can add TN / L zero elements to each group. The first device can then, based on the position information, sequentially map N / L symbols and TN / L zero elements from each group into one of the L second sequences.

[0351] The location information can be determined by the first device itself, or it can be pre-configured or pre-defined, or it can be sent to the first device by other devices (e.g., the second device), or it can be determined by the first device based on information sent by other devices (e.g., the second device).

[0352] Based on the above scheme, the first device can map the first sequence to L second sequences. The above scheme is simple to operate and has a small processing delay.

[0353] In some possible implementations, the location information includes a first matrix (also called a position matrix) of size L*T. This first matrix may include N first indications and (L*TN) second indications. The N first indications can be used to indicate the N non-zero elements, and the (L*TN) second indications can be used to indicate the (L*TN) zero elements.

[0354] Here, L*T can represent L rows and T columns, or T rows and L columns. The first matrix can have the same size as the L second sequences (which can also be represented as a mapping matrix). For example, if the L second sequences can be L rows and T columns, then the first matrix can also be L rows and T columns. Another example is that the first matrix can be T rows and L columns, and the transpose of the first matrix can also be L rows and T columns.

[0355] N first indication messages can each indicate N non-zero elements. In this way, the first device can place N symbols into the positions of the N non-zero elements in L second sequences.

[0356] In some examples, the positions of N first indicators in a first matrix can indicate the positions of N non-zero elements in L second sequences.

[0357] For example, the value of the first indication information can be 1. Thus, in the first matrix, an element with a value of 1 indicates that the position of that element contains a symbol from the first sequence. However, this application is not limited to this; the first indication information can also have other values.

[0358] The N second indication messages can each indicate (L*TN) zero elements. In this way, the first device can fill the positions of the (L*TN) zero elements in the L second sequences with zero elements.

[0359] For example, the value of the second indication information can be 0. Thus, in the first matrix, an element with a value of 0 can indicate that the position of that element is 0 (or, in other words, there is no symbol from the first sequence). However, this application is not limited to this; the second indication information can also have other values.

[0360] For example, suppose N = 3, L = 3, T = 3. An example of mapping a first matrix to L second sequences (hereinafter referred to as the mapping matrix) is as follows:

[0361] In this equation, the matrix on the left can be the first matrix, and the matrix on the right can be the mapping matrix.

[0362] In the example above, the first indication information can be located in the 1st row and 2nd column, the 1st row and 3rd column, and the 3rd row and 3rd column, respectively. This first indication information can be used to indicate that the three symbols in the first sequence are placed in the 2nd element, 3rd element, and 3rd element of the first second sequence, and the 3rd element of the third second sequence, respectively. Alternatively, the first indication information can be used to indicate that the three symbols in the first sequence are placed in the 1st row and 2nd column, the 1st row and 3rd column, and the 3rd row and 3rd column of the mapping matrix. The order in which the three symbols are placed in the three positions can be pre-configured or predefined, determined by the first device, or indicated by other devices to the first device.

[0363] This application does not limit the specific name of the first matrix. The first matrix may also be called a pattern, design, mapping pattern, mapping design, sparse mapping pattern, sparse mapping design, codebook, mapping codebook, sparse mapping codebook or other names.

[0364] Based on the above scheme, location information can be indicated in the form of a matrix. The first device can quickly map the first sequence to L second sequences according to the first matrix, with a small processing delay.

[0365] This application does not limit the specific form of the location information, and the location information may not be indicated in the form of a matrix. For example, the location information may consist of only N first indication information, where the content of the N first indication information can respectively indicate the position of N non-zero elements in L second sequences. Exemplarily, the first indication information can be positive integers. Two examples are given below, denoted as Example 1-1 and Example 1-2, respectively.

[0366] Example 1-1: The first indication information includes N values, which are taken from 1 to L*T. These N values ​​are used to indicate the positions of the N symbols in the L second sequences.

[0367] Taking L=3, T=3, N=3 as an example, the first indicator information takes the value of any three numbers from 1 to 9. For instance, the first indicator information could be 2, 3, or 9, indicating that the three symbols in the first sequence are placed at the second, third, and third elements of the first, third, and third second sequences, respectively. It can be understood that the third element of the third second sequence is equivalent to the ninth element of the three second sequences. Therefore, a first indicator information value of 9 indicates the third element of the third second sequence.

[0368] Example 1-2: The first indication information includes L groups of values. The i-th group of values ​​in L groups includes N. i There are several numerical values ​​for N. i The values ​​are taken from 1 to T. The above N... i Each of the values ​​is used to indicate N. i The position of a symbol in the i-th second sequence of L second sequences.

[0369] Taking L=3, T=3, N=3 as an example, the first indication information includes three sets of values. The first set of values ​​includes the values ​​2 and 3. The second set includes 0 values. The third set includes the value 3. Thus, the "2" and "3" in the first set indicate that the two symbols in the first sequence are placed in the second and third elements of the first of the three second sequences; the "3" in the third set indicates that the one symbol in the first sequence is placed in the third element of the third of the three second sequences.

[0370] The following is an example of how the first device obtains the first matrix.

[0371] In some possible implementations, the first matrix may be predefined, preconfigured, or indicated to the first device by other means.

[0372] In some other possible implementations, the first matrix may be determined by the first device. Two examples of the first device determining the first matrix are described below, denoted as Example 2-1 and Example 2-2, respectively.

[0373] Example 2-1, the first matrix based on the interleaver.

[0374] In Example 2-1, the L second sequences can be equally sparse. For example, any two second sequences can have the same number of symbols, i.e., N i= N / L. In this way, the sparsity levels of any two of the L second sequences are the same. However, the positions of the symbols in any two of the L second sequences may be the same or may not be the same.

[0375] The L second sequences can be represented as a mapping matrix with L rows and T columns. In this way, the mapping matrix can also be called a row-equi-sparse matrix. Because the sparsity levels of any two rows in this mapping matrix are the same. Row-equi-sparse can also be understood as that the number of zero elements in any two rows of the mapping matrix is the same, but the positions of the zero elements may be the same or may not be the same.

[0376] The following introduces row-equi-sparse.

[0377] Given the numerical values of L, T, and N, (L×T)! / (N!×(L×T - N)!) different first matrices can be obtained. The first matrix can be used to implement the sparse mapping from the first sequence to the L second sequences. However, the number of the above first matrices is too large, which is not conducive to communication indication. The inventor found through simulation that the row-equi-sparse mapping can provide most of the gains of the above sparse mapping.

[0378] In this way, the first matrix can be a row-equi-sparse matrix. The row-equi-sparse matrix can include a row-overlap matrix and a row-interleave matrix. Among them, the positions of the zero elements in any two rows of the row-overlap matrix are exactly the same. The row-interleave matrix can be a row-equi-sparse matrix other than the row-overlap matrix.

[0379] Exemplarily, the interleaver in Example 2-1 can be a linear polynomial permutation (LPP) interleaver. However, this application is not limited thereto, and the interleaver in Example 2-1 can also be other interleavers.

[0380] The following introduces the algorithm of the LPP interleaver.

[0381] The LPP interleaver can implement the mapping from a sequence x with length T to a sequence y with the same length. The above process can be expressed by the following formula. y = π(x) = mod(f1x + f2, T)

[0382] Where, 0 ≤ f2 < T, 1 ≤ f1 ≤ T, and T and f1 are relatively prime. Relatively prime can be understood as that T and f1 have no common divisor other than 1. π() represents inputting the sequence in the brackets into the LPP interleaver for interleaving (or permuting). mod(fix + f2, T) can represent taking the modulus of f1x + f2 with respect to T.

[0383] The following example illustrates this. Suppose x = [0,1,2,3], f1 = 3, f2 = 0, T = 4, then the sequence obtained after permutation is y = [0,3,2,1]. That is, the fourth element "3" of x is replaced by the second element of y, and the second element "1" of x is replaced by the fourth element of y. Generalizing to a general sequence, if x = [a(0),a(1),a(2),a(3)], then y = [a(0),a(3),a(2),a(1)].

[0384] In this way, different interleaving (or permutation) can be achieved by configuring different f1 and f2. For example, for an invariant sequence, i.e., y = x, f1 = 1 and f2 = 0 can be configured. As another example, for an overlapping and colliding sequence, i.e., y and x have at most one collision, or in other words, y and x have at most one element in the same position, where the collision point is the i-th position, then y(i) = x(i), and f1 ≠ 1, f2 ≠ 0 can be configured.

[0385] Here, mod(f1x+f2,T) can also be represented as π(x). For example, the first matrix can be determined based on the binary sequence and the second matrix. In the above case, x is a binary sequence. In the case of, for example, the q-th second matrix in the second matrix set It can be represented as follows:

[0386] in, This can represent the q-th second matrix in the first matrix set of user k. Wherein, As i changes from 1 to L, π k,i () can be changed.

[0387] In some examples, the i-th interleaving function π for user k k,i The parameters are all generated based on f1 and f2. In this way, the network device can determine the second matrix by sending a small number of parameters, thus saving transmission overhead.

[0388] The following is an example of determining the first matrix based on a nested LPP interleaver.

[0389] In some possible implementations, the method 300 further includes: a first device determining the first matrix based on a second matrix of size L*T and a binary sequence. The elements of each row of the second matrix can be used to indicate the position of the binary sequence in the corresponding row of the first matrix.

[0390] Figure 6 is a schematic diagram of determining the first matrix according to an embodiment of this application. Figure 6 uses a binary sequence [1,0,0,0,1], L=3, T=5, and N=6 as an example. Figure 6 is only an example, and the above parameters (e.g., L, T, N, binary sequence, f1 or f2) can be other values. The following describes an example of determining the first matrix based on a nested LPP interleaver with reference to Figure 6.

[0391] A binary sequence may include T indication messages, which consist of N / L first indication messages and TN / L second indication messages. The descriptions of the first and second indication messages can be found above. For example, referring to Figure 6, a binary sequence may include 5 indication messages (T = 5), where the 5 indication messages may include 2 first indication messages (represented by "1" in Figure 6) and 3 second indication messages (represented by "0" in Figure 6). The first and second indication messages may also be represented by other numerical values, which are not limited in this application.

[0392] Here, "binary" can represent that there are two types of information in the binary sequence, namely, a first indication and a second indication. The weight of the binary sequence can be N / L, indicating that the binary sequence includes N / L first indications.

[0393] This application does not limit the specific name of the binary sequence, which may also be called a sequence, sparse sequence, binary sparse sequence or other names.

[0394] The i-th row of the second matrix includes T first position numbers, which are used to indicate the positions of the T indication information in the i-th row of the first matrix.

[0395] Let's first introduce the first position number.

[0396] For example, the T first position numbers can be T positive integers from 1 to T. For instance, referring to Figure 6, the 5 first position numbers (T=5) can be arranged from largest to smallest as 1, 2, 3, 4, 5. However, this application does not restrict the order of the T first position numbers in the i-th row of the second matrix. For example, assuming T=3 and i=1, the elements in the first row of the second matrix can be 1, 2, 3, or 2, 1, 3.

[0397] For example, the first position in the i-th row and j-th column of the second matrix is ​​numbered p, which can indicate that the j-th element of the binary sequence is located in the p-th position (i.e., the p-th column) of the i-th row of the first matrix, where p is an integer greater than or equal to 1 and less than or equal to T.

[0398] For example, referring to Figure 6, the first position in the second row and third column of the second matrix is ​​numbered "1", which can indicate that the third element "0" of the binary sequence [1,0,0,0,1] is located in the first position in the second row of the first matrix.

[0399] For example, suppose the first position in the i-th row and j-th column of the second matrix is ​​numbered 1, which indicates that the j-th element of the binary sequence is located in the first position (i.e., the first column) of the i-th row of the first matrix. For another example, if the first position in the i-th row and j-th column of the second matrix is ​​numbered 2, it indicates that the j-th element of the binary sequence is located in the second position (i.e., the second column) of the i-th row of the first matrix.

[0400] The first position number can start from 1 or 0. If the first position number starts from 0, then the first position number in the i-th row and j-th column of the second matrix is ​​p, indicating that the j-th element of the binary sequence is located in the p+1-th position (i.e., the p+1-th column) of the i-th row of the first matrix. For example, if the first position number in the i-th row and j-th column of the second matrix is ​​3, then the j-th element of the binary sequence is located in the 4-th position (i.e., the 4th column) of the i-th row of the first matrix.

[0401] This application does not limit the specific name of the first position number. The first position number may also be called the first number, the first index, the first identifier, the first position index, the first position identifier, or other names.

[0402] The second matrix will be introduced below.

[0403] The i-th row of the second matrix includes T first position numbers, which are used to indicate the positions of the T indication information in the i-th row of the first matrix. Thus, i ranges from 1 to L, and each row of the second matrix can include T first position numbers. In other words, the T first position numbers in each row of the second matrix can indicate the positions of the T indication information in the corresponding rows of the first matrix.

[0404] This application does not limit the specific name of the second matrix, which may also be called a position (Pos) matrix or other names.

[0405] The following example, using a binary sequence [1,0,0,0,1], L=3, T=5, N=6, illustrates how to determine the first matrix. Referring to Figure 6, an example of determining the first matrix based on the second matrix is ​​as follows:

[0406] In this equation, the matrix on the left can be the second matrix, and the matrix on the right can be the first matrix.

[0407] In the example above, the first row of the second matrix is ​​[1,2,3,4,5]. Here, the first position number "1" indicates that the first element of the binary sequence (i.e., 1) is placed in the first row and first column of the first matrix. The first position number "2" indicates that the second element of the binary sequence (i.e., 0) is placed in the first row and second column of the first matrix, and so on. Therefore, when the T first position numbers in the i-th row of the second matrix are arranged in ascending order, the i-th row of the first matrix represents a binary sequence.

[0408] In the example above, the second row of the second matrix is ​​[5,3,1,2,4]. The first position number "5" indicates that the first element of the binary sequence (i.e., 1) is placed in the 2nd row and 5th column of the first matrix. The first position number "3" indicates that the second element of the binary sequence (i.e., 0) is placed in the 2nd row and 3rd column of the first matrix.

[0409] In the example above, the third row of the second matrix is ​​[2,4,3,1,5]. The first position number "2" indicates that the first element of the binary sequence (i.e., 1) is placed in the third row and second column of the first matrix. The first position number "4" indicates that the second element of the binary sequence (i.e., 0) is placed in the third row and fourth column of the first matrix.

[0410] For example, suppose the first matrix is ​​represented as B k The binary sequence is represented as The i-th row of the second matrix can be represented as Pos k,i The element in the i-th row and j-th column of the second matrix can be represented as Pos. k,i (j). Thus, B k The element in the i-th row and j-th column can be The Pos in k,i (j) elements.

[0411] Among them, Pos k,i It can also be called a position sequence, position permutation sequence, position interleaving sequence, or other names.

[0412] It is understandable that different first matrices can be obtained from the same second matrix and different binary matrices. For example, the q-th binary sequence and the second matrix can yield the q-th first matrix in the set of first matrices, where q can be a positive integer. This set of first matrices can also be called a mapping codebook set, a mapping pattern set, a mapping diagram set, or other names.

[0413] For example, the binary matrix can be determined by the first device or indicated by other devices. Taking scenario 1 as an example, the second device can issue different binary matrices multiple times, so that the first device obtains different first matrices, thereby achieving the maintenance of the mapping function.

[0414] Based on the above scheme, the first device can quickly determine the first matrix based on the binary sequence and the second matrix, without requiring other devices to send the complete first matrix. Therefore, the above scheme reduces processing latency while also reducing transmission overhead.

[0415] For example, the second matrix may be determined by the first device itself, or it may be fully indicated by other devices, or it may be determined by the first device through a small number of parameters indicated by other devices.

[0416] The following is an example of how the first apparatus determines the second matrix using a small number of parameters (e.g., f1 and f2). This example can also be referred to as an example of determining the first matrix based on nested LPP.

[0417] In some possible implementations, the method 300 further includes: a first device determining the second matrix based on a first position sequence and a second interleaving parameter. For example, the first device may use the second interleaving parameter as a parameter of an LPP interleaver and the first position sequence as input to obtain the second matrix.

[0418] The first position sequence may include T second position numbers. For example, the T second position numbers can be arranged in ascending order. However, this application is not limited to this, and the T second position numbers can also have other arrangements, such as predefined or pre-configured arrangements.

[0419] For example, the T second position numbers may include T integers taken sequentially from 0 to T-1. For instance, the T second position numbers may be: 0, 1, ..., T-1.

[0420] This application does not limit the specific name of the second position number, which may also be called a second number, second index, second identifier, second position index, second position identifier, or other names.

[0421] This application does not limit the specific name of the first position sequence, which may also be called the first position vector or other names.

[0422] The second matrix comprises L second position sequences. These L second position sequences can be generated from the aforementioned first position sequences. In other words, the L second position sequences can be obtained through nesting or recursion.

[0423] For example, the first position sequence is the first second position sequence among the L second position sequences; when i is greater than 1, the i-th second position sequence among the L second position sequences is determined by interleaving the (i - 1)-th second position sequence according to the second interleaving parameter.

[0424] Based on the above solution, the first device can generate a second matrix in a nested or recursive manner according to the first position sequence and the second interleaving parameter. The above solution requires fewer input parameters and is easy to implement.

[0425] An example of determining L second position matrices is introduced below in combination with an exemplary formula.

[0426] For example, the second matrix can satisfy:

[0427] where Pos i represents the i-th second position sequence among the L second position sequences; "0:T - 1" represents 0, 1,..., T - 1; mod represents taking the modulus; f1 and f2 belong to the second interleaving parameter, f1 is an integer greater than or equal to 1 and less than or equal to T, f1 is relatively prime to T, and f2 is an integer greater than or equal to 0 and less than T. For example, 0 ≤ f2 < T, 1 ≤ f1 ≤ T. For example, referring to FIG. 6, substituting specific values of the second interleaving parameters f1 and f2 into the above formula can obtain the second matrix shown in FIG. 6.

[0428] Referring to the above formula, when i is greater than 1, the (i - 1)-th second position sequence among the L second position sequences can be used as the input sequence (or called input vector) of the i-th second position sequence.

[0429] The L second position sequences can respectively correspond to the L rows of the second matrix. The first row among the L rows of the second matrix can be the first position sequence, that is, 0, 1,..., T - 1. Among the L rows of the second matrix, the other rows except the first row can be determined according to the output value of the permutation of the previous row. That is, except for the first row, the permutation of each row of the second matrix can be determined by modifying the input value to the output value of the previous row.

[0430] Configuring different second interleaving parameters (for example, f1 and f2) can obtain different second matrices.

[0431] For example, if f1 = 1, f2 = 0, then the second matrix can be a row-overlapping matrix, that is, Pos i = 0:T - 1. Or rather, Pos i includes T integers taken in sequence from 0 to T - 1.

[0432] For another example, if f1 ≠ 1, f2 ≠ 0, then there is only one collision between adjacent rows of the second matrix. Or rather, Posi With Pos i-1 In the array, only one first position number has the same value and position.

[0433] For example, f1≠1, Then any two rows of the second matrix are different.

[0434] This application does not limit the specific name of the second position sequence, which may also be called the second position vector or other names.

[0435] In some examples, the second interleaving parameter can be associated with the first device (or the second device). For example, the second interleaving parameter can be a parameter for user k; in other words, the second interleaving parameter can be for user k; that is, the second interleaving parameter can correspond to user k.

[0436] For ease of description, the second interleaving parameter corresponding to user k is denoted as the second interleaving parameter k, which may belong to the set of second interleaving parameters. For example, the set of second interleaving parameters may also include the second interleaving parameter l, representing the second interleaving parameter associated with user l.

[0437] Each second interleaving parameter in the second interleaving parameter set can be configured at the per-user granularity; different users can have different second interleaving parameters. For example, the second interleaving parameter associated with user k mentioned above can also be expressed as: f k,1 and f k,2 This indicates that the aforementioned second interleaving parameter is associated with user k. Thus, the i-th second position sequence among the L second position sequences can be represented as Pos. k,i .

[0438] The example above, with reference to Figure 6, illustrates how the first matrix can be determined from the second matrix. The first matrix can also be determined directly from the binary sequence and the second interleaving parameter. This will be discussed in detail below.

[0439] In some possible implementations, method 300 further includes: a first device determining the first matrix based on a second interleaving parameter and a binary sequence.

[0440] The first matrix comprises L third position sequences. Specifically: the binary sequence is the first third position sequence among the L third position sequences; when i is greater than 1, the i-th third position sequence among the L third position sequences is determined by interleaving the (i-1)-th third position sequence according to the second interleaving parameter.

[0441] For example, the L sequences of third positions in the first matrix can satisfy:

[0442] Among them, b iThis represents the i-th third position sequence among L third position sequences. Other descriptions are as described above and will not be repeated here.

[0443] The following are examples of parameters used to determine location information (e.g., the first matrix).

[0444] In some possible implementations, the method further includes: S320, the first device receiving or transmitting second information. Optionally, the second information is used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence. In Figure 3, "L / T / N / second interleaving parameter / binary sequence" can represent at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence.

[0445] Correspondingly, the second device receives or sends the second information.

[0446] For example, in scenario 1 (i.e., the uplink scenario), the first device can receive the second information, and the second device can send the second information. Figure 3 shows an example of scenario 1, but this application can also be applied to other scenarios.

[0447] For example, in scenario 2 (i.e., downlink scenario), the first device can send the second information, and the second device can receive the second information.

[0448] For example, in scenario 3 (i.e., the side-view scenario), the first device can receive second information from the network device, and the second device can receive second information from the network device.

[0449] For example, in L, T, N, the second interleaving parameter, or the binary sequence, the content not indicated by the first information may be predefined or preconfigured, or may not require indication. For instance, with the interleaver unchanged, the second information may not indicate the second interleaving parameter.

[0450] The previous section introduced mapping functions. It can include at least one of the following: L, T, N, the first interleaving parameter, or an example of L Ni. Here, the mapping function It may include at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence. When the mapping function is for user k, the mapping function indicated by the second information can be expressed as: For example, in scenario 1, the first device can be user k. In scenario 2, the second device can be user k. In scenario 3, the first device can be user k.

[0451] In Example 2-1, the second information can indicate only a few parameters, such as the second interleaving parameter and the binary sequence. Thus, user k can generate a first matrix (or position matrix) based on a nested LPP algorithm. Subsequently, user k can map the first sequence to L second sequences based on the first matrix. For example, the first sequence's... The symbol to the first Each symbol (N / L symbols in total) can be sequentially mapped to the position of the first indication information in the i-th second sequence of L second sequences.

[0452] Different users can achieve sparse isolation by configuring different second interleaving parameters (e.g., f1 and f2) and binary sequences. For example, user k's f... k,1 f k,2 and Can be used with user l's f l,1 f l,2 and The difference is that even if user k and user l send or receive data on the same L layers and T time-frequency resources, the interference between the two users will be reduced because their data will not always be on the same layer and the same time-frequency resource at the symbol granularity.

[0453] Optionally, the second information is also used to indicate a second mapping rule. For example, the second mapping rule can be a row-by-row mapping, a column-by-column mapping, or other preset order mapping. In this way, the first device can, according to the second mapping rule, place the symbols in the first sequence into each row, each column, or other preset positions in the first matrix in sequence.

[0454] This application does not limit the second mapping rule to be indicated only by the second information. For example, the second mapping rule can also be predefined or preconfigured.

[0455] Based on the above scheme, the second information can indicate a small number of parameters, which can be used to determine the second matrix. The transmission overhead of the above scheme is relatively small.

[0456] Example 2-2, the first matrix (also called the position matrix) based on the third matrix (or power adjustment matrix).

[0457] In mapping scheme 1, the first device can adjust the power of L second sequences according to the third matrix to obtain the third sequence.

[0458] Optionally, in S320 above, the second information can be used to indicate the third matrix.

[0459] In some possible implementations, method 300 may further include: a first device determining a first matrix based on a third matrix. The third matrix may include multiple adjustment parameters. The positions corresponding to these multiple adjustment parameters may be the positions of first indication information. Thus, the first device can determine the first matrix based on the positions of the first indication information.

[0460] For example, the third matrix M k It can be represented as:

[0461] The first matrix can be determined based on the third matrix mentioned above. k for:

[0462] Where, m k The position of (n) can be replaced with the first indication information (the first indication information is "1" above).

[0463] Based on the above scheme, the first device can determine the position information (e.g., the first matrix) according to the third matrix used for power adjustment. In this way, the second information serves both to indicate the adjustment parameters and the position information. Compared to indicating the adjustment parameters and position information through different parameters, the above scheme can save transmission overhead.

[0464] In some possible implementations, the second information is also used to indicate the T time-frequency resources and / or the L layers.

[0465] This scheme can be understood as follows: in addition to indicating the mapping function, the second information can also indicate the scope of application of that mapping function. For example, the second information can indicate the time-frequency resources and / or the antenna ports on which the mapping function is applied.

[0466] For other examples, please refer to the previous example "The first information is also used to indicate the T time-frequency resources and / or the L layers". The difference is that the original "first information" is replaced with "second information" here, which will not be repeated here.

[0467] The above section introduced an example of sparse mapping; the following section will introduce some examples of power adjustment.

[0468] In this embodiment, power adjustment can be divided into power compensation and non-power compensation.

[0469] Power compensation can be used to transfer the power of unmapped time-frequency resources (or time-frequency resources mapped to all zero elements) to mapped signed time-frequency resources. Power compensation can also transfer the power of time-frequency resources mapped to a smaller number of symbols to time-frequency resources mapped to a larger number of symbols. The total power of the L second sequences remains unchanged before and after power compensation.

[0470] In the example of power compensation, the adjustment parameters (e.g., the third matrix) can be issued by the network device or determined by the terminal device (e.g., the first terminal device or the second terminal device).

[0471] More examples of power compensation can be found later in this article, and will not be elaborated here.

[0472] Non-power compensation refers to any power adjustment other than power compensation, and this application does not limit it.

[0473] In non-power compensation examples, the adjustment parameters can be issued by the network device.

[0474] In scenario 1, the first device is a first terminal device, and the second device is a network device. In scenario 2, the first device is a network device, and the second device is a first terminal device. In scenario 3, the first device is a first terminal device, and the second device is a second terminal device.

[0475] In some possible implementations, the adjustment parameters of the non-zero elements corresponding to two of the T time-frequency resources are different. That is to say, power adjustment can be at the "time-frequency resource granularity".

[0476] Power adjustment at the time-frequency resource granularity can be either power compensation or non-power compensation; this application does not limit this. For example, power compensation itself is at the time-frequency resource granularity. As another example, in the case of non-power compensation, the adjustment parameters issued by the network device can be the same for the same time-frequency resource, but not entirely the same for different time-frequency resources.

[0477] Based on the above scheme, the first device can adjust the power of multiple second sequences on different time-frequency resources. Therefore, in scenarios with multiple users, the above scheme can enable multiple users to transmit multiple second sequences at different powers on multiple time-frequency resources, thereby resulting in different interference levels for the multiple second sequences of multiple users on different time-frequency resources, and thus obtaining different power gains on different time-frequency resources. In some possible implementations, the total power of the L second sequences before power adjustment is equal to the total power of the L second sequences after power adjustment.

[0478] For example, using the example of power compensation, the total power of the L second sequences before power adjustment is equal to the total power of the L second sequences after power adjustment. Examples of power compensation will be introduced later and will not be elaborated upon here.

[0479] For example, without the above scheme, differentiating two users in the power domain requires two different total powers. However, with the above scheme, two users can have different power levels on different time-frequency resources at different layers while maintaining the same total power. This allows for differentiation between different users at different layers and time-frequency resources, thus enabling them to obtain different capacity gains in different power domains while maintaining the same total power. Based on this scheme, the communication system can accommodate more users with the same total power, improving channel capacity.

[0480] The following is an example of the form of the third matrix in power compensation.

[0481] In some possible implementations, the method 300 further includes: the first device adjusting the power of the L second sequences according to the third matrix to determine the third sequence.

[0482] For example, the third matrix can satisfy:

[0483] Here, M(i,j) can represent the element in the i-th row and j-th column of the third matrix.

[0484] Where T1 can represent the number of time-frequency resources carrying symbols in the T time-frequency resources, or T1 can represent the number of zero columns in the first matrix, or T1 can represent the number of non-zero columns in the mapping matrix.

[0485] Wherein, L1(j) can represent the number of symbols carried by the j-th time-frequency resource in the T time-frequency resources, or L1(j) can represent the number of non-zero elements in the j-th column of the first matrix, or L1(j) can represent the number of non-zero elements in the j-th column of the mapping matrix.

[0486] Wherein, P0 can represent the total power of the third sequence, or, P0 can represent the total power of L second sequences, or, P0 can represent the total power over L*T two-dimensional spatial-time-frequency resources.

[0487] For example, in the case where T time-frequency resources are T frequency domain units on one time domain unit (e.g., symbol), the above formula for determining the third matrix can be applied.

[0488] For example, when T time-frequency resources are T time-domain units on one frequency-domain unit, the above formula for determining the third matrix can be applied. Optionally, the third matrix can also satisfy the power constraint of the signal transmitted on the time-domain unit. Taking T time-domain units as symbols as an example, assuming that the upper limit of the power of each of the T symbols is P1, then...

[0489] Those skilled in the art will understand that, regardless of whether the T time-domain resources are different frequency-domain units on the same time-domain unit or different time-domain units on the same frequency-domain unit, the third matrix can amplify the data differences between the various spaces (e.g., various layers) on the aforementioned T time-domain resources, thereby obtaining non-orthogonal benefits in the power domain.

[0490] The following description uses P0=4 as an example. Based on different configurations of L and T, and different first matrices B, different third matrices M can be obtained. As shown in Table 1:

[0491] Table 1

[0492] As shown in Table 1, compared with the SDMA (Space Division Multiple Access) scheme and the traditional sparse code multiple access (SCMA) scheme, the transmission power of different spaces (corresponding to the rows of the third matrix) and time-frequency resources (corresponding to the columns of the third matrix) in the third matrix obtained in this application has significant differences.

[0493] For example, the first matrices corresponding to Examples 3-1 and 3-2 exhibit local conflicts. In Example 3-1, symbols can be mapped to the first position (denoted as position #1) and the third position (denoted as position #2) of the first second sequence. In Example 3-2, symbols can also be mapped to positions #1 and #2. The first second sequence in Examples 3-1 and 3-2 can correspond to the same antenna port, and the first and third positions correspond to the same time-frequency resources. Therefore, symbols belonging to two users may be transmitted on the same antenna port and the same time-frequency resources, leading to conflicts, i.e., interference.

[0494] However, the sparse mapping scheme described above also includes power compensation. In Example 3-1, the user at position #1 and position #2 adjusts the parameter by "1" and "2" respectively. Power adjustment is performed on the symbols to be transmitted; the user in Example 3-2 adjusts parameters at positions #1 and #2. The power of the symbols to be transmitted is adjusted. It is evident that two users can transmit symbols at different powers on the same antenna port and the same time-frequency resources, allowing the receiving end to distinguish between the two users by power. Therefore, the above scheme can achieve non-orthogonal benefits in the power domain. For example, the receiving end may include a successive interference cancellation (SIC) receiver.

[0495] Unlike traditional power adjustment schemes, the power adjustment scheme provided in this application embodiment has a finer compensation granularity. For example, in Example 3-1, the adjustment parameter corresponding to the first second sequence can be... In traditional power regulation schemes, the same adjustment parameters can only be set for power regulation within the same layer. Examples include the SCMA and SDMA schemes mentioned above.

[0496] The following describes how the third matrix is ​​determined in power compensation.

[0497] In some examples, the network device may only send the mapping function to user k. For example, the network device may only send the first message or the second message. The first message may indicate at least one of the following: L, T, N, a first interleaving parameter, or L times N. i The second information may indicate at least one of the following: L, T, N, the second interleaving parameter, or a binary sequence, while the second information does not indicate the third matrix.

[0498] In scenario 1, the first device can be user k. In scenario 2, the second device can be user k. In scenario 3, the first device can be user k.

[0499] User k can determine the first matrix based on the mapping function, and then determine the third matrix based on the first matrix.

[0500] For example, when the mapping function is indicated by the first information, and / or when the first device maps the first sequence to L second sequences by splitting, zero-padding, and interleaving, the first device can first map the first sequence to L second sequences, and then determine the first matrix (also called the position matrix) based on the positions of the non-zero elements (i.e., symbols) in the L second sequences. The first device can then determine the third matrix based on the first matrix.

[0501] For example, when the mapping function is indicated by the second information, and / or when the second device maps the first sequence to L second sequences by the position information, the first device can determine the third matrix based on the position information (e.g., the first matrix).

[0502] An example of determining the third matrix based on the first matrix is ​​described above and will not be repeated here.

[0503] In other examples, the network device may send only the third matrix to user k. For instance, the network device may only have access to the second information, which can be used to indicate the third matrix.

[0504] In this case, the network device no longer needs to issue the mapping function; user k can determine the mapping function (e.g., the first matrix) based on the third matrix. An example of determining the mapping function can be found in the previous description of sparse mappings, and will not be repeated here.

[0505] In power compensation, the mapping function and the third matrix can have a one-to-one correspondence. That is, given a fixed mapping function, the third matrix can be unique; and given a fixed third matrix, the mapping function can be unique.

[0506] The following are some examples of non-power compensation.

[0507] Unlike power compensation, in non-power compensation, there may be no direct correspondence between the mapping function and the multiple adjustment parameters. In other words, there is no binding or correlation between the mapping function and the multiple adjustment parameters.

[0508] For ease of distinction, the multiple adjustment parameters for non-power compensation can be referred to as the fourth matrix.

[0509] For example, the fourth matrix can be any matrix of size L*T. The fourth matrix can include N adjustment parameters, located at N positions corresponding to the symbols in the L second sequences. Thus, the first device can perform Hadamard multiplication of the fourth matrix with the L second sequences to achieve power adjustment.

[0510] For example, the fourth matrix can be the adjusted parameter M′ in Figure 4. k In other words, the fourth matrix can also be in vector form. A vector can be viewed as a special type of matrix.

[0511] In some possible implementations, in mapping scheme 1, the third sequence is determined by adjusting the power of the L second sequences according to the fourth matrix.

[0512] In some possible implementations, in mapping scheme 2, S350 includes: the first device adjusting the power of the first sequence according to the fourth matrix to determine the fourth sequence; and mapping the fourth sequence to the L second sequences.

[0513] For example, the fourth matrix can perform power adjustment at the time-frequency resource granularity. As another example, the fourth matrix can perform power adjustment at the symbol granularity. And yet another example, the fourth matrix can perform power adjustment at the layer granularity.

[0514] Based on the above scheme, the first device can adjust the power of L second sequences or first sequences according to the fourth matrix. The granularity of the power adjustment of the fourth matrix is ​​flexible; it can be at the time-frequency resource level, the symbol level, or the layer level. Therefore, the above scheme allows the first device to flexibly adjust the power of each symbol, thereby further reducing interference between multiple users.

[0515] The indication method of the fourth matrix is ​​described below.

[0516] In some implementations, method 300 further includes: S330, the first device receives or transmits third information, the third information indicating at least one of the following: the fourth matrix, the T time-frequency resources, or the L layers. Correspondingly, the second device receives or transmits the third information.

[0517] For example, in scenario 1 (i.e., the uplink scenario), the first device can receive the third information, and the second device can send the third information. Figure 3 shows an example of scenario 1, but this application can also be applied to other scenarios.

[0518] For example, in scenario 2 (i.e., downlink scenario), the first device can send third information and the second device can receive third information.

[0519] For example, in scenario 3 (i.e., the side-view scenario), the first device can receive third information from the network device, and the second device can receive third information from the network device.

[0520] The third information indicates T time-frequency resources and / or L layers, which can be understood as indicating the scope of the fourth matrix. For example, the third information can indicate the time-frequency resources and / or the antenna ports involved.

[0521] For other examples, please refer to the previous example "The first information is also used to indicate the T time-frequency resources and / or the L layers". The difference is that the original "first information" is replaced with "third information" here, which will not be repeated here.

[0522] The third information can directly indicate the fourth matrix; for example, it can include the complete fourth matrix or non-zero adjustment parameters within the fourth matrix. The third information can also indirectly indicate the fourth matrix. For example, it can include an identifier for the fourth matrix. The receiving end can then determine the fourth matrix corresponding to that identifier.

[0523] The aforementioned mapping matrix (e.g., X in Figure 4) k Or A k This includes (L*TN) zero elements. For example, the third information may simply indicate the N adjustment parameters in the fourth matrix corresponding to the non-zero elements (or symbols) of the mapping matrix.

[0524] For example, the third information can indicate the position, quantization precision, and value of N adjustment parameters, thereby enabling the indication of N adjustment parameters.

[0525] Those skilled in the art will understand that, for T time-frequency resources across L layers in the same group, in a power-compensated scheme, the mapping function can be bound to multiple adjustment parameters. However, in a non-power-compensated scheme, the mapping function and the multiple adjustment parameters can be independent.

[0526] For ease of description, the multiple adjustment parameters used to adjust a first sequence or L second sequences described above can be referred to as a set of adjustment parameters. The parameters used to map a first sequence or first sequence' to L second sequences (e.g., first interleaving parameter, second interleaving parameter, L, T, N, L N') i A sequence of two elements (or a binary sequence) can be called a set of mapping functions.

[0527] In some possible implementation scenarios, network devices can configure one set of mapping functions and multiple sets of tuning parameters for user k, or one set of tuning parameters and multiple sets of mapping functions. For example, a network device can be configured with one set of mapping functions to update the tuning parameters according to the requirements of different scenarios.

[0528] The power adjustment described above can be compatible with conventional power configurations. Alternatively, the power adjustment described above can be independent of conventional power configurations. For example, a conventional power configuration can be a long-term configuration, while the power adjustment described above can be a more granular power configuration across L*T resources (including spatial resources and time-frequency resources).

[0529] Taking power domain NOMA as an example, assuming L = 2 layers, the power configuration of user k in the two layers (denoted as layer #1 and layer #2) is as follows:

[0530] Among them, F k =[f k1 ,f k2 ], It is the precoding vector of the i-th layer in two layers (or replaced by the antenna port).

[0531] At this time, the power configuration on layer #1 is as follows: The power configuration on layer #2 is as follows

[0532] The power adjustment provided in this application embodiment is a more detailed power configuration across L×T resources, in the third matrix M. k Or the fourth matrix M k Under the influence of the third sequence A k Or the L second sequences A in mapping scheme 2 k It can also be expressed as:

[0533] As can be seen from the above formula, the symbol on layer #1 is used on the first time-frequency resource out of T time-frequency resources. The adjusted power transmission is used on the T-th time-frequency resource. Adjusted power transmission; symbols on layer #2 are used on the first of T time-frequency resources. The adjusted power transmission is used on the T-th time-frequency resource. Adjusted power transmission. Therefore, m ki (j) The power on a certain time-frequency resource was further adjusted.

[0534] The following examples, using scenario 1 as an example, further illustrate the relevant aspects of method 300. The behaviors of the first device (i.e., the network device) and the second device (i.e., the first terminal device) in scenario 2 can be referenced from the behaviors of the network device and the first terminal device in scenario 1, respectively. The behaviors of the first device (i.e., the first terminal device) and the second device (i.e., the second terminal device) in scenario 3 can be referenced from the behavior of the first terminal device in scenario 1.

[0535] In Scenario 1, the first device can be a first terminal device, and the second device can be a network device. The following description uses the first terminal device as a UE (denoted as UE1) and the network device as a base station as an example.

[0536] In some possible implementations, method 300 further includes: S302, whereby a first device (e.g., UE1) sends capability information to a second device (e.g., a base station), the capability information indicating that the first device supports sparse mapping. Correspondingly, the second device receives the capability information from the first device.

[0537] S302 can also be understood as UE1 reporting capability, indicating that UE1 supports sparse multi-stream mapping. Here, "multi-stream" can be understood as multiple layers, that is, the aforementioned L layers (L is an integer greater than 1).

[0538] In some possible implementations, method 300 further includes: S304, the second device (e.g., a base station) determines the mapping function and multiple adjustment parameters.

[0539] For example, the second device can determine one or more sets of mapping functions, and the second device can determine one or more sets of adjustment parameters.

[0540] In some possible implementations, the second device may execute S310, wherein the first information may be used to indicate one or more sets of mapping functions. Optionally, the first information may also be used to indicate the scope of action (e.g., T time-frequency resources and / or L layers).

[0541] In some possible implementations, the second device may execute S320, wherein the second information may be used to indicate one or more sets of mapping functions, or one or more sets of adjustment parameters (i.e., a third matrix). Optionally, the second information may also be used to indicate the scope of action (e.g., T time-frequency resources and / or L layers).

[0542] In some possible implementations, the second device may execute S330, wherein the third information may be used to indicate one or more sets of adjustment parameters. Optionally, the third information may also be used to indicate the scope of action (e.g., T time-frequency resources and / or L layers).

[0543] In some possible implementations, method 300 further includes: S332, the second device sends information indicating the transmission weight (or, transmission weight indication information) to the first device. Correspondingly, the second device receives the information indicating the transmission weight from the first device.

[0544] Thus, the first device uses a set of mapping functions (denoted as...) issued by the second device. A set of adjustment parameters (M1) and transmission weights (or precoding matrix or precoding information) can be used to obtain the first signal. For example, the first signal Z in Figure 4... k .

[0545] The above-mentioned S360 can be understood as follows: the first device sends a first signal to the second device, the first signal being used to carry L second sequences or third sequences. Correspondingly, the second device receives the first signal from the first device. The first signal may also be called transmission data or other names, which are not limited in this application.

[0546] The above S370 can be understood as: the second device is based on a mapping function. By adjusting parameter M1, the L second or third sequences carried by the first signal are demodulated to obtain the first sequence.

[0547] For example, suppose the signal received by the second device is Therefore, the signal can be represented as:

[0548] Y k =H k Z k +W

[0549] The meaning of each parameter can be found in the previous text and will not be repeated here.

[0550] The second device is based on a mapping function. Adjusting parameter M1 on the signal Y k Demodulation yields the first sequence. Among them, the first sequence With the first sequence s k They can be the same or have some differences, depending on the specific channel conditions. The demodulation process can be represented as:

[0551] Among them, Demod(vec(Y)k )) can represent the vectorized signal Y k Demodulate.

[0552] The following is an example of transmitting data from multiple NOMA layers on the same L layers and the same T time-frequency resources.

[0553] In some implementations, the L second sequences or the third sequence correspond to the first NOMA layer. For example, the first NOMA layer may correspond to the first NOMA signature.

[0554] The first NOMA signature may also be called the first NOMA identifier, the first NOMA index, or other names, which are not limited in this application.

[0555] For example, the first NOMA signature can be power, spreading code, or sparse codebook. For instance, the power of a signal transmitted through the first NOMA layer can be different from the power of a signal transmitted through the second NOMA layer. As another example, the spreading code used to process (e.g., linearly spread spectrum) the signal in the first NOMA layer can be different from the spreading code used to process the signal in the second NOMA layer. As yet another example, the sparse codebook used to process the signal in the first NOMA layer (e.g., a sparse codebook of SCMA) can be different from the sparse codebook used to process the signal in the second NOMA layer.

[0556] The method 300 further includes: a first device acquiring a fifth sequence; the first device mapping the fifth sequence to L sixth sequences; and outputting the L sixth sequences, which correspond to a second non-orthogonal multiple access layer.

[0557] The example of mapping the fifth sequence to L sixth sequences is similar to the example of mapping the first sequence to L second sequences mentioned above. The following is a brief description of an example of mapping the fifth sequence to L sixth sequences; for parts not described, please refer to the previous example of mapping the first sequence to L second sequences.

[0558] The fifth sequence consists of M symbols, where M is a positive integer. The value of M can be the same as or different from the value of N. That is, M can be equal to N, or M can be different from N.

[0559] Each of the L sixth sequences corresponds one-to-one with one of the L layers. The i-th sixth sequence among the L sixth sequences may include T second elements.

[0560] The meaning of the second element is similar to that of the first element. The difference is that the second element is an element in the sixth sequence, while the first element is an element in the second sequence.

[0561] The T second elements may include M iThe sum of non-zero elements (TM) i ) zero elements. The M i A non-zero element can belong to any of the M symbols. Each of the T second elements corresponds one-to-one with each of the T time-frequency resources.

[0562] In other words, the first and fifth sequences can undergo similar processing and ultimately be transmitted on the same L layers and the same T time-frequency resources.

[0563] The following section presents some examples of method 300 in the case of multiple NOMA layers.

[0564] Optionally, the capability information in S302 is also used to indicate that the first device supports multiple NOMA layers.

[0565] In some possible implementations, method 300 further includes: S306, whereby the second device determines that multiple NOMA layers are applicable. This application does not limit the execution of S304 and S306; S304 may be executed before or after S306, or simultaneously.

[0566] In some possible implementations, S304 includes: a second device determining multiple sets of mapping functions and multiple sets of adjustment parameters.

[0567] For example, the second device can determine two sets of mapping functions (denoted as follows): and The second device can determine two sets of adjustment parameters (denoted as M1 and M2 respectively).

[0568] Optionally, the first information is used to indicate at least one of the following: L, T, N, first interleaving parameter, and L N. i M, the first interleaving parameter ' or L M i .

[0569] Wherein, mapping function It can include L, T, N, the first interleaving parameter, and L N's. i Mapping function This can include L, T, M, the first interleaving parameter', and L M's. i .

[0570] For example, M, the first interleaving parameter ', or L M i Content not indicated by the first information may be predefined or preconfigured.

[0571] The first interleaving parameter ' is similar to the first interleaving parameter ', except that the first interleaving parameter ' is used to process sequences related to the fifth sequence, while the first interleaving parameter ' is used to process sequences related to the first sequence. Alternatively, the first interleaving parameter ' is used to determine L sixth sequences, and the first interleaving parameter ' is used to determine L second sequences. The specific values ​​of the first interleaving parameter ' and the first interleaving parameter ' can be different or the same.

[0572] In other words, the first information, besides indicating the mapping function In addition, it can also indicate the mapping function.

[0573] Optionally, the second information is used to indicate parameter 1 or parameter 2.

[0574] Parameter 1: Parameter 1 includes at least one of the following: L, T, N, a second interleaving parameter or a binary sequence; or, Parameter 1 includes a third matrix.

[0575] Parameter 2: Parameter 2 includes at least one of the following: L, T, M, second interleaving parameter 'or binary sequence'; or, Parameter 2 includes a third matrix '.

[0576] Wherein, mapping function It can include L, T, N, the second interleaving parameter, and the binary sequence. Mapping function. It can include parameter 2: L, T, M, second interleaving parameter ' and binary sequence '.

[0577] The adjustment parameter M1 can include the third matrix. The adjustment parameter M2 can include the third matrix.

[0578] In this context, the values ​​of the second interleaving parameter ' and the second interleaving parameter can be different or the same, and so on. The values ​​of the binary sequence and the binary sequence ' can be different or the same, and so on. The values ​​of the third matrix ' and the third matrix can be different or the same, and so on.

[0579] In other words, the second information, besides indicating the mapping function... Alternatively, besides adjusting parameter M1, you can also indicate the mapping function. Alternatively, adjust parameter M2.

[0580] Optionally, the third information is used to indicate at least one of the following: a fourth matrix, a fourth matrix', T time-frequency resources, or L layers.

[0581] The values ​​of the fourth matrix ' and the fourth matrix can be different or the same, and so on.

[0582] The adjustment parameter M1 can include the fourth matrix. The adjustment parameter M2 can include the fourth matrix.

[0583] In other words, the third information can indicate not only the adjustment parameter M1, but also the adjustment parameter M2.

[0584] Optionally, the first, second, or third information may also be used to indicate the signature of the first NOMA layer and the signature of the second NOMA layer. Wherein, the mapping function... The adjustment parameter M1 can be associated with the first NOMA layer or the signature of the first NOMA layer. Mapping function The adjustment parameter M2 can be associated with the signature of the second NOMA layer or the second NOMA layer.

[0585] Thus, the first device uses the two sets of mapping functions issued by the second device. By adjusting two sets of parameters M1 and M2 and the transmission weights, the first signal can be obtained. The first device can first map the first sequence and the fifth sequence to different NOMA layers, and then to different layers. Alternatively, the first device can map the first sequence and the fifth sequence to different layers, and then to different NOMA layers.

[0586] For ease of distinction, the third sequence A in Figure 4 k Or L second sequences A k It can be denoted as A k1 If mapping the fifth sequence to L sixth sequences using mapping scheme 1, then the sequence obtained after adjusting the L sixth sequences according to the adjustment parameter M2 can be denoted as the seventh sequence A. k2 If mapping the fifth sequence to L sixth sequences is done using mapping scheme 2, then let the L sixth sequences be denoted as A. k2 .

[0587] Unlike the scheme shown in Figure 4, in the example with multiple NOMA layers, the first signal Z k =F k (A k1 +A k2 In other words, signals from multiple NOMA layers can be transmitted together using the same transmission weight.

[0588] The above-mentioned S360 can be understood as follows: the first device sends a first signal to the second device, the first signal being used to carry L second sequences or third sequences, and L sixth sequences or seventh sequences. Correspondingly, the second device receives the first signal from the first device.

[0589] The above S370 can be understood as: the second device is based on a mapping function. By adjusting parameters M1 and M2, the L second or third sequences and the L sixth or seventh sequences carried by the first signal are demodulated to obtain the first sequence and the fifth sequence.

[0590] For example, suppose the signal received by the second device is Therefore, this signal can be represented as: Y k =H k Z k +W

[0591] The meaning of each parameter can be found in the previous text and will not be repeated here.

[0592] The second device is based on a mapping function. Adjusting parameters M1 and M2 on the signal Y k Demodulation yields the first sequence. and the fifth sequence The demodulation process can be represented as:

[0593] Among them, Demod(vec(Y) k )) can represent the vectorized signal Y k Demodulate.

[0594] The communication device provided in the embodiments of this application will be described in detail below with reference to Figures 7 to 10. The description of the device embodiments corresponds to the description of the method embodiments. Therefore, for content not described in detail, please refer to the method embodiments above. For the sake of brevity, some content will not be repeated.

[0595] This application embodiment can divide the communication device into functional modules according to the above method example. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware, software, or a combination of both. The module division in this application embodiment is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The following description uses the division of functional modules according to each function as an example.

[0596] Figure 7 is an exemplary block diagram of the communication device 10 provided in an embodiment of this application.

[0597] As shown in Figure 7, for example, the communication device 10 may include a chip system 110, a memory 120, a bus 130, a power management module 140, or a transceiver 150, etc.

[0598] The chip system 110 can be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method can be completed through integrated logic circuits in the hardware of the chip system 110 or through software instructions.

[0599] By way of example and not limitation, chip system 110 may include circuitry or chips responsible for signal processing (such as a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip or system-in-package (SIP) chip containing a modem core).

[0600] Optionally, the chip system 110 may also include a memory (such as a cache) for storing instructions and data. In some embodiments, the memory in the chip system 110 is a cache memory. This memory can store instructions or data that the chip system 110 has just used or that are used repeatedly. If the chip system 110 needs to use the instruction or data again, it can directly retrieve it from the memory. This avoids repeated accesses, reduces the waiting time of the chip system 110, and thus improves the efficiency of the system.

[0601] In some embodiments, the chip system 110 may include one or more interfaces. Interfaces may include an inter-integrated circuit (I2C) interface, an inter-integrated circuit sound (I2S) interface, a pulse code modulation (PCM) interface, a universal asynchronous receiver / transmitter (UART) interface, a mobile industry processor interface (MIPI), a general-purpose input / output (GPIO) interface, a subscriber identity module (SIM) interface, and / or a universal serial bus (USB) interface, etc.

[0602] Memory 120 may include random access memory (RAM) and read-only memory (ROM). Memory 120 may store computer-readable, computer-executable code, including instructions that, when executed, cause the processor to perform the various functions described in this application.

[0603] Optionally, the code may include instructions for implementing various aspects of the embodiments of this application, such as instructions for sending first information. The code may be stored in a non-transitory computer-readable medium such as system memory or other types of memory. In some cases, the code may not be directly executable by the chip system 110, but may enable a computer (e.g., at compile and execution time) to perform the functions described in this application. In some cases, memory 120 may contain a basic I / O system that controls basic hardware or software operations, such as interaction with peripheral components or devices.

[0604] For example, the chip system 110 executes various functional applications and data processing of the communication device 10 by running instructions stored in the memory 120. For instance, when the communication device 10 transfers files with other devices (which may also be terminals or access network devices), the chip system 110 of the communication device 10 can call the computer-executable program code stored in the memory 120 to implement the communication method provided in the embodiments of this application.

[0605] In addition, the memory 120 can be integrated into the chip system 110 or independent of the chip system 110.

[0606] For example, bus 130 may be USB, used to support communication between various parts of communication device 10.

[0607] The power management module 140 is used to receive charging input from the charger. Optionally, the power management module 140 can also supply power to the communication device 10 while charging it (e.g., the battery module of the communication device 10). By way of example and not limitation, the power management module 140 can also supply power to other devices besides the communication device 10.

[0608] Transceiver 150 can communicate bidirectionally via one or more antennas, wired links, or wireless links. For example, transceiver 150 can represent a wireless transceiver and can communicate bidirectionally with another wireless transceiver. Transceiver 150 may also include a modem for modulating packets and providing the modulated packets to the antenna for transmission, and for demodulating packets received from the antenna. Transceiver 150 may include a receiver and a transmitter, the receiver performing the function of receiving information and the transmitter performing the function of transmitting information.

[0609] In some cases, a wireless device may include a single antenna. However, in other cases, the device may have more than one antenna, such as antenna 1 and antenna 2 shown in FIG. 7, which may be capable of simultaneously transmitting or receiving multiple wireless transmissions. Exemplarily, antenna 1 and antenna 2 are used to transmit and receive electromagnetic wave signals. Each antenna in communication device 10 can be used to cover one or more communication frequency bands. Different antennas can also be multiplexed to improve antenna utilization. For example, antenna 1 can be multiplexed as a diversity antenna for a wireless local area network. In other embodiments, the antennas can be used in conjunction with a tuning switch. Communication device 10 can transfer files to other devices via wireless communication functions.

[0610] In one design, the communication device 20 may correspond to the first device in the above method embodiment.

[0611] The device 10 can implement the steps or processes corresponding to those performed by the first device in the above method embodiments. The transceiver 150 can be used to perform transmission and reception related operations of the first device in the above method embodiments, such as performing step S360 in the above method embodiments. The chip system 110 can be used to perform processing related operations of the first device in the above method embodiments, such as performing steps S340 and S350 in the above method embodiments.

[0612] In another design, the communication device 10 may correspond to the second device in the above method embodiment.

[0613] The device 10 can implement the steps or processes corresponding to those performed by the second device in the above method embodiments. The transceiver 150 can be used to perform transmission and reception related operations of the second device in the above method embodiments, such as performing step S360 in the above method embodiments. The chip system 110 can be used to perform processing related operations of the second device in the above method embodiments.

[0614] In the design of the communication device 20 corresponding to the terminal device (e.g., the first device in scenario 1, the second device in scenario 2, and the first and second devices in scenario 3), the communication device 10 may include modules such as the short-range communication module 164, sensor 161, display 162, or camera 163 as shown in FIG7.

[0615] The short-range communication module 164 may include modules that support short-range communication, such as WiFi and Bluetooth.

[0616] For example, sensor 161 may include pressure sensor, gyroscope sensor, barometric pressure sensor, magnetic sensor, accelerometer, distance sensor, proximity sensor, fingerprint sensor, temperature sensor, touch sensor, ambient light sensor, bone conduction sensor, etc.

[0617] For example, display 162 is used to display images, videos, etc. The display includes a display panel. The display panel may be a liquid crystal display (LCD), an organic light-emitting diode (OLED), an active-matrix organic light-emitting diode (AMOLED), a flexible light-emitting diode (FLED), a mini light-emitting diode (LED), a micro LED, a micro OLED, a quantum dot light-emitting diode (QLED), etc. For example, in this embodiment, the display can be used to display the interface required by the communication device 10. For example, the communication device 10 implements display functions through a graphics processing unit (GPU), a display, and an application processor. The GPU is a microprocessor for image processing, connected to the display and the application processor. The GPU is used to perform mathematical and geometric calculations for graphics rendering. The chip system 110 may include one or more GPUs that execute program instructions to generate or modify display information.

[0618] For example, camera 163 is used to acquire images, videos, etc.

[0619] It is understood that the structure shown in Figure 7 does not constitute a specific limitation on the communication device 10, and the specific structure of the terminal device and / or access network device can be referred to Figure 7. In some embodiments, the communication device 10 may also include more or fewer components than shown in Figure 7, or combine some components, or split some components, or have different component arrangements, etc. Alternatively, some components shown in Figure 7 may be implemented in hardware, software, or a combination of software and hardware, and the terminal device and / or access network device may add or reduce components based on the structure given in Figure 7.

[0620] Figure 8 is a schematic block diagram of the communication device 20 provided in an embodiment of this application.

[0621] As shown in Figure 8, the communication device 20 may include a baseband unit 210, which can communicate with external devices via a cellular radio frequency (RF) transceiver 220 (e.g., if the communication device 20 is a terminal device, the baseband unit 210 can communicate with access network devices via the cellular RF transceiver 220; or, if the communication device 20 is an access network device, the baseband unit 210 can communicate with terminal devices and / or core network devices via the cellular RF transceiver 220).

[0622] Exemplarily, baseband unit 210 may include a computer-readable medium / memory. Baseband unit 210 may be responsible for general processing, including the execution of software stored on the computer-readable medium / memory. When executed by baseband unit 304, the software causes baseband unit 210 to perform the various functions described above. The computer-readable medium / memory may also be used to store data manipulated by baseband unit 210 during software execution.

[0623] Optionally, the baseband unit 210 further includes a receiving unit 201, a management unit 202, and a transmitting unit 203. The management unit 202 includes one or more sub-units shown in FIG. 8. For example, a mapping sub-unit, wherein the mapping sub-unit can be used to perform the operation of mapping the first sequence to L second sequences in the above method embodiments. The units within the management unit 201 can be stored in a computer-readable medium / memory and / or configured as hardware within the baseband unit 210. The receiving unit 201 and the transmitting unit 203 can be referred to as transceiver units.

[0624] When the communication device 20 is used to implement the function of the first device in the above method embodiments, the receiving unit 201 is used to execute the receiving step of the first device, the sending unit 203 is used to execute the sending step of the first device, and the management unit 202 is used to execute the processing step of the first device.

[0625] For example, when the communication device 20 is used to implement the function of the first device in the above method embodiments, the management unit 201 is used to obtain a first sequence, which includes N symbols, where N is a positive integer; the management unit 201 is also used to map the first sequence to L second sequences, which correspond one-to-one with L layers, and the i-th second sequence in the L second sequences includes T first elements, where the T first elements include N i Non-zero elements and TN i N zero elements, the N i A non-zero element belongs to the N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L. The L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine a third sequence after power adjustment based on the multiple adjustment parameters. The multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter. The first adjustment parameter and the second adjustment parameter are used to adjust the power of two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different. The transmitting unit 203 is used to output the third sequence or the L second sequences.

[0626] For example, when the device 20 is used to perform the method in FIG3, the receiving unit 201 can be used to perform the step of receiving information in the method; the management unit 202 can be used to perform the processing step in the method; and the sending unit 203 can be used to perform the step of sending information in the method.

[0627] When the communication device 20 is used to implement the function of the second device in the above method embodiments, the receiving unit 201 is used to execute the receiving step of the second device, the sending unit 203 is used to execute the sending step of the second device, and the management unit 202 is used to execute the processing step of the second device.

[0628] For example, when the communication device 20 is used to implement the function of the second device in the above method embodiments, the receiving unit 201 is used to acquire a third sequence or L second sequences, wherein the L second sequences correspond one-to-one with L layers, and the i-th second sequence in the L second sequences includes T first elements, and the T first elements include N i Non-zero elements and TN i N zero elements, the N i Each non-zero element belongs to one of N symbols. L is an integer greater than or equal to 2, T is a positive integer, and i is an integer from 1 to L. The L second sequences are determined by power adjustment based on multiple adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment based on the multiple adjustment parameters. The multiple adjustment parameters include a first adjustment parameter and a second adjustment parameter, which are used to adjust the power of two non-zero elements in the L second sequences, respectively. The first adjustment parameter and the second adjustment parameter are different. The management unit 202 is used to determine a first sequence based on the third sequence or the L second sequences, and the first sequence includes the N symbols.

[0629] For example, when the device 20 is used to perform the method in FIG3, the receiving unit 201 can be used to perform the step of receiving information in the method; the management unit 202 can be used to perform the processing step in the method; and the sending unit 203 can be used to perform the step of sending information in the method.

[0630] For a more detailed description of the receiving unit 201, management unit 202 and sending unit 203, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here.

[0631] By way of example and not limitation, the chip system in this application is shown in FIG9, which is a schematic block diagram of the chip system 30 provided in an embodiment of this application. The chip system includes, but is not limited to, a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip or a system-in-package (SIP) chip containing a modem core.

[0632] As can be seen from Figure 9, the chip system (or processing system) includes a processor 310, a memory 320, and an input / output interface 330.

[0633] The processor 310 can be a processing circuit in the chip system (including at least one processor, such as processor 1 and processor 2 as shown in FIG. 9). The processor 310 can be coupled to the memory 320 to call the instructions in the memory 320, so that the chip system can implement the methods and functions of the various embodiments of this application. The input / output interface 330 can be an input / output circuit in the chip system, which outputs the information processed by the chip system, or inputs the data or signaling information to be processed into the chip system for processing.

[0634] As one approach, the chip system is used to implement the operations performed by the first or second device in the various method embodiments described above.

[0635] For example, processor 310 is used to implement the processing-related operations performed by the first device or the second device in the above method embodiments, as described in the foregoing embodiments; input / output interface 330 is used to implement the sending and / or receiving-related operations performed by the first device or the second device in the above method embodiments, as described in the foregoing embodiments.

[0636] As an example and not a limitation, the chip system in this application is shown in FIG10, which is a schematic block diagram of the chip system 40 provided in an embodiment of this application.

[0637] As shown in Figure 10, the chip system (or processing system) includes an input / output interface 410 and logic circuitry 420. The input / output interface 410 can be an input / output circuit within the chip system, outputting processed information or inputting data or signaling information to be processed into the chip system for processing. For details, please refer to the description in the preceding embodiments, such as the embodiment shown in Figure 3. The logic circuitry 420 is used to execute the aforementioned communication method, and for details, please refer to the description in the preceding embodiments.

[0638] As one approach, the chip system is used to implement the operations performed by the first or second device in the various method embodiments described above.

[0639] For example, logic circuit 420 is used to implement processing-related operations performed by the first device or the second device in the above method embodiments; input / output interface 410 is used to implement sending and / or receiving-related operations performed by the first device or the second device in the above method embodiments.

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

[0641] For example, when the computer program is executed by a computer, it enables the computer to implement the methods performed by the first or second device in the various embodiments of the above methods.

[0642] This application also provides a computer program product comprising instructions which, when executed by a computer, implement the methods performed by the first or second device in the above-described method embodiments.

[0643] This application also provides a communication system, including the aforementioned first device and second device.

[0644] The explanations and beneficial effects of the relevant contents in any of the devices provided above can be found in the corresponding method embodiments provided above, and will not be repeated here.

[0645] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0646] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0647] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0648] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0649] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0650] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

Claims

1. A communication method characterized by comprising: The method comprises: obtaining a first sequence, the first sequence comprising N symbols, N being a positive integer; mapping the first sequence to L second sequences, the L second sequences corresponding one-to-one to L layers, an i-th second sequence of the L second sequences comprising T first elements, the T first elements comprising N i non-zero elements and T-N i non-zero elements belonging to the N symbols, i ​ L is an integer greater than or equal to 2, T is a positive integer, i is an integer taken from 1 to L, the L second sequences are determined according to a plurality of adjustment parameters for power adjustment, or the L second sequences are used to determine a third sequence after power adjustment according to the plurality of adjustment parameters; wherein the plurality of adjustment parameters comprise a first adjustment parameter and a second adjustment parameter, the first adjustment parameter and the second adjustment parameter are respectively used for power adjustment of two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different; outputting the third sequence or the L second sequences.

2. The method of claim 1, wherein, The first sequence is mapped to L second sequences, comprising: The first sequence is divided into L seventh sequences, an i-th seventh sequence among the L seventh sequences includes N i symbols; determining L eighth sequences, an i-th eighth sequence of the L eighth sequences comprising the i-th seventh sequence and T-N i zero elements; interleaving the L eighth sequences respectively to obtain the L second sequences.

3. The method of claim 2, wherein, The method further comprises: receive or transmit first information, the first information being used for indicating at least one of: L, T, N, a first interleaving parameter, or L N i wherein the first interleaving parameter is used for interleaving the L eighth sequences.

4. The method of claim 3, wherein, The T first elements correspond to T time-frequency resources one by one, and the first information is further used to indicate the T time-frequency resources and / or the L layers.

5. The method of claim 1, wherein, The first sequence is mapped to L second sequences, comprising: mapping the first sequence to the L second sequences according to position information, wherein the position information is used to indicate positions of N non-zero elements corresponding to the N symbols in the L second sequences.

6. The method of claim 5, wherein, The position information comprises a first matrix with a size of L*T, the first matrix comprising N first indication information and L*T-N second indication information, wherein the N first indication information is respectively used to indicate the N non-zero elements, and the L*T-N second indication information is respectively used to indicate L*T-N zero elements.

7. The method of claim 6, wherein, The number of symbols in any two second sequences in the L second sequences is the same, and the method further comprises: determining the first matrix according to a second matrix with a size of L*T and a binary sequence, wherein the binary sequence comprises T indication information, the T indication information comprising N / L first indication information and T-N / L second indication information, and the i-th row of the second matrix comprises T first position numbers, the T first position numbers being respectively used to indicate positions of the T indication information in the i-th row of the first matrix.

8. The method of claim 7, wherein, The method further comprises: determining the second matrix according to a first position sequence and a second interleaving parameter, wherein The first position sequence comprises T second position numbers, and the second matrix comprises L second position sequences, wherein: the first position sequence is the first one of the L second position sequences; in the case that i is greater than 1, the i-th one of the L second position sequences is determined by interleaving the (i-1)-th one of the second position sequences according to the second interleaving parameter.

9. The method of claim 8, wherein, The second matrix satisfies: wherein Pos i represents the i-th second position sequence; "0:T-1" represents 0, 1, …, T-1; mod represents modulo; f1 and f2 belong to the second interleaving parameters, f1 is an integer greater than or equal to 1 and less than or equal to T, f1 is co-prime with T, f2 is an integer greater than or equal to 0 and less than T.

10. The method according to any one of claims 5 to 9, characterized in that, The method further comprises: receiving or sending second information, the second information being used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence; or In a case that the L second sequences are used to determine the third sequence, the second information is used to indicate a third matrix, the third matrix is used to adjust power of the L second sequences, and is used to determine the position information.

11. The method of claim 10, wherein, The T first elements correspond to T time-frequency resources one by one, and the second information is further used to indicate the T time-frequency resources and / or the L layers.

12. The method according to any one of claims 1 to 11, characterized in that, The T first elements correspond to T time-frequency resources one by one, and adjustment parameters of non-zero elements corresponding to two time-frequency resources in the T time-frequency resources are different.

13. The method of claim 12, wherein, Total power of the L second sequences before power adjustment is equal to total power of the L second sequences after power adjustment.

14. The method according to claim 12 or 13, characterized in that, The method further comprises: According to a third matrix, power of the L second sequences is adjusted to determine the third sequence, wherein the third matrix satisfies: Wherein, M(i,j) represents an element of the third matrix in the ith row and the jth column, T1 represents a quantity of time-frequency resources carrying symbols in the T time-frequency resources, L1(j) represents a quantity of symbols carried by the jth time-frequency resource in the T time-frequency resources, and P0 represents total power of the third sequence.

15. The method of claim 12, wherein, The plurality of adjustment parameters belong to a fourth matrix, wherein: The third sequence is determined according to the fourth matrix, power adjustment of the L second sequences; or, The mapping of the first sequence to the L second sequences comprises: determining a fourth sequence according to the fourth matrix, power adjustment of the first sequence; and mapping the fourth sequence to the L second sequences.

16. The method of claim 15, wherein, The method further comprises: Receiving or sending third information, the third information is used to indicate at least one of the following: the fourth matrix, T time-frequency resources, or the L layers.

17. The method of any one of claims 1 to 16, wherein, The T first elements correspond to T time-frequency resources one by one, and the L second sequences or the third sequence correspond to a first non-orthogonal multiple access layer, and the method further comprises: Obtaining a fifth sequence, the fifth sequence comprising M symbols, M being a positive integer; mapping the fifth sequence to L sixth sequences, the L sixth sequences corresponding one-to-one to the L layers, an i-th sixth sequence of the L sixth sequences comprising T second elements, the T second elements comprising M i non-zero elements and (T-M i ) zero elements, the M i non-zero elements belonging to the M symbols, The T second elements correspond to the T time-frequency resources one by one; Outputting the L sixth sequences, the L sixth sequences corresponding to a second non-orthogonal multiple access layer.

18. A method of communication, comprising: The method comprises: Obtaining a third sequence or L second sequences, wherein, The L second sequences correspond to L layers one by one, a i-th second sequence in the L second sequences includes T first elements, the T first elements include N i non-zero elements and T-N i zero elements, the N i non-zero elements belong to N symbols, L is an integer greater than or equal to 2, T is a positive integer, and i is an integer taken from 1 to L; The L second sequences are determined according to a plurality of adjustment parameters, or the L second sequences are used to determine the third sequence after power adjustment according to the plurality of adjustment parameters; wherein the plurality of adjustment parameters comprise a first adjustment parameter and a second adjustment parameter, the first adjustment parameter and the second adjustment parameter are respectively used to perform power adjustment on two non-zero elements in the L second sequences, and the first adjustment parameter and the second adjustment parameter are different; Determining a first sequence according to the third sequence or the L second sequences, the first sequence comprising the N symbols.

19. The method of claim 18, wherein, The method further comprises: receiving or transmitting first information, the first information being used for indicating at least one of: L, T, N, a first interleaving parameter, or L N i wherein the first interleaving parameter is used for determining the L second symbol sequences.

20. The method of claim 19, wherein, The T first elements correspond to T time-frequency resources one by one, and the first information is further used to indicate the T time-frequency resources and / or the L layers.

21. The method of claim 19 or 20, wherein, The determining of the first symbol sequence according to the second symbol sequence comprises: demodulate the second sequence of symbols according to the first information to determine the first sequence of symbols.

22. The method of claim 18, wherein, The method further comprises: receiving or sending second information, the second information being used to determine position information, the position information being used to indicate positions of the N non-zero elements corresponding to the N symbols in the L second sequences.

23. The method of claim 22, wherein, The position information is a first matrix with a size of L*T, the first matrix comprising N first indication information and L*T-N second indication information, wherein the N first indication information are respectively used to indicate the N non-zero elements, and the L*T-N second indication information are respectively used to indicate L*T-N zero elements.

24. The method of claim 22 or 23, wherein The second information is used to indicate at least one of the following: L, T, N, a second interleaving parameter, or a binary sequence, wherein the second interleaving parameter and / or the binary sequence are used to determine a first matrix; or In a case where the L second sequences are used to determine the third sequence, the second information is used to indicate a third matrix, the third matrix being used to adjust powers of the L second sequences and being used to determine the position information.

25. The method of claim 24, wherein, The T first elements correspond to T time-frequency resources one by one, and the second information is further used to indicate the T time-frequency resources and / or the L layers.

26. The method of any one of claims 18-25, wherein, The plurality of adjustment parameters belong to a fourth matrix, wherein the method further comprises: receiving or sending third information, the third information being used to indicate the fourth matrix, the fourth matrix being used to adjust powers of the L second sequences, or the fourth matrix being used to adjust powers of the first sequence to determine a fourth sequence, the fourth sequence being used to be mapped to the L second sequences.

27. The method of claim 26, wherein, The T first elements correspond to T time-frequency resources one by one, and the third information is further used to indicate the T time-frequency resources and / or the L layers.

28. The method of any one of claims 18-27, wherein, The T first elements correspond to T time-frequency resources one by one, and the L second sequences or the third sequence correspond to a first NOMA layer, the method further comprises: obtaining L sixth sequences, the L sixth sequences corresponding to a second NOMA layer, the L sixth sequences corresponding to the L layers one by one, an i-th sixth sequence in the L sixth sequences comprising T second elements, the T second elements comprising M i non-zero elements and T-M i zero elements, the M i non-zero elements belonging to M symbols, M is a positive integer, and the T second elements correspond to the T time-frequency resources one by one; determining a fifth sequence according to the L sixth sequences, the fifth sequence comprising the M symbols.

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

30. A communications device, characterized by comprising: a processor configured to cause the method of any one of claims 1 to 28 to be performed by executing computer programs or instructions.

31. The communication apparatus according to claim 30, wherein The communication apparatus further comprises a memory configured to store the computer programs or the instructions.

32. A computer-readable storage medium, comprising: The computer readable storage medium has stored thereon computer programs or instructions which, when executed, cause the method of any one of claims 1 to 28 to be performed.

33. A computer program product, characterised in that, comprising computer programs or instructions which, when executed, cause the method of any one of claims 1 to 28 to be implemented.

Images