Communication method and apparatus

Abstract

A communication method and apparatus, for use in increasing the capacity of multi-data-stream transmission. The method comprises the following steps: a first terminal acquires N first sequences, wherein N is greater than 1, any first sequence corresponds to one antenna, the N first sequences correspond to a first data stream, and any first sequence comprises one or more zero elements; the first terminal performs precoding processing on the first data stream to obtain a first signal; the first terminal performs spectrum spreading processing on a p-th element of the first signal on the basis of a j-th first sequence to obtain a p-th group of second signals, wherein 1≤j≤N, and p is a positive integer; and the first terminal sends a u-th element in the p-th group of second signals on a u-th time-frequency resource by means of a p-th antenna, wherein 1≤u≤Nsf, and Nsf is the length of the first sequences.

Description

A communication method and apparatus

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese Patent Application No. 202410662314.1, filed on May 24, 2024, and entitled "A communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

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

[0004] In multi-input multi-output (MIMO) technology, multiple transmit antennas can be used for signal transmission at the transmitting end, and multiple receive antennas can be used for signal reception at the receiving end. MIMO technology can improve the service quality of users, such as reducing the bit error rate and increasing the data rate.

[0005] How to improve the capacity of multi-data stream transmission is a technical problem to be solved in MIMO technology. SUMMARY

[0006] The present application provides a communication method and apparatus to improve the capacity of multi-data stream transmission.

[0007] In a first aspect, a communication method is provided. The method can be implemented by a first communication apparatus. The first communication apparatus can be a terminal or a component in the terminal. In the present application, the component may, for example, include at least one of a chip, a chip system, a processor, a transceiver, a processing unit, a circuit, a functional module, or a transceiving unit. Taking the first terminal as an example, the execution subject includes the following steps: the first terminal obtains N first sequences, N is greater than 1, any first sequence corresponds to an antenna, the N first sequences correspond to a first data stream, and any first sequence includes one or more zero elements; the first terminal performs precoding processing on the first data stream to obtain a first signal; the first terminal performs spread spectrum processing on the pth element of the first signal according to the jth first sequence to obtain the pth group of second signals, 1≤j≤N, and p is a positive integer; and the first terminal transmits the u element in the pth group of second signals through the pth antenna at the u time-frequency resource, 1≤u≤N sf , N sf is the length of the first sequence.

[0008] Based on the implementation manner, the first data stream is pre-coded to obtain a first signal, and the first signal can include multiple elements, wherein the multiple elements of the first signal are spread by the N first sequences respectively, which can improve the capacity of multi-data stream transmission. In addition, since the first sequence includes one or more zero elements, the transmission interference between multiple data streams can be reduced.

[0009] In addition, the multiple groups of second signals can also be regarded as a matrix, and the matrix can be regarded as the second signal. The matrix can be a combination of the multiple groups of second signals. Alternatively, "the first terminal transmits the u-th element in the p-th group of second signals through the p-th antenna at the u-th time-frequency resource" can be replaced by "the first terminal transmits the p, u-th element of the second signal through the p-th antenna at the u-th time-frequency resource". The time-frequency resource can also be referred to as a time-frequency resource unit, such as a resource element (RE).

[0010] As an example, p = j.

[0011] In a possible implementation manner, any first sequence in the N first sequences includes at least one non-zero element. That is, the first sequence avoids including zero sequences.

[0012] In a possible implementation manner, the N first sequences satisfy at least one of the following conditions: the proportion of non-zero elements in the N first sequences is less than or equal to a threshold value; the proportion of zero elements in the N first sequences is greater than or equal to a threshold value; the proportion of non-zero elements in any first sequence in the N first sequences is less than or equal to a threshold value; or the proportion of zero elements in any first sequence in the N first sequences is greater than or equal to a threshold value. Based on the implementation manner, the first sequence can satisfy the sparsity requirement, that is, the first sequence is a sparse sequence, which can further reduce the transmission interference between data streams.

[0013] In a possible implementation manner, the threshold value is 1 / 2. Based on the implementation manner, a sequence with a zero element proportion greater than or equal to 1 / 2 or a non-zero element proportion less than or equal to 1 / 2 can be required as a sparse sequence.

[0014] In a possible implementation manner, the N first sequences correspond to the N antennas one by one; wherein the N antennas belong to one terminal, that is, the first terminal, or the N antennas belong to multiple terminals, and the multiple terminals can include the first terminal.

[0015] In a possible implementation, the unit terminal can receive configuration information of a first matrix from the network device; and determine the first matrix according to the configuration information, the first matrix being related to the N first sequences. Based on the implementation, the first terminal can determine (or generate) the first matrix according to the configuration information of the first matrix, to achieve flexible determination of the first sequences.

[0016] In a possible implementation, the configuration information of the first matrix can include information of elements of the first matrix. The information of elements of the first matrix can include numerical values of row elements and / or numerical values of column elements of the first matrix, to achieve efficient indication of the first matrix.

[0017] In a possible implementation, the configuration information includes a first generation parameter, the first generation parameter being used to generate the first matrix.

[0018] In a possible implementation, the first generation parameter indicates non-zero elements in the first matrix, row indexes of the non-zero elements, and column indexes of the non-zero elements. Based on the implementation, efficient indication of the sparse first matrix can be achieved.

[0019] In a possible implementation, the first generation parameter further indicates a generation manner of the first matrix, so that the first terminal generates the first matrix by using the generation manner. For example, the first generation parameter can indicate which variables are used to generate the first matrix, the variables including a number of sequences used to generate the first matrix, a sequence type, a sequence length, or a generation manner of the sequence, and / or a sequence expansion manner used to generate the matrix. In addition, the first generation parameter can carry an index of the generation manner, the index corresponding to the number of sequences used to generate the first matrix, the sequence type, the sequence length, or the generation manner of the sequence.

[0020] In a possible implementation, the first matrix is generated according to a one-dimensional sequence, the one-dimensional sequence including one or more zero elements. Based on the implementation, the first matrix can be obtained by one-dimensional sequence expansion, to efficiently generate the first matrix. For example, the one-dimensional sequence can be a sparse sequence. As an example, a corresponding sparse sequence can be used to obtain the first matrix according to a sparsity requirement.

[0021] In a possible implementation, the configuration information includes an index of the first matrix in a first matrix set. Therefore, the first terminal can determine the first matrix from the first matrix set according to the index. The first matrix set can include a plurality of matrices. The first matrix set can be predefined or can be a set of matrices known to the first terminal and the network device.

[0022] In a possible implementation, the configuration information further includes a second generation parameter used for generating the first matrix set; or the configuration information further includes an index of the first matrix set. The second generation parameter can be used for generating a matrix in the first matrix set, so that the first terminal can determine the first matrix set (or a matrix in the first matrix set) according to the second generation parameter. In this implementation, the index of the first matrix in the first matrix set and the second generation parameter used for generating the first matrix set can be indicated by the same configuration information, so as to achieve flexible and efficient configuration.

[0023] In a possible implementation, the second generation parameter further indicates a generation manner of the first matrix set, so that the first terminal generates the first matrix set by using the generation manner. For example, the second generation parameter can indicate which variables are used to generate the first matrix set, and the variables can include a number of sequences used to generate a matrix in the first matrix set, a sequence type, a sequence length, a generation manner of the sequence, and the like, and can further include a sequence expansion manner used to generate the matrix. In addition, the second generation parameter can carry an index of the generation manner, which can correspond to the number of sequences used to generate the matrix in the first matrix set, the sequence type, the sequence length, the generation manner of the sequence, and the like. In addition, the second generation parameter can also be used to indicate the second matrix set in this application, and / or indicate a manner of determining the matrix in the first matrix set from the second matrix set.

[0024] In a possible implementation, a matrix in the first matrix set is generated according to a one-dimensional sequence including one or more zero elements. Based on this implementation, a matrix in the first matrix set can be obtained by one-dimensional sequence expansion, so as to efficiently generate the first matrix set. For example, the one-dimensional sequence can be a sparse sequence, for example, a proportion of zero elements in the one-dimensional sequence is not less than 1 / 2. As an example, a matrix in the first matrix set can be obtained by using a corresponding sparse sequence expansion according to a sparsity requirement.

[0025] In a possible implementation, the configuration information is included in a configuration message of grant-free transmission. Based on this implementation, the first matrix can be indicated by carrying the configuration information of the first matrix in a configuration message of a grant-free transmission process. The configuration message can be carried in an RRC message, a MAC CE, or a DCI.

[0026] In a possible implementation, the method further includes: receiving at least one of the following information from the network device: dimension information of the first matrix; time-frequency resource information corresponding to the first matrix; or data stream information corresponding to the first matrix. The dimension information can be used to indicate whether a row of the first matrix corresponds to a quantity of time-frequency resources or a quantity of antennas, and / or whether a column of the first matrix corresponds to a quantity of time-frequency resources or a quantity of antennas, and the first terminal can take a row or a column corresponding to the quantity of antennas as a first sequence. It can also be understood that the dimension information includes row information and / or column information, the row information can be used to indicate whether a row corresponds to a quantity of time-frequency resources or a quantity of antennas, and the column information can be used to indicate whether a column of the first matrix corresponds to a quantity of time-frequency resources or a quantity of antennas.

[0027] In addition, the N sf time-frequency resources on which the first matrix acts are a non-orthogonal multiple access (non-orthogonal MA, NOMA) unit (also referred to as a spreading unit, a NOMA resource unit, or a spreading resource unit), and the time-frequency resource information can be used to flexibly indicate a position of N sf time-frequency resources of a NOMA unit, and the time-frequency resource information corresponding to the first matrix can be used to reasonably determine a matrix used by the time-frequency resources.

