Communication method and apparatus

Abstract

A communication method and apparatus, which are used for increasing the capacity of multi-data-stream transmission. The communication method comprises: a network device acquiring a first matrix set, which comprises a first matrix and a second matrix, wherein the first matrix comprises at least two columns of identical elements and the second matrix does not comprise two columns of identical elements, or the first matrix comprises at least two rows of identical elements and the second matrix does not comprise two rows of identical elements; and the network device sending configuration information of a third matrix to a terminal, wherein the configuration information of the third matrix is used for configuring the third matrix in the first matrix set, and the third matrix is used by the terminal to send a first data stream.

Description

Communication method and apparatus

[0001] Cross-reference to Related Applications

[0002] This application claims priority to the Chinese Patent Application No. 202410669887.7, 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 at the transmitting end for signal transmission, and multiple receive antennas can be used at the receiving end for signal reception. 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 robustness 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 robustness of multi-data stream transmission.

[0007] In a first aspect, the present application provides a communication method, which is applied to a first communication apparatus, or a component (such as a processor, a chip, a chip system, a circuit, a functional module, or other, etc.) in the first communication apparatus, or a software module. Taking the first communication apparatus as a network device as an example, the method can include: the network device obtains a first matrix set, the first matrix set including a first matrix and a second matrix; wherein the first matrix includes at least two columns of identical elements, and the second matrix does not include two columns of identical elements; or the first matrix includes at least two rows of identical elements, and the second matrix does not include two rows of identical elements; the network device sends configuration information of a third matrix to a terminal, the configuration information of the third matrix being used to configure a third matrix in the first matrix set, and the third matrix being used for the terminal to send a first data stream.

[0008] With this design, the first matrix set includes a first matrix with column repetition (or row repetition), and the performance of the first matrix set is robust. The third matrix sent by the network device to the terminal is a matrix in the first matrix set, and the third matrix is used for the terminal to send the first data stream, thereby improving the capacity of multi-data stream transmission.

[0009] In one possible design, the second matrix includes a column-orthogonal matrix or a row-orthogonal matrix.

[0010] With this design, the second matrix includes a column-orthogonal matrix or a row-orthogonal matrix, and thus the second matrix satisfies the autocorrelation requirement.

[0011] In one possible design, the first matrix includes a matrix with all identical columns or a matrix with all identical rows.

[0012] With this design, the first matrix includes a matrix with all identical columns or a matrix with all identical rows, and thus the performance robustness of the first matrix set is further improved.

[0013] In one possible design, the first matrix set satisfies a correlation requirement, and the correlation requirement includes that a correlation between any two matrices in the first matrix set is no more than a cross-correlation threshold.

[0014] With this design, the correlation between any two matrices in the first matrix set is no more than the cross-correlation threshold, and thus the network device can screen the first matrix set that satisfies the correlation threshold by adjusting the cross-correlation threshold, and thus the transmission interference between data streams is reduced.

[0015] In one possible design, the correlation between any two matrices in the first matrix set is no more than the cross-correlation threshold, and includes at least one of the following: an element value of a correlation matrix of the any two matrices is less than or equal to a first threshold; an average of element values of correlation matrices between matrices in the first matrix set is less than or equal to the first threshold; a two-norm of the correlation matrix of the any two matrices is less than or equal to a second threshold; or an average of two-norms of correlation matrices between matrices in the first matrix set is less than or equal to the second threshold.

[0016] With this design, the first matrix set satisfies the correlation threshold in a flexible combination of multiple manners, and thus the network device can screen the first matrix set that satisfies the correlation threshold in multiple manners, and thus the transmission interference between data streams is further reduced.

[0017] In one possible design, the network device can also determine, from the second matrix set, a matrix that satisfies the correlation requirement as a matrix in the first matrix set.

[0018] With this design, the network device can screen the first matrix set that satisfies the correlation threshold, and thus the first matrix set is efficiently determined.

[0019] In one possible design, any matrix in the second set of matrices includes N one-dimensional sequences, the one-dimensional sequences are from a set including M one-dimensional sequences, and a number of matrices in the second set of matrices is M N Optionally, N is a number of antennas.

[0020] In one possible design, the configuration information includes an index of the third matrix in the first set of matrices, and the configuration information further includes a second generation parameter, where the second generation parameter is used to generate the first set of matrices; or the configuration information further includes an index of the first set of matrices.

[0021] With this design, the network device sends, to the terminal, the configuration information including the index of the third matrix in the first set of matrices and the second generation parameter, or the configuration information further includes the index of the first set of matrices, so that the terminal can obtain the first set of matrices and the third matrix based on the configuration information.

[0022] In one possible design, the second generation parameter further indicates a generation manner of the first set of matrices.

[0023] With this method, the network device sends, to the terminal, the configuration information including the generation manner of the first set of matrices, so that the terminal can generate the first set of matrices based on the configuration information, and thus obtain the third matrix.

[0024] In one possible design, the generation manner of the first set of matrices includes: determining, from the second set of matrices, a matrix satisfying a correlation requirement as a matrix in the first set of matrices.

[0025] With this method, the network device sends, to the terminal, the configuration information including the generation manner of the first set of matrices in the network device: determining, from the second set of matrices, a matrix satisfying a correlation requirement as a matrix in the first set of matrices, so that the terminal can generate the first set of matrices by using the same generation manner, and thus obtain the third matrix.

[0026] In one possible design, the configuration information further includes at least one of the following: a generation manner of the second set of matrices; information of the second set of matrices; and / or information of the correlation requirement.

[0027] In one possible design, the third matrix includes N first sequences, any first sequence corresponding to one antenna, and the method further includes that the network device receives at least one set of second signals, the pth set of second signals being obtained by performing spreading on the pth element of the first signal according to the jth first sequence, the u element in the pth set of second signals being transmitted by the pth antenna at the u time-frequency resource, the first signal being obtained by performing precoding on the first data stream, 1≤j≤N, p being a positive integer, and 1≤u≤N sf , N sf being the length of the first sequence; and the network device recovers the first data stream according to the N first sequences.

[0028] With this design, the second information received by the network device is obtained by performing spreading on the elements in the first signal, and the first signal is obtained by performing precoding on the first data stream, which can improve the capacity of multi-data stream transmission.

[0029] In addition, the multiple sets of second signals can also be considered as a matrix, which can be considered as the second signal. The matrix can be a combination of the multiple sets of second signals. Alternatively, "the first terminal transmits the u element in the pth set of second signals by the pth antenna at the u time-frequency resource" can be replaced by "the first terminal transmits the p, u element of the second signal by the pth antenna at the u time-frequency resource". The time-frequency resource can also be referred to as a time-frequency resource unit, such as a resource element (RE).

[0030] As an example, p=j.

[0031] In one possible design, the third matrix includes N first sequences, and the N first sequences correspond to the N antennas one by one; and the N antennas belong to one terminal, or the N antennas belong to multiple terminals.

[0032] In a second aspect, a communication method is provided. The method is applied to a second communication device, or a component (such as a processor, a chip, a chip system, a circuit, a functional module, or other components) in the second communication device, or a software module. Taking the second communication device as a terminal device (or terminal, first terminal) as an example, the method can include: the terminal receives configuration information of a third matrix, the configuration information of the third matrix being used to configure a third matrix in a first matrix set; the first matrix set includes a first matrix and a second matrix; wherein the first matrix includes at least two same columns of elements, and the second matrix does not include two same columns of elements; or the first matrix includes at least two same rows of elements, and the second matrix does not include two same rows of elements; and the terminal transmits a first data stream according to the third matrix.

[0033] In a possible design, the second matrix includes a column-orthogonal matrix or a row-orthogonal matrix.

[0034] In a possible design, the first matrix includes a matrix with all identical columns or a matrix with all identical rows.

[0035] In a possible design, the first matrix set satisfies a correlation requirement, where the correlation requirement includes that a correlation between any two matrices in the first matrix set is no more than a cross-correlation threshold.

[0036] In a possible design, the correlation between any two matrices in the first matrix set is no more than a cross-correlation threshold, including at least one of the following: an element value of a correlation matrix of the any two matrices is less than or equal to a first threshold; an average of element values of correlation matrices between matrices in the first matrix set two by two is less than or equal to a first threshold; a two-norm of the correlation matrix of the any two matrices is less than or equal to a second threshold; or, an average of two-norms of correlation matrices between matrices in the first matrix set two by two is less than or equal to a second threshold.

[0037] In a possible design, the configuration information includes an index of the third matrix in the first matrix set, and 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.

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

[0039] In a possible design, the generation manner of the first matrix set includes: determining, as a matrix in the first matrix set, a matrix that satisfies a correlation requirement from a second matrix set.

[0040] In a possible design, the configuration information further includes at least one of the following: a generation manner of the second matrix set; information of the second matrix set; and / or, information of the correlation requirement.

[0041] In a possible design, the third matrix includes N first sequences, any first sequence corresponding to one antenna, and the terminal can send the first data stream in the following manner: the terminal performs precoding processing on the first data stream to obtain a first signal; the terminal performs 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, and p is a positive integer; and the terminal sends a u th< element in the p th< group of second signals through a p th< antenna at a u th< time-frequency resource, 1≤u≤N sf , Nsf is the length of the first sequence.

[0042] In a possible design, the third matrix includes N first sequences, where the N first sequences correspond to N antennas one by one; and the N antennas belong to one terminal, or the N antennas belong to multiple terminals.

[0043] In a third aspect, a communication apparatus is provided. The apparatus can implement the method in any possible implementation of the method in the first aspect or the second aspect. The apparatus has the functions of the first communication apparatus or the second communication apparatus. The apparatus is, for example, a terminal device, or a functional module in a terminal device, or a network device or a functional module in a network device, etc.

[0044] In an alternative implementation, the apparatus can include a module or unit or means for performing each of the method operations / operations / steps / actions of any possible implementation of the method in the first aspect to the second aspect, which can be hardware circuitry, software, or a combination of hardware circuitry and software. In an alternative implementation, the apparatus includes a processing unit (sometimes also referred to as a processing module) and a communication unit (sometimes also referred to as a transceiver module, a communication module, etc.). The transceiver unit can implement a sending function and a receiving function. 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). 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 can implement the sending function and the receiving function. Alternatively, the sending unit and the receiving unit can be different functional modules, and the transceiver unit is a collective term for these functional modules.

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

[0046] In a fourth aspect, the embodiments of the present application further 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 in any possible implementation of any of the first aspect to the second aspect.

[0047] In a possible implementation, the processor and the memory are integrated together.

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

[0049] The communication device also includes a communication interface for the communication device to communicate with other devices, such as transmitting or receiving data and / or signals. Exemplarily, the communication interface can be a transceiver, a circuit, a bus, a module, or other types of communication interfaces.

