A method and apparatus for wireless communication

Abstract

A method and device for wireless communication, the method comprising: first precoding a first data stream by using a first precoding to obtain a precoded data stream, the first precoding being obtained according to a first preset precoding sequence with a length of N, or the first precoding being obtained according to a first preset precoding matrix with a size of P×Q, P and Q are both integers greater than 0 and the product of P and Q is equal to N, N is an integer greater than 0; and then transmitting the precoded data stream by using N antennas. The method can simplify a communication device for implementing omni-directional precoding on the basis of implementing omni-directional precoding.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a method and apparatus for wireless communication. Background Technology

[0002] In wireless communication systems, such as fourth-generation (4G) and fifth-generation (5G) wireless communication systems—new radio access technology (NR) systems—massive multiple-input multiple-output (Massive MIMO) technology significantly improves the system's spectral efficiency and energy efficiency by deploying large-scale antenna arrays (tens or even hundreds of antennas) at the base station to simultaneously serve multiple users within the cell. During data transmission, Massive MIMO technology can provide high-quality service to specific users through directional beamforming. However, for the transmission of public signals (such as signaling broadcasts and digital video broadcasts), coverage of the entire cell is required. Furthermore, to reduce configuration costs and improve the overall gain of Massive MIMO, multiple low-power antennas need to be used simultaneously to transmit broadcast information.

[0003] Furthermore, in MIMO communication, to compensate for channel transmission problems and reduce the bit error rate, it is usually necessary to preprocess the signals or data streams transmitted by the transmitter before transmission, or to preprocess the signals or data streams received by the receiver before use. Specifically, in the transmitter, the data stream to be transmitted can first be space-time encoded to form multiple information substreams. Then, these multiple information substreams are subjected to omnidirectional precoding to obtain multiple data substreams. Finally, these multiple data substreams are transmitted from multiple antennas. In the receiver, multiple antennas can be used to receive these multiple data substreams. Then, the received multiple data substreams are decoded, and space-time encoding is used to separate the multiple data substreams to achieve optimal processing. However, in transmitters or receivers, the more columns of the coding sequence used in the omnidirectional precoding of a Uniform Linear Array (ULA) or the more columns of the coding matrix used in the omnidirectional precoding of a Uniform Rectangular Array (ULA), the greater the required order of space-time coding, which makes the designed transmitter or receiver structure more complex.

[0004] Therefore, there is an urgent need to propose a wireless communication method that can simplify the implementation of omnidirectional precoding communication devices. Summary of the Invention

[0005] A method and apparatus for wireless communication that simplifies the implementation of omnidirectional precoding communication devices.

[0006] In a first aspect, this application provides a method for wireless communication, which is specifically applicable to a first communication device and / or a first product. Optionally, the first communication device and / or product may be a device and / or product with a transmitting function.

[0007] For example, the first communication device may include, but is not limited to, wireless access point (AP) type communication devices and station (STA) type communication devices such as communication servers, routers, switches, bridges, computers, and mobile phones. Specifically, the communication device may include a transceiver and a processor; optionally, the communication device may also include a pre-coder and a memory.

[0008] Therefore, the wireless communication method provided in this application can be executed by the processor of the first communication device and / or the first product, or by the chip corresponding to the processor, without limitation. Specifically, it includes the following steps: precoding a first data stream using a first precoding method to obtain a precoded data stream; wherein the first precoding is obtained based on a preset first precoding sequence of length N, or the first precoding is obtained based on a preset first precoding matrix of size P×Q, where P and Q are both integers greater than 0 and the product of P and Q equals N, where N is an integer greater than 0; and transmitting the precoded data stream using N antennas.

[0009] In this implementation, the transmitting side can use the first precoding to precode the first data stream to be transmitted, obtaining the encoded data stream, and then use N antennas to transmit the precoded data, where N is an integer greater than 0. Specifically, the design of the first precoding includes: in the scenario of omnidirectional precoding of a Uniform Linear Array (ULA), the first precoding can be configured according to a first coding sequence of length N; in the scenario of omnidirectional precoding of a Uniform Rectangular Array (ULA), the first precoding can be configured according to a first precoding matrix of size P×Q. Therefore, in the design of this application, the first precoding can be directly used to precode the data stream to be transmitted before transmission via antennas. Thus, the design of this application not only realizes omnidirectional precoding of ULA and URA, but also simplifies the structure of the communication device.

[0010] In one possible implementation, the first precoding matrix is ​​the one with the largest energy ratio among a plurality of precoding matrices of size P×Q.

[0011] This implementation method selects the precoding matrix with the largest energy ratio from multiple precoding matrices of size P×Q as the first precoding matrix, thereby maximizing the stability of the data stream processed by the first precoding matrix transmitted through N antennas.

[0012] In one possible implementation, the precoding matrix of size P×Q satisfies the following formula:

[0013]

[0014] Where H' is a precoding matrix of size P×Q. For H P The transpose matrix, H P For a precoded sequence of length P, H Q P represents a precoded sequence of length Q, where the product of P and Q equals the number of antennas, and both P and Q are positive integers greater than 0.

[0015] This implementation method can obtain multiple candidate precoding matrices, and then determine a suitable first precoding matrix from these multiple candidate precoding matrices, thereby ensuring that the first precoding obtained from the first precoding matrix is ​​optimal.

[0016] In one possible implementation, the energy ratio of the P×Q precoding matrix satisfies the following formula:

[0017]

[0018] Where H' is a precoding matrix of size P×Q. Let H' be the squared norm of matrix H'. p,q is the value in the precoding matrix H' located at row p and column q.

[0019] The energy ratio of each precoding matrix can be accurately and effectively obtained using the formula in this implementation. Then, based on the energy ratio of each precoding matrix, a suitable precoding matrix can be selected to ensure that the first precoding obtained is optimal.

[0020] In one possible implementation, the first precoding sequence is the one with the largest energy ratio among a plurality of precoding sequences of length N.

[0021] This implementation method selects the precoding matrix with the largest energy ratio from multiple precoding sequences of length N as the first precoding matrix, thereby maximizing the stability of the data stream processed by the first precoding and transmitted through N antennas.

[0022] In one possible implementation, each precoded sequence of length N is obtained based on the characteristic polynomial of the precoded sequence of length N. Through this implementation, multiple precoded sequences of length N can be efficiently obtained using the characteristic polynomial of the precoded sequence of length N.

[0023] In one possible implementation, the characteristic polynomial of the precoded sequence of length N satisfies the following formula:

[0024]

[0025] in, Indicates the root radius. Let represent the (N-1)th power root of unity, b be an element in set B, c be an element in set C, set B be a subset of set A, set C be the complement of set B, set A = {0, 1, ..., N-2}, N represent the sequence length, e be the euler's number, i be the imaginary unit, and K be a non-zero constant used to normalize the precoded sequence of length N. Through this implementation, the formula specifically satisfied by the characteristic polynomial of the precoded sequence of length N can be obtained, and by referring to this formula, multiple precoded sequences of length N can be effectively obtained.

[0026] In one possible implementation, the energy ratio of the precoded sequence of length N satisfies the following formula:

[0027]

[0028] Where H represents a precoded sequence of length N, H = [H0, H1, ..., H...] N-1 ], k∈(0,1,…,N-1), where N represents the number of antennas.

[0029] This implementation method can accurately and effectively obtain the energy ratio of each precoding sequence, and then select a suitable precoding sequence based on the energy ratio of each precoding sequence to ensure that the first precoding obtained is optimal.

[0030] In one possible implementation, when P×Q=4×8, the first precoding matrix satisfies the following formula:

[0031]

[0032] in, H4 is the transpose of H4, where H4 is the first precoding sequence of length 4 and H8 is the first precoding sequence of length 8.

[0033] In this implementation method, when the size of the first precoding matrix is ​​4×8, that is, the number of antennas is 32, a specific first precoding matrix is ​​determined, which can realize the optimal omnidirectional precoding of URA.

[0034] In one possible implementation, when P×Q=4×16, the first precoding matrix satisfies the following formula:

[0035]

[0036] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 16 It is the first precoded sequence with a length of 16.

[0037] In this implementation method, when the size of the first precoding matrix is ​​4×16, that is, the number of antennas is 64, a specific first precoding matrix is ​​determined, which can realize the optimal omnidirectional precoding of URA.

[0038] In one possible implementation, when P×Q=8×16, the first precoding matrix satisfies the following formula:

[0039]

[0040] in, Let H be the transpose of H8, where H8 is the first precoding sequence of length 8. 16 It is the first precoded sequence with a length of 16.

[0041] With this implementation method, when the size of the first precoding matrix is ​​8×16, that is, the number of antennas is 128, a specific first precoding matrix is ​​determined, which can realize the optimal omnidirectional precoding of URA.

[0042] In one possible implementation, when N is 4, the first precoding sequence is either a first sequence or the first precoding sequence is the conjugate inversion of the first sequence;

[0043] The first sequence satisfies the following sequence:

[0044] A*[0.802926,-0.363904+0.630299i,-0.564463-0.977678i,-1.24545+9.06431E-16i];

[0045] Where A is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0046] In this implementation, when the length of the first precoding sequence is 4 (i.e., the number of antennas is 4), a specific first sequence is determined and used as the first precoding sequence. Since the conjugate inversion of the first sequence does not affect the properties of the sequence, the conjugate inversion of the first sequence can also be used as the first precoding sequence, thereby enabling the first precoding sequence to achieve optimal omnidirectional precoding of ULA.

[0047] In one possible implementation, when N is 8, the first precoding sequence is the second sequence or the first precoding sequence is the conjugate inversion of the second sequence;

[0048] The second sequence satisfies the following sequence:

[0049] B*[0.862959, -0.608268+0.40355i, 0.671941+0.240793i, -1.39612+0.224078i, -0.17 0289-0.602021i, 0.57998-1.08727i, -0.816799-0.541898i, -1.1588+1.73594E-15i];

[0050] Where B is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0051] In this implementation, when the length of the first precoding sequence is 8 (i.e., the number of antennas is 8), a specific second sequence is determined and used as the first precoding sequence. Since the conjugate inversion of the second sequence does not affect the properties of the sequence, the conjugate inversion of the second sequence can also be used as the first precoding sequence, thereby enabling the first precoding sequence to achieve optimal omnidirectional precoding of ULA.

[0052] In one possible implementation, when N is 16, the first precoding sequence is either the third sequence or the first precoding sequence is the conjugate inversion of the third sequence;

[0053] The third sequence satisfies the following sequence: C*[0.911842,0.744996-0.113883i,-0.0654774-0.179596i,-0.651775-0.944747i,-0.670119-0.19198i,0.186435+1.22397i,-0.719419+1.06779i,-1.00355+0.447137i,-0.473356-0.874311] i,-1.18884+0.383784i,0.307512+0.407312i,0.0889852-1.31655i,-0.0450766+1.07512i,-0.793708-0.00780988i,0.896014+0.136968i,-1.09668+8.36758E-16i];where C is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0054] In this implementation, when the length of the first precoding sequence is 16, i.e., the number of antennas is 16, a specific third sequence is determined and used as the first precoding sequence. Since the conjugate inversion of the third sequence does not affect the properties of the sequence, the conjugate inversion of the third sequence can also be used as the first precoding sequence, thereby enabling the first precoding sequence to achieve optimal omnidirectional precoding of ULA.