[0028] For example, the first matrix acts on N1 time-frequency resources, which are marked as 0 to N1-1, and the time-frequency resource information can include, indicate, or be used to determine any one or more of the following: (1) ( M NOMA units correspond to the first matrix. (2) indicates position information of the ith, i = 0, 1,..., M-1 NOMA unit on the configured N1 time-frequency resources, or NOMA unit information corresponding to the nth time-frequency resource. For example, in a mapping form, the (i+1)th time-frequency resource belongs to the ith NOMA unit, or the nth time-frequency resource is located in the ith NOMA unit. sf time-frequency resource. sf

[0029] The data stream information corresponding to the first matrix can be used to flexibly indicate a matrix used by the data stream. Based on this implementation, the first terminal can reasonably determine a matrix used by the time-frequency resources and / or the data stream, and improve configuration efficiency. For example, the network device can indicate one or more matrices through a signaling, and indicate an antenna quantity, a quantity of time-frequency resource units included in a time-frequency resource, a position of the time-frequency resource, or a data stream to which the one or more matrices apply through another signaling. Therefore, based on the above implementation, dimension indication of the first matrix, corresponding time-frequency resource indication, or corresponding data stream indication can be dynamically or flexibly implemented. ​​

[0030] In a possible implementation, the first matrix set satisfies a correlation requirement. The first matrix set satisfies the correlation requirement, including: a correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold; and / or a self-correlation of a matrix in the first matrix set is not more than a self-correlation threshold. Based on the implementation, reasonable and efficient determination of the matrices in the first matrix set can be implemented. Wherein, the matrices satisfying the correlation requirement can be determined as the matrices in the first matrix set according to the cross-correlation and / or the self-correlation of the matrices.

[0031] In a possible implementation, the first matrix set satisfies a sparsity requirement. The first matrix set satisfies the sparsity requirement, including at least one of the following: a proportion of non-zero elements in a matrix of the first matrix set is not more than a threshold; a proportion of zero elements in the matrix of the first matrix set is not less than a threshold; a proportion of non-zero elements in one or more rows of the matrix of the first matrix set is not more than a threshold; a proportion of zero elements in the one or more rows of the matrix of the first matrix set is not less than a threshold; a proportion of non-zero elements in one or more columns of the matrix of the first matrix set is not more than a threshold; or, a proportion of zero elements in the one or more columns of the matrix of the first matrix set is not less than a threshold. Based on the implementation, the matrices satisfying the sparsity requirement can be determined as the matrices in the first matrix set, so as to satisfy the sparsity requirement of the N first sequences and reduce transmission interference between data quantities.

[0032] In a possible implementation, the N first sequences correspond to the first data stream, the first data stream corresponds to a first time-frequency resource set, and the first time-frequency resource set includes the u th time-frequency resource. Wherein, the first time-frequency resource set can be one or more NOMA units.

[0033] In a possible implementation, the first terminal can also obtain N second sequences, any second sequence corresponding to one antenna, the N second sequences corresponding to a second data stream, the second data stream corresponding to the first time-frequency resource, or the second data stream corresponding to a second time-frequency resource, the second time-frequency resource being different from the first time-frequency resource. In combination with the first data stream corresponding to the first time-frequency resource set, the first terminal can configure different spreading sequences (or different spreading sequence sets) for different data streams in different time-frequency resource sets, respectively, or the first terminal can configure different spreading sequences (or different spreading sequence sets) for different data streams in the same time-frequency resource set, respectively. In addition, the second data stream can also be a data stream of another terminal (such as a second terminal).

[0034] In a possible implementation, the N first sequences can also correspond to a third data stream, the third data stream corresponding to third time-frequency resources, the third time-frequency resources being different from the first time-frequency resources. In combination with the first data stream corresponding to the first set of time-frequency resources and the second data stream corresponding to the second set of time-frequency resources, the first time-frequency resources and the third time-frequency resources use the same spreading sequence, and the second time-frequency resources can also use other spreading sequences. The third data stream can be a data stream of the first terminal or other terminals.

[0035] In a possible implementation, the N second sequences are obtained by: receiving configuration information of a third matrix from the network device; and determining the third matrix according to the configuration information, the third matrix including the N second sequences. The configuration information of the third matrix and the configuration information of the first matrix are included in a same message, and the first matrix includes the N first sequences. The first terminal can obtain the N second sequences according to the configuration information of the third matrix. The configuration information of the third matrix and the configuration information of the first matrix can be carried in a same message. In addition, the configuration information of the third matrix and the configuration information of the first matrix can also be carried in different messages, which is not specifically limited.

[0036] In a possible implementation, the first terminal can further send capability information to the network device, the capability information being used to indicate that the first terminal supports spreading processing of the pth element of the first signal according to the jth first sequence. Alternatively, the capability information can be used to indicate that the first terminal supports pre-coding processing of a data stream before spreading processing. The first terminal can indicate to the base station, through the capability information, that the first terminal supports the method shown in the present application, and accordingly, the base station can determine to use the method shown in the present application according to the capability information of the first terminal, so as to avoid configuring the N first sequences to a terminal that does not support the present application.

[0037] Secondly, a communication method is provided. This method can be implemented by a second communication device. The second communication device can be a network device or a component within a network device. The network device is, for example, a base station. The components in this application may include, for example, at least one of a chip, chip system, processor, circuit, functional module, transceiver, processing unit, or transceiver unit. Taking a network device as the executing entity as an example, the method includes the following steps: the network device acquires N first sequences, where N is greater than 1, each first sequence corresponds to an antenna, the N first sequences correspond to a first data stream, and each first sequence includes one or more zero elements; the network device receives a second signal, the p-th group of which is obtained by spreading the p-th element of the first signal according to the j-th first sequence, the u-th element of the p-th group of the second signal being transmitted through the p-th antenna on the u-th time-frequency resource, and the first signal being obtained by precoding the first data stream, where 1 ≤ j ≤ N, p is a positive integer, and 1 ≤ u ≤ N. sf N sf The length of the first sequence; the network device can also recover the first data stream based on N first sequences.

[0038] In one possible implementation, any of the N first sequences includes at least one non-zero element.

[0039] In one possible implementation, the N first sequences satisfy at least one of the following: the proportion of non-zero elements in the N first sequences is less than or equal to a threshold; the proportion of zero elements in the N first sequences is greater than or equal to a threshold; the proportion of non-zero elements in any of the N first sequences is less than or equal to a threshold; or, the proportion of zero elements in any of the N first sequences is greater than or equal to a threshold.

[0040] In one possible implementation, the threshold is 1 / 2.

[0041] In one possible implementation, the N first sequences correspond one-to-one with the N antennas; wherein the N antennas belong to one terminal, or the N antennas belong to multiple terminals.

[0042] In one possible implementation, the network device may also send configuration information of a first matrix, which is used to determine the first matrix and is related to the N first sequences.

[0043] In one possible implementation, the configuration information includes information about the elements of the first matrix.

[0044] In one possible implementation, the configuration information includes a first generation parameter used to generate the first matrix.

[0045] In a possible implementation, the first generation parameter indicates a non-zero element in the first matrix, a row index of the non-zero element, and a column index of the non-zero element.

[0046] In a possible implementation, the first generation parameter further indicates a generation manner of the first matrix.

[0047] In a possible implementation, the first matrix is generated according to a one-dimensional sequence, and the one-dimensional sequence includes one or more zero elements.

[0048] In a possible implementation, the configuration information includes an index of the first matrix in a first matrix set.

[0049] In a possible implementation, the configuration information further includes a second generation parameter used for generating the first matrix set, or the configuration information further includes an index of the first matrix set.

[0050] In a possible implementation, the second generation parameter further indicates a generation manner of the first matrix set.

[0051] In a possible implementation, the generation manner includes that a matrix in the first matrix set is generated according to a one-dimensional sequence, and the one-dimensional sequence includes one or more zero elements.

[0052] In a possible implementation, a proportion of zero elements in the one-dimensional sequence is not less than 1 / 2.

[0053] In a possible implementation, the method further includes: sending at least one of the following information: dimension information of the first matrix; time-frequency resource information corresponding to the first matrix; or data stream information corresponding to the first matrix.

[0054] In a possible implementation, the first matrix set satisfies a correlation requirement, and the first matrix set satisfying the correlation requirement includes: a correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold; and / or, an autocorrelation of a matrix in the first matrix set is not more than an autocorrelation threshold.

[0055] In a possible implementation, the first matrix set satisfies a sparsity requirement, and the first matrix set satisfying the sparsity requirement comprises at least one of the following: a proportion of non-zero elements in a matrix of the first matrix set does not exceed a threshold value; a proportion of zero elements in the matrix of the first matrix set does not fall below a threshold value; a proportion of non-zero elements in one or more rows of the matrix of the first matrix set does not exceed a threshold value; a proportion of zero elements in the one or more rows of the matrix of the first matrix set does not fall below a threshold value; a proportion of non-zero elements in one or more columns of the matrix of the first matrix set does not exceed a threshold value; or, a proportion of zero elements in the one or more columns of the matrix of the first matrix set does not fall below a threshold value.

[0056] In a possible implementation, the N first sequences correspond to the first data stream, the first data stream corresponds to a first set of time-frequency resources, and the first set of time-frequency resources comprises the u th time-frequency resource.

[0057] In a possible implementation, the method further comprises: sending, by the network device, configuration information of a second matrix, the configuration information of the second matrix being used to determine the second matrix, the second matrix being related to N second sequences, any second sequence corresponding to one antenna, the N second sequences corresponding to a second data stream, the second data stream corresponding to the first set of time-frequency resources, or the second data stream corresponding to a second set of time-frequency resources, the second set of time-frequency resources being different from the first set of time-frequency resources.

[0058] In a possible implementation, the N first sequences further correspond to a third data stream, the third data stream corresponding to a third set of time-frequency resources, the third set of time-frequency resources being different from the first set of time-frequency resources.

[0059] In a possible implementation, the configuration information of the second matrix and the configuration information of the first matrix are included in a same message, and the first matrix comprises the N first sequences.

[0060] In a possible implementation, the network device can further receive capability information of the terminal, the capability information being used to indicate that the terminal supports performing a spreading process on a p th element of the first signal according to a j th first sequence, or used to indicate that the terminal supports performing the spreading process after the precoding process.

[0061] In a third aspect, a communication apparatus is provided. The apparatus can implement the method in any one of the above first aspect to the second aspect and any possible implementation thereof. The apparatus has the functions of the above first communication apparatus or second communication apparatus. The apparatus is, for example, a first terminal or a base station, or a functional module of the first terminal, or a functional module in the base station, or a functional module in a configuration function producer.

[0062] In an alternative implementation, the apparatus can include a module or unit or means for performing the method / operation / step / action of any of the first aspect to the second aspect and any possible implementation thereof, which can be hardware circuit, software, or a combination of hardware circuit and software. In an alternative implementation, the apparatus includes a processing unit (sometimes also referred to as processing module) and a communication unit (sometimes also referred to as transceiver module, communication module, etc.). The transceiver unit can implement the sending function and the receiving function, and when the transceiver unit implements the sending function, it can be referred to as a sending unit (sometimes also referred to as a sending module), and when the transceiver unit implements the receiving function, it can be referred to as a receiving unit (sometimes also referred to as a receiving module). The sending unit and the receiving unit can be the same functional module, which is referred to as a transceiver unit, and the functional module can implement the sending function and the receiving function; or the sending unit and the receiving unit can be different functional modules, and the transceiver unit is a general term for these functional modules.

[0063] For example, when the apparatus is used to perform the method described in any of the first aspect to the second aspect, the apparatus can include a communication unit and a processing unit.

[0064] In the fourth aspect, the embodiments of the present application also provide a communication apparatus, including a processor configured to execute a computer program (or computer executable instructions) stored in a memory, when the computer program (or computer executable instructions) is executed, causing the apparatus to perform the method described in any of the first aspect to the second aspect and any possible implementation thereof.

[0065] In a possible implementation, the processor and the memory are integrated together;

[0066] In another possible implementation, the memory is located outside the communication apparatus.

[0067] The communication apparatus also includes a communication interface, which is used for the communication apparatus to communicate with other devices, such as the sending or receiving of data and / or signals. For example, the communication interface can be a transceiver, a circuit, a bus, a module or other types of communication interfaces.

[0068] In the fifth aspect, a computer readable storage medium is provided, which is used to store a computer program or instructions, when the computer program or instructions are executed, causing the method described in any of the first aspect to the second aspect and any possible implementation thereof and the method described in any possible implementation thereof to be implemented.

[0069] In the sixth aspect, a computer program product including instructions is provided, when the computer program product is executed on a computer, causing the method described in any of the first aspect to the second aspect and any possible implementation thereof to be implemented.

[0070] In a seventh aspect, an embodiment of the present application further provides a communication apparatus, configured to execute the method in any one of the first aspect to the second aspect and any possible implementation of the method.

[0071] In an eighth aspect, a chip system is provided, which includes a logic circuit (or can be understood as including a processor, which can include a logic circuit, etc.), and can further include an input / output interface. The input / output interface can be used for inputting a message, and can also be used for outputting a message. The input / output interface can be the same interface, i.e., the same interface can realize both the sending function and the receiving function; or the input / output interface includes an input interface and an output interface, the input interface is used to realize the receiving function, i.e., is used to receive a message; and the output interface is used to realize the sending function, i.e., is used to send a message. The logic circuit can be used to perform operations other than the transceiving function in the method in any one of the first aspect to the second aspect and any possible implementation of the method; and the logic circuit can also be used to transmit a message to the input / output interface, or receive a message from the input / output interface from other communication apparatuses. The chip system can be used to realize the method in any one of the first aspect to the second aspect and any possible implementation of the method. The chip system can be composed of a chip, or can include a chip and other discrete devices.

[0072] Optionally, the chip system can further include a memory, which can be used to store instructions, and the logic circuit can call the instructions stored in the memory to realize corresponding functions.

[0073] In a ninth aspect, a communication method is provided, which can include the method implemented by the first communication apparatus in the first aspect and any possible implementation of the method, and the method implemented by the second communication apparatus in the second aspect and any possible implementation of the method.

[0074] In a tenth aspect, a communication system is provided, which can include a first communication apparatus and a second communication apparatus. The first communication apparatus can be used to realize the method in the first aspect and any possible implementation of the method, and the second communication apparatus can be used to realize the method in the second aspect and any possible implementation of the method.

[0075] The technical effects brought by the above third aspect to the tenth aspect can be referred to the description of the beneficial effects of the corresponding solutions in the first aspect to the second aspect, which will not be described herein. BRIEF DESCRIPTION OF DRAWINGS

[0076] FIG. 1 is a schematic diagram of an architecture of a wireless communication system;

[0077] FIG. 2 is a schematic diagram of a spread spectrum and precoding processing flow;

[0078] FIG. 3 is a flow diagram of a communication method according to an embodiment of the present application;

[0079] FIG. 4 is a schematic diagram of a precoding and spreading processing method according to an embodiment of the present application;

[0080] FIG. 5 is a schematic diagram of resource distribution of a precoding and spreading processing method according to an embodiment of the present application;

[0081] FIG. 6 is a schematic diagram of a communication apparatus according to an embodiment of the present application;

[0082] FIG. 7 is a schematic diagram of another communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0083] Embodiments of the present application provide a communication method and apparatus. Since the principles of the method and apparatus for solving the problem are similar, the implementation of the apparatus and the method can be referred to each other, and the repeated parts will not be described again.

[0084] FIG. 1 is a schematic diagram of an architecture of a communication system 10 to which embodiments of the present application are applied. As shown in FIG. 1, the communication system includes an access network 100 and a core network 200. Optionally, the communication system 10 can also include an Internet 300. The radio access network (RAN) 100 can include at least one RAN node (e.g., 110a and 110b in FIG. 1) and at least one terminal (e.g., 120a-120j in FIG. 1). The terminal is connected to the radio access network device in a wireless manner, and the radio access network device is connected to the core network in a wireless or wired manner. The core network device and the radio access network device can be independent and different physical devices, or can be integrated into the same physical device with the functions of the core network device and the logical functions of the radio access network device, or can be a physical device integrated with part of the functions of the core network device and part of the functions of the radio access network device. The terminals and the terminals, and the radio access network devices and the radio access network devices can be connected to each other in a wired or wireless manner. FIG. 1 is only a schematic diagram, and the communication system can also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 1.

[0085] The network device is a network-side device with wireless transceiving function. The network device can be a device providing wireless communication function for a terminal device in a radio access network (RAN), referred to as a RAN node. The RAN can be an access network in the 3rd generation partnership project (3GPP), for example, a 4G, 5G, or future-oriented communication network. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network of two or more of the above networks. The RAN node can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next generation NodeB (gNB) in a 5th generation (5G) mobile communication system, a base station in a future mobile communication system, an access node in a wireless fidelity (WiFi) system, a long range radio (LoRa) system, or a vehicle-to-everything system. The RAN node can also be a module or unit that completes part of the function of a base station, for example, a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU here completes the function of the radio resource control protocol and the packet data convergence protocol (PDCP) of the base station, and can also complete the function of the service data adaptation protocol (SDAP). The DU completes the function of the radio link control layer and the medium access control (MAC) layer of the base station, and can also complete part or all of the function of the physical layer. For specific descriptions of the above protocol layers, reference can be made to the relevant technical specifications of the 3GPP. The CU and the DU can be separately arranged or included in the same network element, for example, a baseband unit (BBU).The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, the CU, the DU, or the RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, and the RU can also be referred to as an O-RU. Any of the CUs (or CU-CPs, CU-UPs), DUs, and RUs in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module. The wireless access network device can be a macro base station (such as 110a in FIG. 1), a micro base station or an indoor station (such as 110b in FIG. 1), or a relay node or a donor node, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the wireless access network device. For ease of description, the network device is referred to as the wireless access network device, and the base station is an example of the wireless access network device.

[0086] The terminal is a device with wireless transceiver function, which can send signals to the base station or receive signals from the base station. The terminal can also be referred to as a terminal device, a user equipment (UE), a mobile station, a mobile terminal, etc. The terminal can be widely used in various scenarios, such as device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, remote medical treatment, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiver function, a wearable device, a vehicle, an airplane, a ship, a robot, a mechanical arm, a smart home device, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the terminal.

[0087] The base station and the terminal can be fixed in position or movable. The base station and the terminal can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water surface; can also be deployed on an airplane, a balloon, and a man-made satellite. The embodiments of this application do not limit the application scenarios of the base station and the terminal.

[0088] The roles of the base station and the terminal can be relative. For example, the helicopter or the drone 120i in FIG. 1 can be configured as a mobile base station, and for the terminal 120j that accesses the wireless access network 100 through the 120i, the terminal 120i is a base station; but for the base station 110a, the 120i is a terminal, that is, the 110a and the 120i communicate through a wireless air interface protocol. Of course, the 110a and the 120i can also communicate through a base station-to-base station interface protocol, and in this case, the 120i is also a base station relative to the 110a. Therefore, the base station and the terminal can be collectively referred to as a communication device, and the 110a and the 110b in FIG. 1 can be referred to as a communication device with a base station function, and the 120a-120j in FIG. 1 can be referred to as a communication device with a terminal function.

[0089] It can be understood that the base station and the terminal in the present application, the base station and the base station, and the terminal and the terminal can communicate through the licensed spectrum, or can communicate through the unlicensed spectrum, or can communicate through the licensed spectrum and the unlicensed spectrum at the same time. In addition, the base station and the terminal, the base station and the base station, and the terminal and the terminal can communicate through a frequency spectrum below 6 gigahertz (GHz), for example, through a 700 / 900 megahertz (MHz), 2.1 / 2.6 / 3.5 GHz frequency band, or can communicate through a frequency spectrum above 6 GHz, for example, through a millimeter wave, a terahertz (THz) wave, or can communicate through a frequency spectrum below 6 GHz and a frequency spectrum above 6 GHz at the same time. The embodiments of the present application do not limit the frequency spectrum resources used for wireless communication.

[0090] In the embodiments of the present application, the functions of the base station can also be performed by a module (such as a chip) in the base station, or can be performed by a control subsystem containing the base station function. The control subsystem containing the base station function herein can be a control center in the above-mentioned application scenarios such as smart grid, industrial control, intelligent transportation, and smart city. The functions of the terminal can also be performed by a module (such as a chip or a modem) in the terminal, or can be performed by a device containing the terminal function.

[0091] In the present application, the base station sends a downlink signal or downlink information to the terminal, and the downlink information is carried on a downlink channel; the terminal sends an uplink signal or uplink information to the base station, and the uplink information is carried on an uplink channel. In order to communicate with the base station, the terminal needs to establish a wireless connection with a cell controlled by the base station. The cell that establishes a wireless connection with the terminal is called a service cell of the terminal. When the terminal communicates with the service cell, it will also be interfered by signals from neighboring cells.

[0092] The technical terms involved in the present application are introduced as follows.

[0093] (1) MIMO technology: can support using multiple transmit antennas for signal transmission at the transmitting end and using multiple receive antennas for signal reception at the receiving end to improve the service quality of users, such as reducing the bit error rate and increasing the data rate. In addition, multiple-input single-output (MISO) and single-input multiple-output (SIMO) based on transmit diversity and receive diversity are also part of MIMO.

[0094] (2) Precoding technology: network devices such as base stations can process the to-be-transmitted signal by means of a precoding matrix matched with the channel state in the case of known channel state, so that the to-be-transmitted signal after precoding is adapted to the channel, thereby reducing the complexity of the receiving device to eliminate the influence of the channel. Therefore, through the precoding processing of the to-be-transmitted signal, the receiving signal quality is improved, and the receiving signal quality can be represented by parameters such as signal to interference plus noise ratio (SINR). Therefore, by using the precoding technology, the transmitting device and multiple receiving devices can transmit on the same time-frequency resource, that is, multiple user multiple input multiple output (MU-MIMO) is realized. It should be understood that the related description of the precoding technology in this paper is only for example to facilitate understanding, and is not used to limit the protection scope of the embodiments of the present application. In the specific implementation process, the transmitting device can also perform precoding in other ways. For example, in the case where the channel information (such as the channel matrix) cannot be obtained, a pre-configured precoding matrix or a weighting processing method is used for precoding.