[0050] In a fifth aspect, a computer readable storage medium is provided, which is configured to store a computer program or instructions, which, when executed by a computer, cause the method according to any possible implementation of the first aspect to the second aspect and any possible implementation thereof to be performed.

[0051] In a sixth aspect, a computer program product is provided, which contains instructions, which, when executed on a computer, cause the method according to any possible implementation of the first aspect to the second aspect to be performed.

[0052] In a seventh aspect, the embodiments of the present application also provide a communication device, which is configured to perform the method according to any possible implementation of the first aspect to the second aspect.

[0053] In an eighth aspect, a chip system is provided, which includes a logic circuit (or it is understood that the chip system includes a processor, which can include a logic circuit, etc.), and can also include an input / output interface. The input / output interface can be configured to input a message, and can also be configured to output a message. The input / output interface can be the same interface, i.e., the same interface can be configured to implement the sending function and the receiving function; or the input / output interface includes an input interface and an output interface, the input interface is configured to implement the receiving function, i.e., is configured to receive a message; and the output interface is configured to implement the sending function, i.e., is configured to send a message. The logic circuit can be configured to perform operations other than the transceiving function in the method according to any possible implementation of the first aspect to the second aspect; and the logic circuit can also be configured to transmit a message to the input / output interface, or receive a message from the input / output interface from other communication devices. The chip system can be configured to implement the method according to any possible implementation of the first aspect to the second aspect. The chip system can be composed of a chip, or can include a chip and other discrete devices.

[0054] Optionally, the chip system can also include a memory, which can be configured to store instructions, and the logic circuit can invoke the instructions stored in the memory to implement corresponding functions.

[0055] In a ninth aspect, a communication method is provided, which can include the method implemented by the first communication device according to the first aspect and any possible implementation thereof, and the method implemented by the second communication device according to the second aspect and any possible implementation thereof.

[0056] In a tenth aspect, a communication system is provided, which can include a first communication device and a second communication device. The first communication device can be configured to implement the method of the first aspect and any possible implementation thereof, and the second communication device can be configured to implement the method of the second aspect and any possible implementation thereof.

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

[0058] FIG. 1a is a schematic diagram of an architecture of a communication system according to an embodiment of the present application;

[0059] FIG. 1b is a schematic diagram of another architecture of a communication system according to an embodiment of the present application;

[0060] FIG. 2 is a schematic diagram of a process of transmitting a data stream according to an embodiment of the present application;

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

[0062] FIG. 4 is a schematic diagram of another communication method according to an embodiment of the present application;

[0063] FIG. 5 is a schematic diagram of a precoding and spreading processing manner according to an embodiment of the present application;

[0064] FIG. 6 is a schematic diagram of a structure of a communication device according to an embodiment of the present application;

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

[0066] Embodiments of the present application provide a communication method and device. Since the principles of the method and device for solving problems are similar, the implementation of the device and the method can be referred to each other, and the repeated parts will not be repeated.

[0067] Figure 1a is a schematic diagram of an architecture of a communication system 10 to which embodiments of the present application are applied. As shown in Figure 1a, 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 Figure 1a) and at least one terminal (e.g., 120a-120j in Figure 1a). The terminal is connected to the RAN node by wireless means, and the RAN node is connected to the core network by wireless or wired means. The core network device and the RAN 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 RAN 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 RAN device. The terminal and the terminal, and the RAN device and the RAN device can be connected to each other by wired or wireless means. Figure 1a is only a schematic diagram, and the communication system can also include other network devices (such as wireless relay devices and wireless backhaul devices). As shown in Figure 1b, the communication system is based on Figure 1a, and the target terminal can access the RAN node through the wireless relay device.

[0068] The network device is a network-side device with wireless transceiving function. The network device can be a device providing wireless communication function for terminal devices 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 CU (or CU-CP, CU-UP), the DU, and the RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module. The wireless access network device can be a macro base station (such as 110a in FIG. 1a), a micro base station or an indoor station (such as 110b in FIG. 1a), 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.

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

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

[0071] The roles of the base station and the terminal can be relative. For example, the helicopter or the drone 120i in FIG. 1a 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. 1a can be referred to as a communication device with a base station function, and the 120a-120j in FIG. 1a can be referred to as a communication device with a terminal function.

[0072] It can be understood that the base station and the terminal, the base station and the base station, and the terminal and the terminal in the present application can communicate through a licensed frequency spectrum, or can communicate through an unlicensed frequency spectrum, or can simultaneously communicate through a licensed frequency spectrum and an unlicensed frequency spectrum. 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 or a terahertz (THz) wave, or can simultaneously use a frequency spectrum below 6 GHz and a frequency spectrum above 6 GHz. The embodiments of the present application do not limit the frequency spectrum resources used for wireless communication.

[0073] 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 base station functions. The control subsystem containing base station functions 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 terminal functions.

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

[0075] The technical terms involved in the present application are introduced below.

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

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

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

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

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

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

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

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

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

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

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

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

[0088] In addition, the multiple access technology can also be classified according to the signal dimension. When the multiple access is established by dividing the different carrier frequencies of the transmission signals, the multiple access technology can be referred to as a frequency division multiple access (FDMA) mode. When the multiple access is established by dividing the different time of the transmission signals, the multiple access technology can be referred to as a time division multiple access (TDMA) mode. When the multiple access is established by dividing the different code types of the transmission signals, the multiple access technology can be referred to as a code division multiple access (CDMA) mode.

[0089] Currently, the 3GPP mainly discusses the multiple access under the scenario that the terminal has only one transmission antenna (i.e., 1TX), and in addition, mainly non-orthogonal multiple access technology, and does not involve the MIMO scenario that the terminal has multiple TX capabilities. How the multi-transmission antenna scenario user utilizes multiple antennas for multiple access still needs to be discussed.

[0090] 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 transmission side and the reception side. However, the SDMA scheme only has significant benefits in the scenario that the user channels are low correlation, and the performance in the scenario that the user channels are high correlation often deteriorates sharply.

[0091] In order to improve the performance of SDMA in the scenario that the channels are high correlation, the industry has also proposed a MIMO-code division non-orthogonal access (code division-NOMA, CD-NOMA) technical scheme in recent years, which introduces CD-NOMA on the data stream. In the 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 the users in the same space and the streams within the users. For example, different data streams use c n,i and c k,j with lower correlation as the spreading sequence to reduce the interference between the data streams. However, if multiple data streams use a spreading sequence with higher correlation, the interference between the data streams cannot be reduced.

[0092] As shown in FIG. 2, terminal n transmits data symbols s t of the data stream i by 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. n,i 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 one REs. For ease of understanding, we can consider it as a... 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 Send b 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. b n,i (j) in N t Transmitted on one antenna, eventually reaching N sf Each time-frequency resource is accessed through N t The data matrix transmitted by the root transmitting antenna satisfies:

[0093] Assume there are N 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:

[0094] wherein, is the channel experienced by terminal n, Y, s n,i represents a data stream. N R represents the number of base station receiving antennas.

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

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

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

[0098] At this time, if two data streams need to be orthogonal and not correlated with each other, 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 by the constraint δ n,k (i,j)<1. Combined with the bandwidth loss caused by spreading itself, the capacity of the MIMO-CD-NOMA system is limited.

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

[0100] To improve the capacity of multi-data stream transmission, the application provides a communication method. The communication method can be implemented by a first communication device and a second communication device. The first communication device can be a signal sending end, and the second communication device can be a signal receiving end. That is, 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 in the terminal device, and the second communication device can be a network device, or a module or a chip in the network device, such as a RAN node or other access network device. As another example, in the downlink communication process, the first communication device can be a network device, or a module or a chip in the network device, and the second communication device can be a terminal device, or a module or a chip in the terminal device. Similarly, the first communication device can be a signal receiving end, and the second communication device can be a signal sending end.

[0101] The method will be described below in combination with the flow shown in FIG. 3. In FIG. 3, the first communication device is a first terminal, and the second communication device is a base station. According to needs, the first communication device can be replaced by a base station, a chip or a sending unit in the base station, or other communication devices, a chip or a sending unit in a terminal, or other execution subjects. In addition, the second communication device can be replaced by a terminal or other communication devices, or other execution subjects.

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

[0103] S101: The base station acquires a first matrix set.

[0104] The first matrix set includes a first matrix and a second matrix. The first matrix includes at least two columns of the same elements, that is, the first matrix can be a column-repeated matrix. The second matrix does not include two columns of the same elements, that is, the second matrix can be a column-non-repeated matrix. For example, one column of elements in the first matrix or the second matrix can be used as a spreading sequence. The first matrix includes at least two columns of the same elements, and the second matrix does not include two columns of the same elements.

[0105] For example, the first matrix can be The second matrix can be

[0106] Optionally, some or all columns of the first matrix are the same. For example, when the number of matrix columns is greater than 2, the first matrix can include at least two columns of the same column elements, or at least two columns of different column elements. For example, when the number of matrix columns is 3, the first matrix can be Or etc.

[0107] Similarly, it can also be said that the first matrix includes at least two rows of identical elements, that is, the first matrix can be a row-repeated matrix. In addition, the second matrix does not include two rows of identical elements, that is, the second matrix can be a row-unrepeated matrix. For example, one row of elements in the first matrix or the second matrix can serve as a spreading sequence, so that the first matrix includes at least two rows of identical elements, and the second matrix does not include two rows of identical elements. Alternatively, some or all rows of the first matrix are identical.

[0108] Alternatively, the second matrix includes a column-orthogonal matrix or a row-orthogonal matrix, so that the orthogonality of the matrices in the first matrix set meets the requirements. For example, so that the autocorrelation of the matrices in the first matrix set meets the autocorrelation constraint.

[0109] S102: The base station sends configuration information of a third matrix to the first terminal. Correspondingly, the first terminal receives the configuration information of the third matrix. Wherein, the third matrix is any one of the first matrix set.

[0110] Wherein, the third matrix can be one of the first matrix or one of the second matrix. That is, the third matrix can be a column-repeated matrix, a row-repeated matrix, a column-unrepeated matrix, or a row-unrepeated matrix.

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

[0112] Alternatively, the third matrix includes N first sequences, and the N first sequences can be used to send the data stream of the first terminal.

[0113] The following describes the way in which the base station configures the third matrix to the first terminal.

[0114] As described in S102, the base station can send configuration information of the third matrix to the first terminal. Wherein, the third matrix can be related to the N first sequences, so that the first terminal can determine the N first sequences according to the third matrix. For example, the base station can send configuration information of the third matrix to the first terminal, and the configuration information can be used to indicate or determine the third matrix.