[0055] Secondly, this application provides a communication device that can be applied to the first communication device and / or the first product mentioned in the first aspect above. The first communication device and / or the first product may include: a transceiver module and a processing module.

[0056] Optionally, the communication device may also include a separate precoding module and a storage module. The precoding module may also be located in the transceiver, and this application does not limit this.

[0057] The processing module is used to precode the first data stream using a first precoder to obtain a precoded data stream; wherein the first precoder is obtained based on a first precoder sequence of a preset length N, or the first precoder is obtained based on a first precoder matrix of a preset size P×Q, where P and Q are both integers greater than 0 and the product of P and Q is equal to N, where N is an integer greater than 0; the transceiver module is used to transmit the precoded data stream using N antennas.

[0058] It should be noted that in this design, the precoding module can also be used to perform precoding processing on the data stream, and the storage module can be used to store data and / or instructions, etc.

[0059] In one possible design, the first precoding matrix is ​​the one with the largest energy ratio among multiple precoding matrices of size P×Q.

[0060] In one possible design, the precoding matrix of size P×Q satisfies the following formula:

[0061]

[0062] Where H' is a precoding matrix of size P×Q. For H P The transpose matrix, H P For a precoded sequence of length P, H Q P represents a precoded sequence of length Q, where the product of P and Q equals the number of antennas, and both P and Q are positive integers greater than 0.

[0063] In one possible design, the energy ratio of the P×Q precoding matrix satisfies the following formula:

[0064]

[0065] Where H' is a precoding matrix of size P×Q. Let H' be the squared norm of matrix H'. p,q is the value in the precoding matrix H' located at row p and column q.

[0066] In one possible design, the first precoding sequence is the one with the largest energy ratio among multiple precoding sequences of length N.

[0067] In one possible design, each of the precoded sequences of length N is obtained based on the characteristic polynomial of the precoded sequence of length N.

[0068] In one possible design, the characteristic polynomial of the precoded sequence of length N satisfies the following formula:

[0069]

[0070] in, Indicates the root radius. Let b be an element of set B, c be an element of set C, B be a subset of set A, and C be the complement of set B. Set A = {0, 1, ..., N-2}, N be the sequence length, e be the euler's number, i be the imaginary unit, and K be a non-zero constant used to normalize the precoded sequence of length N.

[0071] In one possible design, the energy ratio of the precoded sequence of length N satisfies the following formula:

[0072]

[0073] Where H represents a precoded sequence of length N, H = [H0, H1, ..., H...] N-1 ], k∈(0,1,…,N-1), where N represents the number of antennas.

[0074] In one possible design, when P×Q=4×8, the first precoding matrix satisfies the following formula:

[0075]

[0076] in, H4 is the transpose of H4, where H4 is the first precoding sequence of length 4 and H8 is the first precoding sequence of length 8.

[0077] In one possible design, when P×Q=4×16, the first precoding matrix satisfies the following formula:

[0078]

[0079] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 16 It is the first precoded sequence with a length of 16.

[0080] In one possible design, when P×Q=8×16, the first precoding matrix satisfies the following formula:

[0081]

[0082] in, Let H be the transpose of H8, where H8 is the first precoding sequence of length 8. 16 It is the first precoded sequence with a length of 16.

[0083] In one possible design, when N is 4, the first precoding sequence is either the first sequence or the first precoding sequence is the conjugate inversion of the first sequence;

[0084] The first sequence satisfies the following sequence:

[0085] A*[0.802926,-0.363904+0.630299i,-0.564463-0.977678i,-1.24545+9.06431E-16i];

[0086] Where A is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0087] In one possible design, when N is 8, the first precoding sequence is the second sequence or the first precoding sequence is the conjugate inversion of the second sequence;

[0088] The second sequence satisfies the following sequence:

[0089] B*[0.862959, -0.608268+0.40355i, 0.671941+0.240793i, -1.39612+0.224078i, -0.17 0289-0.602021i, 0.57998-1.08727i, -0.816799-0.541898i, -1.1588+1.73594E-15i];

[0090] Where B is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0091] In one possible design, when N is 16, the first precoding sequence is either the third sequence or the first precoding sequence is the conjugate inversion of the third sequence;

[0092] The third sequence satisfies the following sequence:

[0093] C*[0.911842,0.744996-0.113883i,-0.0654774-0.179596i,-0.651775-0.944747i,-0.67 0119-0.19198i,0.186435+1.22397i,-0.719419+1.06779i,-1.00355+0.447137i,-0.4733 56-0.874311i,-1.18884+0.383784i,0.307512+0.407312i,0.0889852-1.31655i,-0.0450 766+1.07512i,-0.793708-0.00780988i,0.896014+0.136968i,-1.09668+8.36758E-16i];

[0094] Where C is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0095] Thirdly, this application also provides a communication device that can be applied to the first communication device and / or the first product mentioned in the first aspect above. The communication device includes a transceiver, a processor, a memory, and one or more programs. Optionally, the communication device may also include an independent pre-coder, or the pre-coder may be located in the transceiver. This application does not limit this.

[0096] The one or more programs are stored in the memory, and the one or more programs include instructions that, when executed by the processor, cause the communication device to perform the function of the method in the first aspect or any possible implementation of the first aspect.

[0097] Fourthly, embodiments of this application also provide a computer storage medium storing a software program that, when read and executed by one or more processors, can implement the methods provided in the first aspect or any of the possible implementations described above.

[0098] Fifthly, embodiments of this application also provide a computer program product including a computer program, which, when run on a computer, causes the method provided in the first aspect or any of the possible implementations therein to be executed.

[0099] Sixthly, embodiments of this application also provide a chip system including a processor for supporting clients in implementing the functions involved in the first aspect above.

[0100] In one possible design, the chip system further includes a memory for storing necessary program instructions and data to be executed by the loading device. The chip system may consist of chips or may include chips and other discrete components.

[0101] The technical effects that can be achieved by the second aspect or any possible implementation of the second aspect can be described with reference to the technical effects that can be achieved by the first aspect or any possible implementation of the first aspect, and will not be repeated here. Attached Figure Description

[0102] Figure 1 This is a schematic diagram illustrating an application scenario to which a wireless communication method provided in this application embodiment is applicable;

[0103] Figure 2 This is a structural diagram illustrating a specific process for transmitting data using a transmitter, as provided in an embodiment of this application.

[0104] Figure 3 This is a schematic diagram of an embodiment of a wireless communication method provided in this application.

[0105] Figure 4 This is a schematic diagram of a wireless communication method provided in an embodiment of this application;

[0106] Figure 5A This is a flowchart of a method for generating a first precode provided in an embodiment of this application;

[0107] Figure 5B This is a flowchart of another method for generating a first precode provided in the embodiments of this application;

[0108] Figure 6 This is a schematic diagram of the structure of a wireless communication device provided in an embodiment of this application;

[0109] Figure 7 This is a schematic diagram of the structure of a wireless communication device provided in an embodiment of this application. Detailed Implementation

[0110] This application provides a method and apparatus for wireless communication. The method and apparatus are based on the same or similar technical concepts. Since the methods and apparatus solve problems in similar principles, the implementation of the apparatus and the method can refer to each other, and repeated parts will not be described again.

[0111] The following section will first explain some of the terms used in the embodiments of this application so that those skilled in the art can understand them.

[0112] 1) Antenna

[0113] The antenna described in this application is a transducer that can convert guided waves propagating on a transmission line into electromagnetic waves propagating in an unbounded medium (usually free space), or vice versa. It can be used as a component in wireless equipment to transmit or receive electromagnetic waves. Furthermore, antennas are essential in engineering systems such as radio communication, broadcasting, television, radar, navigation, electronic countermeasures, remote sensing, and radio astronomy, whenever electromagnetic waves are used to transmit information. Additionally, antennas are required for non-signal energy radiation when transmitting energy using electromagnetic waves. Antennas are typically reversible, meaning the same antenna can be used as both a transmitting and receiving antenna. Moreover, according to the reciprocity theorem of antennas, the fundamental characteristic parameters of the same antenna are identical whether it is used for transmitting or receiving.

[0114] Antennas can be classified in several ways, including: Based on their function, they can be divided into transmitting antennas and receiving antennas; based on their application, they can be divided into communication antennas, broadcast antennas, television antennas, radar antennas, etc.; based on their direction, they can be divided into omnidirectional antennas and directional antennas; based on their operating wavelength, they can be divided into very low wave (VLS) antennas, long wave antennas, medium wave antennas, short wave antennas, ultra-short wave (UHF) antennas, microwave antennas, etc.; and based on their structure and operating principle, they can be divided into wire antennas and surface antennas, etc. Additionally, common antenna characteristic parameters include radiation pattern, directivity, gain, input impedance, radiation efficiency, polarization, and bandwidth.

[0115] Antenna gain refers to the ratio of the power density of the signal produced by an actual antenna and an ideal radiating element at the same point in space, under the condition of equal input power. It quantitatively describes the degree to which an antenna concentrates the input power for radiation. Obviously, antenna gain is closely related to the antenna pattern; the narrower the main lobe and the smaller the side lobes, the higher the gain.

[0116] From a physical perspective, antenna gain is defined as the power required to generate a signal of a certain magnitude at a point at a given distance. For example, if an ideal omnidirectional point source is used as the transmitting antenna, 100W of input power is needed. However, if a directional antenna with a gain of G = 13dB = 20 is used as the transmitting antenna, only 100 / 20 = 5W of input power is required. Therefore, the gain of an antenna, in terms of its radiation effect in its maximum radiation direction, is the factor by which it amplifies the input power compared to an ideal omnidirectional point source.

[0117] 2) Data stream

[0118] The data stream involved in this application embodiment is an ordered sequence of bytes with a start and an end. Data streams can be mainly divided into input streams and output streams. Input streams can only be read, not written, while output streams can only be written, not read. Typically, programs use input streams to read data and output streams to write data, as if data flows into and out of the program. Using data streams makes the program's input and output operations independent of the associated devices.

[0119] It should be noted that in the wireless communication method provided in this application embodiment, the object of precoding is mainly a data stream, but in practice, the object of precoding can also be a signal, and this application does not specifically limit it.

[0120] 3) Precoding

[0121] In MIMO systems, precoding techniques can preprocess the data to be transmitted in the baseband, enabling the base station to send data to users in the cell in a more targeted manner.

[0122] The advantages of precoding include: First, it allows signal processing at the base station, enabling users to directly receive the data they need, avoiding signal processing by the terminal equipment; Second, precoding makes the signals sent by the base station more directional, rather than simply radiating in all directions, increasing the power of the signals received by users, while also avoiding energy waste and improving the energy efficiency of the communication system.

[0123] Precoding can generally be divided into linear precoding and nonlinear precoding. Typical linear precoding methods include: maximum ratio transmission (MRT), zero forcing (ZF) precoding, and minimum mean square error (MMSE).