[0095] (3) 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 terminal device through channel estimation or based on channel reciprocity. For example, the precoding matrix can be obtained by singular value decomposition (SVD) of the channel matrix or the covariance matrix of the channel matrix, or it can also be obtained by eigen value decomposition (EVD) of the covariance matrix of the channel matrix.

[0096] (4) Precoding layer number: also can be referred to as transmission layer number. Optionally, the network device can determine the precoding layer number for data transmission between the network device and the terminal device according to the rank of the channel matrix fed back by the terminal device. The terminal device can determine the rank of the channel matrix according to the channel obtained through channel estimation. For example, in the process of determining the precoding matrix through SVD, different precoding layers can be distinguished according to the size of the eigenvalue. For example, the precoding vector determined by the eigenvector corresponding to the largest eigenvalue can correspond to the first precoding layer, and the precoding vector determined by the eigenvector corresponding to the smallest eigenvalue can correspond to the Zth precoding layer. That is, the eigenvalues corresponding to the first transmission layer to the Zth precoding layer decrease in turn.

[0097] In this application, it is assumed that one data stream occupies one layer, that is, the number of data streams is equal to the number of precoding layers.

[0098] (5) Port: also can be referred to as antenna port, which can be understood as a virtual antenna identified by the receiving device. The port is a logical concept, and one port can be one physical transmitting antenna or a combination of multiple physical transmitting antennas. The signals transmitted through the same port, whether they are transmitted through the same or different physical antennas, can be considered as the same or related in terms of the channel corresponding to the path experienced by the signals in space transmission. For example, the large-scale channel characteristics of the signals transmitted through the same port are the same as the channel matrix. That is, the signals transmitted through the same port can be considered as the same or related in terms of the channel when demodulated by the receiving end, and the signal receiving end usually identifies signals with different transmission channels through antenna ports.

[0099] Optionally, the port refers to a transmitting antenna port, for example, the reference signal of each port can be a reference signal without precoding, or a precoded reference signal obtained by precoding the reference signal based on a delay vector. The number of ports can refer to the number of transmitting antenna ports, or the number of transmitting antennas.

[0100] Optionally, the port refers to a reference signal port after beamforming, for example, the reference signal of each port can be a precoded reference signal obtained by precoding the reference signal based on an angle vector, or a precoded reference signal obtained by precoding the reference signal based on an angle vector and a delay vector. The number of ports can refer to the number of reference signal ports, or the number of angle vectors. It can be understood that the number of reference signal ports after beamforming can be less than the number of transmitting antenna ports.

[0101] (6) Reference signal (RS) and precoded reference signal: The reference signal can also be referred to as a pilot, a reference sequence, etc. In the embodiments of the present application, the reference signal can be a reference signal for channel measurement. For example, the reference signal can be a channel state information reference signal (CSI-RS) for downlink channel measurement, or a sounding reference signal (SRS) for uplink channel measurement. It should be understood that the reference signals listed above are only examples and should not constitute any limitation on the present application. The present application does not exclude the possibility of defining other reference signals in future protocols to achieve the same or similar functions. The precoded reference signal can be a reference signal obtained by precoding the reference signal. The precoding can specifically include beamforming and / or phase rotation. For example, beamforming can be achieved by precoding the downlink reference signal based on one or more angle vectors, and phase rotation can be achieved by precoding the downlink reference signal based on one or more delay vectors.

[0102] (7) Frequency domain unit: The unit of frequency domain resource, which can represent different frequency domain resource granularity. The frequency domain unit can include but is not limited to, sub-band, resource block (RB), resource block group (RBG), precoding resource block group (PRG), etc.

[0103] (8) Multiple access technology: In the radio coverage range of a wireless communication environment, how to establish a connection between the wireless channels of users is a multiple access (MA) problem. The method for solving the multiple access problem is called multiple access technology. The multiple access technology divides the signal dimension into different channels and allocates them to users to realize communication between multiple users using the above resources.

[0104] According to whether the user access is related, the multiple access technology can be divided into orthogonal MA (OMA) and NOMA. Among them, the user in OMA exclusively occupies a certain dimension of signal resource, while multiple users in NOMA share channel resources and cannot be distinguished by a certain dimension.

[0105] In addition, the multiple access technology can also be classified according to the signal dimension. When the multiple access is established according to the different division of the carrier frequency of the transmitted signal, the multiple access technology can be a frequency division multiple access (FDMA) mode. When the multiple access is established according to the different division of the time of the transmitted signal, the multiple access technology can be referred to as a time division multiple access (TDMA) mode. When the multiple access is established according to the different division of the code type of the transmitted signal, the multiple access technology can be a code division multiple access (CDMA) mode.

[0106] At present, 3GPP mainly discusses the multiple access under the scenario that the terminal has only one transmitting antenna (i.e., 1TX), and mainly non-orthogonal multiple access technology, without involving the MIMO scenario that the terminal has multiple TX capabilities. How the multi-transmitting antenna scenario user utilizes multiple antennas for multiple access still needs to be discussed.

[0107] The spatial division multiple access (SDMA) technology is the technical basis for large-scale application of the MIMO scheme. The SDMA technology is a spatial domain access scheme constructed by using large-scale antenna arrays on the transmitting side and the receiving side. However, the SDMA scheme only has significant benefits in the scenario that the user channel is low correlation, and the performance in the scenario that the user channel is high correlation often deteriorates sharply.

[0108] In order to improve the performance of SDMA in the scenario that the channel is high correlation, the industry has also proposed a MIMO-code division non-orthogonal multiple access (CD-NOMA) technical scheme in recent years, which introduces CD-NOMA on the data stream. In MIMO-CD-NOMA, the low correlation characteristics of the spreading sequences c n,i and c k,j can be used to reduce the correlation between users in the same space and between intra-user streams. For example, different data streams use c n,i and c k,j with lower correlation as spreading sequences to reduce the interference between data streams. However, if multiple data streams use spreading sequences with higher correlation, the interference between the above data streams cannot be reduced.

[0109] As shown in FIG. 2, terminal n transmits data symbols s t of the data stream i based on MIMO-CD-NOMA using N n,iThe process is (m). m represents the m-th symbol of the data stream. In the MIMO-CDMA scheme, all data symbols in the same stream are processed the same way, so m is ignored, and s is used instead. ni Let $\mathbf{i}$ represent any symbol in data stream $i$ for user $n$, and describe the processing procedure for that symbol. The terminal first performs line spread spectrum on the data stream, i.e., using sequence $c$. n,i s n,i Extended to N of 1 NOMA unit sf On each time-frequency resource, N sf A time-frequency resource can refer to N sf A time-frequency resource unit, for example, N sf There are REs. For ease of understanding, we can consider a as... n,i It is a time-domain symbol sequence, corresponding to different time-domain orthogonal frequency division multiplexing (OFDM) symbols 1 to N. sf The same frequency domain resource location. The terminal then... n,i Perform column spread spectrum (or spatial spread or SDMA), i.e., symbol a n,i (j) after Weighted f n,i N is the weighting factor. t f represents the number of transmitting antennas of the terminal. n,i (1) to f n,i (N t ) represent N respectively t The weighting factor corresponding to each of the root transmitting antennas. The terminal can be in N t b is transmitted on the root antenna n,i (j), for example, the first transmitting antenna transmits f n,i (1)a n,i (j), the second transmitting antenna transmits f n,i (2)a n,i (j), and so on. Finally, at N... sf Each time-frequency resource is accessed through N t The data matrix transmitted by the root transmitting antenna satisfies:

[0110] Assume there are N x The terminals in the above N sf Data is transmitted on N time-frequency resources, and each terminal has N... t With one antenna, each terminal transmits L streams, and the terminal experiences flat fading. Then, the signal model Y at the receiving side satisfies:

[0111] wherein, is the channel experienced by terminal n, s n,i denotes a data stream. N R denotes the number of base station receive antennas.

[0112] Vectorize Y to get vec(Y):

[0113] wherein, denotes a Kronecker product. The channel correlation coefficient of data stream i of terminal n and data stream j of terminal k satisfies:

[0114] wherein, f n,i denotes the weight factor of data stream i of terminal n, f k,j denotes the weight factor corresponding to data stream j of terminal k. H k denotes the channel of terminal k.

[0115] At this time, if two data streams are required to be orthogonal and mutually independent, can be defined that is, when two data streams use orthogonal spreading sequences, the two data streams are orthogonal to each other. However, in the case of using non-orthogonal spreading sequences, the two data streams are orthogonal to each other if and only if the spatial orthogonality of the two users , otherwise the two data streams are non-orthogonal, and the interference is still reduced subject to the constraint of δ n,k (i,j)<1. Combined with the bandwidth loss brought by spreading itself, the capacity of the MIMO-CD-NOMA system is limited.

[0116] Therefore, how to improve the capacity of multi-data stream transmission is a technical problem to be solved in the MIMO technology at present.

[0117] In order to improve the capacity of multi-data stream transmission, the present application provides a communication method. The communication method can be implemented by a first communication device and a second communication device. Wherein, the first communication device can be used as a signal sending end, and the second communication device can be used as a signal receiving end. That is to say, the first communication device can be used for sending signals, and the second communication device can be used for receiving signals. As an example, in the uplink communication process, the first communication device can be a terminal device, or a module or a chip and the like in the terminal device, and the second communication device can be a base station or other network equipment, or a module or a chip and the like in the network equipment, and the network equipment is, for example, a RAN node or other access network equipment.

[0118] The method will be introduced below in combination with the flow shown in FIG. 3. In FIG. 3, the first communication device is taken as an example of a first terminal, and the second communication device is taken as an example of a base station. The first communication device can also be replaced by a base station, a chip or a sending unit in the base station, or other components, or a chip or a sending unit in other communication equipment or a terminal, or other execution subjects, and the second communication device can also be replaced by a terminal or other communication equipment, or other execution subjects, without specific limitation.

[0119] As shown in FIG. 3, the communication method can include the following steps:

[0120] S101: The first terminal acquires N first sequences, N is greater than 1, any first sequence corresponds to one antenna, and the N first sequences correspond to a first data stream.

[0121] In this application, the first sequence can be used for signal spreading, and therefore can also be referred to as a spreading sequence. Specifically, the spreading sequence in this application can be used for column spreading of a signal, which will be introduced below in combination with S103.

[0122] Any first sequence includes one or more zero elements and / or one or more non-zero elements.

[0123] In one possible example, any first sequence is a sparse sequence, or in other words, each first sequence is a sparse sequence. The sparse sequence can be a sequence in which the proportion of non-zero elements in all elements of the sequence (which can be referred to as the proportion of non-zero elements in a sequence) is less than or equal to a threshold, or a sequence in which the proportion of zero elements in all elements of the sequence (which can be referred to as the proportion of zero elements in a sequence) is greater than or equal to a threshold.

[0124] In one possible example, the entirety of the N first sequences is sparse, that is, it is not required that each first sequence is sparse, but the sparsity is required from the perspective of all elements contained in the N first sequences. In this example, the proportion of non-zero elements in all elements in the N first sequences (which can be referred to as the proportion of non-zero elements in the N first sequences) is less than or equal to a threshold, or the proportion of zero elements in all elements in the N first sequences (which can be referred to as the proportion of zero elements in the N first sequences) is greater than or equal to a threshold.

[0125] In any of the above examples, the threshold can be 1 / 2 or other numerical values, without specific limitation in this application.

[0126] The N first sequences can correspond to N antennas one-to-one, and the N antennas can belong to one or more terminals, such as a first terminal. The present application does not make specific limitations. It can be understood that if the N antennas belong to a terminal, the terminal can be the first terminal in S101. That is, N = N t , N t represents the number of antennas of the first terminal.

[0127] In addition, in some cases, N < N t . For example, part of the N t antennas of the first terminal are not used, that is, only N antennas are needed. At this time, the unused antennas can correspond to the 0 sequence. For another example, multiple antennas of the first terminal correspond to the same first sequence, for example, multiple antennas corresponding to the same port can correspond to the same first sequence.

[0128] If the N antennas belong to multiple terminals, the multiple terminals can include the first terminal in S101, and can also include one or more other terminals (such as a second terminal). At this time, N can be greater than, less than, or equal to N t , which is not specifically limited. Optionally, the base station can indicate the mapping relationship between the antennas of the terminal and the N antennas to the multiple terminals. Taking the antennas of the first terminal as an example, the base station can indicate the index of the antenna of the first terminal in the N antennas to the first terminal, for example, the base station can configure the first terminal with the index x and the index y of the antenna of the first terminal, wherein the index x can be used to indicate the antenna with the index x of the first terminal (that is, antenna x), and the index y can be used to indicate that the antenna x of the first terminal is the yth antenna in the N antennas, and x and y are positive integers. In addition, the index y can also be used to indicate that the antenna x of the first terminal corresponds to the yth first sequence, wherein the yth first sequence corresponds to the yth antenna in the N antennas.

[0129] In the present application, the antenna can refer to a physical antenna or a virtual antenna, or a precoded antenna port. The physical antenna can refer to a physically independent antenna of a terminal. The virtual antenna can be a logical antenna, such as an antenna port, which is formed by combining multiple physical antennas.

[0130] Optionally, the N first sequences can form a matrix, that is, in S101, the first communication device can obtain the N first sequences in the form of a matrix.

[0131] In addition, the N first sequences can correspond to one data stream, i.e., a first data stream. It can be understood that the N first sequences can be used to process the first data stream to obtain a transmission signal corresponding to the first data stream. It can be understood that one data stream can correspond to one antenna port (at this time, the antenna port can be a precoding processed antenna port), and one antenna port corresponds to N physical antennas. Alternatively, one data stream can correspond to N antenna ports (at this time, the antenna port can be a precoding processed antenna port), and one antenna port corresponds to 1 physical antenna. Wherein, any data stream corresponds to one antenna port, so it can also be said that the N first sequences can correspond to one antenna port.

[0132] The manner in which the first terminal obtains the N first sequences will be described below in conjunction with Embodiment 1, which will not be expanded here.

[0133] S102: The first terminal performs precoding processing on the first data stream to obtain a first signal.

[0134] In S102, the precoding processing can mean performing column spreading on the first data stream.

[0135] As an example of precoding processing, the first terminal can perform precoding processing on the first data stream by a transmission weight. For example, the first data stream can be represented as s1, the transmission weight corresponding to the first data stream is represented as f1, and accordingly, the precoding processed first signal can be represented as a1=f1s1. The precoding processing here is actually an operation on an element in one data stream. By default, all elements in the same data stream are operated in the same way, so the element subscript is ignored.

[0136] Specifically, if there are multiple terminals, the first signal corresponding to the i-th data stream of the n-th terminal can be represented as n,i , a n,i can satisfy:

[0137] wherein f n,i represents the transmission weight corresponding to the i-th data stream of the n-th terminal. It can be understood that different terminals and / or different data streams can correspond to different transmission weights. s n,i represents the i-th data stream of the n-th terminal. Wherein, the length of a n,i may be P.

[0138] Wherein, the transmission weight can also be described as a spatial weight or a precoding vector. The transmission weight can be included in a precoding matrix, that is, the transmission weight can be configured in the form of a precoding matrix. Wherein, the precoding matrix can be used to indicate the transmission weights of multiple terminals, and the first terminal can obtain the transmission weight of the first terminal from the precoding matrix.

[0139] The first terminal can receive configuration information from the base station, and the configuration information can include a transmission weight of the first terminal or include a precoding matrix including the transmission weight.

[0140] Optionally, the first signal after the precoding processing can include P elements, P being a positive integer. That is, the transmission weight can be used to expand the first data stream into a column vector with a length of P, for example, a1 can include P elements. For example, when N antennas all belong to the first terminal, the first signal can include P=N elements. For another example, when N antennas belong to multiple terminals, P antennas of the N antennas belong to the first terminal, i.e., P