[0115] In an implementation, the third matrix is sent in a manner such as the base station sending information of elements of the third matrix to the first terminal to indicate the third matrix. The information of elements of the third matrix can include values of row elements and / or values of column elements of the third matrix, that is, the base station can send row elements and / or column elements of the third matrix to the first terminal. For example, the base station can send configuration information of the third matrix carrying the information of elements of the third matrix to the first terminal.

[0116] It can be understood that the third matrix is related to the N first sequences, and thus the third matrix can be used to directly or indirectly determine the N first sequences so as to send the first data stream according to the N first sequences in S103. Direct determination can mean that the third matrix is composed of the N first sequences, and thus the first terminal can obtain the N first sequences according to the third matrix without additional operations or processing. For example, the N first sequences are N row or column elements in the third matrix, and thus the N first sequences can be indicated by the third matrix. Indirect determination can mean that the N first sequences can be obtained through calculation or processing of the third matrix. For example, the N first sequences are N row or column elements in a subset or a submatrix of the third matrix, and the first terminal needs to select the N first sequences from the third matrix. For example, N=2, N=4, the dimension of the third matrix is 4x4, 2 row or column elements in the third matrix can form a subset or a submatrix of the third matrix, and the 2 row or column elements can be used as 2 first sequences. For another example, the first terminal can obtain the N first sequences after extending part or all elements (or vectors) of the third matrix. For example, multiple row elements or multiple column elements in the third matrix can be connected at the head and tail to form a first sequence, or a row element or a column element in the third matrix can be repeatedly arranged to obtain a first sequence. sf

[0117] For example, taking the third matrix as , the base station can send configuration information of the third matrix to the first terminal, and the configuration information can include row elements (a0, a2) and (a1, a3). Alternatively, the base station can send configuration information of the third matrix to the first terminal, and the configuration information can include column elements (a0, a1) and (a2, a3). If the column elements correspond to a first sequence, the base station can also be understood as sending N first sequences to the first terminal, where N=2. That is, S102 can be replaced by the base station sending N first sequences to the first terminal.

[0118] ​Optionally, the base station can also send dimension information of the third matrix to the first terminal. This dimension information can be used to indicate whether a row of the third matrix corresponds to the number of time-frequency resources or the number of antennas, and / or, to indicate whether a column of the third matrix corresponds to the number of time-frequency resources or the number of antennas. The first terminal can determine whether a row or a column of the third matrix constitutes a first sequence based on the dimension information. For example, if the number of columns in the third matrix is ​​the number of antennas N, and correspondingly, the columns of the third matrix correspond to the number of antennas, then each column in the third matrix can be considered a first sequence. Alternatively, the dimension information can be understood as including row information and / or column information; row information can be used to indicate whether a row corresponds to the number of time-frequency resources or the number of antennas, and column information can be used to indicate whether a column of the third matrix corresponds to the number of time-frequency resources or the number of antennas.

[0119] Optionally, the base station may also send time-frequency resource information and / or data stream information corresponding to the third matrix to the first terminal. The time-frequency resource information can be used to indicate the time-frequency resources corresponding to the third matrix (or N first sequences), and this time-frequency resource can also serve as the time-frequency resource information corresponding to the N first sequences. The time-frequency resource information can be used to indicate the N of a NOMA resource. sf The location of each time-frequency resource, and the time-frequency resource information corresponding to the third matrix, can be used to reasonably determine the matrix for the use of time-frequency resources.

[0120] Additionally, define the N of the third matrix. sf Each time-frequency resource is a non-orthogonal access (NOMA) unit (also called a spread spectrum unit, NOMA resource unit, or spread spectrum resource unit, etc.). Time-frequency resource information can be used to indicate the N of a NOMA unit. sf The location of each time-frequency resource, and the time-frequency resource information corresponding to the third matrix, can be used to reasonably determine the matrix for the use of time-frequency resources.