[0124] Based on the characteristics of the set of precoding matrices used, precoding can be classified into codebook-based precoding and non-codebook-based precoding. Codebook-based precoding refers to a set of finite precoding matrices; therefore, in codebook-based precoding, only usable precoding matrices can be selected from the codebook. In non-codebook-based precoding, there is no restriction on the number of available precoding matrices; therefore, the precoding matrix can be any matrix that conforms to the design rules and application conditions, and is not limited to a specific codebook.

[0125] 4) In the embodiments of this application, "multiple" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone. The character " / " generally indicates that the preceding and following related objects have an "or" relationship. Furthermore, it should be understood that in the description of this application, terms such as "first" and "second" are used only for descriptive purposes and should not be construed as indicating or implying relative importance or order.

[0126] 5) The terms "comprising" and "having," and any variations thereof, mentioned in the description of the embodiments of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices. It should be noted that in the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0127] The following is a brief introduction to existing MIMO technology.

[0128] Massive MIMO technology is a crucial technology in 5G mobile communication. It effectively improves spectral and energy efficiency and smooths channel response through a simple transmit / receive structure. During data transmission, Massive MIMO can provide high-quality service to specific users through directional beamforming, but for the transmission of public signals (such as signaling broadcasting and digital video broadcasting), it needs to cover the entire cell.

[0129] refer to Figure 1 As shown, this is a MIMO communication system to which a wireless communication method provided in an embodiment of this application may be applied. Figure 1 As shown, the MIMO communication system 100 includes a network device 101 and a terminal device 102. The network device 101 may be configured with multiple antennas, and the terminal device may also be configured with multiple antennas. It should be understood that the network device 101 may also include multiple components related to signal transmission and reception (e.g., processor, modulator, encoder, multiplexer, demodulator, or demultiplexer, etc.). In this MIMO communication system 100, the network device 101 can communicate with the terminal device 102, and the network device 101 can also communicate with one or more terminal devices other than the terminal device 102. However, it should be understood that... Figure 1 The network device 101 shown can communicate with the terminal device 102, but this only shows one possible scenario. In some scenarios, the terminal device 102 can also communicate with the network device 101 and other network devices. This application does not make any specific limitations on this.

[0130] In a Massive MIMO system, network device 101 and terminal device 102 can select a special antenna to use as a broadcast antenna. Since the antenna selected for broadcast transmission requires an expensive, high-power amplifier, and during broadcasting, a large number of other ordinary antennas are put into sleep mode. Therefore, using multiple low-power antennas simultaneously to transmit broadcast signals is significant for reducing costs and improving the overall gain of Massive MIMO.

[0131] As an example, network device 101 can transmit signals or data through multiple configured antennas, and terminal device 102 can also receive signals or data transmitted by network device 101 through multiple configured antennas. To compensate for problems in channel transmission and reduce the bit error rate of signal transmission, network device 101 typically needs to preprocess the transmitted signal or data stream, such as through omnidirectional precoding.

[0132] Currently, omnidirectional precoding mainly includes schemes using Uniform Linear Array (ULA) and Uniform Rectangular Array (ULA). While both methods can achieve omnidirectional precoding, in the ULA scheme, the length of the precoding sequence used in the precoder is equal to the order of the space-time coding. Therefore, the longer the precoding sequence, the higher the order of the space-time coding is required, resulting in a more complex transceiver structure for the terminal device. Similarly, in the ULA scheme, the more precoding matrices are required, the higher the order of the space-time coding is needed, further complicating the transceiver structure for the terminal device.

[0133] Therefore, this application provides a wireless communication method, which includes: firstly, precoding a first data stream using a first precoding method to obtain a precoded data stream; the first precoding is obtained based on a preset first precoding sequence of length N, or the first precoding is obtained based on a preset first precoding matrix of size P×Q, where P and Q are both integers greater than 0 and the product of P and Q equals N, where N is an integer greater than 0; finally, the precoded data stream is transmitted using N antennas. This method simplifies the communication device for implementing omnidirectional precoding while achieving omnidirectional precoding.

[0134] It should be understood that Figure 1 This is a simplified illustration for ease of understanding only. The MIMO communication system 100 may also include other network devices or other terminal devices. Figure 1The details are not shown in the diagram. In this application embodiment, different base stations can be base stations with different identifiers, or they can be base stations with the same identifier deployed in different geographical locations. Since a base station does not know whether it will be involved in the scenario applied in this application embodiment before deployment, the base station or baseband chip should support the method provided in this application embodiment before deployment. It is understood that the aforementioned base stations with different identifiers can be base station identifiers, cell identifiers, or other identifiers.

[0135] It is important to note that Figure 1 To provide a possible scenario for implementing a wireless communication method, the first communication device and / or first product to which the method in this application embodiment is applicable can be a network device or a terminal device. When the network device sends an encoded data stream to the terminal device, the first communication device is a network device, such as a base station; when the terminal device sends an encoded data stream to the network device, the first communication device is a terminal device.

[0136] It should be noted that the wireless communication method provided in this application can be applied to various communication systems. These systems may include, for example, long-term evolution (LTE) systems supporting 4G access technology, new radio (NR) systems supporting 5G access technology, any cellular system related to the 3rd generation partnership project (3GPP), wireless-fidelity (WiFi) systems, worldwide interoperability for microwave access (WiMAX) systems, radio access technology (RAT) systems, or other future-oriented communication technologies. For instance, it could be an Internet of Things (IoT) system, a narrowband Internet of Things (NB-IoT) system, a long-term evolution (LTE) system, a fifth-generation (5G) communication system, a hybrid LTE / 5G architecture, an NR system, or new communication systems emerging in future communication developments (e.g., 6G mobile communication systems), vehicle-to-everything (V2X) communication systems, etc. This application applies to 5G NR Frequency Division Duplexing (FDD) MIMO systems and 5G NR Time Division Duplexing (TDD) MIMO systems.

[0137] The terminal equipment and network equipment of this application are described below.

[0138] The terminal devices involved in the embodiments of this application can also be referred to as user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of this application do not limit the specific technologies or device forms used in the terminals.

[0139] The network device involved in the embodiments of this application can be a device in a wireless network. For example, a network device can be a device deployed in a wireless access network to provide wireless communication functions for terminal devices. For example, a network device can be a radio access network (RAN) node that connects terminal devices to a wireless network, and can also be called an access network device.

[0140] Network equipment includes, but is not limited to: evolved Node B (eNB), radio network controller (RNC), Node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (e.g., home-evolved Node B, or home Node B, HNB), baseband unit (BBU), access point (AP), wireless relay node, wireless backhaul node, transmission point (TP), or transmission and reception point (TRP) in a wireless fidelity (WIFI) system, and can also be network equipment in a 5G mobile communication system. For example, next-generation Node B (gNB), transmission and reception point (TRP), or TP in an NR system; or one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G mobile communication system; or, network equipment can also be network nodes constituting a gNB or transmission point. For example, BBU, or distributed unit (DU), etc.

[0141] In some deployments, a gNB may include a centralized unit (CU) and a dedicated unit (DU). The gNB may also include an active antenna unit (AAU). The CU implements some of the gNB's functions, and the DU implements others. For example, the CU handles non-real-time protocols and services, implementing radio resource control (RRC) and packet data convergence protocol (PDCP) layer functions. The DU handles physical layer protocols and real-time services, implementing radio link control (RLC), MAC, and physical (PHY) layer functions. The AAU implements some physical layer processing functions, radio frequency processing, and active antenna-related functions. Information from the RRC layer ultimately becomes information from the PHY layer, or is derived from PHY layer information. Therefore, in this architecture, higher-layer signaling (such as RRC layer signaling) can be considered to be sent by the DU, or by both the DU and AAU. It is understood that network devices can be one or more of CU nodes, DU nodes, and AAU nodes. In addition, the CU can be classified as a network device in the RAN or as a network device in the core network (CN), and this application does not limit this.

[0142] It should be noted that the terminal devices and network devices in the embodiments of this application can be fixed in location or mobile. The terminal devices and network devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

[0143] This application's embodiments address the implementation of omnidirectional precoding for uniform antenna arrays using a single sequence or matrix without employing space-time coding. Therefore, to facilitate understanding of the technical solutions in this application's embodiments, the omnidirectional precoding technology is described below for ULA and URA scenarios.

[0144] (I) ULA omnidirectional radiation under a single precoding sequence.

[0145] For details on the transmitter data transmission process, please refer to [link / reference]. Figure 2 As shown, the ULA includes M antennas. Considering the large-scale fading channel model, the data stream to be transmitted does not need to go through space-time coding and can directly enter the precoder. The precoder is configured according to a precoding sequence W of length M, where the precoding sequence of length M is denoted as W and M is an integer greater than 0.

[0146] Under large-scale fading, the antenna radiation gain at different azimuth angles can satisfy the following formula:

[0147]

[0148] Where a(θ) is the antenna radiation gain at different azimuth angles, and θ is the azimuth angle. d is the antenna spacing, λ is the wavelength, e is the euler's number, and j is the imaginary unit.

[0149] The precoding gain at different azimuth angles can satisfy the following formula:

[0150] |h(θ)| 2 =|W H a(θ)| 2 ,

[0151] The precoded sequence W has a unit energy, i.e., W0 H W=1, the W H Let W be the transpose of W.

[0152] Theorem 1 in this field defines the precoding gain at different azimuth angles as determined by the aperiodic correlation of the precoding vector. That is, Theorem 1 satisfies the following formula:

[0153]

[0154] Where, |h(θ)| 2 ρ represents the precoding gain at different azimuth angles, a(θ) represents the antenna radiation gain at different azimuth angles, and ρ represents the antenna radiation gain at different azimuth angles. W (τ) represents the aperiodic autocorrelation function. θ is the azimuth angle, d is the antenna spacing, λ is the wavelength, W is the precoding sequence, M is the number of antennas, k represents the number of precoding vectors in the precoder, e is the natural constant, and i is the imaginary unit.

[0155] According to the formula of Theorem 1 above, when ρ W When (τ) = 0, the precoding gain can be made independent of the azimuth angle, thus ensuring that the precode has the same energy in different directions. Therefore, the realization of single-sequence omnidirectional precoding is equivalent to determining a precoding sequence with ideal aperiodic correlation, i.e., determining the precoding sequence W. k This makes its aperiodic autocorrelation function ρ W (τ)=0, when τ≠0.

[0156] (II) URA omnidirectional radiation under a single precoding array.

[0157] For details on the transmitter data transmission process, please refer to [link / reference]. Figure 2 As shown, the URA includes M antennas, where M is a positive integer and M = P × Q. Considering the large-scale fading channel model, the data stream to be transmitted does not need to undergo space-time coding and can directly enter the precoder. The precoder is configured by a precoding matrix, denoted as W, and the size of the precoding matrix W is P × Q, that is, the precoding matrix W is a matrix with P rows and Q columns.

[0158] Under large-scale fading, different azimuth angles θ and elevation angles The antenna radiation gain satisfies the following formula:

[0159]

[0160] in, Representing different azimuth angles θ and elevation angles The antenna radiation gain, p = 1, 2, ..., P; q = 1, 2, ..., Q; θ ∈ [0, 2π], λ is the wavelength, and j represents the imaginary unit.