[0141] In addition, P>N can also be met. For example, the first signal can include more than N elements. At this time, the multiple elements of the first signal can correspond to the same first sequence.

[0142] S103: The first terminal performs spread spectrum processing on the pth element of the first signal according to the jth first sequence to obtain the pth group of second signals, 1≤p≤P.

[0143] In S103, the spread spectrum processing can be referred to as row spread spectrum processing on the first signal. The first terminal can perform spread spectrum processing on the P elements of the first signal one by one through one or more first sequences to obtain P groups of second signals. It can be referred to that a certain element and the first sequence used for the row spread spectrum processing of the element correspond to each other, i.e., the jth first sequence corresponds to the pth element of the first signal.

[0144] It can be understood that in the P groups of second signals, each group of second signals can include N sf row elements. That is, the 1st to Pth groups of second signals can include N sf row P column elements, i.e., the 1st to Pth groups of second signals can be represented by a matrix composed of N sf row P column elements.

[0145] The correspondence between the N first sequences and the P elements will be described in the following cases according to the size relationship between P and N. The first sequence can be used for row spread spectrum processing of the corresponding element.

[0146] Case 1: When P=N, the N first sequences and the P elements of the first signal can correspond to each other one by one, for example, p=j. That is, at this time, the N elements of the first signal can be processed by the N first sequences respectively for row spread spectrum processing. In case 1, S103 can be changed to: the first terminal performs spread spectrum processing on the jth element of the first signal according to the jth first sequence to obtain the jth group of second signals.

[0147] Case 2: When P < N, there is a one-to-one correspondence between the P first sequences out of the N first sequences and the P elements of the first signal. That is, in this case, row spread spectrum processing can be performed on the P elements of the first signal using the P first sequences respectively. For example, when N antennas belong to multiple terminals, and P antennas out of the N antennas belong to the first terminal, the first terminal only needs to use the P first sequences out of the N first sequences to perform row spread spectrum processing on the P elements of the first signal respectively.

[0148] Case 3, when P > N, at least one of the N first sequences can correspond to at least two elements of the first signal, meaning that the at least two elements can use the same spreading sequence for line spreading processing. It is understood that the scheme shown in Figure 2 occurs when all elements of the first terminal use the same first sequence. However, in this application, at least two of the first sequences corresponding to the P elements of the first terminal are different.

[0149] Taking P=N as an example, as a type of line spread spectrum, the N elements of the first signal can be represented as a1(1) to a1(N), and the second signals of the first to Nth groups can be represented as B1, satisfying:

[0150] Among them, c1……c N Each represents one of the N first sequences. Let the transpose of the j-th first sequence be denoted as . Let represent the second signal in the j-th group. `diag()` represents a diagonal matrix. `C1` represents a matrix consisting of N first sequences. Let C1 be the transpose of C1.

[0151] Optional, That is, the element in the j-th column of the matrix can be used as the j-th first sequence. Additionally, if Then the element in the j-th row of the matrix can be used as the j-th first sequence, and correspondingly, in Formula 1... It can be replaced with C1.

[0152] It is understandable that if all N antennas belong to the first terminal n, the N elements of the first signal can be represented as a. n,i (1) to a n,i (N), the first to Nth groups of the second signals of the first terminal n can be represented as b n,i b n,i satisfy:

[0153] in, Each represents one of the N first sequences. Let the transpose of the j-th first sequence be denoted as . denotes the j-th group of second signals. n,i denotes a matrix consisting of N first sequences. denotes the transpose of C n,i .

[0154] Formula 2 can be understood as a variant of formula 1.

[0155] Optionally, that is, the j-th column element of the matrix can be used as the j-th first sequence. In addition, if , the j-th row element of the matrix can be used as the j-th first sequence, and correspondingly, C in formula 1 can be replaced by C n,i .

[0156] S104: The first terminal transmits the u-th element in the j-th group of second signals through the j-th antenna at the u-th time-frequency resource, 1≤u≤N sf , N sf is the length of the first sequence.

[0157] wherein the u-th time-frequency resource can be one of N sf time-frequency resources. Optionally, the N sf time-frequency resources can be continuous time-frequency resources, or discontinuous time-frequency resources, which are not specifically limited. The N sf time-frequency resources can also be referred to as N sf time-frequency resource units. The time-frequency resource unit is, for example, a RE, or other resource units.

[0158] In addition, the N sf time-frequency resources on which the N first sequences act are an NOMA unit (or a spreading unit). It can be understood that one NOMA unit can correspond to N first sequences, that is, the N sf time-frequency resources (or one NOMA unit) can be used to represent the time-frequency resources to which the N first sequences are applied, that is, different spreading sequences (or spreading matrices) can be used for different NOMA units. Taking N sf time-frequency resources as N sf REs for example, that is, one NOMA unit can include N sf REs, and the base station can indicate the index of the N sf REs to the first terminal, such as indicating the index of the first continuous RE and / or the index of the last continuous RE in the N sf REs, and / or indicating the index of the discontinuous REs; in addition, the base station can also indicate the index of all N sf REs.

[0159] The time-frequency resource here can be an RE. For example, the u-th time-frequency resource can be the k-th RE in the N sf REs.

[0160] Based on S104, the first terminal can respectively send N sf elements of the j-th group of second signals on the N sf time-frequency resources through the j-th antenna. That is, the first terminal can send the matrix B1 on the 1≤u≤N sf time-frequency resources through the 1≤j≤N antennas, where the symbol sent on the u-th resource of the j-th antenna is the b1(j,k) in the u-th column of the j-th row of B1.

[0161] In addition, if the N antennas in S101 all belong to the first terminal, that is, P=N, then N groups of second signals can be obtained, and the first terminal can respectively send the 1st to the Nth groups of second signals through the N antennas.

[0162] It can be understood that if the N antennas all belong to the first terminal, the first terminal can determine the j-th antenna corresponding to the j-th first sequence according to the indexes of the N antennas. For example, the indexes of the N antennas of the first terminal are 1, 2, …, N respectively. The indexes of the N antennas of the first terminal can also start from 0, for example, 0, 1, 2, …, N-1.

[0163] If the N antennas belong to multiple terminals, and the antenna x1 of the first terminal is one of the N antennas, the first terminal can determine that the antenna corresponding to the j-th first sequence is the antenna x1 according to the mapping relationship between the N antennas and the antenna x1 of the first terminal, that is, determine that the j-th antenna is the antenna x1. For example, the first terminal can receive an antenna configuration from the base station, which can be used to indicate that the antenna x1 corresponds to the j-th first sequence, or the antenna configuration can be used to indicate that the antenna x1 corresponds to the j-th antenna of the N antennas, so the first terminal can determine that the antenna corresponding to the j-th first sequence is the antenna x1.

[0164] Based on the flow shown in FIG. 3, the first terminal can perform precoding processing on the first data stream to realize column spreading of the first data stream. In addition, the first terminal can perform row spreading on the obtained signal after column spreading through the N first sequences to obtain the to-be-sent signal b n,i . For example, the signal processing process of obtaining the second signal according to formula 2 can be referred to FIG. 4.

[0165] It can be understood that the first terminal in the present application can indicate to the base station that the first terminal supports using the method shown in the present application through the capability information. Correspondingly, the base station can determine to use the method shown in the present application according to the capability information of the first terminal, avoid configuring N first sequences to the terminal which does not support the present application, and improve the configuration reliability. For example, the base station can configure the first matrix and / or N first sequences to the first terminal after obtaining the capability information of the first terminal and determining that the first terminal supports using the method shown in the present application according to the capability information. Optionally, the capability information can be used to indicate that the first terminal supports spreading the pth element of the first signal according to the jth first sequence, that is, the first terminal supports performing S103, or the capability information can be used to indicate that the first terminal supports the flow shown in FIG. 3, or the capability information can be used to indicate that the first terminal supports NOMA spreading. It can also be understood that the first terminal can also indicate that the first terminal supports using the method shown in the present application through other uplink signaling or messages other than the capability information.

[0166] After the second signal is processed by formula 2 and transmitted based on S104, the received signal can be represented as Y, wherein Y satisfies: Y = H1B1 + W.

[0167] Wherein, H1 represents the antenna channel of the first terminal, W represents noise. B1 represents the 1st to Nth group of second signals of the 1st terminal, which can be referred to formula 1.

[0168] In addition, after the second signal is processed by formula 2 and transmitted based on S104, the received signal can be represented as Y, wherein Y satisfies:

[0169] Wherein, H n represents the antenna channel of the nth terminal, W represents noise. C n,i represents the matrix composed of N first sequences. is the transpose matrix of C n,i .

[0170] After vectorizing Y, the vectorized expression vec(Y) of Y is obtained, and vec(Y) satisfies:

[0171] Wherein, represents Khatri-Rao product.

[0172] According to formula 3, for the multi-terminal scenario, the channel correlation coefficient of the i1th data stream of the n1th terminal and the i1th data stream of the n1th terminal is:

[0173] Wherein, represents the Hadamard product of the matrix, that is, the point multiplication of the corresponding elements of the two matrices.

[0174] According to ρ n1,n2 (i1,i2) of the expression, when Or ρ n,k (i,j) = 0. Wherein, I represents the unit matrix of N*N. μ is a constant value. Therefore, the sequence condition of making two data streams orthogonal is extended, not limited to two data streams using orthogonal spreading sequences to achieve the orthogonality of data streams, which can expand the MIMO-CD-NOMA system capacity.

[0175] In addition, since the first sequence contains one or more zero elements, or, any first sequence is a sparse sequence, the transmission interference between data streams can be further reduced. Figure 5 shows the signal diagram of dense matrix spreading, sparse sequence spreading and sparse matrix spreading on different REs. The vertical coordinate of one RE in the figure represents different antennas, and the horizontal coordinate represents different users. Among them, the dense matrix represents the matrix without zero value, that is, the N first sequences do not contain zero elements. The sparse sequence spreading represents that the terminal uses the same sparse sequence for spreading on different antennas. The sparse matrix spreading represents that the terminal uses different sparse sequences for spreading on different antennas. In figure 5, the shaded position represents the existence of data stream transmission, that is, the shaded position corresponds to the non-zero element in the spreading sequence (or matrix), and different shading patterns correspond to different terminals. The blank position represents the non-existence of data stream transmission, that is, the blank position corresponds to the zero element in the spreading sequence (or matrix).

[0176] Assuming that the specific values of the channel and the first sequence are not considered, from figure 5, it can be seen that when the dense matrix spreading, the number of interference users of a user (such as the first terminal) on all REs is the same, and each user is interfered by all other users on each RE. From the total number of interference users, the interference between different REs is uniform, and only when satisfies certain characteristics (i.e. Or ), it is possible to reduce the interference between users, so the overall interference of dense matrix spreading is large.

[0177] In addition, if the multiple antennas of the terminal correspond to the same sparse sequence, the user only sends data signals on the RE pointed by the non-zero elements of the sequence. It can be seen that at this time, the interference users of the same user on different REs are different, so the sparse spreading can reduce the user interference to a certain extent. But from figure 5, it can also be found that for a single user, the interference sources of different antennas on the same RE are the same, and when the user is highly related to the above interference channel, it will be difficult to eliminate the above interference.

[0178] In the present application, different antennas of the same user can be required to correspond to different first sequences, wherein any first sequence can include at least one zero element. As shown in the sparse matrix spreading in FIG. 5, different antennas of the user at the same RE can be independently transmitted, which can be transmitted or not transmitted. According to the C n,i To achieve a spatial sparsity effect similar to spatial modulation, the number of interference sources on different antennas of the same user at the same RE is different, and the high correlation is significantly reduced, thereby bringing additional performance benefits, and the transmission interference is further reduced.

[0179] It can be understood that the sparse matrix spreading can be understood as an ideal case in the present application. It can be understood that the first terminal in the present application spreads the signals corresponding to the N antennas respectively by the N first sequences. In the case where the N first sequences are all sparse sequences, it can be understood as a sparse matrix spreading scheme, at this time the transmission interference is significantly reduced. In the general case, at least one of the N first sequences includes at least one zero element, which can also reduce the transmission interference to a certain extent.

[0180] The following describes a manner in which the base station configures the N first sequences to the first terminal.

[0181] In the present application, the base station can configure the N first sequences to the first terminal by a matrix, that is, the base station can configure a matrix (referred to as a first matrix) to the first terminal, the matrix is related to the N first sequences, and therefore the first terminal can determine the N first sequences according to the first matrix. For example, the base station can send configuration information of the first matrix to the first terminal, and the configuration information can be used to indicate or determine the first matrix.

[0182] In an implementation manner, the base station can send the first matrix to the first terminal. For example, the base station can send information of elements of the first matrix to the first terminal to indicate the first matrix. The information of the elements of the first matrix can include, indicate or be used to determine the numerical value of the row elements and / or the numerical value of the column elements of the first matrix, that is, the base station can send the row elements and / or the column elements of the first matrix to the first terminal. For example, the base station can send configuration information of the first matrix carrying the information of the elements of the first matrix to the first terminal.

[0183] It is understandable that the first matrix is ​​related to N first sequences, therefore the first matrix can be used to directly or indirectly determine N first sequences. Direct determination means that the first matrix consists of N first sequences, so the first terminal can obtain the N first sequences from the first matrix without additional calculations or processing. For example, the N first sequences are the N rows or N columns of elements in the first matrix, so the first matrix can indicate the N first sequences. Indirect determination means that the N first sequences can be obtained through calculations or processing of the first matrix. For example, the N first sequences are a subset of the first matrix or a submatrix containing N rows or N columns of elements, and the first terminal needs to select N first sequences from the first matrix. Here, the subset or submatrix of the first matrix can consist of some or all of the row elements or some or all of the column elements of the first matrix. For example, N=2, N... sf =4, the dimension of the first matrix is ​​4×4. Two rows or two columns of elements in the first matrix can form a subset or submatrix of the first matrix, and these two rows or two columns can be used as two first sequences. Alternatively, the first terminal can obtain N first sequences by expanding some or all of the elements (or vectors) of the first matrix. For example, multiple rows or columns of elements in the first matrix can be concatenated end-to-end to form a first sequence, or a row or column of elements in the first matrix can be repeatedly arranged to obtain a first sequence.

[0184] For example, the first matrix is For example, the configuration information of the first matrix sent by the base station to the first terminal may include row elements (a0,0), (0,a2), (a1,0), and (0,a3). Alternatively, the configuration information of the first matrix sent by the base station to the first terminal may include column elements (a0,0,a1,0) and (0,a2,0,a3). Wherein, if a column element corresponds to a first sequence, the configuration method of the base station sending column elements to the first terminal can also be understood as the base station sending N first sequences to the first terminal, where N=2.

[0185] Furthermore, since the first matrix is ​​a sparse matrix, the base station can only indicate the non-zero elements and their row and / or column indices in the matrix to the first terminal. That is, the configuration information of the first matrix can include the non-zero elements and their row and / or column indices in the first matrix. Let's assume the first matrix is... For example, the base station can indicate (1,1,a0), (2,2,a2), (3,1,a1), and (4,2,a3) to the first terminal. It can be understood that for element a0, its row index and column index are (1,1).

[0186] In addition, if the first matrix is a binary matrix, i.e., a0 to a3 are all 1, the values of a0 to a3 can be further omitted, i.e., only the row index and the column index need to be indicated: (1, 1), (2, 2), (3, 1), and (4, 2).

[0187] As an example, the first matrix can be an N sf ×N matrix. One dimension (row or column) of the first matrix is the number N sf of time-frequency resources, and the other dimension (column or row) is the number N of antennas. Wherein, the two dimensions of the first matrix are independent of each other and do not affect each other, and the dimensions can be determined according to actual system requirements.