[0121] For example, the third matrix operates on N time-frequency resources, labeled 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) ( (1) Indicates the third matrix corresponding to the NOMA unit (rounded down). (2) Indicates the location information of the i-th, i = 0, 1, ..., M-1 NOMA unit in the configured N time-frequency resources, or the NOMA unit information corresponding to the configured n-th time-frequency resource. For example, when the mapping form is sequential mapping, the i×N-th NOMA unit is the third matrix corresponding to the third matrix. sf up 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.

[0122] The data stream information can be used to indicate the data stream corresponding to the third matrix (or the N first sequences). For example, the data stream information can include port information of the first data stream, which is used to indicate that the third matrix corresponds to the first data stream. The 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 the data stream 1 corresponding to t1 is mapped to the N antennas {t21, t22, … t2N} after precoding processing. Wherein, the port information can be used to indicate the antenna port t1, and / or indicate the antennas {t21, t22, … t2N}.

[0123] The above-mentioned dimension information, time-frequency resource information and / or data stream information can be carried in control signaling such as radio resource control (RRC) message, MAC control element (CE) or downlink control information (DCI), which is not specifically required in the present application.

[0124] In addition, in the present application, the base station can also send N first sequences to the first terminal. For example, the base station can send information of elements of the first sequence to the first terminal to indicate the value of each first sequence.

[0125] S103: The first terminal sends the first data stream according to the third matrix.

[0126] The manner in which the first terminal sends the first data stream will be described below in combination with the flowchart of FIG. 4, which will not be expanded here.

[0127] In combination with the flowchart shown in FIG. 3, the base station can configure the third matrix to the first terminal, so that the first terminal sends the first data stream according to the third matrix. Wherein, the third matrix can be a matrix in the first matrix set (also referred to as codebook), which includes matrices with repeated columns and matrices with non-repeated columns, or includes matrices with repeated rows and matrices with non-repeated rows, and the codebook can improve the robustness of multi-data stream transmission.

[0128] Embodiment 1: The following describes the characteristics possessed by the first matrix set (including the third matrix) and the possible generation manner, i.e. a possible implementation manner of S101.

[0129] In the present application, any two matrices in the first matrix set satisfy the correlation requirement (also referred to as correlation constraint / correlation constraint condition). Therefore, the matrices satisfying the correlation requirement can be determined from the second matrix set as the matrices in the first matrix set , and the second matrix set can contain multiple matrices.

[0130] The correlation requirement can be related to cross-correlation between the plurality of matrices and / or auto-correlation of the matrices.

[0131] Optionally, the correlation requirement can include low correlation of the correlation matrix. For example, the correlation requirement can include that the correlation value between any two matrices is not more than a cross-correlation threshold, i.e., the correlation between the two matrices is low. That is, the correlation value between two matrices can be determined according to the correlation matrix of the two matrices. For example, the cross-correlation matrix of two matrices C k and is Alternatively, the correlation requirement can include that the auto-correlation value of a matrix is not more than an auto-correlation threshold, i.e., the correlation of the matrix is low. In addition, T n,n may represent the auto-correlation matrix of matrix C n .

[0132] In the following, the definition of the correlation of the cross-correlation matrix and the definition of the correlation of the auto-correlation matrix are introduced respectively.

[0133] The definition of the correlation of the cross-correlation matrix and the definition of the correlation of the auto-correlation matrix are introduced respectively.

[0134] For the cross-correlation matrix T n,k , the correlation (or cross-correlation coefficient) p n,k of the cross-correlation matrix is determined by an element value of the cross-correlation matrix T n,k .

[0135] As an example, the correlation p k of the cross-correlation matrix of matrices C n and C n,k may be defined as the maximum element value of the cross-correlation matrix, i.e.,

[0136] where T n,k (i,j) represents the element in the i-th row and the j-th column of matrix T n,k , and |T n,k | represents the maximum value of the absolute values of all elements of the cross-correlation matrix T n,k . That is, the correlation of the cross-correlation matrix can be determined according to the maximum absolute value of all elements |T k (i,j)| of the cross-correlation matrix.

[0137] As another example, the correlation of the cross-correlation matrix of matrices C n and C n,k may be defined as the average cross-correlation coefficient, which is determined by all elements T n,k (i,j) of the cross-correlation matrix.

[0138] For example, the average cross-correlation coefficient p n,k may be determined according to the average of the absolute values of all elements T n,k (i,j) of the cross-correlation matrix. As an example of an exemplary formulated expression, p n,k may satisfy:

[0139] wherein, may represent the average of the absolute values of all elements T n,k (i,j) of the cross-correlation matrix. That is, the correlation of the cross-correlation matrix can be determined according to the average of the absolute values of all elements of the cross-correlation matrix.

[0140] For another example, the average cross-correlation coefficient p n,k may be determined according to the average of the square roots of the elements of the cross-correlation matrix T n,k . As an example of an exemplary formulated expression, p n,k may satisfy:

[0141] wherein, may represent the average of the square roots of all elements T n,k (i,j) of the cross-correlation matrix. That is, the correlation of the cross-correlation matrix can be determined according to the average of the square roots of all elements of the cross-correlation matrix T n,k .

[0142] Further, for the autocorrelation matrix, the correlation of the autocorrelation matrix (or referred to as an autocorrelation coefficient) can be determined by the non-principal diagonal elements of the matrix.

[0143] As an example, the correlation of the autocorrelation matrix can be defined as the maximum autocorrelation coefficient p n,n of the autocorrelation matrix. For example, the maximum autocorrelation coefficient p n,n may be determined according to the maximum value of the non-diagonal elements of the autocorrelation matrix T n,n . As an example of an exemplary formulated expression, p n,n may satisfy:

[0144] wherein, i≠j, may represent the maximum value of the non-diagonal elements of the autocorrelation matrix T n,n . That is, the correlation of the autocorrelation matrix can be determined according to the maximum value of the non-diagonal elements of the autocorrelation matrix T n,n .

[0145] As another example, the correlation of the autocorrelation matrix of a matrix can be defined as the average autocorrelation coefficient. For instance, the average autocorrelation coefficient is determined by the average of the off-diagonal elements of the autocorrelation matrix. As an exemplary formulaic expression, the average autocorrelation coefficient ρ... n,n It can satisfy:

[0146] Among them, T n,n Representing matrix C n The autocorrelation matrix, T n,n (i,j) represents matrix T n,n The element in the i-th row and j-th column. Matrix C can be represented n The average of the absolute values ​​of the off-diagonal elements of the autocorrelation matrix. In other words, the correlation of the autocorrelation matrix can be determined by the average of the off-diagonal elements of the autocorrelation matrix.

[0147] Furthermore, the average autocorrelation coefficient can also be determined by taking the square root of the sum of squares of the off-diagonal elements of the autocorrelation matrix. As an exemplary formulaic expression, the average autocorrelation coefficient ρ... n,n It can satisfy:

[0148] in, Matrix C can be represented n The square root of the sum of the squares of the means of the off-diagonal elements of the autocorrelation matrix.

[0149] In addition, normalization can be performed on the aforementioned correlation coefficients (such as cross-correlation coefficients and / or autocorrelation coefficients). For example, the average cross-correlation coefficient. The normalized average cross-correlation coefficient (which can still be expressed as ρ) n,k It can satisfy:

[0150] The normalization of the autocorrelation coefficient can be written as:

[0151] Normalized correlation coefficients can eliminate the influence of the size of individual matrix elements on the correlation. If the correlation coefficient is normalized, the corresponding correlation threshold can be changed. The correlation threshold corresponding to the normalized correlation coefficient is called the relative threshold, while the correlation threshold corresponding to the unnormalized correlation coefficient is called the absolute threshold.

[0152] Correspondingly, the correlation threshold is the corresponding correlation threshold value. Meeting this condition indicates that the correlation matrix is ​​low-correlation. That is, the correlation requirement can be transformed into a condition related to the correlation matrix T. n,k The correlation constraint, that is, the requirement for T n,k It has a low correlation.

[0153] For example, when the correlation coefficient of the correlation matrix T n,k satisfies p n,k ≤ Th2, it indicates that the correlation between the matrix C k and C n satisfies the correlation requirement, or the correlation value between the matrix C k and C n does not exceed the correlation threshold. Wherein, Th2 represents the correlation limit value, and the smaller the Th2 is, the more irrelevant the matrix is.

[0154] The same correlation coefficient can also be selected to achieve different set selection by different correlation constraints.

[0155] For example, the element value of the correlation matrix T n,k of the first matrix set can be required to be less than or equal to a first threshold value. Specifically, the element value of the correlation matrix T n,k between any two matrices (or between all matrices) can be required to be less than or equal to the first threshold value. In addition, it can not be required that the element value of the correlation matrix between all matrices in the first matrix set is less than or equal to the first threshold value, but the average value of the element value of each correlation matrix is required to be less than or equal to the first threshold value, or the average value of the element value of all correlation matrices is required to be less than or equal to the first threshold value. In this application, the cross-correlation threshold value can include the first threshold value and / or the second threshold value.

[0156] For another example, the two-norm of the correlation matrix T n,k of the first matrix set can be required to be less than or equal to a second threshold value. Specifically, the two-norm of the correlation matrix T n,k between any two matrices (or between all matrices) can be required to be less than or equal to the second threshold value. In addition, it can not be required that the two-norm of the correlation matrix between all matrices in the first matrix set is less than or equal to the second threshold value, but the two-norm of the element value of each correlation matrix is required to be less than or equal to the first threshold value, or the evaluation value of the two-norm of all correlation matrices is required to be less than or equal to the second threshold value.

[0157] In an example, the aforementioned correlation constraint (or correlation requirement) includes that the correlation between any two matrices in the first matrix set does not exceed the cross-correlation threshold value (satisfying at least one of the following four conditions).

[0158] Condition 1: the element value of the correlation matrix of the aforementioned any two matrices is less than or equal to the first threshold value;

[0159] Condition 2: the average value of the element value of the correlation matrix between the matrices in the first matrix set is less than or equal to the first threshold value;

[0160] Condition 3: the 2-norm of the correlation matrix of any two of the preceding matrices is less than or equal to a second threshold value.

[0161] Condition 4: the average of the 2-norms of the correlation matrices between each pair of matrices in the first set of matrices is less than or equal to a second threshold value.

[0162] Optionally, any matrix in the first set of matrices satisfies a sparsity requirement. The sparsity requirement includes that the proportion of non-zero elements in the matrix is less than or equal to a threshold value (which can be referred to as a sparsity threshold value for the sake of distinction), or the proportion of zero elements in the matrix is greater than or equal to a threshold value. The threshold value can be 1 / 2 or other numerical values.

[0163] As an example, the sparsity of any matrix can be defined according to the numerical value of the sparsity and the size relationship with the threshold value to determine whether the matrix satisfies the sparsity requirement. The sparsity may refer to the proportion of the number of non-zero elements N non-zero in all element numbers. The smaller the Dos value, the sparser the matrix, i.e., the sparsity can be required to be less than or equal to a threshold value.

[0164] In addition, the sparsity of the matrix can also be defined as the row sparsity and / or the column sparsity The row sparsity represents the proportion of the number of non-zero elements in the i-th row vector in the row vector elements. The column sparsity represents the proportion of the number of non-zero elements in the j-th column vector in the column vector elements.

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

[0166] For example, one or more of the following can be required: Dos≤Th、 or . Wherein, may represent the maximum value of the row sparsity of multiple row elements of the matrix, may identify the maximum value of the column sparsity of multiple column elements of the matrix.

[0167] Similarly, the sparsity can be defined as the ratio of the number of zero elements in the sparsity representation matrix to the total number of elements, or the row sparsity can be defined as the ratio of the number of zero elements in the i-th row vector to the total number of elements in the row vector, or the column sparsity can be defined as the ratio of the number of zero elements in the j-th column vector to the total number of elements in the column vector. Correspondingly, the greater the sparsity value, row sparsity value or column sparsity value, the sparser the matrix, that is, the sparsity value, row sparsity value or column sparsity value can be required to be greater than or equal to a threshold value.

[0168] In a possible embodiment, the first terminal and / or the base station can determine the matrix in the first matrix set from the second matrix set according to the constraint condition.

[0169] The first matrix set can include an initial matrix, such as a preset matrix.

[0170] Suppose the first matrix set has N k matrices, the k-th matrix B from k is calculated, and the correlation matrix T n of B n,k with any matrix A n,k in the second matrix set is calculated.

[0171] Only when T n,k satisfies the correlation constraint, can it enter and N k = N k + 1, that is, to determine whether the next matrix B k+1 can be a matrix in the first matrix set; when T n,k does not satisfy the correlation constraint, B k is discarded. It can be understood that the correlation constraint here can be a cross-correlation constraint.

[0172] For example, the correlation is defined as the maximum absolute value of the elements of the correlation matrix, that is, the correlation constraint is defined as any one ρ n,k is less than or equal to a first threshold value. Taking the correlation matrix described in formula 2 as an example, the element value T n,k (i,j) of the correlation matrix of any one matrix can satisfy:

[0173] where Th can represent the first threshold value.

[0174] For another example, the correlation is defined as the two-norm of the correlation matrix, such as the correlation constraint includes that any one ρ n,k is less than or equal to a second threshold value.

[0175] In one possible embodiment, this application can use methods such as brute-force search to obtain complete... The search is performed within the set to obtain the matrices in the first matrix set, which is the second matrix set mentioned above. It can be complete Set. Based on a brute-force search approach, two matrices can be arbitrarily selected. It is then determined whether the two matrices satisfy the correlation and / or sparsity requirements. If they do, the two matrices can be included in the first matrix set; otherwise, matrices are selected again.

[0176] Alternatively, this application can also expand upon a known one-dimensional sequence to obtain a second set of matrices.

[0177] For example, a second set of matrices can be obtained by directly extending from a one-dimensional sequence. The matrices in the second matrix set. Any matrix in the second matrix set is represented as C. n , It can satisfy: C n =[c n,1 …c n,N ].

[0178] in, It is N sf A one-dimensional sequence of length N × 1. That is, it can be a sequence of N × 1. sf The combination of one-dimensional sequences yields any matrix in the second matrix set, where N > 1.

[0179] For example, matrices in the second matrix set can be obtained from multiple sequences through tensor expansion.

[0180] Taking two sequences as an example, any matrix in the second matrix set is represented as C. n , It can satisfy:

[0181] in, It is N sf A one-dimensional sequence of ×1, It is an N×1 one-dimensional sequence.

[0182] It is understandable that tensors are expanded to C. n This has brought more possibilities. Among them, and It can be a sequence with the same properties (or type), such as They can all be Zadoff-Chu (ZC) sequences or both can be m sequences; and which can be different in nature (or type), such as which can be complex sequences, which can be binary sequences of {0, 1}, and tensor extension can realize matrices containing 0 elements.

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

[0184] The following will introduce the process of screening the first matrix set under two possible generation modes of the second matrix set .

[0185] Mode 1, based on a sequence set (referred to as a base sequence set) to construct the second matrix set The base sequence set can include one or more sequences. In addition, in the case where the sparsity threshold Th is known, the matrix satisfying the constraint condition can be screened from the second matrix set according to the sparsity threshold Th, thereby constituting the first matrix set Wherein, the constraint condition can include a correlation constraint and / or a sparsity constraint.

[0186] For example, assuming that the sequence set is:

[0187] In the sequence set , the sequence set includes 9 vectors, denoted as M=9, wherein the correlation of any two vectors does not exceed 1 / 3.

[0188] In a possible design, any matrix in the second matrix set includes N one-dimensional sequences, the one-dimensional sequences come from a set containing M one-dimensional sequences, and the number of matrices in the second matrix set is M N . Optionally, N is the number of antennas.

[0189] Based on the complete set generated by extending the sequence set in the foregoing example, the complete set includes M N matrices. Optionally, M N is much larger than N. Assuming that N=2, any two vectors in the foregoing sequence set can constitute a matrix in the complete set . In the present example, the complete set can include 81 matrices, for example, and and so on. In the present example, the foregoing 81 matrices are not unfolded. The first matrix in the complete set may be denoted as B1, In an example,

[0190] Further, according to the foregoing complete set a second matrix set That is, the second matrix set is a subset of the complete set For example, the complete set obtained in the foregoing example can be taken as the second matrix set That is, For another example, a proper subset of the complete set obtained in the foregoing example can be taken as the second matrix set

[0191] In the foregoing second matrix set , matrices meeting the conditions are screened out to form a first matrix set In some cases, the screening of the matrices can also not be performed, that is, in some cases, the first matrix set is the same as the second matrix set .

[0192] In an example, the foregoing screening condition can include that the first matrix set satisfies a correlation requirement. The correlation requirement can refer to the description of the correlation constraint in the present application, which will not be repeated here.

[0193] In an example, the first matrix set includes a repeated matrix (i.e., a first matrix), and multiple column vectors (or row vectors) in the repeated matrix are all the same. Optionally, the repeated matrix includes a matrix with all columns being the same or a matrix with all rows being the same. For example, in the case where the number of columns of the matrix is greater than 2, the matrix can include at least two columns of the same column elements or at least two columns of different column elements. For example, is a column-repeated matrix.

[0194] In an example, the first matrix set includes a non-repeated matrix (i.e., a second matrix), and the non-repeated matrix does not include two column (or row) vectors that are the same. For example, is a non-repeated matrix. Optionally, the non-repeated matrix includes an orthogonal column matrix or an orthogonal row matrix.

[0195] The process (steps 1 to 3) of screening the first matrix set from the second matrix set is described below.

[0196] Step 1: initialization setting: set any matrix in the second matrix set as the initial value (or initial matrix) of the first matrix set. For example, the first matrix set in this example includes Q matrices, and after the aforementioned initialization setting, Q = 1.

[0197] In some cases, the initial value of the first matrix set during initialization setting can be an empty set, in which case Q = 0.

[0198] Step 2: iterate through the matrices in the second matrix set except matrix B1, and incorporate the matrices meeting the conditions into the first matrix set, thereby updating the first matrix set.

[0199] In one example, step 2 can be specifically broken down into the following steps 2a, 2b, 2c and 2d.

[0200] Step 2a: assuming the kth matrix in the second matrix set is matrix Bk, calculate the cross-correlation matrix of matrix Bk and each matrix in the first matrix set, respectively, to obtain Q cross-correlation matrices. Among them, the cross-correlation matrix of matrix Bk and the Qth matrix Aq in the first matrix set is: k k k Q

[0201] Step 2b: based on the Q cross-correlation matrices obtained in step 2a, calculate the variable corresponding to the constraint condition.

[0202] For example, when the constraint condition is the aforementioned condition 3 and condition 4, calculate the two-norm of the Q cross-correlation matrices Tk, respectively. Q,k Further, calculate the average of the two-norm of the aforementioned Q cross-correlation matrices, respectively.

[0203] Step 2c: if the Q autocorrelation matrices corresponding to the kth matrix Bk meet the constraint condition, incorporate matrix Bk into the first matrix set. k k ​​​​​​​​​​​​​​​​​​In the middle (i.e., updating the first matrix set) ),remember And let Q increment by 1, denoted as Q = Q + 1. Conversely, the first matrix set... Without changing matrix B k Do not enter the set Among them, satisfying the constraints can mean:

[0204] Step 2d: Increment k by 1, and denote k = k + 1. When k ≤ M N If the condition is met, return to step 2a; otherwise, exit the filtering process and proceed to step 3.

[0205] Step 3: Output the first set of matrices after the most recent update.

[0206] Assuming Th = 1 / 2, then using the aforementioned filtering method, we can select from the aforementioned complete set. The first matrix set consists of the following 23 matrices obtained from the 81 matrices included.

[0207] Matrix 1:

[0208] Matrix 2:

[0209] Matrix 3:

[0210] Matrix 4:

[0211] Matrix 5:

[0212] Matrix 6:

[0213] Matrix 7:

[0214] Matrix 8:

[0215] Matrix 9:

[0216] Matrix 10:

[0217] Matrix 11:

[0218] Matrix 12:

[0219] Matrix 13:

[0220] Matrix 14:

[0221] Matrix 15:

[0222] Matrix 16:

[0223] Matrix 17:

[0224] Matrix 18:

[0225] Matrix 19:

[0226] Matrix 20:

[0227] Matrix 21:

[0228] Matrix 22:

[0229] Matrix 23:

[0230] Among the 23 matrices in the foregoing example, the following 3 repeated matrices are included:

[0231] Matrix 1, Matrix 11 and Matrix 21. Other matrices are non-repeated matrices.

[0232] Among the 23 matrices in the foregoing example, 20 non-repeated matrices are included, such as other matrices except Matrix 1, Matrix 11 and Matrix 21.

[0233] In addition, the second matrix set can also include part or all of the 23 matrices described above, for example, include part or all of the 3 repeated matrices, and / or, include part or all of the 20 non-repeated matrices.

[0234] Assuming Th = 2 / 3, using the foregoing screening method, the following 45 matrices (two columns constitute a matrix) can be obtained from the foregoing complete set of 81 matrices

[0235] Matrix 1 to Matrix 23 are respectively the same as Matrix 1 to Matrix 23 in the foregoing example, and will not be repeated.

[0236] Matrix 24:

[0237] Matrix 25:

[0238] Matrix 26:​

[0239] Matrix 27:

[0240] Matrix 28:

[0241] Matrix 29:

[0242] Matrix 30:

[0243] Matrix 31:

[0244] Matrix 32:

[0245] Matrix 33:

[0246] Matrix 34:

[0247] Matrix 35:

[0248] Matrix 36:

[0249] Matrix 37:

[0250] Matrix 38:

[0251] Matrix 39:

[0252] Matrix 40:

[0253] Matrix 41:

[0254] Matrix 42:

[0255] Matrix 43:

[0256] Matrix 44:

[0257] Matrix 45:

[0258] The following 5 duplicate matrices are included in the 45 matrices in the foregoing examples:

[0259] Matrix 1, Matrix 11, Matrix 21, Matrix 31, Matrix 40, and Matrix 45.

[0260] The 45 matrices in the foregoing example include 40 non-repeated matrices, such as matrices 1, 11, 21, 31, 40 and 45, and other matrices.

[0261] In addition, the second matrix set can also include part or all of the 45 matrices described above, for example, including part or all of the 5 repeated matrices, and / or, including part or all of the 40 non-repeated matrices.

[0262] Method 2, based on sequence set Generate at least two second matrix sets, for example, including And In addition, based on the constraint condition, the matrices that meet the condition are screened from the at least two second matrix sets respectively, thereby forming the first matrix set

[0263] First, still taking the sequence set shown in method 1 As an example, the sequence set is extended to generate a complete set

[0264] Second, at least two matrix sets are determined according to the foregoing complete set , such as determining And And may be two subsets of the complete set respectively. And There can be an intersection, and there can be no intersection. And The complement of may contain part or all of the matrices of the complete set.

[0265] For example, the complete set includes a repeated matrix set and a non-repeated matrix set The repeated matrix set includes repeated matrices and does not include non-repeated matrices, and the non-repeated matrix set includes non-repeated matrices and does not include repeated matrices. As an example, the repeated matrix set and the non-repeated matrix set may be taken as a second matrix set respectively, for example In this example, the autocorrelation threshold can be used as a condition for selecting the second matrix set . For example is the matrix set whose average autocorrelation coefficient is 1, The average autocorrelation coefficient is less than 1.

[0266] Further, in the aforementioned second matrix set , the matrices meeting the conditions are screened to form a first matrix set In the aforementioned second matrix set , the matrices meeting the conditions are screened to form a first matrix set It should be noted that different screening conditions (such as sparsity threshold, correlation threshold, or the number of zero elements contained in the matrix, etc.) can be set in the screening process of the second matrix set and in the screening process of the second matrix set The screening conditions can be referred to the description of the aforementioned manner 1, and the screening process can be referred to the description of steps 1 to 3 of the aforementioned manner 1, which will not be repeated here.

[0267] The screening process of the second matrix set will be briefly described below. Any matrix (such as matrix D1, ) in the second matrix set is taken as the initial value of the first matrix set Referring to the method of step 2, the matrices in the second matrix set except matrix D1 are traversed, and the matrices meeting the conditions are incorporated into the first matrix set , so as to update the first matrix set

[0268] In some cases, the initial value of the first matrix set may be an empty set, which will not be specifically expanded in this example.

[0269] The screening process of the second matrix set will be briefly described below. In one example, any matrix (such as matrix D1′, ) in the second matrix set is taken as the initial value of the first matrix set Referring to the method of step 2, the matrices in the second matrix set except matrix D1′ are traversed, and the matrices meeting the conditions are incorporated into the first matrix set , so as to update the first matrix set In another example, the first matrix set may inherit the first matrix set , that is, the recently updated first matrix set is taken as the first matrix set initial value of the first matrix set. Referring to the method of step 2, all matrices in the second matrix set are traversed, and the matrices meeting the condition are incorporated into the first matrix set, thereby updating the first matrix set

[0270] In some cases, the initial value of the first matrix set can be an empty set, and the present example does not specifically expand on this case.

[0271] Finally, the most recently updated first matrix set For example, the first matrix set can be the union of the first matrix set For another example, the first matrix set can be the union of the first matrix set and the first matrix set , that is

[0272] Based on the above method of constructing the second matrix set and screening the matrices 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 method information, the above sequence expansion method, the matrix correlation requirement or the correlation threshold, and other specific matrix set construction schemes for the terminal (such as the first terminal).

[0273] It can also be understood that the matrices in the second matrix set can include multiple matrices generated by different generation methods. That is, a part of the matrices in the second matrix set can be constructed in a certain way, and another part of the matrices can be constructed in another different way. Among them, the different matrix construction methods can at least one of the following: different sequence types, different sequence lengths, different sequence expansion methods, 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 sequences, and another part of the matrices can be constructed according to one-dimensional m sequences.

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

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

[0276] ​​As an example, the configuration information of the third matrix can contain a first generation parameter, which can be used to generate the third 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 third 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 third matrix. Wherein, the sequence type is used to indicate, for example, that the type of the sequence used to generate the third 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 third matrix, for example, to indicate N sf , so as to generate the third 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 third matrix according to the same expansion manner.

[0277] In addition, the first generation parameter can indicate or determine the generation manner of the third matrix. The generation manner of the third matrix can include generating the third matrix according to one or more one-dimensional sequences. For example, one or more one-dimensional sequences can be expanded to obtain the third matrix. 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.

[0278] Correspondingly, the first generation parameter can indicate the number of one-dimensional sequences participating in constructing the third 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 third matrix, the matrix correlation threshold or the sparsity threshold, etc.

[0279] For example, taking the third matrix as an example , the matrix can be expanded according to 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 third 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 third matrix. For example, the relationship between C1 and c1 and c2 is: In addition, if it is necessary to update the third matrix, the base station can re-indicate c1 and c2, or re-indicate the relationship between C1 and c1 and c2.

[0280] Optionally, the first terminal and the base station can agree on multiple generation manners of the matrix, and set indexes of the multiple 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 third matrix. For example, the index of the generation manner can represent that the third matrix is generated according to the one-dimensional sequences c1=(0, 1) and c2=(1, 0) and the relationship determining the third matrix Based on this implementation manner, the base station does not need to send all variables of the generation manner of the third matrix to the first terminal, but only needs to indicate the index, and determine the variables of the generation manner of the third matrix from the locally existing configuration according to the index, which can reduce the indication overhead.

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

[0282] In this application, the configuration information of the third matrix can be used to initially configure the third matrix, or can be used to update the third matrix configured by the first terminal. The update condition includes, for example, that the base station determines that the channel transmission changes, or the number of users changes, etc. For the scenario of updating the first matrix, the base station can determine a matrix different from the initially configured third matrix from the first matrix set, that is, the update process can not 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, etc.), the configuration information of the updated third matrix can include the index of the updated third matrix in the set. In addition, the base station can determine the third 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.

[0283] 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 out-of-the-box configuration of the first terminal. For another example, the first matrix set is defined by the 3GPP standard, etc., 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 the RRC message, the MAC CE or the 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.