[0161] Under large-scale fading, different azimuth angles θ and elevation angles The precoding gain satisfies the following formula: The precoding gain for different azimuth and elevation angles satisfies the following formula:

[0162]

[0163] Wherein, the precoding matrix W has unit energy, i.e. This represents the squared norm value of the precoding matrix W.

[0164] Theorem 2 in this field defines the precoding gain for different azimuth and elevation angles as determined by the aperiodic correlation of the precoding matrix. That is, Theorem 2 satisfies the following formula:

[0165]

[0166] in, Indicates different azimuth angles θ and elevation angles Precoding gain, W is the precoding matrix. Let e ​​represent the aperiodic autocorrelation function, where e is the natural constant.

[0167] According to the formula of Theorem 2 above, when ρ WWhen (τ) = 0, the precoding gain can be made independent of the azimuth and elevation angles, thus ensuring that the precoding has the same energy in different directions. Therefore, the implementation of single-array omnidirectional precoding is equivalent to determining a precoding array with ideal aperiodic correlation, that is, determining a precoding matrix W of size P×Q such that its aperiodic autocorrelation function... when τ≠0.

[0168] The technical solution of this application is described below with reference to specific embodiments.

[0169] Figure 3 This is a schematic diagram illustrating an embodiment of a wireless communication method provided in this application. (Reference) Figure 3 As shown, the first data stream to be transmitted undergoes pre-encoding processing by a first pre-encoder before being sent out. This method can be applied to a first communication device and / or a first product. Optionally, the first communication device and / or product can be a device and / or product with transmission / transmission capabilities.

[0170] For example, the first communication device may include, but is not limited to, wireless access point (AP) type communication devices and station (STA) type communication devices such as communication servers, routers, switches, bridges, computers, and mobile phones. Specifically, the first communication device may include a transceiver and a processor. The transceiver can be used for sending / receiving the packet structure. The processor can be used to parse signaling information and process related data. The memory can be used to store signaling information and pre-agreed preset values, etc.

[0171] Optionally, the first communication device may further include a precoder for performing a precoding process of the data stream. The precoder may be a separate device in the first communication device, or the precoder may be located in the transceiver of the first communication device; this application does not limit this.

[0172] Therefore, taking the aforementioned first communication device as an example, the method of this application will be specifically described below. (Reference) Figure 4 As shown, the specific method flow of this embodiment is as follows:

[0173] S401: The first communication device uses the first precoding to precode the first data stream to obtain the precoded data stream.

[0174] Specifically, a first data stream to be sent is determined, and the processor in the first communication device performs precoding processing on the first data stream using a first precoder to obtain a precoded data stream; or the first data stream to be sent is input into a precoder in the first communication device, where the first data stream is precoded and the precoder outputs a precoded data stream.

[0175] Optionally, the first precoder can be configured in a separate precoder, i.e., the first data stream is input to the precoder, and the output of the precoder is the encoded data stream, and the precoder is configured according to the first precoder.

[0176] In one implementation, the first precoding is obtained based on a first precoding sequence of a preset length N, or the first precoding is obtained based on a first precoding matrix of a preset size P×Q, where P and Q are both integers greater than 0 and the product of P and Q is equal to N, where N is an integer greater than 0.

[0177] As an example, this application embodiment determines the first precoding sequence corresponding to several different numbers of antennas. Specifically, it may include the following:

[0178] When N is 4, the first precoding sequence is denoted as H4, meaning that the first precoding sequence H4 is the first sequence. Since the conjugate inversion of the first sequence does not affect the properties of the sequence, the first precoding sequence H4 can also be the conjugate inversion of the first sequence.

[0179] The first sequence specifically satisfies the following sequence:

[0180] A*[0.802926,-0.363904+0.630299i,-0.564463-0.977678i,-1.24545+9.06431E-16i];

[0181] Where A is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0182] The first precoding sequence H4 corresponds to the set B = {0, 2} mentioned above. The energy ratio corresponding to this first precoding sequence is 2.5788.

[0183] When N is 8, the first precoding sequence is denoted as H8, meaning that the first precoding sequence H8 is the second sequence. Since the conjugate inversion of the second sequence does not affect the properties of the sequence, the first precoding sequence H8 can also be the conjugate inversion of the second sequence.

[0184] The second sequence satisfies the following sequence:

[0185] B*[0.862959, -0.608268+0.40355i, 0.671941+0.240793i, -1.39612+0.224078i, -0.17 0289-0.602021i, 0.57998-1.08727i, -0.816799-0.541898i, -1.1588+1.73594E-15i];

[0186] Where B is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0187] The first precoding sequence H8 corresponds to the set B = {0, 2, 5, 6}. The energy ratio corresponding to the first precoding sequence H8 is 4.0013.

[0188] When N is 16, the first precoding sequence is denoted as H. 16 That is, the first precoding sequence H 16 This is the third sequence. Since the conjugate inversion of the third sequence does not affect the properties of the sequence, the first precoding sequence H... 16 It can also be the conjugate inversion of the third sequence.

[0189] The third sequence satisfies the following sequence:

[0190] C*[0.911842,0.744996-0.113883i,-0.0654774-0.179596i,-0.651775-0.944747i,-0.67 0119-0.19198i,0.186435+1.22397i,-0.719419+1.06779i,-1.00355+0.447137i,-0.4733 56-0.874311i,-1.18884+0.383784i,0.307512+0.407312i,0.0889852-1.31655i,-0.0450 766+1.07512i,-0.793708-0.00780988i,0.896014+0.136968i,-1.09668+8.36758E-16i];

[0191] Where C is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0192] The first precoded sequence H 16 This corresponds to the set B = {0, 2, 5, 6, 7, 8, 10, 11} mentioned above. The first precoding sequence H... 16 The corresponding energy ratio is 9.1889.

[0193] When N is 32, the first precoding sequence is denoted as H. 32 That is, the first precoding sequence H 32 This is the fourth sequence. Since the conjugate inversion of the fourth sequence does not affect the properties of the sequence, the first precoded sequence H... 32 It can also be the conjugate inversion of the fourth sequence.

[0194] The fourth sequence satisfies the following sequence:

[0195] D*[0.94565,1.06357+0.170642i,0.488069+0.185938i,0.756591-0.12945i,0.47906-0 .280633i,-0.534094-0.810586i,-0.833989-0.944053i,-0.751162-0.235484i,-0.519 017-1.07294i,-0.198133-1.13521i,0.24793+0.405002i,1.02255-0.507768i,1.18505 -0.605795i,-0.358657+0.710371i,-1.21427-0.495671i,0.872887-1.04056i,1.03741 -0.113152i,-0.522955+0.893288i,0.724073+0.891883i,0.365551-0.800314i,-0.318 858-0.250833i,0.341557+0.231721i,-0.929152-0.238287i,0.522734+1.18713i,0.89 1176+0.128904i,-0.539493-0.857896i,0.27286+0.353311i,-1.32764+0.13279i,1.08 168+0.0915187i,-0.757427+0.221305i,1.18934-0.190821i,-1.05747+2.09002E-15i];

[0196] Where D is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0197] The first precoded sequence H 32 This corresponds to the set B = {1, 5, 7, 9, 12, 13, 14, 15, 16, 17, 18, 20, 21, 24, 25, 26}. The first precoding sequence H... 32 The corresponding energy ratio is 17.3471.

[0198] When N is 64, the first precoding sequence is denoted as H. 64 That is, the first precoding sequence H 64 This is the fifth sequence. Since the conjugate inversion of the fifth sequence does not affect the properties of the sequence, the first precoding sequence H... 64 It can also be the conjugate inversion of the fifth sequence.

[0199] The fifth sequence satisfies the following sequence:

[0200] F*[0.94565,1.06357+0.170642i,0.488069+0.185938i,0.756591-0.12945i,0.47906-0 .280633i,-0.534094-0.810586i,-0.833989-0.944053i,-0.751162-0.235484i,-0.519 017-1.07294i,-0.198133-1.13521i,0.24793+0.405002i,1.02255-0.507768i,1.18505 -0.605795i,-0.358657+0.710371i,-1.21427-0.495671i,0.872887-1.04056i,1.03741 -0.113152i,-0.522955+0.893288i,0.724073+0.891883i,0.365551-0.800314i,-0.318 858-0.250833i,0.341557+0.231721i,-0.929152-0.238287i,0.522734+1.18713i,0.89 1176+0.128904i,-0.539493-0.857896i,0.27286+0.353311i,-1.32764+0.13279i,1.08 168+0.0915187i,-0.757427+0.221305i,1.18934-0.190821i,-1.05747+2.09002E-15i];

[0201] Where F is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0202] The first precoded sequence H 64 The following conditions must be met for the set B mentioned above:

[0203] B = {0,2,8,12,15,16,18,20,22,23,24,25,26,27,28,29,30,31,32,33,37,38,39,41,44,45,46,47,49,57,58,62}. The first precoding sequence H... 64 The corresponding energy ratio is 26.0258.

[0204] When N is 128, the first precoding sequence is denoted as H. 128 That is, the first precoding sequence H 128 This is the sixth sequence. Since the conjugate inversion of the sixth sequence does not affect the properties of the sequence, the first precoding sequence H... 128 It can also be the conjugate inversion of the sixth sequence.

[0205] The sixth sequence satisfies the following sequence:

[0206] G*[1.01929,0.406318+0.231955i,-0.373987-0.0952898i,-0.367731-0 .587133i,0.228449-0.12221i,0.198101+0.0363763i,-0.332481-0.5486 94i,-0.605406-0.812968i,0.698584-0.465837i,0.425759+0.563994i,-0.688767+0.138986i,-0.668032-0.638221i,-0.219976+0.226485i,0.0 658161+1.08394i,-0.23649+0.741746i,-0.558761-0.632815i,-0.0327595-0.305218i,0.726052+0.956118i,0.131861+0.238876i,0.849912-1. 36222i, 0.576365 - 0.313029i, - 0.481633 + 0.46811i, 0.391448 + 0.896474i, 0.561325 - 0.649279i, - 0.336525 - 0.919283i, 0.214784 - 0.0458932i, - 1 .16544+0.342769i,-1.03227-0.496644i,-0.391328-0.503213i,-1.24773-0.0143311i,-0.000383879+0.392386i,0.932582+1.29784i,0.601505 +0.23772i, 0.670625 +0.356246i, 0.0404481 +0.232432i, -0.2884 +0.892821i, -0.247524 +1.48384i, -0.616624 -0.331782i, 0.257908 -1.07897i, 1 .24553+0.912842i,0.0779543-0.77906i,0.186603-0.86197i,1.02991+0.317902i,0.430829-0.514483i,1.0121+0.713158i,-0.308627+0.36158 1i,-1.2418+0.514985i,-0.116601-0.501178i,1.16708-1.28309i,0.343407-1.16372i,1.52713+0.498865i,-0.587166-0.559094i,-0.138607-0.851871i,-1.42004-0.61065i,0.161108+0.367014i,-0.296069-1.22258i,0.9736-0.724265i,0.995977-1.39388i,-1.04147-0.379581i,-0.621 963+0.313869i,-1.0206+0.331161i,-0.518457+1.29361i,0.555727-1.51804i,1.04553-1.20314i,-0.531482+0.70339i,0.398234-0.912637i,- 1.40726-0.688519i,1.45544-0.439108i,-0.665851-0.724908i,0.726833-1.54105i,-0.288251+0.245461i,-0.75621+1.23034i,0.0365837+0. 152961i, 1.6165 - 0.738378i, - 1.09018 + 0.912017i, 1.25641 - 0.887113i, 0.544979 + 0.171796i, 0.499804 - 1.28489i, - 0.272712 - 1.35923i, - 0.0934 339-0.269901i,0.257179-0.754938i,-0.533771+0.541634i,-0.32559+0.819085i,1.22877+0.0812213i,0.692266-0.842447i,0.3172-0.36426 i,0.74394+0.850261i,-0.224503-0.37255i,0.305183+1.42829i,-0.58 0736-1.59721i,-0.258601+0.301548i,0.794673+0.18032i,-1.17687+0. 112119i, 0.660166 - 0.117267i, - 0.868348 + 0.620641i, 0.407885 - 0.458964i, 0.923009 + 0.0278339i, - 0.0283287 + 0.853964i, 0.153884 + 0.009242 26i,-0.538542+0.848099i,0.423257-0.240246i,-0.993372+0.400492i,0.000102603+0.422257i,0.520649+1.02515i,-0.99126-0.702938i,-0.856478-0.42295i,-0.748369+0.654394i,0.109745-1.18627i,-0.827536-0.187289i,-0.222334+0.0622278i,0.974367-0.35955 6i,-0.743009-1.37109i,0.90575+0.37929i,0.49894-0.712457i,0.706872-0.437825i,-0.0313725+0.457232i,0.616029-0.332 859i,0.34089+0.27738i,-0.400266+0.512784i,1.0743+0.485306i,-0.436375+0.220078i,-0.28041+0.467881i,0.0528504+0.5 11448i,0.0766431-0.163176i,-0.107315+0.233298i,-0.465062+0.269715i,0.391088-0.223261i,-0.981079-1.79994E-14i];.

[0207] Where G is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0208] The first precoded sequence H 128 The following conditions must be met for the set B mentioned above:

[0209] B = {1,3,4,5,6,7,8,9,14,17,19,22,23,24,27,36,38,39,42,43,44,49,50,52,53,54,55,56,57,60,62,63,65,68,69,70,72,73,74,77,79,80,84,85,86,87,88,89,90,93,94,95,102,103,105,108,109,113,114,116,117,123,126}. This first precoding sequence H... 128 The corresponding energy ratio is 40.5286.

[0210] When N is 256, the first precoding sequence is denoted as H. 256 That is, the first precoding sequence H 256 This is the seventh sequence. Since the conjugate inversion of the seventh sequence does not affect the properties of the sequence, the first precoding sequence H... 256 It can also be the conjugate inversion of the seventh sequence.

[0211] The seventh sequence satisfies the following sequence:

[0212] I*[0.989186,0.808653+0.0269174i,-0.169779-0.32292i,-0.733528+0.115751i,-0.613068+0.0368521i,0.331565-0.392331i,0.0601563+0.200854i,-0.617035-0.355185i,-0.278821-0.312619i,-0.511443+0.0145336i,0.346632+0.0540139i,0.62756+0.852919i,-0.386705+0.311236i,0.0474609+0.0442843i,0.105609+0.0357574i,0.222635-0.394455i,0.0563216+0.513777i,-0.738706+0.470864i,0.219221-0.824882i,0.758824-0.132939i,0.644625+0.251876i,0.535591+0.325514i,-0.732479-0.131569i,-0.688261-0.951143i,0.393991-0.372776i,-0.271018-0.0963014i,-0.202222-0.0827184i,-0.547753+0.441625i,-0.902373-0.225489i,0.237862+0.229112i,0.450681+0.981206i,-0.216361+0.549749i,-0.753582+0.780146i,0.433376+0.651541i,1.76187-0.548428i,1.11863-0.717052i,-0.932984-0.685011i,-0.512218-1.08034i,0.61665-0.10064i,0.0540245+0.55586i,0.740965-0.0520081i,-0.313679-0.163575i,-1.0506-1.42357i,0.502055+0.199389i,0.306472+0.327695i,0.161809-0.563189i,-0.824851+1.31996i,-1.63526+0.571237i,-0.0983224-0.132809i,-0.508774+0.530958i,-0.065912-0.27276i,0.200468+0.0436518i,-0.412288+0.533068i,1.17216+0.66288i,1.15729+0.181825 i,0.14745-1.14591i,0.814312-0.0882376i,0.496977+0.625019i,-0.8 34182-0.73254i,-1.52398+0.0790747i,-1.28294+0.218327i,0.758817+0.216012i,0.207635-0.175509i,0.465753-1.09441i,1.10662-0.04742 43i,-0.619625+0.700196i,-0.10983+0.913097i,-0.0633908+0.799022i,0.318259-1.24303i,-0.271027-0.856276i,-0.674387-1.33843i,0.2 9661-0.220914i,-1.22283+1.59814i,0.594048+1.47751i,1.03211+0.357164i,0.396735-1.13241i,-0.523596+0.832727i,-1.70158+1.16383i, -0.598731-1.07458i,0.301148-0.638984i,-0.590571-1.49685i,-0.09455-0.00220634i,0.71273+0.388332i,1.24023-0.0514791i,0.241834+ 0.0587994i,-0.37682+0.768669i,0.645376+0.120912i,0.788128-0.281884i,-1.14458+0.248466i,-0.831576+0.645859i,0.150562+1.01832i, -0.430179-0.536174i,-0.451239-0.580884i,0.595077+0.274583i,0.322394-0.0945713i,0.144473-0.533125i,-0.173378-0.0641487i,1.1587 +0.837781i,0.106212+1.03774i,0.271696+0.714299i,0.324133-1.4543i,1.21441-1.32073i,-0.412683+0.279811i,-0.918624-0.0615713i,0.298318-0.804481i,0.705376-1.6604i,0.165233-1.3317i,-0.741656-0.46966i,1.00885+0.754769i,0.592543+0.146305i,-0.149326+0.51054 4i,-0.0202263+0.809557i,-0.105471-0.957823i,0.573209-0.366006i ,-0.35317+1.70238i,0.93617+0.280783i,-1.95501+0.0859945i,-1.373 12-0.261866i,-0.439179+0.667917i,-0.382861-0.0738975i,-1.11032-0.0777457i,-0.983789+0.278258i,0.838915-0.218631i,1.42114+1.41 102i,-0.680638+0.471727i,1.15888+1.17556i,0.321996-0.159816i,0.106662-1.13529i,0.677961-1.31699i,0.632775-0.957256i,1.33126+0 .373491i,0.177071+1.08921i,0.280829+0.869116i,-0.869848-0.256212i,0.381441-0.0829292i,0.565344-0.724911i,0.0640149-0.269786i 0.630164 + 0.10538i, -1.59444 + 0.031907i, -0.248211 -1.41656i, -0.261586 + 0.464759i, 1.27938 -0.98989i, -0.0818831 -1.43946i, 1.06542 -0.9 7846i, 0.051959 - 1.0558i, 0.159583 - 0.289203i, 0.121388 - 0.115385i, 0.196595 - 0.510878i, - 0.297489 + 1.44542i, 0.101027 + 1.71225i, 1.19849 - 0.214487i,0.676087-1.05766i,0.218371+1.40686i,0.163322-1.06158i,0.416688+0.144738i,-0.906576+0.437044i,-0.467098+0.430272i,0.0741941+0.180273i,-0.347149+0.376308i,0.432468-0.762666i,-0.980022+1.43913i,-0.0316078-0.56178i,-0.969984+0.506703i,0.188911+ 0.746976i,-1.20006+0.811112i,-0.905428-0.059547i,-0.293713+1.02173i,-1.64475-0.139065i,-0.460187+0.247996i,-0.685151+0.379155 i,-0.904241-0.272871i,-0.854403+0.0678971i,-0.550366+1.0148i,-1.35619-0.331346i,-0.69199-0.719672i,-0.39798-0.0200359i,-0.147 074+0.625674i,-0.445559+0.272314i,0.29685-0.0758723i,-0.150344+1.01769i,0.113072-0.233218i,-0.272081+0.673791i,1.19845-1.7306 5i,-1.32153+0.848585i,0.71295+0.962567i,-1.08991-0.0470914i,-0.370468+0.483849i,0.229413+0.294579i,-0.0736328+1.13033i,-0.496 084-1.72993i,0.0623902+0.874895i,0.164802-0.0912504i,-1.6548+0.184379i,0.0255151-0.0208509i,-0.349987+0.601078i,-0.749825+0.3 65295i, 0.801406, 0.199255i, 0.409381, 0.0696831i, 0.65606, 0.532503i, 0.712018, 0.0258957i, 0.956829, 0.132354i, 0.412107, 0.109508i -0.712925 -0.430767i, 0.837063 + 0.912753i, -0.880211 - 0.149518i, 1.23686 - 0.645984i, -1.01333 + 0.616455i, 1.79448 - 0.699341i, -1.54161 + 0.208063i,1.02559+0.289486i,-0.283254-1.06191i,0.138716+0.60 4578i,1.04132+1.10964i,-0.771246-1.76931i,0.302422+1.48506 i,0.611912-0.0680079i,-1.15302-0.282761i,0.0781247+0.478651i,0.450038-0.465606i,-0.800845+0.869943i,-0.04261-0.64468 9i,0.0873191+0.420773i,-0.212136-0.161895i,-0.35767+0.0431 664i,0.374055-0.215484i,-0.190545+0.166168i,-0.764421+0.18 2018i,0.790308-0.466753i,-0.406254-0.134399i,-0.519593+0.5 68968i,0.152241-0.90536i,0.279198+0.847582i,-0.633424+0.22 9514i,-0.0772849-0.183976i,0.334152-0.396945i,0.270882+0.7 90633i,-0.836231-0.527001i,0.793826-0.293879i,-0.428993+0. 388297i,-0.0774887+0.412864i,-0.504173-0.67576i,0.636889+0 .507024i,-0.505758+0.309826i,-0.213733-0.287586i,0.556971+ 0.0124937i,-0.80116+0.300744i,0.246219+0.27192i,-0.211233- 0.631864i,-0.196267+1.25613i,-0.304181-0.376879i,-0.015856 6-0.348981i,-0.0684187+0.972362i,0.0665399-0.722447i,-0.84 8365+0.374996i,0.826431-0.0275091i,-1.01093-1.08618E-13i];.

[0213] Where I is a non-zero constant, E is the scientific notation symbol, i is the imaginary unit, and * is the multiplication sign.

[0214] The first precoded sequence H 256 The following conditions must be met for the set B mentioned above:

[0215] B={0,1,3,4,6,8,9,10,13,15,16,20,22,26,31,33,34,37,38,43,44,46,48,58,60,63,64,65,66,71,73,74,75,76,77,78,79,80,81,82 ,84,85,86,89,90,91,99,104,106,107,111,112,113,114,115,117, 118,119,120,121,122,124,125,128,129,130,131,132,134,135,13 6,138,141,142,144,145,146,148,149,150,151,152,153,154,156,157,158,159,160,162,163,164,165,166,169,170,171,172,173,175,181,182,185,188,189,190,194,198,199,205,207,212,215,221,222,223,226,227,228,234,236,237,245,246,249,251,252,254}. This first precoded sequence H 256 The corresponding energy ratio is 57.7690.