[0188] Optionally, the base station can also send the first terminal the dimension information of the first matrix. The dimension information can be used to indicate whether the row of the first matrix corresponds to the number of time-frequency resources or the number of antennas, and / or, whether the column of the first matrix corresponds to the number of time-frequency resources or the number of antennas. The first terminal can determine whether a row of the first matrix is a first sequence or a column is a first sequence according to the dimension information. For example, if the number of columns of the first matrix is the number N of antennas, and correspondingly, the column of the first matrix corresponds to the number of antennas, each column in the first matrix can be a first sequence. It can also be understood that the dimension information includes row information and / or column information, the row information can be used to indicate that the row corresponds to the number of time-frequency resources or the number of antennas, and the column information can be used to indicate that the column of the first matrix corresponds to the number of time-frequency resources or the number of antennas.

[0189] Optionally, the base station can also send the first terminal the time-frequency resource information and / or data stream information corresponding to the first matrix. Wherein, the time-frequency resource information can be used to indicate the time-frequency resource corresponding to the first matrix (or N first sequences), and the time-frequency resource can also be used as the time-frequency resource information corresponding to the N first sequences. The time-frequency resource information can be used to indicate the position of the N sf time-frequency resources of one NOMA resource, and the time-frequency resource information corresponding to the first matrix can be used to reasonably determine the matrix used by the time-frequency resource.

[0190] For example, the first matrix acts on N1 time-frequency resources, marked as 0 to N-1, and the time-frequency resource information can include, indicate, or be used to determine any one or more of the following: (1) ( indicates the first matrix corresponds to M NOMA units. (2) indicates the position information of the i, i = 0, 1, …, M-1, NOMA unit on the configured N1 time-frequency resources, or the information of the NOMA unit corresponding to the nth time-frequency resource. For example, the mapping form is to map the time-frequency resources in turn, the i × N sf to (i+1) × N sf-1 time-frequency resources belong to the i-th NOMA cell, or the n-th time-frequency resource is located in the i-th NOMA cell. In the NOMA unit.

[0191] Data stream information can be used to indicate the data stream corresponding to the first matrix (or N first sequences). For example, the data stream information may include port information of the first data stream, used to indicate that the first matrix corresponds to the first data stream. Port information can be used to indicate the physical antenna or antenna port corresponding to the first data stream. For example, stream number 1 corresponds to antenna port t1, and data stream 1 corresponding to t1 is mapped to N antennas {t21, t22, ..., t2N} after precoding. The port information can be used to indicate antenna port t1, and / or, to indicate antennas {t21, t22, ..., t2N}.

[0192] The aforementioned dimensional information, time-frequency resource information, and / or data stream information may be carried in control signaling such as radio resource control (RRC) messages, MAC control elements (CE), or downlink control information (DCI), and this application does not specifically require this.

[0193] In addition, in this application, the base station may also send N first sequences to the first terminal. For example, the base station may send information about the first sequences to the first terminal to indicate the value of each first sequence.

[0194] Example 1: The following describes the possible ways to generate the first matrix.

[0195] In this application, any two matrices in the first matrix set satisfy the correlation requirement. Therefore, the second matrix set can be used to determine the correlation requirement. The matrix that satisfies the correlation requirement is selected as the first matrix set. The matrix in the second matrix set It can contain multiple matrices.

[0196] The correlation requirement can be related to the cross-correlation and / or autocorrelation between multiple matrices. For example, the correlation requirement can include that the correlation value between any two matrices does not exceed a cross-correlation threshold, i.e., the correlation between the two matrices is low. In other words, the correlation value between two matrices can be determined based on the correlation matrix of the two matrices. For example, two matrices C... k and The cross-correlation matrix is And / or, correlation requirements may include that the autocorrelation value of the matrix does not exceed an autocorrelation threshold, i.e., the matrix has low correlation. Furthermore, T n,nThe correlation matrix of the matrix C n .

[0197] In the following description, unless otherwise specified, the autocorrelation matrix and the cross-correlation matrix can be identified by the correlation matrix.

[0198] As an example, the correlation requirement can include that the correlation matrix is sparse. For example, the zero norm of the correlation matrix is required to be no more than a sparsity threshold. That is, the correlation value in this example can be determined according to the zero norm of the correlation matrix, and the corresponding correlation threshold is the corresponding sparsity threshold. When this condition is met, it means that the correlation matrix is sparse. That is, the correlation requirement can be transformed into a sparsity constraint on the correlation matrix T n,k , that is, T n,k is required to be sparse.

[0199] For example, the zero norm of T n,k (that is, the number of non-zero elements contained in T n,k ) satisfies the following condition, indicating that T n,k is sparse:

[0200] Where Th1 represents the sparsity threshold, and the larger Th1 is, the sparser the matrix is.

[0201] It can be understood that when formula 4 is met, the zero norm of the correlation matrix of the matrix C k and C n is no more than the sparsity threshold, at which time it can be considered that the matrix C k and C n satisfy the correlation requirement, or in other words, the correlation value between the matrix C k and C n does not exceed the correlation threshold.

[0202] As another example, the correlation requirement can include that the correlation matrix is low-correlated. For example, the 1-norm of the correlation matrix is required to be no more than a correlation threshold. That is, the correlation value in this example can be determined according to the 1-norm of the correlation matrix, and the corresponding correlation threshold is the corresponding correlation threshold. When this condition is met, it means that the correlation matrix is low-correlated. That is, the correlation requirement can be transformed into a correlation constraint on the correlation matrix T n,k , that is, T n,k is required to be low-correlated.

[0203] For example, the 1-norm of T n,k satisfies the following condition, indicating that T n,k is sparse:

[0204] Where Th2 represents the correlation limit, and the smaller Th2 is, the less correlated the matrix is.

[0205] It can be understood that when formula 5 is satisfied, the matrix C k and the 1-norm of the correlation matrix of C n is not more than the correlation threshold value, at this time it can be considered that the matrix C k and C n satisfy the correlation requirement, or in other words, the correlation value between the matrix C k and C n does not exceed the correlation threshold value.

[0206] In addition, in addition to determining whether two matrices satisfy the correlation requirement according to whether the correlation matrix is sparse or whether it is low correlation, it can also be determined whether two matrices satisfy the correlation requirement according to the transmission power and other parameters of the correlation matrix.

[0207] For example, when the transmission power of the autocorrelation matrix T n,n satisfies formula 6, it can be considered that the correlation requirement is satisfied:

[0208] Wherein, represents the transmission power of the correlation matrix T n,k , and Th3 represents the transmission power threshold value.

[0209] In addition, any matrix in the first matrix set in the present application satisfies the sparsity requirement. Wherein, the sparsity requirement includes that the proportion of non-zero elements in the matrix in all elements in the matrix is less than or equal to a threshold value (for the convenience of distinction, it can be called a sparsity threshold value), or the proportion of zero elements in the matrix in all elements in the matrix is greater than or equal to a threshold value. Wherein, the threshold value can be 1 / 2 or other numerical values.

[0210] As an example, the sparsity of any matrix can be defined, and whether the matrix satisfies the sparsity requirement is determined according to the size relationship between the numerical value of the sparsity and the threshold value. Wherein, the sparsity may refer to the proportion of the number of non-zero elements N non-zero in the matrix in all element numbers. The smaller the Dos value, the sparser the matrix, that is, it can be required that the sparsity is less than or equal to the threshold value.

[0211] In addition, the sparsity of the matrix can also be defined as row sparsity and / or column sparsity Wherein, the row sparsity represents the proportion of the number of non-zero elements of the ith row vector in the elements of the row vector. The column sparsity represents the proportion of the number of non-zero elements of the jth column vector in the elements of the column vector.

[0212] It can be understood that the sparsity can be constrained by a threshold value, for example, for any matrix, the sparsity of the matrix Dos, the row sparsity of at least one row (such as the maximum of the row sparsity of multiple row elements), or the column sparsity of at least one column (such as the maximum of the column sparsity of multiple column elements) can be required to be less than or equal to a threshold value Th.

[0213] For example, the sparsity of the matrix can be required to satisfy one or more of the following: Or Wherein, Can represent the maximum of the row sparsity of multiple row elements of the matrix, Can identify the maximum of the column sparsity of multiple column elements of the matrix.

[0214] Similarly, the sparsity can be defined as the proportion of the number of zero elements in the matrix to the total number of elements, or the row sparsity can be defined as the proportion of the number of zero elements in the ith row vector to the elements in the row vector, or the column sparsity can be defined as the proportion of the number of zero elements in the jth column vector to the elements in the column vector. Accordingly, the larger the sparsity value, row sparsity value or column sparsity value, the sparser the matrix, i.e. the sparsity value, row sparsity value or column sparsity value can be required to be greater than or equal to a threshold value.

[0215] Optionally, in the present application, a brute force search or the like can be used to search from the complete Set to obtain the matrices in the first matrix set, that is, the second matrix set Can be a complete Set. Based on the brute force search method, two matrices can be randomly extracted to determine whether the two matrices satisfy the correlation requirement and / or the sparsity requirement. If they do, the two matrices can be used as matrices in the first matrix set; if they do not, the matrices are re-extracted.

[0216] In addition, in the present application, the second matrix set

[0217] For example, the second matrix set Can be obtained by directly expanding the one-dimensional sequence. Wherein, any matrix in the second matrix set is represented as C n , Can satisfy: C n =[c n,1 …c n,N ].

[0218] Wherein, Is a one-dimensional sequence of N sf ×1. That is, N elements of length N sfAny matrix in the second matrix set can be obtained by combining one-dimensional sequences in the one-dimensional sequence set.

[0219] For example, a matrix in the second matrix set can be obtained by tensor expansion from multiple sequences.

[0220] For example, any matrix in the second matrix set with two sequences can be represented as C n , The following conditions can be met:

[0221] wherein, is a one-dimensional sequence of N sf ×1, is a one-dimensional sequence of N×1.

[0222] It can be understood that tensor expansion brings more possibilities to C n wherein, and may be sequences of the same property (or type), such as both of which can be Zadoff-Chu (ZC) sequences or m sequences; and may be sequences of different properties (or types), such as may be a complex sequence, may be a binary sequence of {0, 1}, and tensor expansion can realize a matrix containing 0 elements.

[0223] It can be understood that the above second matrix set can be pre-configured in the first terminal and / or the base station before sending a signal, or can be generated by the first terminal and / or the base station when a signal needs to be sent.

[0224] In addition, based on the matrices in the second matrix set , matrices meeting the correlation requirement can be screened as matrices in the first matrix set .

[0225] The following describes possible generation methods of the second matrix set .

[0226] Method 1: The second matrix set is determined based on one or more one-dimensional sequences (or base sequences), wherein the one-dimensional sequence can be a sparse sequence. For example, in the case where the sparsity threshold Th is known, a one-dimensional sparse sequence with a sparsity equal to the sparsity threshold can be used to construct the second matrix set, so that the matrices in the second matrix set meet the sparsity threshold.

[0227] For example, it is assumed that N=2, N sf= 4, and the sparsity of the matrix is required to be Dos= 1 / 2, then the second matrix set can be generated by using the one-dimensional sequence with sparsity of 1 / 2 and length of N sf = 4 to generate the second matrix set The one-dimensional sparse sequence at this time can be the column vector of the matrix seq_grp matrix. The seq_grp matrix is, for example,

[0228] It can be seen that the seq_grp includes 6 column vectors, denoted as M = 6, wherein any column vector c n has a sparsity of 50%.

[0229] In an example of determining the second matrix set, any two column vectors in the seq_grp can be taken as a matrix in the second matrix set, that is, the second matrix set can include M N = 36 matrices.

[0230] wherein the second matrix set includes a repeated matrix set that is, the matrix C n = [c n , c n ] in the second matrix set, the number of column vectors (or spreading sequences) of each matrix in the repeated matrix set is the same. In this example, there are 6 matrices as follows:

[0231] The second matrix set also includes a non-repeated matrix set that is, C n = [c n,1 , c n,2 ], c n,1 ≠ c n,2 , and there are 30 matrices.

[0232] That is, for example, in this example, the row-orthogonal matrix belongs to

[0233] Optionally, the matrix in the first matrix set can be selected from the second matrix set according to the constraint condition of the matrix. The constraint condition can include the correlation requirement of the matrix, which is described in the correlation requirement and will not be described again. In addition, the constraint condition can also include other conditions, for example, the number of non-zero elements in each sequence.

[0234] For example, if it is required that only 1 element in each row of the matrix C n in the second matrix set is not 0, that is, it is required that: The first matrix set satisfying the condition at this time The six matrices satisfying the condition in the middle are as follows:

[0235] Any one of the above six matrices C n satisfies is the conjugate matrix of C n , that is, the above matrix is a row-orthogonal matrix.

[0236] For another example, the constraint condition can also include: the column vectors in any matrix are different, that is, n,1 ≠c n,2 If the matrix is screened only according to this condition, the first matrix set

[0237] In addition, in some cases, the screening of the matrix can also not be performed, that is, in some cases, the first matrix set is the same as the second matrix set.

[0238] Method 2, determining the second matrix set based on one or more matrices. For example, one or more matrices can be used to construct the matrices in the second matrix set by Kronecker product. For the convenience of distinction, the matrices used to generate the second matrix set in the following can be referred to as base matrices.

[0239] Wherein, the base matrix can be any matrix set. For example, the base matrix can be an orthogonal matrix or a non-orthogonal matrix, which is not specifically limited.

[0240] Optionally, if two base matrices (that is, a first base matrix and a second base matrix) are used to determine the second matrix set with a dimension of N×N sf by Kronecker product, wherein the first base matrix includes r rows and q columns of elements, that is, its dimension can be r×q, and the second base matrix includes t rows and l columns of elements, that is, its dimension can be t×l. Wherein, in order to make the dimension of the second matrix set N×N sf , r, q, t and l can be set to satisfy:

[0241] r×t=N, q×l=N sf . Wherein, × represents multiplication operation.

[0242] As an example of method 2, assuming N=2, N sf =8, and the sparsity of the matrix Dos is required to be 1 / 4, taking the first base matrix as an example, which is a one-dimensional vector (or a matrix with one row), the one-dimensional sparse sequence can be The column vector of the matrix. The seq_grp matrix is, for example:

[0243] It can be seen that the seq_grp matrix includes six column vectors, denoted as M1=6, wherein any column vector cn The sparsity of the matrix is 50%.

[0244] In this example, any column vector in the matrix set may be used as the first basis matrix. In addition, the second basis matrix can be any matrix.

[0245] For example, the second basis matrix is one matrix in the matrix set A subset of the second matrix set can be determined according to any matrix in the matrix set For example, each column vector in the matrix set seq_grp can be used as the first basis matrix, and a matrix in the second matrix set can be determined according to each matrix in the matrix set In this example, there are M2=4 matrices in the matrix set each with a dimension of t=2, l=2, and a matrix sparsity of 1 / 2.

[0246] For example, a matrix in the second matrix set satisfies where a i represents a column vector in the matrix set , that is, a B j represents a matrix in the matrix set , that is, a The matrix in the second matrix set constructed based on may satisfy: C n , n=M1×i+j, that is, Therefore, the number of matrices in the set may be expanded to M1×M2=24. At this time, the number of matrices in the set may be 24. The matrix in the second matrix set constructed at this time is shown in Table 1. Each row in Table 1 corresponds to a i , and each column corresponds to a j , that is, the matrix corresponding to a i and a j in Table 1 represents a matrix determined according to the corresponding a i and B j .

[0247] Table 1

[0248] It can be understood that the second matrix set can include part or all of the matrices shown in Table 1, which is not specifically limited.

[0249] As shown in Table 1, if the mth element of a i is zero, that is, a i (m)=0, then C nThe elements of the t(m-1)+1, mt)th row of A are all zeros, 1≤m≤r. The elements of the mth row of A are not all zeros, i.e., a i The elements of the mth row of A are not all zeros, i.e., a i (m)≠0, the sparsity of the t(m-1)+1, mt)th row of C n is determined by B j . Therefore, the sparsity of C n is determined by a i and B j . In this example, the sparsity of C n is Dos C =1 / 4.