[0284] As an example of a base station configuring a first matrix set to a first terminal, the base station can send a second generation parameter to the first terminal. This second generation parameter can be used to generate multiple matrices (including a third matrix), which can be included in the first matrix set. Optionally, the configuration information of the third matrix may include the second generation parameter. The second generation parameter may include sequence type, sequence length, sequence expansion method, etc. The sequence type, for example, indicates that the type of 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, indicating N... sf So that according to the length of N sf The sequence generates a third matrix. Sequence expansion methods, such as direct expansion or tensor expansion, can be used to indicate the expansion method for obtaining the second matrix set and / or the first matrix set through sequence expansion. For example, the second generation parameter may include, indicate, or determine the number of sequences used to construct the one-dimensional matrix of the second matrix set, the type of each one-dimensional sequence, sequence length and sequence generation method information, the expansion method of multiple sequence-generated matrices, correlation requirements or correlation thresholds, and other specific matrix set construction schemes. Optionally, the base station can obtain the first matrix set according to the same expansion method, such as after constructing the second matrix set, filtering the matrices in the second matrix set to obtain the first matrix set.

[0285] In some examples, the second generation parameter may include at least one of the following:

[0286] 1. Initial set of sequences The generation parameters or the initial set of sequences. The index. Wherein, the initial sequence set. The generation parameters include the initial set of sequences. Sequence type, sequence length N sf The initial set of sequences The codebook length S, etc.

[0287] 2. Codebook (i.e., the first matrix set) generation scheme. Codebook generation schemes include single-set generation (corresponding to method 1 above) and multiple-set generation (corresponding to method 2 above). If single-set generation is used, further instructions are required.

[0288] 3. Used for alternative codebook sets The index. Among them, the candidate codebook set. It is by The generated complete set A subset or the entirety of.

[0289] Assume that "index = 0" indicates the complete set "index = 1" indicates a subset of the complete set "index = 2" indicates a subset of the complete set When the codebook generation scheme is single-set generation, the alternative codebook set is the entire complete set generated by The base station can indicate that the alternative codebook set includes the entire complete set by "index = 0". For another example, when the codebook generation scheme is multiple-set generation, the alternative codebook set is at least two subsets of the complete set generated by The base station can indicate which subsets of the complete set the alternative codebook set includes by "index = 1" and / or "index = 2".

[0290] 4. The initialization setting value (or initial value) A1 of the first matrix set. Wherein, A1 is a matrix in the alternative codebook set

[0291] 5. The constraint condition (or screening condition). For example: the constraint condition based on the element value of the correlation matrix of any two matrices; the constraint condition based on the average value of the element value of the correlation matrix between any two matrices in the first matrix set; the constraint condition based on each type of norm (including 1-norm, 2-norm, and infinite norm) of the correlation matrix of any two matrices; the constraint condition based on the average value of each type of norm of the correlation matrix between any two matrices in the first matrix set, etc.

[0292] 6. The threshold value (such as the cross-correlation threshold value or the autocorrelation threshold value, etc.).