[0216] As another example, this application embodiment determines the first precoding matrix corresponding to several different numbers of antennas. Specifically, it may include the following:

[0217] It should be noted that the number of antennas N = P × Q.

[0218] When P×Q=4×4, the first precoding matrix satisfies the following formula:

[0219]

[0220] It is important to note that Let H4 be the transpose matrix. In this formula, the first H4 from the left represents the first precoding sequence with length P and P equals 2, and the second H4 from the left represents the first precoding sequence with length Q and Q equals 4. The two H4 can be obtained by determining the first precoding sequence as described above, but they are not equivalent.

[0221] When P×Q=4×8, the first precoding matrix satisfies the following formula:

[0222]

[0223] in, H4 is the transpose of H4, where H4 is the first precoding sequence of length 4 and H8 is the first precoding sequence of length 8.

[0224] When P×Q=4×16, the first precoding matrix satisfies the following formula:

[0225]

[0226] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 16 It is the first precoded sequence with a length of 16.

[0227] When P×Q=4×32, the first precoding matrix satisfies the following formula:

[0228]

[0229] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 32 It is the first precoded sequence with a length of 32.

[0230] When P×Q=4×64, the first precoding matrix satisfies the following formula five:

[0231]

[0232] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 64 It is the first precoded sequence with a length of 64.

[0233] When P×Q=4×128, the first precoding matrix satisfies the following formula six:

[0234]

[0235] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 128 It is the first precoded sequence with a length of 128.

[0236] When P×Q=4×256, the first precoding matrix satisfies the following formula seven:

[0237]

[0238] in, Let H4 be the transpose of H4, where H4 is the first precoding sequence of length 4. 256 It is the first precoded sequence with a length of 256.

[0239] When P×Q=8×8, the first precoding matrix satisfies the following formula:

[0240]

[0241] It is important to note that Let H8 be the transpose of the matrix. In this formula, the first H8 from the left represents the first precoding sequence with length P and P equals 8, and the second H8 from the left represents the first precoding sequence with length Q and Q equals 8. The two H8s can be obtained by determining the first precoding sequence as described above, but they are not equivalent.

[0242] When P×Q=8×16, the first precoding matrix satisfies the following formula nine:

[0243]

[0244] in, This is the transpose of the H8 matrix, where H8 is the first precoding sequence of length 8. 16 It is the first precoded sequence with a length of 16.

[0245] When P×Q=8×32, the first precoding matrix satisfies the following formula:

[0246]

[0247] in, This is the transpose of the H8 matrix, where H8 is the first precoding sequence of length 8. 32 It is the first precoded sequence with a length of 32.

[0248] When P×Q=8×64, the first precoding matrix satisfies the following formula eleven:

[0249]

[0250] in, This is the transpose of the H8 matrix, where H8 is the first precoding sequence of length 8. 64 It is the first precoded sequence with a length of 64.

[0251] When P×Q=8×132, the first precoding matrix satisfies the following formula 12:

[0252]

[0253] in, This is the transpose of the H8 matrix, where H8 is the first precoding sequence of length 8. 132 It is the first precoded sequence with a length of 132.

[0254] When P×Q=8×256, the first precoding matrix satisfies the following formula thirteen:

[0255]

[0256] in, This is the transpose of the H8 matrix, where H8 is the first precoding sequence of length 8. 256 It is the first precoded sequence with a length of 256.

[0257] When P×Q=16×16, the first precoding matrix satisfies the following formula fourteen:

[0258]

[0259] It is important to note that For H 16 The transpose matrix, the first H from the left in this formula 16 H represents the first precoding sequence H with length P and P equal to 16. P The second H from the left in the formula 16 H represents the first precoded sequence H with length Q and Q equal to 16. Q Two Hs 16 It can be obtained by determining the first precoding sequence as described above, but the two are not equivalent.

[0260] When P×Q=16×32, the first precoding matrix satisfies the following formula fifteen:

[0261]

[0262] in, For H 16 transpose matrix, H 16 H is the first precoding sequence of length 16. 32 It is the first precoded sequence with a length of 32.

[0263] When P×Q=16×64, the first precoding matrix satisfies the following formula sixteen:

[0264]

[0265] in, For H 16 transpose matrix, H 16 H is the first precoding sequence of length 16. 64 It is the first precoded sequence with a length of 64.

[0266] When P×Q=16×128, the first precoding matrix satisfies the following formula seventeen:

[0267]

[0268] in, For H 16 transpose matrix, H 16 H is the first precoding sequence of length 16. 128 It is the first precoded sequence with a length of 128.

[0269] When P×Q=16×256, the first precoding matrix satisfies the following formula eighteen:

[0270]

[0271] in, For H 16 transpose matrix, H 16 H is the first precoding sequence of length 16. 256 It is the first precoded sequence with a length of 256.

[0272] When P×Q=32×32, the first precoding matrix satisfies the following formula nineteen:

[0273]

[0274] It is important to note that For H 32 The transpose matrix, the first H from the left in this formula 32 H represents the first precoding sequence H with length P and P equal to 32. P The second H from the left in the formula 32 H represents the first precoding sequence H with length Q and Q equal to 32. Q Two Hs 32 It can be obtained by determining the first precoding sequence as described above, but the two are not equivalent.

[0275] When P×Q=32×64, the first precoding matrix satisfies the following formula 20:

[0276]

[0277] in, For H 32 transpose matrix, H 32 H is the first precoding sequence of length 32. 64 It is the first precoded sequence with a length of 64.

[0278] When P×Q=32×128, the first precoding matrix satisfies the following formula 21:

[0279]

[0280] in, For H 32 transpose matrix, H 32 H is the first precoding sequence of length 32. 128 It is the first precoded sequence with a length of 128.

[0281] When P×Q=32×256, the first precoding matrix satisfies the following formula 22:

[0282]

[0283] in, For H 32 transpose matrix, H 32 H is the first precoding sequence of length 32. 256 It is the first precoded sequence with a length of 256.

[0284] It should be noted that the first precoding sequences of different lengths mentioned above can all be obtained by referring to the method for determining the first precoding sequence described above, therefore, they will not be elaborated further.

[0285] S402: The first communication device uses N antennas to transmit a precoded data stream.

[0286] Specifically, the pre-encoded data stream can be transmitted using N antennas in the transceiver of the first communication device.

[0287] Correspondingly, the second communication device at the receiving end can use N antennas to receive the encoded data stream.

[0288] It should be noted that the second communication device at the receiving end may also use one antenna or a number of antennas not equal to N to receive the encoded data stream. This application does not specifically limit the number of antennas used by the receiving end.

[0289] Optionally, when the second communication device of the receiving end is used as a communication device for transmitting data, the processor in the second communication device can use the first precoder to precode the data stream to be transmitted, or the precoder in the second communication device can complete the precoding of the data stream to be transmitted, which is obtained according to the first precoder configuration.

[0290] The first precoding is obtained from the first precoding sequence or the first precoding is obtained from the first precoding matrix. The first precoding sequence and the first precoding matrix can be obtained by referring to step S402 above, and will not be described in detail here.

[0291] In summary, this application provides a wireless communication method, which includes: firstly, precoding a first data stream using a first precoding method to obtain a precoded data stream; the first precoding is obtained based on a preset first precoding sequence of length N, or the first precoding is obtained based on a preset first precoding matrix of size P×Q, where P and Q are both integers greater than 0 and the product of P and Q equals N, where N is an integer greater than 0; finally, the precoded data stream is transmitted using N antennas. This method simplifies the communication device for implementing omnidirectional precoding while achieving omnidirectional precoding.

[0292] Based on the wireless communication method provided in the above embodiments, this application also provides the following specific embodiments to illustrate in detail how the first precode in the embodiments of this application is generated.

[0293] In the scenario of omnidirectional ULA radiation under a single precoding sequence, the first precoding in this embodiment is obtained based on a preset first precoding sequence of length N, where N represents the number of antennas. Therefore, referring to... Figure 5A As shown, the specific steps for generating the first precoding sequence are as follows:

[0294] S501A: Determines multiple precoded sequences of length N.

[0295] Define the precoding sequence as a complex sequence H of length N, i.e., H = [H0, H1, ..., H]. N-1 ], where N represents the number of antennas.

[0296] The aperiodic autocorrelation function of the precoded sequence can satisfy the following formula 23:

[0297]

[0298] in, For matrix H k+τ The adjoint matrix.

[0299] The characteristic polynomial of this precoded sequence can satisfy the following formula twenty-four:

[0300] H(x) = H0 + H1x + ... + Hx N-1 Formula 24

[0301] Characteristic polynomial H(x) and aperiodic autocorrelation function ρ HThe relationship between (τ) satisfies the following formula 25:

[0302]

[0303] In other words, the implementation of omnidirectional precoding in the ULA scenario is equivalent to determining a precoding sequence with ideal aperiodic correlation.

[0304] Optionally, the precoded sequence can be a Huffman sequence, the characteristic polynomial of which satisfies the following formula twenty-six:

[0305]

[0306] in, Indicates the root radius. Let b be an element of set B and c be an element of set C. Set B is a subset of set A and set C is the complement of set B. Set A = {0, 1, ..., N-2}, N represents the sequence length, e is the euler's number, and i is the imaginary unit.

[0307] In Formula 26 above, since set B is a subset of set A, one or more elements can be arbitrarily selected from set A to form set B. Therefore, multiple sets B can be obtained based on set A.

[0308] The original Huffman sequence, denoted as H0, is extracted from the characteristic polynomial H(x) of Formula 26 above.

[0309] When the number of Huffman sequences is N, the corresponding set B contains N / 2 elements. Selecting N / 2 elements from set A to form set B results in multiple possible outcomes. Since set B has multiple outcomes, the extracted original Huffman sequence H0, based on the characteristic polynomial H(x), also includes multiple sequences.

[0310] For example, when the number of antennas transmitting the data stream is 4, the corresponding number (length) of Huffman sequences should also be 4, so the set B includes 2 elements. Selecting 2 elements from set A to form set B, i.e., B = {0,1}, B = {1,2}, B = {0,2}, ..., since there are multiple sets B, there are also multiple original Huffman sequences H0 obtained from the above characteristic polynomial.

[0311] Furthermore, the original Huffman sequence H0 can be energy-normalized using the following formula 27 to obtain the standard Huffman sequence.

[0312]

[0313] It should be noted that the characteristic polynomial of the Huffman sequence described above can also satisfy the following formula 28.

[0314]

[0315] In Formula 28, K is used to normalize a precoded sequence of length N, and K is a constant that is not equal to 0.

[0316] S502A: Calculate the energy ratio of each precoded sequence of length N.

[0317] The energy ratio of each precoded sequence of length N satisfies the following formula (Equation 29):

[0318]

[0319] S503A: Select the precoding sequence with the largest energy ratio from multiple precoding sequences of length N as the first precoding sequence.