[0250] For another example, the matrices in the second matrix set satisfy i.e., the matrices in the second matrix set satisfy: Therefore, the M1xM2=24 matrices can be extended, i.e., the number of matrices in the set is 24. The matrices in the second matrix set constructed at this time are shown in Table 2. Each row in Table 2 corresponds to an a i , and each column corresponds to a B j , i.e., the matrix corresponding to an a i and a B j in Table 2 represents a matrix determined according to the corresponding a i and B j .

[0251] Table 2

[0252] It can be understood that the second matrix set can include part or all of the matrices shown in Table 2, and is not specifically limited.

[0253] It can be seen that the matrix set shown in Table 2 is significantly different from Table 1. As in Table 1, the sparsity of the matrix C n in Table 2 is determined by a i and B j , and is all Dos C =1 / 4.

[0254] In addition, the matrices in the first matrix set can also be selected from the matrices in the second matrix set based on the constraint condition. This step is not necessary and is introduced for performance consideration to obtain a better matrix set.

[0255] It can be understood that the above-mentioned mode 1 and mode 2 can also be understood as a way to determine the matrices in the second matrix set by linearly extending the one-dimensional sequence (or vector) and / or matrix.

[0256] The third mode is to determine the matrices in the second matrix set by a non-linear expansion mode on a one-dimensional sequence (or vector) and / or a matrix. The non-linear expansion mode includes, for example, nested expansion, in which a plurality of matrices are nested in a plurality of positions of another matrix.

[0257] For example, assuming N = 2, N sf = 8, and the sparsity of the matrix is required to be Dos≤ 1 / 2, the matrices in the second matrix set can be constructed by expanding the one-dimensional sequence in a non-linear mode. The one-dimensional sparse sequence can be the column vectors of the matrix. The seq_grp matrix is, for example:

[0258] It can be seen that the seq_grp includes 6 column vectors, and M1= 6, wherein the sparsity of any column vector c n is 50%.

[0259] The non-linear mode includes, for example, constructing a matrix set including N sf matrices by a row vector set, and determining the matrices in the second matrix set by the matrix set and the one-dimensional sequence. As an example, the row vector set is a row vector set of 2 x 1, and there are M2= 4 vectors.

[0260] At this time, N sf matrices are randomly selected from , and are defined as The matrices C n in the second matrix set can satisfy:

[0261] At this time, a set of sparse matrices with different sparsities including the zero matrix can be obtained, and there are 67, as shown in Table 3.

[0262] Table 3

[0263] It can be understood that the second matrix set can include part or all of the matrices shown in Table 3, and is not specifically limited.

[0264] The maximum value of the sparsity of the matrices shown in Table 3 does not exceed 1 / 2. Optionally, after deleting the zero matrix in the sparse matrix, the remaining matrix can be used as the second matrix set.

[0265] In addition, the matrices in the first matrix set can also be selected from the matrices in the second matrix set based on other constraints.

[0266] It can be understood that in the above mode 1 to mode 3, the matrix in the first matrix set can be further selected from the second matrix set according to the constraint condition of the matrix. Wherein, the constraint condition can include the correlation requirement of the matrix, see the description of the correlation requirement, and will not be repeated. In addition, the constraint condition can also include other conditions, such as the constraint of the element value in the queue matrix, for example, the number of non-zero elements in each sequence.

[0267] It can also be understood that in the above mode 1 to mode 3, the action of selecting the matrix in the first matrix set from the second matrix set according to the constraint condition is not necessarily performed, and is only an optional step when better performance is considered.

[0268] It can also be understood that for the multi-terminal scenario, the base station can refer to the configuration manner of the configuration information of the first matrix in the present application to configure the matrix to the terminal other than the first terminal, and will not be repeated.

[0269] Based on the above manner of constructing the second matrix set and screening the matrix to obtain the first matrix set, the base station can configure the number of one-dimensional sequences participating in the construction, the type of each one-dimensional sequence, the sequence length and the sequence generation manner information, the above sequence expansion manner, the matrix correlation requirement or the correlation threshold, and other specific matrix set construction schemes to the terminal (such as the first terminal).

[0270] It can also be understood that the matrix in the second matrix set may include multiple matrices generated by different generation manners. That is, a part of the matrices in the second matrix set may be constructed in a certain manner, and another part of the matrices can be constructed in another different manner. Wherein, the different matrix construction manners can include at least one of the following: different sequence types, different sequence lengths, different sequence expansion manners, different correlation requirements or different correlation thresholds, etc. For example, a part of the matrices in the second matrix set can be constructed according to one-dimensional ZC sequence, and another part of the matrices can be constructed according to one-dimensional m sequence.

[0271] In addition, the base station can send the configuration information of the first matrix to the first terminal, and the configuration information of the first matrix can carry the parameters used to determine the first matrix, that is, the configuration information can not directly carry the information of the elements of the first matrix.

[0272] Correspondingly, the first terminal can obtain the first matrix according to the configuration information of the first matrix, or in other words, the first terminal can determine or generate the first matrix according to the first configuration information.

[0273] As an example, the configuration information of the first matrix can contain a first generation parameter, which can be used to generate the first matrix. For example, the first generation parameter can include a sequence type, a sequence length, a configuration parameter of generating a sequence, a sequence expansion manner, etc. The first terminal can generate the first matrix according to the first generation parameter to obtain N first sequences. For example, the first terminal can expand according to the sequence according to the first generation parameter to obtain the first matrix. Wherein, the sequence type is used to indicate, for example, that the type of the sequence used to generate the first matrix is a ZC sequence or an m sequence, etc. The sequence length can be used to indicate the length of the sequence used to generate the first matrix, for example, to indicate N sf , so as to generate the first matrix according to a sequence with a length of N sf . The sequence expansion manner includes, for example, the most direct expansion or tensor expansion, etc. Optionally, the base station can obtain the first matrix according to the same expansion manner.

[0274] In addition, the first generation parameter can indicate or determine the generation manner of the first matrix. The generation manner of the first matrix can include generating the first matrix according to one or more one-dimensional sequences. For example, the first matrix can be obtained by expanding one or more one-dimensional sequences. Wherein, the one or more one-dimensional sequences can include one or more zero elements. Wherein, the one-dimensional sequence can be a ZC sequence or an m sequence, etc., or a constant sequence, which is not specifically limited.

[0275] Correspondingly, the first generation parameter can indicate the number of one-dimensional sequences participating in constructing the first matrix, the type of each one-dimensional sequence, the sequence length and the generation manner or value of the sequence, the expansion manner of expanding the sequence to obtain the first matrix, the matrix correlation threshold or the sparsity threshold, etc.

[0276] For example, taking the first matrix as an example , the matrix can be obtained by expanding the one-dimensional sequences c1=(0,1) and c2=(1,0). In this example, the first generation parameter can indicate the one-dimensional sequences c1=(0,1) and c2=(1,0). In addition, the expansion manner of expanding the sequence to obtain the first matrix can be used to indicate the relationship between C1 and c1 and c2, which is used by the first terminal to expand according to the one-dimensional sequence to obtain the first matrix. For example, the relationship between C1 and c1 and c2 is: In addition, if it is necessary to update the first matrix, the base station can re-indicate c1 and / or c2, and / or re-indicate the relationship between C1 and c1 and c2.

[0277] Optionally, the first terminal and the base station can agree on a plurality of generation manners of the matrix, and set indexes of the plurality of generation manners respectively, wherein the agreed manner can be defined by a protocol, or can be configured by the base station through prior signaling, etc. Based on the agreement, the base station can send the index of the generation manner to the first terminal, to indicate the generation manner of the first matrix. For example, the index of the generation manner can represent that the generation manner is according to one-dimensional sequences c1=(0, 1) and c2=(1, 0) and the relationship determining the first matrix Based on this implementation manner, the base station does not need to send all variables of the generation manner of the first matrix to the first terminal, but only needs to indicate the index, and determine the variables of the generation manner of the first matrix from the locally existing configuration according to the index, which can reduce the indication overhead.

[0278] As another example, the configuration information of the first matrix can include an index (or an identifier) of the first matrix in a first matrix set, so that the first terminal can determine the first matrix from the first matrix set according to the index. The first matrix set can include a plurality of matrices, which can have different indexes.

[0279] In this application, the configuration information of the first matrix can be used to initially configure the first matrix, or can be used to update the first matrix configured by the first terminal. The conditions for updating include, for example, that the base station determines that the channel transmission changes, or that the number of users changes, etc. For the scenario of updating the first matrix, the base station can determine a first matrix different from the initially configured first matrix from the first matrix set, that is, the updating process can change the first matrix set. It can be understood that if the first matrix set is not changed, and the first terminal already has the configuration of the first matrix set (such as the second generation parameter and the configuration of the first matrix set), the configuration information of the updated first matrix can include the index of the updated first matrix in the set. In addition, the base station can also determine the first matrix from another matrix set (such as a new matrix set) different from the first matrix set, at this time the base station can configure a new matrix set for the first terminal.

[0280] Optionally, the first matrix set can be a pre-defined set or a set of matrices known to the first terminal and the network device. Specifically, the first matrix set can be stored in the local configuration of the first terminal and / or the base station. For example, the first matrix set is stored in the factory configuration of the first terminal. As another example, the first matrix set is defined by a 3GPP standard, and the first terminal can obtain the first matrix set based on the related standard. In addition, the first matrix set can be configured by the base station to the first terminal through RRC message, MAC CE or DCI. The first matrix set can also be configured to the first terminal by other base stations or communication devices in the previous communication process.

[0281] As an exemplary way of configuring the first matrix set to the first terminal by the base station, the base station can send a second generation parameter to the first terminal. Wherein, the second generation parameter can be used to generate a plurality of matrices, which can be included in the first matrix set. Optionally, the second generation parameter can be included in the configuration information of the first matrix. Wherein, the second generation parameter can include sequence type, sequence length, sequence expansion mode, etc. The sequence type, for example, is used to indicate that the type of the sequence used to generate the second matrix set and / or the first matrix set is a ZC sequence or an m sequence, etc. The sequence length can be used to indicate the length of the sequence used to generate the second matrix set and / or the first matrix set, for example, to indicate N sf , so as to generate the first matrix according to the sequence with the length of N sf . The sequence expansion mode, for example, includes direct expansion or tensor expansion, can be used to indicate the expansion mode of the second matrix set and / or the first matrix set obtained by sequence expansion. For example, the second generation parameter can include, indicate or be used to determine the number of sequences used to construct one-dimensional matrices of the second matrix set, the type of each one-dimensional sequence, the sequence length and the sequence generation mode information, the expansion mode of a plurality of sequence generation matrices, the correlation requirement or the correlation threshold, etc. The specific matrix set construction scheme. Optionally, the base station can obtain the first matrix set according to the same expansion mode, such as after constructing the second matrix set, screening the matrices in the second matrix set to obtain the first matrix set.

[0282] In another exemplary way of configuring the first matrix set, the base station can send the index of the first matrix set to the first terminal, and correspondingly, the first terminal can query a plurality of matrix sets according to the index of the first matrix set to obtain the first matrix set. Wherein, the plurality of matrix sets can be stored or pre-configured in the first terminal, or can be pre-defined, which is not specifically limited in the present application.

[0283] It can be understood that the above first matrix or the configuration information of the first matrix can be carried in the control information. For example, the first matrix can be determined by the base station and indicated to the first terminal through the downlink control message. Exemplarily, the first matrix or the configuration information of the first matrix can be carried in the RRC message, the MAC CE or the DCI.

[0284] For example, the first matrix or the configuration information of the first matrix can be carried in the configuration message of the grant-free transmission process. The grant-free transmission process, for example, includes the transmission process of the configuration grant, random access or semi-static scheduling, etc. That is, the first matrix or the configuration information of the first matrix can be carried in the configuration message related to the configuration grant, random access or semi-static scheduling process, which can be carried in the RRC message, the MAC CE or the DCI.

[0285] In addition, the base station can send configuration information of the second matrix to the first terminal, for configuring the second matrix. The second matrix can be related to the N first sequences. The row elements or column elements in the second matrix can be used to determine the N first sequences. That is, the first terminal can obtain the N first sequences according to the second matrix. For example, the second matrix can include one or more sequences, which can be the N first sequences, or can be used to determine the N first sequences, where a row or a column of elements in the second matrix can be taken as a sequence. The way in which one or more matrices in the second matrix determine the N first sequences is, for example, that the sequences in the second matrix can obtain the N first sequences through sequence spreading. In addition, the first terminal can obtain the first matrix according to the second matrix, and the first matrix can include the N first sequences. For example, the second matrix can obtain the first matrix through spreading. As an example, the second matrix is a sub-matrix of the first matrix. For another example, the second matrix includes part of the N first sequences.

[0286] The configuration information of the second matrix can refer to the description of the configuration information of the first matrix. The sending manner of the configuration information of the first matrix can refer to the sending manner of the first matrix, which will not be repeated here. For example, the second matrix or the configuration information of the second matrix can be carried in the RRC message, MAC CE or DCI of the downlink. In addition, the configuration information of the second matrix can be carried in the configuration message of the scheduling-free.

[0287] In addition, the base station can also send a third matrix set to the first terminal, and the third matrix set can include the second matrix. The second matrix can be related to the N first sequences. For example, the second matrix can be a sub-matrix of the first matrix, and thus the first matrix can be obtained according to the second matrix through spreading. In addition, the third matrix set can also be pre-configured or pre-defined, which is not specifically limited in the present application. The matrices in the third matrix set can be related to the matrices in the first matrix set and / or the matrices in the second matrix set, for example, can be determined according to the matrices in the first matrix set and / or the matrices in the second matrix set.

[0288] The method shown in the present application can be used in the sending scenario of multiple data streams, where the multiple data streams can belong to the same terminal, or can belong to multiple terminals, which is not specifically limited. The following will be introduced in combination with scenarios 1 to 3.

[0289] Scenario 1, taking the case that the multiple data streams belong to the same terminal (i.e. the first terminal) as an example, the first terminal can send the first data stream and the second data stream in the first time-frequency resource. The first time-frequency resource can include N sf time-frequency resources, such as N sfThe first terminal can obtain N first sequences for processing the first data stream, and transmit an u-th element in a j-th group of second signals in a u-th time-frequency resource in the first time-frequency resource by a j-th antenna of the first terminal, according to the manner shown in FIG. 3. Similarly, the first terminal can also obtain N second sequences according to the description of S101. The second sequences can refer to the description of the first sequences, with the difference that the second sequences can be used for processing the second data stream.

[0290] As an example, the manner of processing the second data stream according to the second sequences can refer to the description of FIG. 3, for example, according to S102, the first terminal can perform precoding processing on the second data stream to obtain a third signal, the third signal including N elements. The third signal can refer to the description of the first signal. Further, according to S103, the first terminal can perform spread spectrum processing on a j-th element of the third signal by a j-th second sequence, to obtain a j-th group of fourth signals, 1≤j≤N. The fourth signal can refer to the description of the second signal. According to S104, the first terminal can transmit an u-th element in a j-th group of fourth signals in a u-th time-frequency resource in the first time-frequency resource by a j-th antenna, to realize the transmission of the second data stream.

[0291] It can be understood that in scenario 1, the N first sequences and the N second sequences can form a first matrix and a third matrix respectively. The first matrix and the third matrix both correspond to the first time-frequency resource. In addition, the first matrix corresponds to the first data stream, and the third matrix corresponds to the third data stream. Optionally, the first matrix and the third matrix can be different matrices in the first matrix set. That is, the first matrix and the third matrix can satisfy the correlation requirement, so that the correlation between the first data stream and the second data stream is low.

[0292] In scenario 2, the first terminal can transmit the first data stream in the first time-frequency resource, and transmit the second data stream in the second time-frequency resource. The first time-frequency resource and the second time-frequency resource can be different time-frequency resources. According to the manner shown in FIG. 3, the first terminal can also obtain N second sequences, which can refer to the description of the first sequences, with the difference that the second sequences can be used for processing the second data stream. In addition, the second sequences correspond to the second time-frequency resource.