[0293] Optionally, when the codebook generation scheme is multiple-set (k' sets) generation, k' groups of initialization setting values, k' groups of constraint conditions, and k' groups of threshold values need to be issued. For example, the parameters issued for the i-th group of second matrix sets can include: { the i-th initialization setting value A i,1 , the i-th constraint condition, and the i-th group of threshold values.

[0294] Optionally, when the codebook generation scheme is multiple-set (k' sets) generation, the i-th initialization setting value A i,1 ​​​​whether to inherit the first matrix set

[0295] In this way, the first terminal can generate the first matrix set according to the second generation parameter

[0296] Optionally, when the base station needs to modify the generation mode of the first matrix set , the modification can be performed by modifying the aforementioned certain second generation parameter or modifying all second generation parameters.

[0297] In another exemplary way of configuring the first matrix set, the base station can send an 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.

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

[0299] For example, the third matrix or the configuration information of the third matrix can be carried in the configuration message of the grant-free transmission process. The grant-free transmission process may, for example, include the configuration grant, the random access or the semi-static scheduling transmission process. That is, the third matrix or the configuration information of the third matrix can be carried in the configuration message related to the configuration grant, the random access or the semi-static scheduling process, and the configuration message can be carried in the RRC message, the MAC CE or the DCI.

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

[0301] The manner in which the fourth matrix is sent can refer to the manner in which the third matrix is sent, and the manner in which the configuration information of the fourth matrix is sent can refer to the manner in which the configuration information of the third matrix is sent, which will not be repeated. The fourth matrix or the configuration information of the fourth matrix can be carried in the RRC message, the MAC CE or the DCI of the downlink. In addition, the fourth matrix or the configuration information of the fourth matrix can be carried in the configuration message of the scheduling-free.

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

[0303] The method shown in the present application can be used in the sending scenario of multiple data streams, wherein 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.

[0304] Scenario 1, taking the case that 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 through 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 hereinafter (for example, S201), and 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. In addition, the second data stream can also be a data stream of another terminal (for example, a second terminal).

[0305] 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 S202, the first terminal can perform precoding processing on the second data stream to obtain a third signal, and the third signal includes N elements. The third signal can refer to the description of the first signal. Further, referring to S203, the first terminal can spread the j-th element of the third signal by using the 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. Referring to S204, the first terminal can transmit the u-th element in the j-th group of fourth signals in the u-th time-frequency resource in the first time-frequency resource through the j-th antenna to realize the transmission of the second data stream.

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

[0307] 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. The first terminal can also obtain N second sequences according to the manner shown in FIG. 3, and 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. In addition, the second sequences correspond to the second time-frequency resource.

[0308] 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 S202, 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 S203, the first terminal can spread the jth element of the third signal with 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 S204, 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 with the jth antenna to realize the transmission of the second data stream.

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

[0310] 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. 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. The third data stream can be a data stream of the first terminal or other terminal.

[0311] In which, 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.

[0312] It can also be understood that the third matrix and the fifth 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 third matrix and the fifth matrix can have different dimensions.

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

[0314] The configuration manner of the third matrix is described below.

[0315] Case A, when the third matrix has small dimension and few elements, or the matrix element quantization overhead is small, the base station can directly issue the complete third matrix to the terminal (including the first terminal). For example, the base station can send the third matrix including N first sequences to the first terminal. For example, when N*N sf <=16, the quantization accuracy is not more than 4 bits, the third matrix can be issued in this form. For example, small dimension matrix composed of binary elements such as [1, 1, 1, 1; -1, -1, -1, -1] is suitable for issuing in this form.

[0316] Case B, when the first matrix set where the third matrix is located is agreed by the first terminal and the base station, the base station can indicate the index of the third matrix in the first matrix set to the first terminal. Assuming that the first matrix set is, for example:

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

[0318] Case C, when the third matrix or the first matrix set can be generated based on one-dimensional sequence structure, the base station can send the structured generation parameter to the first terminal, which can be used to generate the third matrix or the first matrix set.

[0319] The generation parameter is, for example, the first generation parameter and / or the second generation parameter in the present application, for example, including: the generation manner of the matrix, such as direct expansion, or tensor expansion; the number K n of one-dimensional sequences i , or the sequence generation parameter used to generate one-dimensional sequences.

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

[0321] 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, the third matrix C1 and the fourth matrix C2 correspond to data stream 1 and data stream 2 respectively, and the dimension of the third matrix C1 and the dimension of the fourth matrix C2 can be different. For example, the third matrix C1 is generated by direct expansion, and the fourth matrix C2 is generated by tensor expansion.

[0322] 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, the third matrix C1 and the fourth matrix C2 correspond to data stream 1 and data stream 2 respectively, and the dimension of the third matrix C1 and the dimension of the fourth matrix C2 can be different. For example, the third matrix C1 is generated by direct expansion, and the fourth matrix C2 is generated by tensor expansion.

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

[0324] In addition, from the perspective of a single sequence, the spreading sequence c i is used as the i1th row vector when constructing the third matrix C1, and the same spreading sequence c i is used as the i2th row vector when constructing C2, where i1≠i2. In addition, the spreading sequence c i may be expanded as a row vector when constructing the third matrix C1, and the same spreading sequence c i is used as a certain dimension vector of tensor expansion when constructing C2.

[0325] In this application, the base station can issue multiple matrices, where the multiple matrices can correspond to different data streams. For example, the third matrix and the fourth matrix in this application can correspond to different data streams, and for example, the third matrix and the fifth 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 this application, the matrix or the configuration information of the matrix can also be referred to as the configuration information of the data stream.

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

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

[0328] It can be understood that when there is repetition in the configuration information of multiple data streams, the configuration information of the data streams can also be sent in the form of multicast plus unicast. For example, the third matrix C1 and the fourth matrix C2 correspond to different data streams of the first terminal, and the third matrix C1 and the fourth matrix C2 are both obtained by tensor expansion, wherein the local sequences a1=a2 of the third matrix C1 and the fourth matrix C2 are the same. 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 third matrix and the fourth 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. The signaling carrying the sequence b1 is used to configure the sequence of the third matrix other than the common sequence to the first terminal, and the signaling carrying the sequence b2 is used to configure the sequence of the fourth matrix other than the common sequence to the first terminal.

[0329] Optionally, the third matrix includes N first sequences, and any first sequence corresponds to one antenna.

[0330] In a possible implementation of S102, the base station can realize the sending of the third matrix by sending N first sequences to the first terminal. Optionally, the base station can also receive at least one set of second signals; and the base station can also recover the first data stream according to the N first sequences.

[0331] In a possible implementation of the method in S103, the method for transmitting the first data stream according to the third matrix by the terminal includes: performing, by the first terminal, precoding processing on the first data stream to obtain a first signal; performing, by the first terminal, 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, and p is a positive integer; and transmitting, by the first terminal, a u-th element in the pth group of second signals through a pth antenna at a u-th time-frequency resource, 1≤u≤N. sf , N sf is the length of the first sequence.

[0332] The method is described below by way of example as shown in FIG. 4. The communication method can include the following steps:

[0333] S201: The first terminal obtains N first sequences, N is greater than 1, any first sequence corresponds to an antenna, and the N first sequences correspond to the first data stream.

[0334] In this application, the first sequence can be used for signal spread spectrum, and therefore can also be referred to as a spread spectrum sequence. Specifically, the spread spectrum sequence in this application can be used for row spread spectrum of a signal, which will be introduced below in combination with S203.

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

[0336] In a possible example, any first sequence is a sparse sequence, or 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.

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

[0338] In any of the above examples, the threshold can be 1 / 2 or other numerical values, which are not specifically limited in this application.

[0339] The N first sequences can correspond to N antennas one by one, and the N antennas can belong to one or more terminals, which is not specifically limited in the application. It can be understood that if the N antennas belong to one terminal, the terminal can be the first terminal in S201. That is, N=N t , N t represents the number of antennas of the first terminal.

[0340] In addition, in some cases, N t . For example, part of the N t antennas of the 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 terminal correspond to the same first sequence, for example, multiple antennas corresponding to the same port can correspond to the same first sequence.

[0341] If the N antennas belong to multiple terminals, the multiple terminals can include the first terminal in S201, and can further include one or more other terminals (such as a second terminal, etc.), and 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 antennas of the first terminal in the N antennas to the first terminal, for example, the base station can configure the index x and the index y of the antennas of the first terminal to 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.

[0342] In the 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 the terminal. The virtual antenna can be a logical antenna, such as an antenna port, which is formed by combining multiple physical antennas.

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

[0344] 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 sending 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.

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

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

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

[0348] As an example of precoding processing, the first terminal can perform precoding processing on the first data stream by sending a weight value. For example, the first data stream can be represented as s1, the sending weight value 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 a data stream. By default, all elements of the same data stream are operated in the same way, so the element subscript is ignored.

[0349] 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:

[0350] Wherein, f n,i represents the sending weight value 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 sending weight values. s n,i represents the i-th data stream of the n-th terminal. Wherein, a n,i The length can be P.

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

[0352] 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 that can include the transmission weight.

[0353] 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. That is, for example, a1 can include P elements. For example, for the case where each of the N antennas belongs to the first terminal, the first signal can include P=N elements. For another example, in the case where the N antennas belong to multiple terminals, P antennas of the N antennas belong to the first terminal, that is, P

[0354] In addition, P>N can also be satisfied. 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.

[0355] S203: 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.

[0356] In S203, 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, that is, the jth first sequence corresponds to the pth element of the first signal.

[0357] 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, that is, the 1st to Pth groups of second signals can be represented by a matrix composed of N sf row P column elements.

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

[0359] 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 row spread spectrum processed through the N first sequences respectively. In case 1, S203 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.

[0360] Case 2, P < N, P first sequences in the N first sequences can correspond to P elements of the first signal one by one. That is, P first sequences in the N first sequences can be used to perform row spreading on P elements of the first signal respectively. For example, in the case that the N antennas belong to multiple terminals, P antennas in the N antennas belong to the first terminal, and the first terminal only needs to use P first sequences in the N first sequences to perform row spreading on P elements of the first signal respectively.

[0361] Case 3, P > N, at least one first sequence in the N first sequences can correspond to at least two elements of the first signal, that is, the at least two elements can be subjected to row spreading using the same spreading sequence. It can be understood that when all elements of the first terminal use the same first sequence, it is the scheme shown in FIG. 2, and in the present application, at least two first sequences in all first sequences corresponding to P elements of the first terminal are different.

[0362] Taking P = N as an example, as an example of row spreading, N elements included in the first signal can be represented as a1(1) to a1(N) respectively, and the first group to the Nth group of second signals can be represented as B1, which satisfies:

[0363] Wherein, c1……c N N first sequences are represented as a1(1) to a1(N) respectively, represents the transpose matrix of the jth first sequence, represents the jth group of second signals. diag() represents a diagonal matrix. C1 represents a matrix composed of N first sequences. is the transpose matrix of C1.

[0364] Optionally, That is, the jth column element of the matrix can be used as the jth first sequence. In addition, if The jth row element of the matrix can be used as the jth first sequence, and correspondingly, C1 in formula 2 can be replaced by C1.

[0365] It can be understood that if the N antennas all belong to the first terminal n, the N elements included in the first signal can be represented as a1(1) to a1(N) respectively, and the first group to the Nth group of second signals of the first terminal n can be represented as b1(1) to b1(N) respectively, which satisfies: n,i n,i n,i n,i

[0366] Wherein, N first sequences are represented as a1(1) to a1(N) respectively, represents the transpose matrix of the jth first sequence, ​​​​​denotes the j-th second signal of the j-th group. n,i denotes a matrix consisting of N first sequences. denotes the transpose matrix of C n,i .

[0367] Formula 3 can be understood as a variant of formula 2.

[0368] 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 n,i in formula 2 can be replaced by C sf .

[0369] S204: The first terminal transmits the u-th element in the j-th second signal through the p-th antenna at the u-th time-frequency resource, 1≤u≤N sf , N sf is the length of the first sequence.

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

[0371] In addition, the N sf time-frequency resources on which the N first sequences act are a 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.

[0372] The time-frequency resource here can be an RE. For example, the u-th time-frequency resource can be one of the N sf REs.

[0373] Based on S204, the first terminal can respectively send the 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≤k≤N sf time-frequency resources through the 1≤j≤N antennas, where the symbol sent on the k-th resource of the j-th antenna is the b1(j, k) element in the first row and the k-th column of B1.

[0374] In addition, if the N antennas in S201 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 first group to the N-th group of second signals through the N antennas.

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

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

[0377] Based on the flow shown in FIG. 4, 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 . Taking obtaining the second signal according to formula 3 as an example, the signal processing process can be referred to FIG. 5. Optionally, when 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.

[0378] It can be understood that the first terminal in the present application can indicate to the base station that the first terminal supports 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 third 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 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 S203, or the capability information can be used to indicate that the first terminal supports the flow shown in FIG. 4, or the capability information can be used to indicate that the first terminal supports NOMA spreading. Or in other words, the capability information can be used to indicate that the first terminal supports performing precoding processing on the data stream before spreading processing. It can also be understood that the first terminal can also indicate that the first terminal supports the method shown in the present application through other uplink signaling or messages other than the capability information.

[0379] After the second signal is processed by formula 3 and transmitted based on S204, the received signal can be represented as Y, wherein Y satisfies: Y=H1B1+W;

[0380] Wherein H1 represents the antenna channel of the first terminal, W represents noise. B1 represents the first group to the Nth group of the first terminal second signal, which can be referred to formula 2.

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

[0382] 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. C n,i is the transpose matrix of C.

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

[0384] Wherein represents Khatri-Rao product.

[0385] According to formula 4, 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:

[0386] Wherein, Hadamard product of matrices, i.e., point multiplication of corresponding elements of two matrices.

[0387] According to ρ n1,n2 The expression of (i1, i2) can be realized ρ Or When (i, j) = 0, ρ n,k I is an N*N unit matrix. μ is a constant value. Therefore, the sequence condition of making two data streams orthogonal is extended, and the orthogonal data stream can be realized not only by using orthogonal spreading sequences for two data streams respectively, but also by expanding the MIMO-CD-NOMA system capacity.

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

[0389] Based on the same technical concept, an embodiment of the present application provides a communication device, which comprises a module or unit or means corresponding to the method steps in the above method embodiments. The functions or units or means can be implemented by software or by hardware, or by corresponding software executed by hardware.

[0390] For example, referring to FIG. 6, the device 600 can comprise a processing module 601 and a transceiver module 602.

[0391] Optionally, the transceiver module 602 can comprise a sending module and / or a receiving module. The sending module is configured to perform the sending operation in the above method embodiments. The receiving module is configured to perform the receiving operation in the above method embodiments.

[0392] It should be noted that the communication device 600 can comprise a sending module and not comprise a receiving module. Alternatively, the communication device 600 can comprise a receiving module and not comprise a sending module. Whether the communication device 600 comprises a sending module and a receiving module or not can depend on whether the above scheme executed by the communication device 600 comprises a sending action and a receiving action.

[0393] The processing module 601 is configured to perform data processing. The transceiver module 602 can implement corresponding communication functions.

[0394] Optionally, the communication apparatus 600 further includes a storage module, which can be configured to store instructions and / or data. The processing module 601 can read the instructions and / or data in the storage module, so that the communication apparatus 600 implements the foregoing method embodiments.

[0395] For example, the communication apparatus 600 can be a first communication apparatus or a component configurable to the first communication apparatus. The first communication apparatus is, for example, a component in a first terminal or a base station. The processing module 601 is configured to perform processing-related operations of the first terminal or the base station in the foregoing method embodiments, for example, at least one of S101 or S103. The transceiver module 602 is configured to perform transmitting and / or receiving-related operations of the first terminal or the base station in the foregoing method embodiments, for example, S102.

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

[0397] It should be understood that all related contents of the steps in the foregoing method embodiments can be cited to the function description of the corresponding functional modules, which will not be repeated here.

[0398] The processing module 601 in the foregoing embodiments can be implemented by at least one processor or processor-related circuit. The transceiver module 602 can be implemented by a transceiver or transceiver-related circuit. The transceiver module 602 can also be referred to as a communication module or a communication interface.

[0399] Another structural schematic diagram of the communication apparatus in the embodiments of the present application is shown below. As shown in FIG. 7, the embodiments of the present application further provide a communication apparatus 700, which includes:

[0400] at least one processor 701, and a communication interface 703 connected with the at least one processor 701; the at least one processor 701 executes instructions stored in a memory 702, so that the apparatus performs the method steps in the foregoing method embodiments through the communication interface 703.

[0401] Optionally, the memory 702 is located outside the apparatus 700.

[0402] Optionally, the apparatus 700 includes the memory 702, the memory 702 is connected with the at least one processor 701, and the memory 702 stores instructions executable by the at least one processor 701. As shown in FIG. 7, the memory 702 is optional for the apparatus 700, which is indicated by a dashed line.

[0403] The processor 701 and the memory 702 can be coupled through an interface circuit or integrated together, which is not limited here.

[0404] The specific connection medium between the processor 701, the memory 702 and the communication interface 703 is not limited in the embodiments of the present application. In FIG. 7, the processor 701, the memory 702 and the communication interface 703 are connected through a bus 704, which is represented by a thick 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 thick line is used in FIG. 7, but it does not mean that there is only one bus or only one type of bus.

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

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

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

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

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

[0410] It should be understood that the memory mentioned 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 but 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 synchronous dynamic random access memory (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM) and direct rambus RAM (DR RAM).

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

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

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

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

[0415] Based on the same technical concept, the embodiments of the present application further provide a communication system, which can include a first communication device (e.g., a first terminal) and a second communication device (e.g., 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, etc.

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

[0417] 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 processor of 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.

[0418] These computer program instructions can also be stored in a computer readable memory 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 memory produce a manufactured 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.

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

[0420] In various embodiments of the present application, the terms and / or descriptions among 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.

[0421] 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 it are in an "or" relationship; in the formula of the present application, the character " / ", indicates that the associated objects before and after it 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.

[0422] 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 a first matrix set, the first matrix set comprising a first matrix and a second matrix; wherein the first matrix comprises at least two columns of identical elements, and the second matrix does not comprise two columns of identical elements; or the first matrix comprises at least two rows of identical elements, and the second matrix does not comprise two rows of identical elements; sending, to a terminal, configuration information of a third matrix, the configuration information of the third matrix being used to configure a third matrix in the first matrix set, and the third matrix being used by the terminal to send a first data stream.

2. The method of claim 1, wherein, The second matrix comprises a column-orthogonal matrix or a row-orthogonal matrix.

3. The method of claim 1 or 2, wherein, The first matrix comprises a matrix with all columns identical or a matrix with all rows identical.

4. The method of any one of claims 1-3, wherein, The first matrix set satisfies a correlation requirement, and the correlation requirement comprises: The correlation between any two matrices in the first matrix set is less than or equal to a cross-correlation threshold.

5. The method of claim 4, wherein, The correlation between any two matrices in the first matrix set is less than or equal to a cross-correlation threshold, which comprises at least one of the following: An element value of a correlation matrix of the any two matrices is less than or equal to a first threshold. An average of element values of correlation matrices between any two matrices in the first matrix set is less than or equal to a first threshold. A two-norm of a correlation matrix of the any two matrices is less than or equal to a second threshold; or An average of two-norms of correlation matrices between any two matrices in the first matrix set is less than or equal to a second threshold.

6. The method of claim 4 or 5, wherein, The method further comprises: determining, from a second matrix set, a matrix satisfying the correlation requirement as a matrix in the first matrix set.

7. The method of claim 6, wherein, Any matrix in the second set of matrices includes N one-dimensional sequences from a set of M one-dimensional sequences, the number of matrices in the second set of matrices being M N .

8. The method of any one of claims 1-7, wherein, The configuration information comprises an index of the third matrix in the first matrix set, and the configuration information further comprises a second generation parameter used to generate the first matrix set; or The configuration information further comprises an index of the first matrix set.

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

10. The method of claim 9, wherein, The generation manner of the first matrix set comprises: determining, from a second matrix set, a matrix satisfying a correlation requirement as a matrix in the first matrix set.

11. The method of claim 10, wherein, The configuration information further comprises at least one of the following: a generation manner of the second matrix set; information of the second matrix set; and / or information of the correlation requirement.

12. The method of any one of claims 1-11, wherein, The third matrix comprises N first sequences, and any first sequence corresponds to one antenna, and the method further comprises: receive at least one set of second signals, a pth set of 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 set of second signals being transmitted through 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; recovering the first data stream according to the N first sequences.

13. The method of any one of claims 1-12, wherein, The third matrix comprises N first sequences, and 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.

14. A communication method, comprising: The method comprises: receiving configuration information of a third matrix, the configuration information of the third matrix being used to configure a third matrix in a first matrix set; the first matrix set comprising a first matrix and a second matrix; wherein the first matrix comprises at least two columns of identical elements, and the second matrix does not comprise two columns of identical elements; or the first matrix comprises at least two rows of identical elements, and the second matrix does not comprise two rows of identical elements; The third matrix is used for sending the first data stream.

15. The method of claim 14, wherein, The second matrix includes a column-orthogonal matrix or a row-orthogonal matrix.

16. The method of claim 14 or 15, wherein, The first matrix includes a matrix with all columns being the same or a matrix with all rows being the same.

17. The method of any one of claims 14-16, wherein, The first matrix set satisfies a correlation requirement, and the correlation requirement includes at least one of the following: The correlation between any two matrices in the first matrix set is less than or equal to a cross-correlation threshold.

18. The method of claim 17, wherein, The correlation between any two matrices in the first matrix set is less than or equal to a cross-correlation threshold, including at least one of the following: An element value of a correlation matrix of the any two matrices is less than or equal to a first threshold value; An average value of element values of a correlation matrix between any two matrices in the first matrix set is less than or equal to a first threshold value; A two-norm of a correlation matrix of the any two matrices is less than or equal to a second threshold value; or An average value of two-norms of a correlation matrix between any two matrices in the first matrix set is less than or equal to a second threshold value.

19. The method of any one of claims 14-18, wherein, The configuration information includes an index of the third matrix in the first matrix set, and the configuration information further includes second generation parameters used for generating the first matrix set; or The configuration information further includes an index of the first matrix set.

20. The method of claim 19, wherein, The second generation parameters further indicate a generation manner of the first matrix set.

21. The method of claim 20, wherein, The generation manner of the first matrix set includes determining a matrix satisfying a correlation requirement from a second matrix set as a matrix in the first matrix set.

22. The method of claim 21, wherein, The configuration information further includes at least one of the following: A generation manner of the second matrix set; Information of the second matrix set; and / or Information of the correlation requirement.

23. The method of any one of claims 14-22, wherein, The third matrix includes N first sequences, and any first sequence corresponds to one antenna. The third matrix includes N first sequences, and 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. 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 the length of the first sequence.

24. The method of any one of claims 14-23, wherein, The processing module and the transceiver module are included. The transceiver module is configured to obtain a first matrix set through the processing module, and the first matrix set includes a first matrix and a second matrix.

25. A communications device, characterized by The transceiver module is further configured to send configuration information of a third matrix to a terminal. The second matrix includes a column-orthogonal matrix or a row-orthogonal matrix. The first matrix includes a matrix with all columns being the same or a matrix with all rows being the same.

26. The apparatus of claim 25, wherein, The first matrix set satisfies a correlation requirement, and the correlation requirement includes at least one of the following:

27. The apparatus of claim 25 or 26, wherein, ​ 28. The apparatus of any one of claims 25-27, wherein, ​ The correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold.

29. The apparatus of claim 28, wherein, The correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold, including at least one of the following: The element value of the correlation matrix of the any two matrices is less than or equal to a first threshold value; The average of the element values of the correlation matrix between the matrices in the first matrix set is less than or equal to a first threshold value; The two-norm of the correlation matrix of the any two matrices is less than or equal to a second threshold value; or The average of the two-norm of the correlation matrix between the matrices in the first matrix set is less than or equal to a second threshold value.

30. The apparatus of claim 28 or 29, wherein, The processing module is specifically configured to: Determine a matrix satisfying the correlation requirement from a second matrix set as a matrix in the first matrix set.

31. The apparatus of claim 30, wherein, Any matrix in the second set of matrices includes N one-dimensional sequences from a set of M one-dimensional sequences, the number of matrices in the second set of matrices being M N .

32. The apparatus of any one of claims 25-31, wherein, The configuration information includes an index of the third matrix in the first matrix set, and 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.

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

34. The apparatus of claim 33, wherein, The generation manner of the first matrix set includes: determining a matrix satisfying a correlation requirement from a second matrix set as a matrix in the first matrix set.

35. The apparatus of claim 34, wherein, The configuration information further includes at least one of the following: A generation manner of the second matrix set; Information of the second matrix set; and / or Information of the correlation requirement.

36. The apparatus of any one of claims 25-35, wherein, The third matrix includes N first sequences, and any first sequence corresponds to one antenna; The transceiving module is further configured to receive at least one group of second signals, the pth group of second signals being obtained by performing spread spectrum processing on the pth element of the first signal according to the jth first sequence, and the u element in the pth group of second signals being transmitted by the pth antenna at the u time-frequency resource, the first signal being obtained by performing precoding processing on the first data stream, 1≤j≤N, p is a positive integer, and 1≤u≤N sf , N sf is the length of the first sequence; The processing module is further configured to recover the first data stream according to the N first sequences.

37. The apparatus of any one of claims 25-36, wherein, The third matrix includes N first sequences, and 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.

38. A communications device, characterized by The apparatus includes a processing module and a transceiver module. The processing module is configured to receive configuration information of a third matrix, the configuration information of the third matrix being used for configuring a third matrix in a first matrix set; the first matrix set includes a first matrix and a second matrix; wherein the first matrix includes at least two columns of same elements, and the second matrix does not include two columns of same elements; or the first matrix includes at least two rows of same elements, and the second matrix does not include two rows of same elements. The transceiver module is configured to transmit a first data stream according to the third matrix.

39. The apparatus of claim 38, wherein, The second matrix includes a column-orthogonal matrix or a row-orthogonal matrix.

40. The apparatus of claim 38 or 39, wherein, The first matrix includes a matrix with all columns being same or a matrix with all rows being same.

41. The apparatus of any one of claims 38-40, wherein, The first matrix set satisfies a correlation requirement, and the correlation requirement includes: The correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold.

42. The apparatus of claim 41, wherein, The correlation between any two matrices in the first matrix set is not more than a cross-correlation threshold, including at least one of the following: The element value of the correlation matrix of the any two matrices is less than or equal to a first threshold value; An average of element values of a correlation matrix between any two matrices in the first matrix set is less than or equal to a first threshold value; A two-norm of a correlation matrix of the any two matrices is less than or equal to a second threshold value; or An average of two-norms of correlation matrices between any two matrices in the first matrix set is less than or equal to a second threshold value.

43. The apparatus of any one of claims 38-42, wherein, The configuration information comprises an index of the third matrix in the first matrix set, and the configuration information further comprises a second generation parameter used for generating the first matrix set; or The configuration information further comprises an index of the first matrix set.

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

45. The apparatus of claim 44, wherein, The generation manner of the first matrix set comprises: determining a matrix satisfying a correlation requirement from a second matrix set as a matrix in the first matrix set.

46. The apparatus of claim 45, wherein, The configuration information further comprises at least one of: A generation manner of the second matrix set; Information of the second matrix set; and / or Information of the correlation requirement.

47. The apparatus of any one of claims 38-46, wherein, The third matrix comprises N first sequences, and any first sequence corresponds to one antenna. The processing module is specifically configured to: perform precoding processing on the first data stream to obtain a first signal; 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 the length of the first sequence.

48. The apparatus of any one of claims 38-47, wherein, perform 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, and p is a positive integer; and The third matrix comprises N first sequences, and the N first sequences correspond to N antennas one by one.

49. A communications device, characterized by The N antennas belong to one terminal, or the N antennas belong to multiple terminals.

50. A computer-readable storage medium, characterized in that, The processing module is specifically configured to:

51. A computer program product, characterised in that, The storage medium stores a computer program or instructions, and when the computer program or instructions are executed by a communication device, a method as claimed in any one of claims 1-13 is implemented, or a method as claimed in any one of claims 14-24 is implemented.

52. A chip system, characterized by When a computer program product is executed by a computer, the computer receives the method as claimed in any one of claims 1-13, or the method as claimed in any one of claims 14-24. The logic circuit is configured to execute a computer executable program, so that a device installed with the chip system is configured to execute the method as claimed in any one of claims 1-13, or execute the method as claimed in any one of claims 14-24.

53. A communication system, characterized by The first communication device is configured to execute the method as claimed in any one of claims 1-13, and the second communication device is configured to execute the method as claimed in any one of claims 14-24. ​

Images