[0320] Therefore, the first precoding sequence can be flexibly and effectively determined through the above steps S501A-S503A, and then the determined first precoding sequence can be used as the first precoding to achieve precoding of the first data stream.

[0321] In the scenario of omnidirectional radiation of URA under a single precoding array, the first precoding in this embodiment is obtained based on a preset first precoding matrix of size P×Q; P and Q are both integers greater than 0 and the product of P and Q is equal to N, where N represents the number of antennas and is an integer greater than 0. Therefore, referring to... Figure 5B As shown, the specific steps for generating the first precoding matrix are as follows:

[0322] S501B: Determines multiple precoding matrices of size P×Q.

[0323] Define a precoding matrix H' of size P×Q.

[0324] The aperiodic autocorrelation function of the precoding matrix satisfies Equation 30:

[0325]

[0326] The characteristic polynomial of the precoding matrix can satisfy the following formula thirty-one:

[0327]

[0328] Characteristic polynomial H′(x,y) and aperiodic autocorrelation function The relationship between them satisfies the following formula:

[0329]

[0330] in, For matrix The adjoint matrix. p = 1, 2, ..., P; q = 1, 2, ..., Q. θ represents the pitch angle, and θ represents the azimuth angle.

[0331] In other words, the implementation of omnidirectional precoding in the URA scenario is equivalent to determining a precoding sequence with ideal aperiodic correlation.

[0332] For example, the precoding matrix can be a Huffman precoding matrix. The construction of the Huffman precoding matrix can be given by a binary adjoint polynomial or obtained by iterating the Huffman precoding sequence. This application will take the construction of the Huffman precoding matrix by the Huffman precoding sequence as an example.

[0333] First, determine the size of the Huffman precoding matrix to be P×Q; then, referring to the method described above for determining the Huffman precoding sequence, generate a Huffman precoding sequence H of length P. P and a precoded Huffman sequence H of length Q Q Finally, the Huffman matrix H′ is constructed using the ordinary matrix multiplication method described in Formula 33 below.

[0334]

[0335] Where H' is a precoding matrix of size P×Q. For H P The transpose matrix, H P For a precoded sequence of length P, H Q P represents a precoded sequence of length Q, where the product of P and Q equals the number of antennas, and both P and Q are positive integers greater than 0.

[0336] S502B: Calculate the energy ratio of each P×Q precoding matrix.

[0337] The energy ratio of each P×Q precoding matrix satisfies the following formula (Formula 34):

[0338]

[0339] Where H' is a precoding matrix of size P×Q. Let H' be the squared norm of matrix H'. p,qis the value in the precoding matrix H' located at row p and column q.

[0340] S503B: Select the precoding matrix with the largest energy ratio from multiple precoding matrices of size P×Q as the first precoding matrix.

[0341] Therefore, the first precoding matrix can be flexibly and effectively determined through the above steps S501B-S503B, and then the determined first precoding matrix can be used as the first precoding to achieve precoding of the first data stream.

[0342] Based on the same technical concept, embodiments of this application provide a wireless communication device, which includes the functions described above. Figure 4 The modules or units corresponding to the methods / operations / steps / actions described in the first communication device in the embodiment can be hardware circuits, software, or a combination of hardware circuits and software. The communication device can have, for example: Figure 6 The structure shown.

[0343] like Figure 6 As shown, the communication device 600 may include a transceiver module 601, which can implement corresponding communication functions. Specifically, the transceiver module 601 may include a receiving module and / or a sending module. The receiving module can be used to receive information and / or data, and the sending module can be used to send information and / or data. The transceiver module may also be referred to as a communication interface or transceiver unit.

[0344] Optionally, the communication device 600 further includes a processing module 602, which is equivalent to a processing unit and can be used for data processing.

[0345] Optionally, the communication device 600 may further include a storage module 603, which is equivalent to a storage unit and can be used to store instructions and / or data. The processing module 602 can read the instructions and / or data in the storage module so that the communication device can implement the aforementioned method embodiments.

[0346] The communication device 600 can be used to perform the above. Figure 4 The actions performed by the first communication device in this embodiment. The communication device 600 can be the first communication device or a component configurable on the first communication device. The transceiver module 601 is used to perform the receiving-related operations on the communication device side in the above method embodiment, and the processing module 602 is used to perform the aforementioned... Figure 4 In this embodiment, the first communication device handles the relevant operations.

[0347] Optionally, the transceiver module 601 may include a sending module and a receiving module. The sending module is used to perform the above-described... Figure 4The sending operation in this embodiment. The receiving module is used to perform the above. Figure 4 The receiving operation in the embodiment.

[0348] It should be noted that the communication device 600 may include a transmitting module but not a receiving module. Alternatively, the communication device 600 may include a receiving module but not a transmitting module. Specifically, it depends on whether the method performed by the communication device 600 includes both transmitting and receiving actions.

[0349] As an example, the communication device 600 is used to perform the above. Figure 4 The actions performed by the first communication device in the illustrated embodiment.

[0350] For example, the processing module 602 uses a first precoding to precode the first data stream to obtain a precoded data stream;

[0351] The transceiver module 601 uses N antennas to transmit the precoded data stream.

[0352] It should be understood that the specific procedures for each module (unit) to perform the above-mentioned corresponding processes have been described in detail in the above method embodiments, and will not be repeated here for the sake of brevity.

[0353] The processing module 602 in the above embodiments can be implemented by at least one processor or processor-related circuitry. The transceiver module 601 can be implemented by a transceiver or transceiver-related circuitry. The storage module 603 can be implemented by at least one memory.

[0354] This application also provides a communication device 700, which may be a first communication device or the processor or chip of the first communication device, and the communication device 700 may be used to perform the above-described... Figure 4 The operation performed by the first communication device in the embodiment.

[0355] When the communication device 700 is a transmitter Figure 7 A simplified schematic diagram of a first communication device is shown. Figure 7 As shown, the first communication device includes a transceiver 710, a processor 720, and a memory 730. The transceiver 710 includes a transmitter 711, a receiver 712, radio frequency circuitry (not shown), an antenna 713, and input / output devices (not shown). The memory 730 can store computer program code.

[0356] The processor 720 is primarily used for processing communication protocols and data, pre-encoding data streams, executing software programs, and processing software program data. The memory is mainly used to store software programs and data. The radio frequency (RF) circuitry is mainly used for converting baseband signals to RF signals and processing RF signals. The antenna 713 is mainly used for transmitting and receiving RF signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are mainly used to receive user input data and output data to the user. It should be noted that some types of communication devices may not have input / output devices.

[0357] When data needs to be transmitted, the processor 720 performs baseband processing on the data to be transmitted and outputs a baseband signal to the radio frequency (RF) circuit. The RF circuit then processes the baseband signal and transmits it outward as an electromagnetic wave through the antenna. When data is sent to the terminal device, the RF circuit receives the RF signal through the antenna, converts it into a baseband signal, and outputs the baseband signal to the processor 720. The processor 720 then converts the baseband signal back into data and processes it. For ease of explanation, Figure 7 Only one memory, processor, and transceiver are shown in the illustration. In actual terminal device products, there may be one or more processors and one or more memories. Memory can also be called storage medium or storage device, etc. Memory can be set up independently of the processor or integrated with the processor; this application does not limit this.

[0358] In the embodiments of this application, the antenna and radio frequency circuit with transceiver function can be regarded as the transceiver unit (transceiver module) of the terminal device, and the processor with processing function can be regarded as the processing unit (processing module) of the first communication device.

[0359] like Figure 7 As shown, the communication device includes a processor 720, which can also be referred to as a processing module, processing board, processing module, processing device, etc.

[0360] Optionally, the transmitter may also include a transceiver 710 and a memory 730. The transceiver 710 may also be referred to as a transceiver module, transceiver, or transceiver device.

[0361] Optionally, the devices in transceiver 710 used to implement the receiving function can be regarded as receiving modules, and the devices in transceiver 710 used to implement the transmitting function can be regarded as transmitting units or transmitting modules. That is, transceiver 710 includes transmitter 711 and receiver 712. Transceiver 710 may also be called a transceiver, transceiver module, or transceiver circuit, etc. Transmitter 711 may also be called a transmitter, transmitting module, or transmitting circuit, etc. Receiver 712 may also be called a receiver, receiving module, or receiving circuit, etc.

[0362] For example, in one implementation, processor 720 is used to execute the above. Figure 4 In the embodiment shown, the transceiver 710 is used to perform the processing actions of the first communication device. Figure 4 The illustrated embodiment shows the transmission and reception operations of the first communication device. For example, transceiver 710 is used to perform... Figure 4 The operation of S402 in the illustrated embodiment. Processor 720 is used to execute... Figure 4 The processing operation of S401 in the illustrated embodiment.

[0363] It should be understood that Figure 7 The first communication device described above, including a transceiver, a processor, and a memory, is optional and not limiting. Figure 7 The structure shown.

[0364] When the communication device 700 is a chip, the chip includes a processor, a memory, and a transceiver. The transceiver can be an input / output circuit or a communication interface; the processor can be a processing module integrated on the chip, a microprocessor, or an integrated circuit. In the above method embodiments, the sending operation of the terminal device can be understood as the output of the chip, and the receiving operation of the terminal device in the above method embodiments can be understood as the input of the chip.

[0365] The module division in this embodiment is illustrative and represents only one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in each embodiment of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

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

[0367] For example, when the computer program is executed by the computer, it enables the computer to perform the above-mentioned tasks. Figure 4 The method performed by the first communication device in the embodiment.

[0368] This application also provides a computer program product containing instructions that, when executed by a computer, cause the computer to perform the above-described actions. Figure 4 The method performed by the first communication device in the embodiment.

[0369] This application also provides a communication system, which includes the above-described... Figure 4 The first communication device (transmitting device) and the second communication device (receiving device) in the embodiment.

[0370] This application also provides a chip device, including a processor, configured to call computer programs or computer instructions stored in the memory, so that the processor executes the above-described... Figure 4 The illustrated embodiment is a wireless communication method.

[0371] In one possible implementation, the input of the chip device corresponds to the above. Figure 4 The receiving operation in the illustrated embodiment corresponds to the output of the chip device described above. Figure 4 The sending operation in the illustrated embodiment.

[0372] Optionally, the processor is coupled to the memory via an interface.

[0373] Optionally, the chip device may also include a memory that stores computer programs or computer instructions.

[0374] The processor mentioned above can be a general-purpose central processing unit, a microprocessor, an application-specific integrated circuit (ASIC), or one or more devices used to control the above. Figure 4 The illustrated embodiment is an integrated circuit for program execution of a wireless communication method. The memory mentioned above can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, such as random access memory (RAM).

[0375] It should be noted that, for the sake of convenience and brevity, the explanations and beneficial effects of the relevant content in the communication device provided above can be found in the above description. Figure 4 The provided method implementation examples will not be described in detail here.

[0376] In this application, the first communication device (transmitting device) or the second communication device (receiving device) may include a hardware layer, an operating system layer running on top of the hardware layer, and an application layer running on the operating system layer. The hardware layer may include hardware such as a central processing unit (CPU), a memory management unit (MMU), and memory (also called main memory). The operating system layer may be any one or more computer operating systems that implement business processing through processes, such as Linux, Unix, Android, iOS, or Windows. The application layer may include applications such as browsers, address books, word processing software, and instant messaging software.