[0293] As an example, the manner of processing the second data stream according to the second sequences can refer to the description of FIG. 3, for example, referring to S102, the first terminal can perform precoding processing on the second data stream to obtain a third signal, the third signal comprising N elements. The third signal can refer to the description of the first signal. Further, referring to S103, the first terminal can spread the jth element of the third signal according to the jth second sequence to obtain the jth group of fourth signals, 1≤j≤N. The fourth signal can refer to the description of the second signal. Referring to S104, the first terminal can transmit the u element of the jth group of fourth signals in the u time-frequency resource in the second time-frequency resource through the jth antenna to realize the transmission of the second data stream.

[0294] It can be understood that in scenario 2, the N first sequences and the N second sequences can constitute a first matrix and a third matrix respectively. Among them, the first matrix corresponds to the first time-frequency resource, and the third matrix corresponds to the second time-frequency resource. In addition, the first matrix corresponds to the first data stream, and the third matrix corresponds to the third data amount. Optionally, the first matrix and the third matrix can be different matrices in the first matrix set. The first matrix and the third matrix can be different matrices in the first matrix set. That is, the first matrix and the third matrix can meet the correlation requirement, so that the correlation between the first data stream and the second data stream is low.

[0295] In scenario 3, the first terminal can transmit the first data stream and the second data stream in the first time-frequency resource, and transmit the third data stream in the third time-frequency resource. Among them, the first time-frequency resource and the third time-frequency resource can be different time-frequency resources. In scenario 3, the N first sequences can be used to process the first data stream and the third data stream. Referring to the manner shown in FIG. 3, the first terminal can also obtain N second sequences. The second sequence can refer to the description of the first sequence, and the difference is that the second sequence can be used to process the second data stream.

[0296] Among them, the processing process of the third data stream according to the N first sequences can refer to the processing process of the first data stream according to the N first sequences in scenario 1 or scenario 2; in addition, the processing process of the second data stream according to the N second sequences can refer to the processing process of the second data stream according to the N second sequences in scenario 1 or scenario 2, and the difference is that the corresponding time-frequency resources are different, which will not be repeated here.

[0297] It can also be understood that the first matrix and the third matrix can also be independent of each other, such as, the dimensions of the two can be the same or different, the generation manners of the two can be the same or different, etc. For example, the first matrix and the third matrix can have different dimensions.

[0298] It can be understood that the configuration information of the first matrix can be different in different scenarios. Therefore, the base station can configure the first matrix for the first terminal in different ways in different scenarios to indicate the N first sequences.

[0299] The configuration of the first matrix will be described below.

[0300] In case A, the base station can send the complete first matrix to the terminal (including the first terminal), that is, the configuration information of the first matrix can include the information of the first matrix. For example, the base station can send the first matrix including N first sequences to the first terminal. In addition, the matrix can also be compressed by using the sparsity of the matrix, and only the information of the non-zero elements (including the position, element value, etc.) is issued. For example The binary elements form a small dimension matrix, which is suitable for being issued in this form, and at this time, only the non-zero element position information (2, 1) and (3, 2) needs to be issued.

[0301] Optionally, when the dimension of the first matrix is small, the number of elements is small, or the quantization overhead of the matrix elements is small, the configuration of the first matrix can be performed through case A.

[0302] In case B, the base station can indicate the index of the first matrix in the first matrix set to the first terminal. It is assumed that the first matrix set is, for example:

[0303] Wherein, the selected matrix is Then the index is, for example, 2, indicating the second set element matrix in the first matrix set.

[0304] Optionally, when the first matrix set where the first matrix is located is agreed by the first terminal and the base station, the configuration of the first matrix can be performed through case B.

[0305] In case C, the base station can send structured generation parameters to the first terminal, which can be used to generate the first matrix or the first matrix set.

[0306] The generation parameters, for example, the first generation parameters and / or the second generation parameters in the present application, for example, include: the generation method of the matrix, such as direct expansion, or tensor expansion, or nonlinear nested expansion; the number K of base sequences (or base matrices) participating in the generation n ; the base sequence (or base matrix) used {c i}, or the generation parameters for generating the base sequence (matrix).

[0307] Optionally, when the first matrix or the first matrix set can be generated based on the structure of the base sequence (or base matrix), the configuration of the first matrix can be performed through case C.

[0308] The matrices in the first matrix set are independent and flexible. The following describes the matrix dimension, generation scheme, and number of configuration messages.

[0309] From the perspective of matrix dimension, the dimensions of different matrices in the first matrix set can be independent. For example, data stream 1 and data stream 2 correspond to the same time-frequency resource, and the first matrix C1 and the second matrix C2 correspond to data stream 1 and data stream 2, respectively, where the dimension of the first matrix C1 and the dimension of the second matrix C2 can be different. For another example, data stream 1 is transmitted in different time-frequency resource 1 and time-frequency resource 2, where data stream 1 corresponds to the first matrix C1 when transmitted in time-frequency resource 1, and data stream 1 corresponds to the second matrix C2 when transmitted in time-frequency resource 2, where the dimension of the first matrix C1 and the dimension of the second matrix C2 can be different.

[0310] From the perspective of matrix generation scheme, the generation schemes of different matrices in the first matrix set can be independent. For example, data stream 1 and data stream 2 correspond to the same time-frequency resource, and the first matrix C1 and the second matrix C2 correspond to data stream 1 and data stream 2, respectively, where the dimension of the first matrix C1 and the dimension of the second matrix C2 can be different. For example, the first matrix C1 is generated by direct expansion, and the second matrix C2 is generated by tensor expansion.

[0311] For another example, data stream 1 is transmitted in different time-frequency resource 1 and time-frequency resource 2, where data stream 1 corresponds to the first matrix C1 when transmitted in time-frequency resource 1, and data stream 1 corresponds to the second matrix C2 when transmitted in time-frequency resource 2, where the dimension of the first matrix C1 and the dimension of the second matrix C2 can be different. For example, the first matrix C1 is generated by direct expansion, and the second matrix C2 is generated by tensor expansion.

[0312] In addition, from the perspective of a single sequence, the spreading sequence c i is used as the ith1 row vector when constructing the first matrix C1, while the same spreading sequence c i is used as the ith2 row vector when constructing C2, where ith ≠ i2. In addition, the spreading sequence c i may be expanded as a row vector when constructing the first matrix C1, while the same spreading sequence c i is used as a certain dimension vector of tensor expansion when constructing C2.

[0313] In the present application, the base station can issue multiple matrices, wherein the multiple matrices can correspond to different data streams. For example, the first matrix and the second matrix in the present application can correspond to different data streams, and for another example, the first matrix and the third matrix can correspond to different data streams. Wherein the configuration information of the multiple matrices can be issued through one or more configuration messages. Wherein the configuration message can be an RRC message, a MAC CE or a DCI. In the present application, the matrix or the configuration information of the matrix can also be referred to as the configuration information of the data stream.

[0314] As a possible implementation, one configuration message can carry one matrix or the configuration information of one matrix. If there are multiple matrices or multiple matrix configuration information, multiple messages can be used to carry multiple matrices or multiple matrix configuration information respectively. For example, the first matrix or the configuration information of the first matrix can be carried in a different configuration message with the second matrix or the configuration information of the second matrix. For another example, the first matrix or the configuration information of the first matrix can be carried in a different configuration message with the third matrix or the configuration information of the third matrix.

[0315] As another possible implementation, the configuration information of multiple data streams can be carried in one message. If there are multiple matrices or multiple matrix configuration information, one configuration message can be used to carry multiple matrices or multiple matrix configuration information. For example, the first matrix or the configuration information of the first matrix can be carried in the same configuration message with the second matrix or the configuration information of the second matrix. For another example, the first matrix or the configuration information of the first matrix can be carried in the same configuration message with the third matrix or the configuration information of the third matrix.

[0316] It can be understood that when there is repetition in the configuration information of multiple data streams, the configuration information of the data stream can also be sent in the form of multicast plus unicast. For example, the first matrix C1 and the second matrix C2 correspond to different data streams of the first terminal, and the first matrix C1 and the second matrix C2 are obtained by tensor expansion, wherein the local sequence a1=a2 of the first matrix C1 and the second matrix C2, the base station can send multicast signaling carrying information of the sequence a=a1=a2 to the first terminal, for configuring the common part (referred to as common sequence) of the first matrix and the second matrix. In addition, the base station can also unicast signaling to the first terminal, for example, the unicast signaling respectively carries sequences b1 and b2. Wherein, the signaling carrying sequence b1 is used to configure the sequence other than the common sequence of the first matrix to the first terminal, and the signaling carrying sequence b2 is used to configure the sequence other than the common sequence of the second matrix to the first terminal.

[0317] The present application can be applied to a random access scenario, can also be applied to a grant-free transmission scenario, and can also be applied to a scenario in which multiple terminals monitor a physical downlink control channel (PDCCH) using a same radio network temporary identity (RNTI) or a scenario in which multiple terminals monitor a same physical downlink shared channel (PDSCH).

[0318] The present application can be applied to a terminal in a connected state or an active state, and can also be applied to a terminal in an inactive state or an idle state.

[0319] Based on the same technical concept, the present application provides a communication apparatus, which comprises a module or unit or means corresponding to each method step in the method embodiments described above, and the functions or units or means can be implemented by software or by hardware, or by hardware executing corresponding software.

[0320] For example, referring to FIG. 6, the communication apparatus 600 can comprise a processing module 610 and a transceiver module 620.

[0321] Optionally, the transceiver module 620 can comprise a sending module and / or a receiving module. The sending module is configured to perform the sending operations in the method embodiments described above. The receiving module is configured to perform the receiving operations in the method embodiments described above.

[0322] It should be noted that the communication apparatus 600 can comprise a sending module but not a receiving module. Alternatively, the communication apparatus 600 can comprise a receiving module but not a sending module. Whether the sending module and the receiving module are comprised in the communication apparatus 600 can depend on whether the communication apparatus 600 performs the sending action and the receiving action in the above-mentioned schemes.

[0323] The processing module 610 is configured to perform data processing. The transceiver module 620 can realize corresponding communication functions.

[0324] Optionally, the communication apparatus 600 can further comprise a storage module, which can be configured to store instructions and / or data. The processing module 610 can read the instructions and / or data in the storage module, so that the communication apparatus 600 realizes the above-mentioned method embodiments.

[0325] The communication apparatus 600 can be a first communication apparatus or a component configurable to the first communication apparatus. The first communication apparatus can be, for example, a component in a first terminal or a base station. The processing module 610 is configured to perform the processing-related operations of the first terminal or the base station in the above method embodiments, for example, at least one of S101 to S103. The transceiver module 620 is configured to perform the transmitting and / or receiving-related operations of the first terminal or the base station in the above method embodiments. For example, S104. In addition, at least one of S101 to S103 can also be performed by the transceiver module 620.

[0326] For example, the communication apparatus 600 can implement the actions performed by the first terminal or the base station in the embodiment shown in FIG. 3, and details are not repeated here.

[0327] It should be understood that all related contents of the steps involved in the above method embodiments can be cited to the functional description of the corresponding functional modules, and details are not repeated here.

[0328] The processing module 610 in the above embodiments can be implemented by at least one processor or processor-related circuit. The transceiver module 620 can be implemented by a transceiver or transceiver-related circuit. The transceiver module 620 can also be referred to as a communication module or a communication interface.

[0329] Another structural diagram of the communication apparatus of the embodiments of the present application is shown below. As shown in FIG. 7, the embodiments of the present application also provide a communication apparatus 700, which comprises:

[0330] at least one processor 710; and an interface circuit 720 connected with the at least one processor 710; the at least one processor 710 executes instructions stored in a memory 730, so that the apparatus performs the method steps in the above method embodiments through the interface circuit 720.

[0331] Optionally, the memory 730 is located outside the communication apparatus 700.

[0332] Optionally, the communication apparatus 700 comprises the memory 730, the memory 730 is connected with the at least one processor 710, and the memory 730 stores instructions executable by the at least one processor 710. FIG. 7 shows that the memory 730 is optional for the communication apparatus 700 with a dashed line.

[0333] The processor 710 and the memory 730 can be coupled through the interface circuit or integrated together, which is not limited here.

[0334] The specific connection medium between the processor 710, the memory 730 and the interface circuit 720 is not limited in the embodiments of the present application. In FIG. 7, the processor 710, the memory 730 and the interface circuit 720 are connected through a bus 740, which is represented by a straight line in FIG. 7. The connection mode between other components is only schematically illustrated and is not limited. The bus can be divided into an address bus, a data bus, a control bus and the like. For convenience of representation, only one solid line is used in FIG. 7, but it does not mean that there is only one bus or only one type of bus.

[0335] Taking the first communication device as an example, when the communication device 700 is the first communication device, the first communication device can include a processor, a memory and a transceiver. The memory can store computer program code, and the transceiver includes a transmitter and a receiver.

[0336] The processor is mainly used for processing communication protocols and communication data, controlling the first communication device, executing software programs and processing data of the software programs and the like. The memory is mainly used for storing software programs and data. The transmitter is used for sending signals to other communication devices or equipment, and the receiver is used for receiving signals from other communication devices or equipment.

[0337] When the communication device 700 is a chip in the first communication device, the chip can include a processor, a memory and a transceiver. The transceiver can be an input-output circuit or a communication interface. The processor can be an integrated processing module or a microprocessor or an integrated circuit on the chip. The transmission operation of the first communication device in the above method embodiments can be understood as the output of the chip, and the receiving operation of the first communication device in the above method embodiments can be understood as the input of the chip.

[0338] It should be understood that the processor mentioned in the embodiments of the present application can be implemented by hardware or software. When implemented by hardware, the processor can be a logic circuit, an integrated circuit and the like. When implemented by software, the processor can be a general-purpose processor which is implemented by reading software code stored in the memory.

[0339] The processor can be, for example, a central processing unit (CPU), a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like. The general purpose processor can be a microprocessor, or the processor can be any conventional processor, etc.

[0340] It should be understood that the memory referred to in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically EPROM (EEPROM) or a flash memory. The volatile memory can be a random access memory (RAM) used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM) and direct rambus RAM (DR RAM).

[0341] It should be noted that when the processor is a general purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, a discrete gate or transistor logic, a discrete hardware component, the memory (storage module) can be integrated in the processor.

[0342] It should be noted that the memory described herein is intended to include, but not limited to, these and any other suitable types of memory.

[0343] Based on the same technical concept, the embodiments of the present application further provide a computer readable storage medium, including a program or instructions, which, when executed on a computer, cause the method in the above method embodiments to be performed.

[0344] Based on the same technical concept, the embodiments of the present application further provide a computer program product, including instructions, which, when executed on a computer, cause the method in the above method embodiments to be performed.

[0345] Based on the same technical concept, the embodiments of the present application further provide a communication system, which can include a first communication device (such as a first terminal) and a second communication device (such as a base station). For example, the communication system can be used to implement the method flow in FIG. 3. Optionally, the communication system can further include other communication devices, such as a second terminal and the like.

[0346] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage devices, etc.) containing computer usable program code.

[0347] The present application is described with reference to the flowcharts and / or block diagrams of the methods, apparatus (systems) and computer program products according to this application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, as well as a combination of flows and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing apparatus produce the functions specified in one or more flows in the flowcharts and / or one or more blocks in the block diagrams.

[0348] These computer program instructions can also be stored in a computer readable storage medium that can direct the computer or other programmable data processing apparatus to work in a specific manner, so that the instructions stored in the computer readable storage medium produce a product including instruction means, which implements the functions specified in one or more flows in the flowcharts and / or one or more blocks in the block diagrams.

[0349] These computer program instructions can also be loaded into a computer or other programmable data processing device, so that a series of operational steps are performed on the computer or other programmable data processing device, to generate a computer implemented process, so that the instructions executed on the computer or other programmable data processing device provide steps for implementing the functions specified in one or more flows in the flowchart and / or one or more blocks in the block diagram.