[0377] It should be noted that the "at least one" in the embodiments of this application includes one or more; wherein, "more" means two or more. Furthermore, it should be understood that in the description of this application, terms such as "first" and "second" are used only for descriptive purposes and should not be construed as indicating or implying relative importance, nor as indicating or implying order.

[0378] The terminology used in the following embodiments is for the purpose of describing particular embodiments only and is not intended to be limiting of this application. As used in the specification and appended claims of this application, the singular expressions “a,” “the,” “the,” “the,” and “this” are intended to also include expressions such as “one or more,” unless the context clearly indicates otherwise. It should also be understood that in the embodiments of this application, “one or more” means one or more (including two); “and / or” describes the relationship between related objects, indicating that three relationships may exist; for example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character “ / ” generally indicates that the preceding and following related objects are in an “or” relationship.

[0379] References to "one embodiment" or "some embodiments" as used in this specification mean that one or more embodiments of this application include a specific feature, structure, or characteristic described in connection with that embodiment. Therefore, the phrases "in one embodiment," "in some embodiments," "in other embodiments," "in still other embodiments," etc., appearing in different parts of this specification do not necessarily refer to the same embodiment, but rather mean "one or more, but not all, embodiments," unless otherwise specifically emphasized. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless otherwise specifically emphasized.

[0380] Through the above description of the embodiments, those skilled in the art will clearly understand that the embodiments of this application can be implemented in hardware, firmware, or a combination thereof. When implemented in software, the above functions can be stored in a computer-readable medium or transmitted as one or more instructions or code on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein communication media include any medium that facilitates the transfer of a computer program from one place to another. Storage media can be any available medium accessible to a computer. For example, but not limited to, computer-readable media can include RAM, ROM, electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible to a computer. Furthermore, any connection can suitably be a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium. As used in embodiments of this application, disks and discs include compact discs (CDs), laser discs, optical discs, digital video discs (DVDs), floppy disks, and Blu-ray discs, wherein disks typically magnetically copy data, while discs optically copy data using lasers. The combinations above should also be included within the scope of protection for computer-readable media.

[0381] In summary, the above descriptions are merely embodiments of this application and are not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, improvements, etc., made based on the disclosure of this application should be included within the scope of protection of this application.

Claims

1. A wireless communication method, characterized in that, include: The first data stream is precoded using a first precoding method to obtain a precoded data stream; wherein the first precoding is obtained based on a preset first precoding sequence of length N, and the first precoding sequence is the one with the largest energy ratio among multiple precoding sequences of length N; or the first precoding is based on a preset size of... The first precoding matrix is ​​obtained from multiple precoding matrices of size 1. The precoding matrix with the largest energy ratio has P and Q as integers greater than 0, and the product of P and Q equals N, where N is an integer greater than 0. The precoded data stream is transmitted using N antennas.

2. The method according to claim 1, characterized in that, The size is The precoding matrix satisfies the following formula: in, The size is The precoding matrix, for The transpose of the matrix, Let P be a precoded sequence of length P. P represents a precoded sequence of length Q, where the product of P and Q equals the number of antennas, and both P and Q are positive integers greater than 0.

3. The method according to claim 1, characterized in that, The size is The energy ratio of the precoding matrices satisfies the following formula: in, Given a precoding matrix of size P×Q, for The norm square value, For the precoding matrix The value located in row p and column q.

4. The method according to claim 1, characterized in that, Each of the precoded sequences of length N is obtained based on the characteristic polynomial of the precoded sequence of length N.

5. The method according to claim 4, characterized in that, The characteristic polynomial of the precoded sequence of length N satisfies the following formula: in, , representing the root radius, , represents the N-1th degree root of unity, b In the set B, c is an element of set C, set B is a subset of set A, set C is the complement of set B, set A = {0, 1, ..., N-2}, N represents the sequence length, e is the euler's number, i is the imaginary unit, and K is a non-zero constant used to normalize the precoded sequence of length N.

6. The method according to claim 1, characterized in that, The energy ratio of the precoded sequence of length N satisfies the following formula: in, This represents a precoded sequence of length N. k N represents the number of antennas.

7. The method according to claim 1 or 2, characterized in that, when At that time, the first precoding matrix satisfies the following formula: in, for transpose matrix, The first precoded sequence is of length 4. The first precoded sequence is of length 8.

8. The method according to claim 1 or 2, characterized in that, when At that time, the first precoding matrix satisfies the following formula: in, for transpose matrix, The first precoded sequence is of length 4. The first precoded sequence is of length 16.

9. The method according to claim 1 or 2, characterized in that, When P×Q=8×16, the first precoding matrix satisfies the following formula: in, for The transpose of the matrix, The first precoded sequence is of length 8. The first precoded sequence is of length 16.

10. The method according to claim 1 or 4, characterized in that, When N is 4, the first precoding sequence is the first sequence or the first precoding sequence is the conjugate inversion of the first sequence; The first sequence satisfies the following sequence: A [0.802926,-0.363904+0.630299i,-0.564463-0.977678i,-1.24545+9.06431E-16i]; Where A is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

11. The method according to claim 1 or 4, characterized in that, When N is 8, the first precoding sequence is the second sequence or the first precoding sequence is the conjugate inversion of the second sequence; The second sequence satisfies the following sequence: B [0.862959,-0.608268+0.40355i,0.671941+0.240793i,-1.39612+0.224078i, -0.170289-0.602021i,0.57998-1.08727i,-0.816799-0.541898i,-1.1588+1.73594E-15i]; Where B is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

12. The method according to claim 1 or 4, characterized in that, When N is 16, the first precoding sequence is the third sequence or the first precoding sequence is the conjugate inversion of the third sequence; The third sequence satisfies the following sequence: C [0.911842, 0.744996-0.113883i, -0.0654774-0.179596i, -0.651775-0.944747i, -0.670119-0.19198i, 0.186435+1.22397i, -0.719419+1.06779i, -1.00355+0.447137i, -0.473356-0.874311i, -1.18884+0.383784i, 0.307512+0.407312i, 0.0889852-1.31655i, -0.0450766+1.07512i, -0.793708-0.00780988i,0.896014+0.136968i, -1.09668+8.36758E-16i]; Where C is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

13. A wireless communication device, characterized in that, include: Transceiver module and processing module; The processing module is used to precode the first data stream using a first precoding method to obtain a precoded data stream; wherein the first precoding is obtained based on a preset first precoding sequence of length N, and the first precoding sequence is the one with the largest energy ratio among multiple precoding sequences of length N; or the first precoding is based on a preset size of The first precoding matrix is ​​obtained from multiple precoding matrices of size 1. The precoding matrix with the largest energy ratio has P and Q as integers greater than 0, and the product of P and Q equals N, where N is an integer greater than 0. The transceiver module is used to transmit the precoded data stream using N antennas.

14. The apparatus according to claim 13, characterized in that, The size is The precoding matrix satisfies the following formula: in, The size is The precoding matrix, for The transpose of the matrix, Let P be a precoded sequence of length P. PQ represents a precoded sequence of length Q, where the value of PQ equals the number of antennas, and both P and Q are positive integers greater than 0.

15. The apparatus according to claim 13, characterized in that, The size is The energy ratio of the precoding matrices satisfies the following formula: in, Given a precoding matrix of size P×Q, for The norm square value, For the precoding matrix The value located in row p and column q.

16. The apparatus according to claim 13, characterized in that, Each of the precoded sequences of length N is obtained based on the characteristic polynomial of the precoded sequence of length N.

17. The apparatus according to claim 16, characterized in that, The characteristic polynomial of the precoded sequence of length N satisfies the following formula: in, , representing the root radius, , represents the N-1th degree root of unity, b In the set B, c is an element of set C, set B is a subset of set A, set C is the complement of set B, set A = {0, 1, ..., N-2}, N represents the sequence length, e is the euler's number, i is the imaginary unit, and K is a non-zero constant used to normalize the precoded sequence of length N.

18. The apparatus according to claim 13, characterized in that, The energy ratio of the precoded sequence of length N satisfies the following formula: in, This represents a precoded sequence of length N. k N represents the number of antennas.

19. The apparatus according to claim 13 or 14, characterized in that, when At that time, the first precoding matrix satisfies the following formula: in, for transpose matrix, The first precoded sequence is of length 4. The first precoded sequence is of length 8.

20. The apparatus according to claim 13 or 14, characterized in that, when At that time, the first precoding matrix satisfies the following formula: in, for transpose matrix, The first precoded sequence is of length 4. The first precoded sequence is of length 16.

21. The apparatus according to claim 13 or 14, characterized in that, When P×Q=8×16, the first precoding matrix satisfies the following formula: in, for The transpose of the matrix, The first precoded sequence is of length 8. The first precoded sequence is of length 16.

22. The apparatus according to claim 13 or 16, characterized in that, When N is 4, the first precoding sequence is the first sequence or the first precoding sequence is the conjugate inversion of the first sequence; The first sequence satisfies the following sequence: A [0.802926,-0.363904+0.630299i,-0.564463-0.977678i,-1.24545+9.06431E-16i]; Where A is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

23. The apparatus according to claim 13 or 16, characterized in that, When N is 8, the first precoding sequence is the second sequence or the first precoding sequence is the conjugate inversion of the second sequence; The second sequence satisfies the following sequence: B [0.862959,-0.608268+0.40355i,0.671941+0.240793i,-1.39612+0.224078i, -0.170289-0.602021i,0.57998-1.08727i,-0.816799-0.541898i,-1.1588+1.73594E-15i]; Where B is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

24. The apparatus according to claim 13 or 16, characterized in that, When N is 16, the first precoding sequence is the third sequence or the first precoding sequence is the conjugate inversion of the third sequence; The third sequence satisfies the following sequence: C [0.911842, 0.744996-0.113883i, -0.0654774-0.179596i, -0.651775-0.944747i, -0.670119-0.19198i, 0.186435+1.22397i, -0.719419+1.06779i, -1.00355+0.447137i, -0.473356-0.874311i, -1.18884+0.383784i, 0.307512+0.407312i, 0.0889852-1.31655i, -0.0450766+1.07512i, -0.793708-0.00780988i,0.896014+0.136968i, -1.09668+8.36758E-16i]; Where C is a non-zero constant, E is the scientific notation symbol, and i is the imaginary unit. It is a multiplication sign.

25. A communication device, characterized in that, The device includes a processor and a communication interface; The communication interface is used to receive code instructions and transmit them to the processor; the processor executes the code instructions to perform the method as described in any one of claims 1 to 12.

26. A chip, characterized in that, The chip includes at least one processor and a transceiver, the transceiver and the at least one processor being interconnected via a line, the processor executing instructions to perform the method according to any one of claims 1 to 12.

27. A computer-readable storage medium, characterized in that, A computer program is stored that, when run on a processor, causes the method described in any one of claims 1 to 12 to be executed.

28. A computer program product, characterized in that, Includes a computer program that, when run on a computer, causes the method as described in any one of claims 1 to 12 to be performed.

Images