[0350] In various embodiments of the present application, the terms and / or descriptions of different embodiments are consistent and can be referred to each other if there is no special description and logical conflict, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0351] In the present application, "at least one" means one or more, and "multiple" means two or more. The "and / or" describes the association relationship between the associated objects, which means that there can be three kinds of relationships, for example, A and / or B, which can represent the following three cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. In the literal description of the present application, the character " / ", generally indicates that the associated objects before and after are in an "or" relationship; in the formula of the present application, the character " / ", indicates that the associated objects before and after are in a "division" relationship. "Including at least one of A, B and C" can mean: including A; including B; including C; including A and B; including A and C; including B and C; including A, B and C.

[0352] It can be understood that various numerical numbers involved in the embodiments of the present application are only distinguished for convenience of description, and are not used to limit the scope of the embodiments of the present application. The size of the serial number of the above processes does not mean the execution order, and the execution order of the processes should be determined according to its function and inherent logic.

Claims

1. A communication method characterized by comprising: The method comprises: obtaining N first sequences, N being greater than 1, any of the first sequences corresponding to an antenna, the N first sequences corresponding to a first data stream, any of the first sequences comprising one or more zero elements; performing precoding processing on the first data stream to obtain a first signal; performing spread spectrum processing on a pth element of the first signal according to a jth first sequence to obtain a pth group of second signals, 1≤j≤N, p being a positive integer; transmitting an u-th element in the p-th group of second signals through the p-th antenna at a u-th time-frequency resource, 1≤u≤N sf , N sf is a length of the first sequence.

2. The method of claim 1, wherein, any of the N first sequences comprising at least one non-zero element.

3. The method of claim 1 or 2, wherein, The N first sequences satisfy at least one of the following conditions: a proportion of non-zero elements in the N first sequences is less than or equal to a threshold value; a proportion of zero elements in the N first sequences is greater than or equal to a threshold value; a proportion of non-zero elements in any of the N first sequences is less than or equal to a threshold value; or a proportion of zero elements in any of the N first sequences is greater than or equal to a threshold value. The threshold value is 1 / 2.

4. The method of claim 3, wherein, The N first sequences correspond to N antennas one by one.

5. The method of any one of claims 1-4, wherein, The N antennas belong to one terminal, or the N antennas belong to multiple terminals. The method comprises:

6. The method of any one of claims 1-5, wherein, receiving configuration information of a first matrix from a network device; determining the first matrix according to the configuration information, the first matrix being related to the N first sequences. The configuration information comprises information of elements of the first matrix.

7. The method of claim 6, wherein, The configuration information comprises a first generation parameter, the first generation parameter being used to generate the first matrix.

8. The method of claim 6, wherein, The first generation parameter indicates non-zero elements in the first matrix, row indexes and column indexes of the non-zero elements.

9. The method of claim 8, wherein, The first generation parameter further indicates a generation manner of the first matrix.

10. The method of claim 9, wherein, The first matrix is generated according to a one-dimensional sequence, the one-dimensional sequence comprising one or more zero elements.

11. The method of any one of claims 6-10, wherein, The configuration information comprises an index of the first matrix in a first matrix set.

12. The method of claim 6, wherein, The configuration information further comprises a second generation parameter, the second generation parameter being used to generate the first matrix set; or 13. The method of claim 12, wherein, The configuration information further comprises an index of the first matrix set. The second generation parameter further indicates a generation manner of the first matrix set.

14. The method of claim 13, wherein, The generation manner comprises:

15. The method of claim 14, wherein, matrices in the first matrix set are generated according to one-dimensional sequences, the one-dimensional sequences comprising one or more zero elements. A proportion of zero elements in the one-dimensional sequences is not less than 1 / 2.

16. The method of claim 11 or 15, wherein, The first matrix set satisfies a sparsity requirement, the first matrix set satisfying the sparsity requirement comprising at least one of the following conditions:

17. The method of any one of claims 12-16, wherein, a proportion of non-zero elements in a matrix of the first matrix set does not exceed a threshold value; a proportion of zero elements in the matrix of the first matrix set does not fall below a threshold value; a proportion of non-zero elements in one or more rows of the matrix of the first matrix set does not exceed a threshold value; a proportion of zero elements in the one or more rows of the matrix of the first matrix set does not fall below a threshold value; a proportion of non-zero elements in one or more columns of the matrix of the first matrix set does not exceed a threshold value; or a proportion of zero elements in the one or more columns of the matrix of the first matrix set does not fall below a threshold value. The method comprises:

18. A method of communication, comprising: ​ N first sequences are acquired, N is greater than 1, any first sequence corresponds to an antenna, the N first sequences correspond to a first data stream, and any first sequence includes one or more zero elements. receive a second signal, a pth group of the second signal being obtained by spreading a pth element of a first signal according to a jth first sequence, a u element in the pth group of the second signal being transmitted by a pth antenna at a u time-frequency resource, the first signal being obtained by precoding the first data stream, 1≤j≤N, p being a positive integer, 1≤u≤N sf , N sf being a length of the first sequence; The first data stream is recovered according to the N first sequences.

19. The method of claim 18, wherein, Any first sequence in the N first sequences includes at least one non-zero element.

20. The method of claim 18 or 19, wherein, The N first sequences satisfy at least one of the following conditions: The proportion of non-zero elements in the N first sequences is less than or equal to a threshold value; The proportion of zero elements in the N first sequences is greater than or equal to a threshold value; The proportion of non-zero elements in any first sequence in the N first sequences is less than or equal to a threshold value; Or, The proportion of zero elements in any first sequence in the N first sequences is greater than or equal to a threshold value.

21. The method of claim 20, wherein, The threshold value is 1 / 2.

22. The method of any one of claims 18-21, wherein, The N first sequences correspond one-to-one to N antennas. The N antennas belong to one terminal, or the N antennas belong to multiple terminals.

23. The method of any one of claims 18-22, wherein, The method further includes: Configuration information of a first matrix is sent, the configuration information of the first matrix is used to determine the first matrix, and the first matrix is related to the N first sequences.

24. The method of claim 23, wherein, The configuration information includes information of elements of the first matrix.

25. The method of claim 23, wherein, The configuration information includes a first generation parameter, and the first generation parameter is used to generate the first matrix.

26. The method of claim 25, wherein, The first generation parameter indicates non-zero elements in the first matrix, row indexes and column indexes of the non-zero elements.

27. The method of claim 26, wherein, The first generation parameter further indicates a generation manner of the first matrix.

28. The method of any one of claims 23-27, wherein, The first matrix is generated according to a one-dimensional sequence, and the one-dimensional sequence includes one or more zero elements.

29. The method of claim 28, wherein, The configuration information includes an index of the first matrix in a first matrix set.

30. The method of claim 29, wherein, The configuration information further includes a second generation parameter, and the second generation parameter is used to generate the first matrix set; or The configuration information further includes an index of the first matrix set.

31. The method of claim 30, wherein, The second generation parameter further indicates a generation manner of the first matrix set.

32. The method of claim 31, wherein, The generation manner includes: Matrices in the first matrix set are generated according to one-dimensional sequences, and the one-dimensional sequences include one or more zero elements.

33. The method of claim 28 or 32, wherein, The proportion of zero elements in the one-dimensional sequence is not less than 1 / 2.

34. The method of any one of claims 29-33, wherein, The first matrix set satisfies a sparsity requirement, and the first matrix set satisfying the sparsity requirement includes at least one of the following conditions: The proportion of non-zero elements in a matrix of the first matrix set does not exceed a threshold value; The proportion of zero elements in the matrix of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more rows of the matrix of the first matrix set does not exceed a threshold value; The proportion of zero elements in one or more rows of the matrix of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more columns of the matrix of the first matrix set does not exceed a threshold value; or The proportion of zero elements in one or more columns of the matrix of the first matrix set does not fall below a threshold value.

35. A communications device, characterized by ​ The processing unit is configured to obtain N first sequences, N being greater than 1, any first sequence corresponding to one antenna, the N first sequences corresponding to a first data stream, any first sequence comprising one or more zero elements; performing precoding processing on the first data stream to obtain a first signal; performing spread spectrum processing on a p-th element of the first signal according to a j-th first sequence to obtain a p-th group of second signals, 1≤j≤N, p being a positive integer; a communication unit, configured to transmit an u-th element in the p-th group of second signals through the p-th antenna at a u-th time-frequency resource, 1≤u≤N sf , N sf is a length of the first sequence.

36. The apparatus of claim 35, wherein, Any first sequence in the N first sequences comprises at least one non-zero element.

37. The apparatus of claim 35 or 36, wherein, The N first sequences satisfy at least one of the following conditions: The proportion of non-zero elements in the N first sequences is less than or equal to a threshold value; The proportion of zero elements in the N first sequences is greater than or equal to a threshold value; The proportion of non-zero elements in any first sequence in the N first sequences is less than or equal to a threshold value; Or, The proportion of zero elements in any first sequence in the N first sequences is greater than or equal to a threshold value.

38. The apparatus of claim 37, wherein, The threshold value is 1 / 2.

39. The apparatus of any one of claims 35-38, wherein, The N first sequences correspond to N antennas one by one; Wherein, the N antennas belong to one terminal, or the N antennas belong to multiple terminals.

40. The apparatus of any one of claims 35-39, wherein, The processing unit is specifically configured to: Receive configuration information of a first matrix from a network device; Determine the first matrix according to the configuration information, the first matrix being related to the N first sequences.

41. The apparatus of claim 40, wherein, The configuration information comprises information of elements of the first matrix.

42. The apparatus of claim 40, wherein, The configuration information comprises a first generation parameter, the first generation parameter being used to generate the first matrix.

43. The apparatus of claim 42, wherein, The first generation parameter indicates non-zero elements in the first matrix, row indexes and column indexes of the non-zero elements.

44. The apparatus of claim 43, wherein, The first generation parameter further indicates a generation manner of the first matrix.

45. The apparatus of any one of claims 40-44, wherein, The first matrix is generated according to a one-dimensional sequence, the one-dimensional sequence comprising one or more zero elements.

46. The apparatus of claim 40, wherein, The configuration information comprises an index of the first matrix in a first matrix set.

47. The apparatus of claim 46, wherein, The configuration information further comprises a second generation parameter, the second generation parameter being used to generate the first matrix set; or, the configuration information further comprises an index of the first matrix set.

48. The apparatus of claim 47, wherein, The second generation parameter further indicates a generation manner of the first matrix set.

49. The apparatus of claim 48, wherein, The generation manner comprises: Matrices in the first matrix set are generated according to one-dimensional sequences, the one-dimensional sequences comprising one or more zero elements.

50. The apparatus of claim 45 or 49, wherein, The proportion of zero elements in the one-dimensional sequences is not less than 1 / 2.

51. The apparatus of any one of claims 46-50, wherein, The first matrix set satisfies a sparsity requirement, the first matrix set satisfying the sparsity requirement comprising at least one of the following conditions: The proportion of non-zero elements in a matrix of the first matrix set does not exceed a threshold value; The proportion of zero elements in the matrix of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more rows of the matrix of the first matrix set does not exceed a threshold value; The proportion of zero elements in one or more rows of the matrix of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more columns of the matrix of the first matrix set does not exceed a threshold value; or, The proportion of zero elements in one or more columns of the matrix of the first matrix set does not fall below a threshold value.

52. A communications device, characterized by ​ The processing unit is configured to obtain N first sequences, N being greater than 1, any of the first sequences corresponding to one antenna, the N first sequences corresponding to a first data stream, any of the first sequences comprising one or more zero elements. A communication unit is configured to receive second signals, a pth group of the second signals being obtained by spreading a pth element of a first signal according to a jth first sequence, a u element in the pth group of the second signals being transmitted by a pth antenna at a u time-frequency resource, the first signal being obtained by precoding the first data stream, 1≤j≤N, p being a positive integer, 1≤u≤N sf , N sf being a length of the first sequence; The processing unit is further configured to recover the first data stream according to the N first sequences.

53. The apparatus of claim 52 wherein, Any of the N first sequences comprises at least one non-zero element.

54. The apparatus of claim 52 or 53, wherein, The N first sequences satisfy at least one of the following conditions: The proportion of non-zero elements in the N first sequences is less than or equal to a threshold value; The proportion of zero elements in the N first sequences is greater than or equal to a threshold value; The proportion of non-zero elements in any of the N first sequences is less than or equal to a threshold value; Or, The proportion of zero elements in any of the N first sequences is greater than or equal to a threshold value.

55. The apparatus of claim 54 wherein, The threshold value is 1 / 2.

56. The apparatus of any one of claims 52-54, wherein, The N first sequences correspond to N antennas one by one. The N antennas belong to one terminal, or the N antennas belong to multiple terminals.

57. The apparatus of any one of claims 52-56, wherein, The communication unit is further configured to: Send configuration information of a first matrix, the configuration information of the first matrix being used to determine the first matrix, the first matrix being related to the N first sequences.

58. The apparatus of claim 57 wherein, The configuration information comprises information of elements of the first matrix.

59. The apparatus of claim 57 wherein, The configuration information comprises a first generation parameter, the first generation parameter being used to generate the first matrix.

60. The apparatus of claim 59 wherein, The first generation parameter indicates non-zero elements in the first matrix, row indexes and column indexes of the non-zero elements.

61. The apparatus of claim 60, wherein, The first generation parameter further indicates a generation manner of the first matrix.

62. The device of any one of claims 57-61, wherein, The first matrix is generated according to a one-dimensional sequence, the one-dimensional sequence comprising one or more zero elements.

63. The apparatus of claim 62 wherein, The configuration information comprises an index of the first matrix in a first matrix set.

64. The apparatus of claim 63 wherein, The configuration information further comprises a second generation parameter, the second generation parameter being used to generate the first matrix set; or, the configuration information further comprises an index of the first matrix set.

65. The apparatus of claim 64, wherein, The second generation parameter further indicates a generation manner of the first matrix set.

66. The apparatus of claim 65, wherein, The generation manner comprises: Matrices in the first matrix set are generated according to one-dimensional sequences, the one-dimensional sequences comprising one or more zero elements.

67. The apparatus of claim 62 or 66, wherein, The proportion of zero elements in the one-dimensional sequences is not less than 1 / 2.

68. The device of any one of claims 63-67, wherein, The first matrix set satisfies a sparsity requirement, the first matrix set satisfying the sparsity requirement comprising at least one of the following conditions: The proportion of non-zero elements in matrices of the first matrix set does not exceed a threshold value; The proportion of zero elements in matrices of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more rows of matrices of the first matrix set does not exceed a threshold value; The proportion of zero elements in one or more rows of matrices of the first matrix set does not fall below a threshold value; The proportion of non-zero elements in one or more columns of matrices of the first matrix set does not exceed a threshold value; or, The proportion of zero elements in one or more columns of matrices of the first matrix set does not fall below a threshold value.

69. A communications device, characterized by The processor is configured to execute computer programs or instructions to implement the method of any of claims 1-17, or to implement the method of any of claims 18-34.

70. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, when the computer program or instructions are executed by a communication device, a method as claimed in any one of claims 1-17 is implemented, or a method as claimed in any one of claims 18-34 is implemented.

71. A computer program product, characterized in that, When the computer program product is executed by a computer, the computer is caused to execute a method as claimed in any one of claims 1-17, or a method as claimed in any one of claims 18-34.

72. A chip system, characterized by comprising a logic circuit; The logic circuit is configured to execute a computer executable program, so that a device installed with the chip system is configured to execute a method as claimed in any one of claims 1-17, or a method as claimed in any one of claims 18-34.

73. A communication system, characterized by comprising a first communication device and a second communication device; The first communication device is configured to execute a method as claimed in any one of claims 1-17; and the second communication device is configured to execute a method as claimed in any one of claims 18-34.

Images