CN116248154A

CN116248154A - Wireless communication method and device

Info

Publication number: CN116248154A
Application number: CN202111484357.8A
Authority: CN
Inventors: 顾执; 刘辰辰; 周正春; 唐小虎
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2021-12-07
Filing date: 2021-12-07
Publication date: 2023-06-09
Also published as: WO2023103799A1

Abstract

A method and apparatus of wireless communication, the method comprising: firstly, precoding a first data stream by utilizing first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0; and then using N antennas to transmit the precoded data streams. The method can simplify the communication device for realizing the omnidirectional precoding on the basis of realizing the omnidirectional precoding.

Description

Wireless communication method and device

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a method and an apparatus for wireless communications.

Background

In wireless communication systems, such as fourth generation (fourth generation, 4G) and fifth generation (5G) wireless communication systems, new radio access technology (new radio access technology, NR) systems, a large-scale multiple-input multiple-output (Massive multiple input multiple output, massive MIMO) technology can significantly improve the spectral efficiency and energy efficiency of the system by simultaneously serving multiple users within a coverage cell by arranging a large-scale antenna array (tens or even hundreds of antennas) on the base station side. In the data transmission process, the Massive MIMO technology can provide high quality service to specific users through directional beam forming, while transmission of common signals (such as signaling broadcasting and digital video broadcasting) needs to cover the whole cell, and in order to reduce configuration cost and improve Massive MIMO overall gain, multiple low-power-consumption antennas need to be used simultaneously to transmit broadcast information.

In addition, in MIMO communication, in order to compensate for the problem in channel transmission and reduce the error rate of signal transmission, it is generally necessary to perform preprocessing and retransmission on a signal or a data stream transmitted by a transmitter or to perform preprocessing and retransmission on a signal or a data stream received by a receiver. Specifically, in the transmitter, a data stream to be transmitted may be subjected to space-time coding to form a plurality of information substreams, and then the plurality of information substreams are subjected to omnidirectional precoding processing to obtain a plurality of data substreams; finally, the plurality of data substreams are transmitted from a plurality of antennas. In the receiver, the multiple data substreams may be received using multiple antennas, then decoded and space-time coded to separate the multiple data substreams for optimal processing. However, in the transmitter or the receiver, when the number of columns of the coding sequence used in the omni-directional precoding of the uniform linear array (Uniform Linear Array, ULA) is larger, or the number of columns of the coding matrix used in the omni-directional precoding of the uniform rectangular array (Uniform Rectangular Array, ULA) is larger, the order of the space-time coding required correspondingly is larger, thus making the structure of the designed transmitter or receiver more complicated.

Therefore, it is needed to propose a wireless communication method, which can simplify the communication device for implementing the omni-directional precoding.

Disclosure of Invention

A method and apparatus for wireless communication can simplify a communication apparatus that implements omni-directional precoding.

In a first aspect, the present application provides a method of wireless communication, the method being particularly applicable to a first communication device and/or a first product. Alternatively, the first communication device and/or the product may be a device and/or a product having a transmitting function.

By way of example, the first communication device may include, but is not limited to, a communication server, a router, a switch, a bridge, a computer, a wireless Access Point (AP) communication device such as a cell phone, and a Station (STA) communication device. The communication device may in particular comprise a transceiver, a processor, optionally a precoder and a memory.

Therefore, the method for providing wireless communication according to the embodiment of the present application may be performed by the first communication device and/or the processor of the first product, or may be performed by a chip corresponding to the processor, which is not limited thereto. The method specifically comprises the following steps: precoding the first data stream by using first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0; the precoded data streams are transmitted using N antennas.

With this embodiment, the transmitting side may perform precoding processing on the first data stream to be transmitted by using first precoding to obtain an encoded data stream, and then transmit the precoded data using N antennas, where N is an integer greater than 0. The design specifically for the first precoding includes: in the case of an omni-directional precoding of a uniform linear array (Uniform Linear Array, ULA), the first precoding may be configured according to a first coding sequence of length N, and in the case of an omni-directional precoding of a uniform rectangular array (Uniform Rectangular Array, ULA), the first precoding may be configured according to a first precoding matrix of size p×q. Therefore, in the design of the application, the data stream to be transmitted can be directly precoded by the first precoding and then transmitted through the antenna, so that the omni-directional precoding of the ULA and the URA can be realized, and the structure of the communication device is simplified.

In one possible implementation, the first precoding matrix is the largest energy ratio among a plurality of precoding matrices of size p×q.

According to the embodiment, the precoding matrix with the largest energy ratio is selected from a plurality of precoding matrixes with the size of P multiplied by Q as the first precoding matrix, so that the stability of data stream after the first precoding processing transmitted through N antennas can be ensured to the greatest extent.

In one possible implementation, the precoding matrix of size p×q satisfies the following formula:

wherein H' is a precoding matrix of size PxQ,

is H _P Transposed matrix of (H) _P For a precoding sequence of length P, H _Q The precoding sequence with length Q is represented, the product of P and Q is equal to the number of antennas, and P and Q are positive integers greater than 0.

By the embodiment, a plurality of precoding matrixes to be selected can be obtained, and a proper first precoding matrix can be determined from the plurality of precoding matrixes to be selected, so that the first precoding obtained by the first precoding matrix can be ensured to be optimal.

In one possible implementation, the energy ratio of the p×q precoding matrix satisfies the following formula:

wherein H' is a precoding matrix of size PxQ,

is the norm square value of the matrix H ', H' _p,q The number of columns is q, and the number of rows is p in the precoding matrix H'.

Through the formula in the embodiment, the energy ratio of each precoding matrix can be accurately and effectively obtained, and then an appropriate precoding matrix can be selected according to the energy ratio of each precoding matrix, so that the obtained first precoding is ensured to be optimal.

In one possible embodiment, the first precoding sequence is the largest energy ratio among a plurality of length N precoding sequences.

According to the embodiment, the precoding matrix with the largest energy ratio is selected from a plurality of precoding sequences with the length of N to serve as the first precoding matrix, so that the stability of data streams after the first precoding processing transmitted through N antennas can be ensured to the greatest extent.

In one possible embodiment, each of the length-N precoding sequences is derived from a characteristic polynomial of the length-N precoding sequence. With this embodiment, a plurality of precoding sequences of length N can be efficiently obtained by the characteristic polynomial of the precoding sequence of length N.

In one possible implementation, the characteristic polynomial of the length N precoding sequence satisfies the following formula:

wherein ,

represents root radius>

Representing N-1 times the unit root, B being an element in set B, C being an element in set C, the set B being a subset of set a, the set C being a complement of set B, the set a= {0,1, …, N-2}, N representing the sequence length, e being a natural constant (euler's number), i being an imaginary unit, K being a constant not equal to 0, the K being used for normalizing the precoding sequence of length N. By this embodiment, a formula specifically satisfied by the characteristic polynomial of the precoding sequence having the length N can be known, and thus the above-described plurality of precoding sequences having the length N can be effectively obtained by referring to the formula.

In one possible embodiment, the energy ratio of the length N precoding sequence satisfies the following formula:

where H denotes a precoding sequence of length N, h= [ H ] ₀ ,H ₁ ,…,H _N-1 ]K epsilon (0, 1, …, N-1), N representing the number of antennas.

According to the embodiment, the energy ratio of each precoding sequence can be accurately and effectively obtained, and further, a proper precoding sequence can be selected according to the energy ratio of each precoding sequence, so that the obtained first precoding is optimal.

In one possible implementation, when pxq=4×8, the first precoding matrix satisfies the following formula:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₈ Is a first precoding sequence of length 8.

With this embodiment, 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, and the first precoding matrix can implement the optimal omni-directional precoding of the URA.

In one possible implementation, when pxq=4×16, the first precoding matrix satisfies the following formula:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₁₆ Is a first precoding sequence of length 16.

With this embodiment, 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, and the first precoding matrix can implement the optimal omni-directional precoding of the URA.

In one possible implementation, when pxq=8×16, the first precoding matrix satisfies the following formula:

wherein ,

is H ₈ Transposed matrix of (H) ₈ H is a first precoding sequence of length 8 ₁₆ Is a first precoding sequence of length 16.

With this embodiment, 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, and the first precoding matrix can implement the optimal omni-directional precoding of the URA.

In one possible embodiment, when N is 4, the first pre-coding sequence is a first sequence or the first pre-coding sequence is a conjugated reverse order 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]；

Wherein A is a constant which is not equal to 0, E is a scientific counting method symbol, i is an imaginary number unit, and x is a multiplication number.

With this embodiment, when the length of the first precoding sequence is 4, that is, the number of antennas is 4, a specific first sequence is determined, and the first sequence is regarded as the first precoding sequence. Since the conjugated reverse order of the first sequence does not affect the nature of the sequence, the conjugated reverse order of the first sequence can also be used as the first precoding sequence, so that the first precoding sequence can realize optimal omni-directional precoding of ULA.

In one possible embodiment, when N is 8, the first precoding sequence is a second sequence or the first precoding sequence is a conjugated reverse order 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]；

wherein B is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

With this embodiment, when the length of the first precoding sequence is 8, that is, the number of antennas is 8, a specific second sequence is determined, and the second sequence is used as the first precoding sequence. Since the conjugated reverse order of the second sequence does not affect the nature of the sequence, the conjugated reverse order of the second sequence can also be used as the first precoding sequence, so that the first precoding sequence can realize optimal omni-directional precoding of ULA.

In one possible embodiment, when N is 16, the first precoding sequence is a third sequence or the first precoding sequence is a conjugate inverse 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.71949+1.06779i, -1.00355+0.4477137i, -0.473356-0.874311i, -1.18884+0.383784i,0.307512+0.407312i,0.0889852-1.31655i, -0.0450766+1.07512i, -0.793708-0.007809988 i,0.896014+0.136968i, -1.09668+8.367558e-16 i ]; wherein, C is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

With this embodiment, when the length of the first precoding sequence is 16, that is, the number of antennas is 16, a specific third sequence is determined, and the third sequence is used as the first precoding sequence. Since the conjugated reverse order of the third sequence does not affect the nature of the sequence, the conjugated reverse order of the third sequence can also be used as the first precoding sequence, so that the first precoding sequence can realize optimal omni-directional precoding of ULA.

In a second aspect, the present application provides a communication device, which is applicable to the first communication device and/or the first product mentioned in the first aspect, where the first communication device and/or the first product may include: the device comprises a receiving and transmitting module and a processing module.

Optionally, the communication device further includes a separate pre-coding module and a storage module, where the pre-coding module may also be located in the transceiver, which is not limited in this application.

The processing module is used for carrying out precoding processing on the first data stream by utilizing first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0; the transceiver module is configured to send the precoded data stream using N antennas.

It should be noted that, in this design, the process of pre-encoding the data stream may also be implemented by a pre-encoding module, and the storage module may be used to store data and/or instructions.

In one possible design, the first precoding matrix is the largest energy ratio among a plurality of precoding matrices of size p×q.

In one possible design, the p×q precoding matrix satisfies the following formula:

wherein H' is a precoding matrix of size PxQ,

In one possible design, the energy ratio of the p×q precoding matrix satisfies the following formula:

wherein H' is a precoding matrix of size PxQ,

In one possible design, the first precoding sequence is the largest energy ratio among a plurality of length N precoding sequences.

In one possible design, each of the length-N precoding sequences is derived from a characteristic polynomial of the length-N precoding sequence.

In one possible design, the characteristic polynomial of the length N precoding sequence satisfies the following formula:

wherein ,

represents root radius>

Representing N-1 times the root of the unit, B being an element of set B, C being an element of set C, the set B being a subset of set a, the set C being a complement of the set B, the set a= {0,1, …, N-2}, N representing the sequence length, e being a natural constant (euler's number), i being an imaginary unit, K being a constant not equal to 0, the K being used for normalizing the precoding sequence of length N.

In one possible design, the energy ratio of the length N precoding sequence satisfies the following equation:

In one possible design, when pxq=4×8, the first precoding matrix satisfies the following formula:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₈ Is a first precoding sequence of length 8. />

In one possible design, when pxq=4×16, the first precoding matrix satisfies the following formula:

wherein ,

In one possible design, when pxq=8×16, the first precoding matrix satisfies the following formula:

wherein ,

In one possible design, when N is 4, the first pre-coding sequence is a first sequence or the first pre-coding sequence is the reverse order of the first sequence;

the first sequence satisfies the following sequence:

In one possible design, when N is 8, the first pre-coding sequence is a second sequence or the first pre-coding sequence is a conjugated reverse order of the second sequence;

the second sequence satisfies the following sequence:

In one possible design, when N is 16, the first pre-coding sequence is a third sequence or the first pre-coding sequence is the reverse order of the conjugate 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]；

wherein, C is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

In a third aspect, the present application also provides a communication device applicable to the first communication device and/or the first product mentioned in the first aspect, the communication device comprising a transceiver, a processor, a memory, and one or more programs; optionally, the communication device further includes a separate precoder, or the precoder is located in the transceiver, which is not limited in this application.

Wherein the one or more programs are stored in the memory, the one or more programs comprising instructions, which when executed by the processor, cause the communication device to perform the functions of the method of the first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, embodiments of the present application further provide a computer storage medium having stored therein a software program which, when read and executed by one or more processors, implements the method provided by the first aspect or any one of the possible implementations.

In a fifth aspect, the present application embodiment also provides a computer program product comprising a computer program which, when run on a computer, causes the method provided by the first aspect or any one of the possible embodiments to be performed.

In a sixth aspect, embodiments of the present application further provide a chip system, where the chip system includes a processor, and the processor is configured to support a client to implement the functions involved in the first aspect.

In one possible design, the chip system further includes a memory for storing necessary program instructions and data for execution by the loader. The chip system can be composed of chips, and can also comprise chips and other discrete devices.

The technical effects achieved by the second aspect or any possible implementation manner of the second aspect may be referred to the technical effects achieved by the first aspect or any possible implementation manner of the first aspect, and the detailed description is not repeated here.

Drawings

Fig. 1 is a schematic diagram of an application scenario to which a wireless communication method provided in an embodiment of the present application is applicable;

fig. 2 is a block diagram of a specific flow of transmitting data by a transmitter according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of an embodiment of a wireless communication method provided in the embodiments of the present application;

fig. 4 is a method flowchart of a wireless communication method provided in an embodiment of the present application;

FIG. 5A is a flow chart of a method for generating a first precoding provided in an embodiment of the present application;

FIG. 5B is a flowchart of another method for generating a first precoding provided in an embodiment of the present application;

fig. 6 is a schematic structural diagram of a wireless communication device according to an embodiment of the present application;

fig. 7 is a schematic structural diagram of a wireless communication device according to an embodiment of the present application.

Detailed Description

The embodiments of the present application provide a method and an apparatus for wireless communication, where the method and the apparatus are based on the same or similar technical ideas, and because the principles of solving the problems by the method and the apparatus are similar, the implementation of the apparatus and the method may be referred to each other, and the repetition is omitted.

In the following, some terms in the embodiments of the present application are explained first to facilitate understanding by those skilled in the art.

1) Antenna

The antenna according to the embodiments of the present application is a transducer that can transform a guided wave propagating on a transmission line into an electromagnetic wave transmitted in an unbounded medium (typically free space), or can inversely transform a guided wave propagating on a transmission line, i.e. a component that can be used to transmit or receive an electromagnetic wave in a radio device. In addition, in engineering systems such as radio communication, broadcasting, television, radar, navigation, electronic countermeasure, remote sensing, radio astronomy, etc., it is necessary to operate by means of an antenna when information is transmitted by electromagnetic waves. In addition, when energy is transmitted by electromagnetic waves, the use of antennas is also required for non-signal energy radiation. Typically antennas are reversible, i.e. the same pair of antennas can be used as both a transmitting antenna and a receiving antenna. And in reciprocal positioning of the antennas, the same antenna is identical as the basic characteristic parameter of transmission or reception.

The antennas may be classified as follows: if the antenna is according to the working property, the antenna can be divided into a transmitting antenna and a receiving antenna; antennas may be classified into communication antennas, broadcast antennas, television antennas, radar antennas, and the like according to the purpose. If antennas are classified into omni-directional antennas and directional antennas according to directions, etc. If the antenna is according to the working wavelength, the antenna can be divided into an ultra-long wave antenna, a medium wave antenna, a short wave antenna, an ultra-short wave antenna, a microwave antenna and the like. If the antenna is based on the structural form and the working principle, the antenna can be divided into a line antenna, a surface antenna and the like. In addition, characteristic parameters typically describing an antenna are pattern, directivity coefficient, gain, input impedance, radiation efficiency, polarization, and bandwidth.

The gain of the antenna is: the ratio of the power densities of the signals generated by the actual antenna and the ideal radiating element at the same point in space, with equal input power. It quantitatively describes the extent to which an antenna concentrates the input power. It is apparent that the gain of the antenna has a close relationship with the antenna pattern, the narrower the main lobe of the pattern, the smaller the side lobe, and the higher the gain.

The gain of an antenna is understood from a physical sense as: a signal of a certain magnitude is generated at a certain point over a certain distance, for example, if an ideal non-directional point source is used as a transmitting antenna, an input power of 100W is required, whereas if a directional antenna with a gain of g=13 db=20 is used as a transmitting antenna, only an input power of 100/20=5W is required. Therefore, the gain of an antenna amplifies the input power by a factor equal to the non-directional ideal point source in terms of the radiation effect in the maximum radiation direction.

2) Data stream (data stream)

The data stream referred to in this embodiment of the present application is a set of ordered data sequences of bytes having a start point and an end point. The data stream can be largely divided into an input stream and an output stream. Wherein the input stream can only be read and not written, and the output stream can only be written and not read. Typically, the program uses an input stream to read data and an output stream to write data as if the data were streamed into and out of the program. The use of data streams allows the input and output operations of the program to be independent of the associated devices.

It should be noted that, in the wireless communication method provided in the embodiment of the present application, the object to be precoded is mainly a data stream, and in practice, the precoded object may also be a signal, which is not specifically limited in this application.

3) Precoding

In the MIMO system, the precoding technique may perform preprocessing on data to be transmitted in baseband, so that data transmitted by the base station may be transmitted to users in a cell with more directionality.

Advantages of precoding include: 1. the signal processing is carried out in the base station, so that users can directly receive the data needed by the users, and the signal processing of the terminal equipment is avoided; 2. the pre-coding can make the signal sent by the base station have more directivity instead of pure radiation to the periphery, thereby enhancing the power of the signal received by the user, avoiding energy waste and improving the energy efficiency of the communication system.

In general, precoding can be classified into linear precoding and nonlinear precoding, and typical linear precoding is: maximum ratio transmission (maximum ratio transmission, MRT), zero Forcing (ZF) precoding, minimum mean square error (minimum mean square error, MMSE), etc.

If precoding is classified into codebook-based precoding and non-codebook-based precoding according to the characteristics of the precoding matrix set used for precoding. Codebook-based precoding refers to a set of a limited number of precoding matrices, and therefore, in codebook-based precoding, only the available precoding matrix can be selected from the codebook. In the precoding of the non-codebook method, the number of optional precoding matrices is not limited, and thus, the precoding matrices may be any matrices meeting the design rule and application condition limitation, and are not limited to be taken from a specific codebook.

4) The plural references in the embodiments of the present application refer to two or more. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship. In addition, it should be understood that in the description of this application, the words "first," "second," and the like are used merely for distinguishing between the descriptions and not for indicating or implying any relative importance or order.

5) The terms "comprising" and "having" and any variations thereof, as used in the description of embodiments of the present application, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed but may optionally include other steps or elements not listed or inherent to such process, method, article, or apparatus. It should be noted that, in the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.

The following is a brief description of the prior art MIMO technology.

Massive antenna array Massive MIMO technology is an important key technology in 5G mobile communication technology, which can effectively improve spectral efficiency and energy efficiency and smooth channel response through a simple transmission/reception structure. In the data transmission process, the Massive MIMO technology can provide a high quality service to a specific user through directional beam forming, but needs to cover the entire cell for transmission of a common signal (e.g., signaling broadcast, digital video broadcast).

Referring to fig. 1, a MIMO communication system to which a method for wireless communication according to an embodiment of the present application may be applicable is shown. As shown in fig. 1, the MIMO communication system 100 includes a network device 101 and a terminal device 102, where the network device 101 may be configured with multiple antennas, and the terminal device may be configured with multiple antennas. It should be appreciated that network device 101 may also include a number of components associated with signal transmission and reception (e.g., processors, modulators, encoders, multiplexers, demodulators, or demultiplexers, etc.). In the MIMO communication system 100, the network device 101 may communicate with the terminal device 102, and the network device 101 may also communicate with one or more terminal devices other than the terminal device 102. It should be understood that the network device 101 shown in fig. 1 may communicate with the terminal device 102, but this is merely illustrative of one possible scenario, and in some scenarios, the terminal device 102 may also communicate with the network device 101 and other network devices, as this application is not specifically limited.

In the Massive MIMO system, the network device 101 and the terminal device 102 may select a particular antenna to be used as a broadcast antenna, and since the antenna is selected to be transmitted as a broadcast, an expensive high-power amplifier needs to be equipped, and a large number of other normal antennas are put into a sleep mode during the broadcast. Therefore, a plurality of low-power-consumption antennas are used for transmitting broadcast signals at the same time, and the method has important significance for reducing cost and improving Massive MIMO overall gain.

As an example, the network device 101 may transmit signals or data through a plurality of configured antennas, and the terminal device 102 may also receive signals or data transmitted by the network device 101 through a plurality of configured antennas. To compensate for the problems in channel transmission to reduce the bit error rate of signal transmission, network device 101 is typically required to pre-process the transmitted signal or data stream, such as omni-directional precoding.

The current omni-directional precoding mainly comprises an omni-directional precoding scheme of a uniform linear array (Uniform Linear Array, ULA) and an omni-directional precoding scheme of a uniform rectangular array (Uniform Rectangular Array, ULA), and although the omni-directional precoding scheme can be realized by the two modes, in the omni-directional precoding scheme of the ULA, the length of a precoding sequence used in a precoder is equal to the order of space-time coding, so that the more the length of the precoding sequence, the more the corresponding order of space-time coding is needed, thereby complicating the structure of a transceiver of a terminal device. Similarly, in the omni-directional precoding scheme of URA, the more precoding matrices are needed in the precoding matrix, the more space-time coding orders are needed correspondingly, so that the structure of the transceiver of the terminal device is more complex.

Accordingly, a method of wireless communication is provided, the method comprising: firstly, precoding a first data stream by utilizing first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0; and finally, using N antennas to transmit the precoded data streams. The method can simplify the communication device for realizing the omnidirectional precoding on the basis of realizing the omnidirectional precoding.

It should be understood that fig. 1 is a simplified schematic diagram for ease of understanding only, and that other network devices or other terminal devices may be further included in the MIMO communication system 100, which are not shown in fig. 1. In the embodiment of the present application, different base stations may be base stations with different identifiers, or may be base stations with the same identifier and deployed in different geographic locations. Because the base station does not know whether it will relate to the scenario in which the embodiments of the present application are applied before the base station is deployed, the base station, or the baseband chip, should support the methods provided by the embodiments of the present application before deployment. It will be appreciated that the aforementioned base stations with different identities may be base station identities, cell identities or other identities.

It should be noted that fig. 1 is a possible scenario applicable to the application implementation of the method for providing a wireless communication, and therefore, the first communication device and/or the first product to which the method of the embodiment of the present application is applicable may be a network device or a terminal device. When the network device sends the encoded data stream to the terminal device, the first communication means is a network device, such as a base station; when the terminal device sends the encoded data stream to the network device, the first communication apparatus is the terminal device.

It should be noted that a method of wireless communication provided in the present application may be applied to various types of communication systems, where the communication system provided in the present application may be, for example, a long term evolution (long term evolution, LTE) system supporting a 4G access technology, a New Radio (NR) system supporting a 5G access technology, any cellular system related to the third generation partnership project (3rd generation partnership project,3GPP), a wireless-fidelity (WiFi) system, a worldwide interoperability for microwave access (worldwide interoperability for microwave access, wiMAX) system, a multiple radio access technology (Radio Access Technology, RAT) system, or other future-oriented communication technologies. For example, it may be an internet of things (internet of things, ioT) system, a narrowband internet of things (narrow band internet of things, NB-IoT) system, a long term evolution (long term evolution, LTE) system, a fifth generation (5G) communication system, an LTE and 5G hybrid architecture, an NR system, and a new communication system (e.g., a 6G mobile communication system), an internet of vehicles (vehicle to everything, V2X) communication system, etc. that occur in future communication development. The application is applicable to 5G NR frequency division duplex (Frequency Division Duplexing, FDD) MIMO systems, 5G NR time division duplex (Time Division Duplexing, TDD) MIMO systems.

The terminal device and the network device of the present application are described below.

The terminal device according to the embodiments of the present application may also be referred to as a User Equipment (UE), a mobile station, a mobile terminal, or the like. The terminal may be widely applied to various scenes, for example, device-to-device (D2D), vehicle-to-device (vehicle to everything, V2X) communication, machine-type communication (MTC), internet of things (internet of things, IOT), virtual reality, augmented reality, industrial control, autopilot, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, and the like. The terminal can be a mobile phone, a tablet personal computer, a computer with a wireless receiving and transmitting function, a wearable device, a vehicle, an unmanned aerial vehicle, a helicopter, an airplane, a ship, a robot, a mechanical arm, intelligent household equipment and the like. The embodiment of the application does not limit the specific technology and the specific equipment form adopted by the terminal.

The network device referred to in the embodiments of the present application may be a device in a wireless network. For example, the network device may be a device deployed in a radio access network to provide wireless communication functionality for terminal devices. For example, the network device may be a radio access network (radio access network, RAN) node, also referred to as access network device, that accesses the terminal device to the wireless network.

Network devices include, but are not limited to: an evolved Node B (eNB), a radio network controller (radio network controller, RNC), a Node B (Node B, NB), a base station controller (base station controller, BSC), a base transceiver station (base transceiver station, BTS), a home base station (home evolved NodeB, or home Node B, HNB, for example), a baseband unit (BBU), an Access Point (AP) in a wireless fidelity (wireless fidelity, WIFI) system, a wireless relay Node, a wireless backhaul Node, a transmission point (transmission point, TP), or a transmission reception point (transmission and reception point, TRP), etc., may also be a network device in a 5G mobile communication system. For example, next generation base stations (gNB) in NR systems, transmission reception points (transmission reception point, TRP), TP; or one or a group (including a plurality of antenna panels) of base stations in a 5G mobile communication system; alternatively, the network device may also be a network node constituting a gNB or a transmission point. Such as a BBU, or a Distributed Unit (DU), etc.

In some deployments, the gNB may include a Centralized Unit (CU) and DUs. The gNB may also include an active antenna unit (active antenna unit, AAU). The CU implements part of the functionality of the gNB and the DU implements part of the functionality of the gNB. For example, the CU is responsible for handling non-real time protocols and services, implementing the functions of the radio resource control (radio resource control, RRC), packet data convergence layer protocol (packet data convergence protocol, PDCP) layer. The DU is responsible for handling physical layer protocols and real-time services, and implements functions of a radio link control (radio link control, RLC), MAC, and Physical (PHY) layers. The AAU realizes part of physical layer processing function, radio frequency processing and related functions of the active antenna. The information of the RRC layer may eventually become information of the PHY layer or may be converted from the information of the PHY layer. Under this architecture, higher layer signaling (e.g., RRC layer signaling) may also be considered to be sent by DUs, or by DUs and AAUs. It is understood that the network device may be a device comprising one or more of a CU node, a DU node, an AAU node. In addition, the CU may be divided into network devices in the RAN, or may be divided into network devices in a Core Network (CN), which is not limited in this application.

It should be noted that, in the embodiments of the present application, the terminal device and the network device may be fixed or movable. Terminal devices and network devices may be deployed on land, including indoor or outdoor, hand-held or vehicle-mounted; the device can be deployed on the water surface; but also on aerial planes, balloons and satellites. The embodiment of the application does not limit the application scene of the network equipment and the terminal equipment.

Embodiments are directed to omni-directional precoding for a uniform antenna array using a single sequence or matrix without using space-time coding. Therefore, in order to facilitate understanding of the technical solutions of the embodiments of the present application, the following description will describe the omni-directional precoding technology with respect to the scenarios of ULA and URA.

(one), omnidirectional radiation for ULA under single pre-coding sequence.

A specific flow of transmitting data by the transmitter may be shown with reference to fig. 2, where the ULA includes M antennas, and considering a large-scale fading channel model, a data stream to be transmitted may directly enter a precoder without space-time coding, where the precoder is configured according to a precoding sequence W with a length M, where the precoding sequence with a length M is denoted as W, and M is an integer greater than 0.

Under large scale fading, the antenna radiation gains of different azimuth angles can satisfy the following formula:

/>

where a (θ) is the antenna radiation gain for different azimuth angles, θ is the azimuth angle,

d is the antenna spacing, λ is the wavelength, e is the natural constant (euler's number), and j is the imaginary unit.

The precoding gains for different azimuth angles may satisfy the following formula:

|h(θ)| ² ＝|W ^H a(θ)| ² ,

wherein the pre-code sequence W has unit energy, i.e. W ^H W=1, the W ^H Is the transposed matrix of W.

Precoding gains for different azimuth angles are defined in theorem 1 in the art, and are determined by aperiodic correlations of precoding vectors. That is, the theorem 1 satisfies the following formula:

wherein, |h (θ) | ² Precoding gains representing different azimuth angles, a (θ) representing antenna radiation gains of different azimuth angles, ρ _W (tau) represents an aperiodic autocorrelation function,

θ is azimuth, d is antenna pitch, λ is wavelength, W is precoding sequence, M is number of antennas, k represents number of precoding vectors in the precoder, e is natural constant, and i is imaginary unit.

As can be seen from the above equation of theorem 1, when ρ _W When (τ) =0, the precoding gain can be made independent of azimuth, so that the precoding can be guaranteed to have the same energy in different directions. Thus, implementation of single-sequence omni-directional precoding is equivalent to determining a precoding sequence with ideal aperiodic correlation, i.e., determining the precoding sequence W _k To make it non-periodic autocorrelation function ρ _W (τ) =0, when τ+.0.

(II) URA omni-directional radiation for single precoding arrays (Array).

A specific flow of data transmitted by the transmitter may be shown with reference to fig. 2, where the URA includes M antennas, M is an integer greater than 0 and m=p×q. Considering a large-scale fading channel model, a data stream to be transmitted can directly enter a precoder without space-time coding, wherein the precoder is configured by a precoding matrix, the precoding matrix is marked as W, the size of the precoding matrix W is P multiplied by Q, namely the precoding matrix W is a matrix of P rows and Q columns.

Under large scale decline, different azimuth angles theta and pitch angles

The antenna radiation gain of (a) satisfies the following formula:

wherein ,

representing different azimuth angles θ, pitch angles +.>

P=1, 2, …, P; q=1, 2, …, Q; theta E [0,2 pi ]],/>

λ is the wavelength, and j is the imaginary unit.

Under large scale decline, different azimuth angles theta and pitch angles

The precoding gain of (a) satisfies the following equation:

the precoding gains of different azimuth angles and pitch angles satisfy the following formulas:

wherein the precoding matrix W has unit energy, i.e

Representing the norm square of the precoding matrix W.

Precoding gains for different azimuth angles and pitch angles are defined in theorem 2 in the art and are determined by aperiodic correlations of the precoding matrix. That is, the theorem 2 satisfies the following formula:

wherein ,

representing different azimuth angles θ, pitch angles +.>

Pre-coding gain,/, of (2)>

W is a precoding matrix, & lt- & gt>

Representing an aperiodic autocorrelation function, e being a natural constant.

As can be seen from the above equation of theorem 2, when ρ _W When (τ) =0, the precoding gain can be made independent of azimuth angle and pitch angle, so that the precoding can be ensured to have the same energy in different directions. Thus, implementation of single Array (Array) omni-directional precoding is equivalent to determining a precoding Array (Array) with ideal aperiodic correlation, i.e., determining a precoding matrix W of size p×q to have its aperiodic autocorrelation function

When->

τ≠0。

The following describes the technical scheme of the present application in connection with specific embodiments.

Fig. 3 is a schematic structural diagram of an embodiment of a wireless communication method according to an embodiment of the present application. Referring to fig. 3, a first data stream to be transmitted is subjected to precoding processing by a first precoder and then sent out. The method of this embodiment may be applicable to the first communication device and/or the first product. Alternatively, the first communication device and/or the product may be a device and/or a product having a transmission/emission function.

By way of example, the first communication device may include, but is not limited to, a communication server, a router, a switch, a bridge, a computer, a wireless Access Point (AP) communication device such as a cell phone, and a Station (STA) communication device. The first communication means may in particular comprise a transceiver, which may be used for transmission/reception of said packet structure, a processor. The processor may be configured to parse the signaling information and process the related data. The memory may be used for storing signaling information, pre-set values agreed in advance, etc.

Optionally, the first communication device may further comprise 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 a transceiver of the first communication device, which is not limited in this application.

Thus, the method of the present application will be specifically described by taking the first communication device as an example. Referring to fig. 4, the specific method flow of this embodiment is as follows:

s401: the first communication device performs precoding processing on the first data stream by using the first precoding to obtain a precoded data stream.

Specifically, a first data stream to be sent is determined, and precoding processing is performed on the first data stream by using first precoding through a processor in a first communication device, so as to obtain a precoded data stream; or inputting the first data stream to be transmitted to a precoder in the first communication device, wherein the precoder performs precoding processing on the first data stream, and the precoder outputs the precoded data stream.

Alternatively, the first pre-coding may be configured in a separate pre-coder, i.e. the first data stream is input to the pre-coder, and the pre-coder outputs the coded data stream, and the pre-coder is configured according to the first pre-coding.

In one embodiment, the first precoding is obtained according to a first precoding sequence of a predetermined length N, or the first precoding is obtained according to a first precoding matrix of a predetermined size p×q, P and Q are integers greater than 0 and the product of P and Q is equal to N, where N is an integer greater than 0.

As an example, in the embodiments of the present application, first precoding sequences corresponding to several different numbers of antennas are determined. Specifically, the following may be included:

When N is 4, the first precoding sequence is denoted as H ₄ I.e. the first pre-code sequence H ₄ Is the first sequence. Since the conjugate inverse of the first sequence does not affect the sequence properties, the first pre-code sequence H ₄ The first sequence may also be the reverse of the conjugate sequence.

The first sequence specifically satisfies the following sequence:

The first pre-coding sequence H ₄ Corresponds to the set b= {0,2}. The energy ratio corresponding to the first precoding sequence is: 2.5788.

when N is 8, the first precoding sequence is denoted as H ₈ I.e. the first pre-code sequence H ₈ Is the second sequence. Since the conjugate inverse of the second sequence does not affect the sequence properties, the first pre-code sequence H ₈ The second sequence may also be the reverse of the conjugate sequence.

The second sequence satisfies the following sequence:

The first pre-coding sequence H ₈ Corresponds to the set b= {0,2,5,6}. The first pre-coding sequence H ₈ The corresponding energy ratio is: 4.0013.

when N is 16, the first precoding sequence is denoted as H ₁₆ I.e. the first pre-code sequence H ₁₆ Is the third sequence. Since the reverse order of the conjugation of the third sequence does not affect the nature of the sequenceThus, the first pre-code sequence H ₁₆ The third sequence may be the reverse of the conjugation.

The third sequence satisfies the following sequence:

The first pre-coding sequence H ₁₆ Corresponds to the set b= {0,2,5,6,7,8,10,11}. The first pre-coding sequence H ₁₆ The corresponding energy ratio is: 9.1889.

when N is 32, the first precoding sequence is denoted as H ₃₂ I.e. the first pre-code sequence H ₃₂ Is the fourth sequence. Since the conjugate inverse of the fourth sequence does not affect the sequence properties, the first pre-code sequence H ₃₂ The fourth sequence may be the reverse conjugated sequence.

The fourth sequence satisfies the following sequence:

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.519017-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.318858-0.250833i,0.341557+0.231721i,-0.929152-0.238287i,0.522734+1.18713i,0.891176+0.128904i,-0.539493-0.857896i,0.27286+0.353311i,-1.32764+0.13279i,1.08168+0.0915187i,-0.757427+0.221305i,1.18934-0.190821i,-1.05747+2.09002E-15i]；

wherein D is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

The first pre-coding sequence H ₃₂ Corresponds to the set b= {1,5,7,9,12,13,14,15,16,17,18,20,21,24,25,26}. The first pre-coding sequence H ₃₂ The corresponding energy ratio is: 17.3471.

when N is 64, the first precoding sequence is denoted as H ₆₄ I.e. the first pre-code sequence H ₆₄ Is the fifth sequence. Since the conjugate reverse order of the fifth sequence does not affect the sequence property, the first pre-coding sequence H ₆₄ The fifth sequence may be the reverse conjugated sequence.

The fifth sequence satisfies the following sequence:

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.519017-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.318858-0.250833i,0.341557+0.231721i,-0.929152-0.238287i,0.522734+1.18713i,0.891176+0.128904i,-0.539493-0.857896i,0.27286+0.353311i,-1.32764+0.13279i,1.08168+0.0915187i,-0.757427+0.221305i,1.18934-0.190821i,-1.05747+2.09002E-15i]；

wherein F is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

The first pre-coding sequence H ₆₄ The following is satisfied for the above set B:

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 pre-coding sequence H ₆₄ The corresponding energy ratio is: 26.0258.

when N is 128, the first precoding sequence is denoted as H ₁₂₈ I.e. the first pre-code sequence H ₁₂₈ The sixth sequence. Since the conjugate reverse order of the sixth sequence does not affect the sequence properties, the first pre-code sequence H ₁₂₈ The sixth sequence may be the reverse conjugated sequence.

The sixth sequence satisfies the following sequence:

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.548694i,-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.0658161+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.361581i,-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.621963+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.0934339-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.36426i,0.74394+0.850261i,-0.224503-0.37255i,0.305183+1.42829i,-0.580736-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.00924226i,-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.359556i,-0.743009-1.37109i,0.90575+0.37929i,0.49894-0.712457i,0.706872-0.437825i,-0.0313725+0.457232i,0.616029-0.332859i,0.34089+0.27738i,-0.400266+0.512784i,1.0743+0.485306i,-0.436375+0.220078i,-0.28041+0.467881i,0.0528504+0.511448i,0.0766431-0.163176i,-0.107315+0.233298i,-0.465062+0.269715i,0.391088-0.223261i,-0.981079-1.79994E-14i]；

wherein G is a constant not equal to 0, E is a scientific counting symbol, i is an imaginary unit, and x is a multiplier.

The first pre-coding sequence H ₁₂₈ The following is satisfied for the above set B:

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}. The first pre-coding sequence H ₁₂₈ The corresponding energy ratio is: 40.5286.

when N is 256, the first precoding sequence is denoted as H ₂₅₆ I.e. the first pre-code sequence H ₂₅₆ A seventh sequence. Since the conjugate reverse order of the seventh sequence does not affect the sequence property, the first pre-coding sequence H ₂₅₆ The seventh sequence may be the reverse conjugated sequence.

The seventh sequence satisfies the following sequence:

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.181825i,0.14745-1.14591i,0.814312-0.0882376i,0.496977+0.625019i,-0.834182-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.0474243i,-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.29661-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.510544i,-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.37312-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.41102i,-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.97846i,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.379155i,-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.147074+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.73065i,-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.496084-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.365295i,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.604578i,1.04132+1.10964i,-0.771246-1.76931i,0.302422+1.48506i,0.611912-0.0680079i,-1.15302-0.282761i,0.0781247+0.478651i,0.450038-0.465606i,-0.800845+0.869943i,-0.04261-0.644689i,0.0873191+0.420773i,-0.212136-0.161895i,-0.35767+0.0431664i,0.374055-0.215484i,-0.190545+0.166168i,-0.764421+0.182018i,0.790308-0.466753i,-0.406254-0.134399i,-0.519593+0.568968i,0.152241-0.90536i,0.279198+0.847582i,-0.633424+0.229514i,-0.0772849-0.183976i,0.334152-0.396945i,0.270882+0.790633i,-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.0158566-0.348981i,-0.0684187+0.972362i,0.0665399-0.722447i,-0.848365+0.374996i,0.826431-0.0275091i,-1.01093-1.08618E-13i]；

wherein I is a constant not equal to 0, E is a scientific counting symbol, I is an imaginary unit, and x is a multiplier.

The first pre-coding sequence H ₂₅₆ The following is satisfied for the above set B:

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,136,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}. The first pre-coding sequence H ₂₅₆ The corresponding energy ratio is: 57.7690.

as another example, in the embodiment of the present application, first precoding matrices corresponding to several different numbers of antennas are determined. Specifically, the following may be included:

Note that the number of antennas n=p×q.

When pxq=4×4, the first precoding matrix satisfies the following equation one:

it should be noted that the number of the components,

is H ₄ Transpose matrix, the first H from the left in the formula ₄ A first precoding sequence representing a length P and P equal to 2, a second H from the left in the formula ₄ Representing a first precoding sequence of length Q and Q equal to 4, two H ₄ The first precoding sequence may be determined in the manner described above, but the two may not be identical.

When pxq=4×8, the first precoding matrix satisfies the following formula two:

wherein ,

When pxq=4×16, the first precoding matrix satisfies the following equation three:

wherein ,

When pxq=4×32, the first precoding matrix satisfies the following equation four:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₃₂ Is a first pre-code sequence of length 32.

When pxq=4×64, the first precoding matrix satisfies the following formula five:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₆₄ Is a first precoding sequence of length 64.

When pxq=4×128, the first precoding matrix satisfies the following formula six:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₁₂₈ Is a first pre-code sequence of length 128.

When pxq=4×256, the first precoding matrix satisfies the following equation seven:

wherein ,

is H ₄ Transposed matrix, H ₄ H is a first precoding sequence of length 4 ₂₅₆ Is a first precoding sequence of length 256.

When pxq=8×8, the first precoding matrix satisfies the following equation eight:

it should be noted that the number of the components,

is H ₈ Transpose matrix, the first H from the left in the formula ₈ A first precoding sequence representing a length P and P equal to 8, a second H from the left in the formula ₈ Representing a first precoding sequence of length Q and Q equal to 8, two H ₈ The first precoding sequence may be determined in the manner described above, but the two may not be identical.

When pxq=8×16, the first precoding matrix satisfies the following formula nine:

wherein ,

is H ₈ Transposed matrix, H ₈ H is a first precoding sequence of length 8 ₁₆ Is a first precoding sequence of length 16.

When pxq=8×32, the first precoding matrix satisfies the following equation ten:

wherein ,

is H ₈ Transposed matrix, H ₈ H is a first precoding sequence of length 8 ₃₂ Is a first pre-code sequence of length 32.

When p×q=8×64, the first precoding matrix satisfies the following formula eleven:

wherein ,

is H ₈ Transposed matrix, H ₈ H is a first precoding sequence of length 8 ₆₄ Is a first precoding sequence of length 64.

When pxq=8×132, the first precoding matrix satisfies the following equation twelve:

wherein ,

is H ₈ Transposed matrix, H ₈ H is a first precoding sequence of length 8 ₁₃₂ Is a first pre-code sequence of length 132.

When pxq=8×256, the first precoding matrix satisfies the following formula thirteen:

wherein ,

is H ₈ Transposed matrix, H ₈ H is a first precoding sequence of length 8 ₂₅₆ Is a first precoding sequence of length 256.

When pxq=16×16, the first precoding matrix satisfies the following formula fourteen:

it should be noted that the number of the components,

is H ₁₆ Transpose matrix, the first H from the left in the formula ₁₆ Representing a first precoding sequence H of length P and P equal to 16 _P Male (Utility)The second H from the left side ₁₆ Representing a first precoding sequence H of length Q and Q equal to 16 _Q Two H ₁₆ The first precoding sequence may be determined in the manner described above, but the two may not be identical.

When p×q=16×32, the first precoding matrix satisfies the following formula fifteen:

wherein ,

is H ₁₆ Transposed matrix, H ₁₆ H is a first precoding sequence of length 16 ₃₂ Is a first pre-code sequence of length 32.

When p×q=16×64, the first precoding matrix satisfies the following formula sixteen:

wherein ,

is H ₁₆ Transposed matrix, H ₁₆ H is a first precoding sequence of length 16 ₆₄ Is a first precoding sequence of length 64.

When p×q=16×128, the first precoding matrix satisfies the following formula seventeen:

/>

wherein ,

is H ₁₆ Transposed matrix, H ₁₆ H is a first precoding sequence of length 16 ₁₂₈ Length of 128Is used for the first precoding sequence of (a).

When p×q=16×256, the first precoding matrix satisfies the following equation eighteen:

wherein ,

is H ₁₆ Transposed matrix, H ₁₆ H is a first precoding sequence of length 16 ₂₅₆ Is a first precoding sequence of length 256.

When p×q=32×32, the first precoding matrix satisfies the following formula nineteen:

it should be noted that the number of the components,

is H ₃₂ Transpose matrix, the first H from the left in the formula ₃₂ Representing a first precoding sequence H of length P and P equal to 32 _P The second H from the left in the formula ₃₂ Representing a first precoding sequence H of length Q and Q equal to 32 _Q Two H ₃₂ The first precoding sequence may be determined in the manner described above, but the two may not be identical.

When p×q=32×64, the first precoding matrix satisfies the following formula twenty:

wherein ,

is H ₃₂ Transposed matrix, H ₃₂ Length 32A pre-coding sequence, H ₆₄ Is a first precoding sequence of length 64.

When p×q=32×128, the first precoding matrix satisfies the following formula twenty-one:

wherein ,

is H ₃₂ Transposed matrix, H ₃₂ H is a first precoding sequence of length 32 ₁₂₈ Is a first pre-code sequence of length 128.

When p×q=32×256, the first precoding matrix satisfies the following formula twenty-two:

wherein ,

is H ₃₂ Transposed matrix, H ₃₂ H is a first precoding sequence of length 32 ₂₅₆ Is a first precoding sequence of length 256.

It should be noted that, the above-mentioned first precoding sequences with different lengths may be obtained by referring to the above-mentioned manner of determining the first precoding sequence, and thus will not be described in detail.

S402: the first communication device transmits the precoded data streams using N antennas.

Specifically, the data stream after the precoding processing may be transmitted by using N antennas in a transceiver in the first communication apparatus.

Accordingly, the second communication device at the receiving end may receive the encoded data stream using N antennas.

It should be noted that the second communication device at the receiving end may also use one antenna or use antennas with the number not equal to N to receive the encoded data stream, and the number of antennas used at the receiving end is not specifically limited in this application.

Optionally, when the second communication device at the receiving end is used as a communication device for transmitting data, the processor in the second communication device may perform precoding processing on the data stream to be transmitted by using the first precoding, or perform precoding processing on the data stream to be transmitted by using a precoder in the second communication device, where the precoder is obtained according to the first precoding configuration.

The first precoding is obtained according to a first precoding sequence, or the first precoding is obtained according to a first precoding matrix, and the first precoding sequence and the first precoding matrix may be obtained by referring to the step S402, which is not described herein in detail.

In summary, the present application provides a method for wireless communication, which includes: firstly, precoding a first data stream by utilizing first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0; and finally, using N antennas to transmit the precoded data streams. The method can simplify the communication device for realizing the omnidirectional precoding on the basis of realizing the omnidirectional precoding.

Based on the wireless communication method provided by the above embodiment, the present application further provides the following specific embodiment according to the method, so as to describe in detail how the first precoding in the embodiment of the present application is generated.

In the case of ULA omni-directional radiation under a single precoding sequence, the first precoding in the embodiment of the present application is obtained according to a preset first precoding sequence with a length of N, where N represents the number of antennas. Thus, referring to fig. 5A, the specific steps for generating the first precoding sequence are as follows:

S501A: a plurality of precoding sequences of length N are determined.

A pre-coding sequence is defined as a complex sequence H of length N, i.e. h= [ H ] ₀ ,H ₁ ,…,H _N-1 ]N represents the number of antennas.

The aperiodic autocorrelation function of the precoding sequence may satisfy the following formula twenty-three:

wherein ,

for matrix H _k+τ Is a matrix of the syndromes.

The characteristic polynomial of the pre-code sequence may satisfy the following formula twenty-four:

H(x)＝H ₀ +H ₁ x+…+Hx ^N-1 twenty-four formulas

Characteristic polynomial H (x) and non-periodic autocorrelation function ρ _H The relationship between (τ) satisfies the following formula twenty-five:

i.e. the implementation of omni-directional precoding in ULA scenarios is equivalent to determining a precoding sequence with ideal aperiodic correlation.

Alternatively, the pre-code sequence may be a Huffman sequence whose characteristic polynomial satisfies the following formula twenty-six:

wherein ,

represents root radius>

Representing N-1 times the root of the unit, B being an element in set B, C being an element in set C, set B being a subset of set a, set C being the complement of set B, set a= {0,1, …, N-2}, N representing the sequence length, e being a natural constant (euler's number), i being an imaginary unit.

In the above formula twenty-six, since the set B is a subset of the set a, one or more elements are arbitrarily selected from the set a to form the set B, and thus, a plurality of sets B can be correspondingly obtained according to the set a.

Extracting the original Huffman sequence from the twenty-six characteristic polynomial H (x) of the formula and recording as H ₀ 。

When the number of Huffman sequences is N, the number of elements included in the corresponding set B is N/2, and N/2 elements are selected from the set A as the set B, so that various situations exist. Since there are many cases in set B, the original Huffman sequence H is extracted according to the characteristic polynomial H (x) ₀ Also included are a plurality.

For example, when the number of antennas for transmitting a data stream is 4, the number (length) of corresponding Huffman sequences should also be 4, and the number of elements included in the set B is 2. 2 elements are selected from the set A to be combined into a set B, namely B= {0,1}, B= {1,2}, B= {0,2} … …, and the original Huffman sequence H is obtained from the characteristic polynomial because a plurality of sets B exist ₀ There are also a plurality.

Further, the original Huffman sequence H can be aligned twenty-seven by the following formula ₀ And carrying out energy normalization to obtain a standard Huffman sequence.

It should be noted that the characteristic polynomial of the Huffman sequence described above may also satisfy the following formula twenty-eight.

Wherein, K in the formula twenty-eight is used for normalizing the precoding sequence with the length of N, and K is a constant which is not equal to 0.

S502A: the energy ratio of each length N precoding sequence is calculated.

The energy ratio of each length N pre-code sequence satisfies the following formula twenty-nine:

S503A: from among a plurality of precoding sequences of length N, a precoding sequence having the largest energy ratio is selected as a first precoding sequence.

Therefore, the first precoding sequence can be flexibly and effectively determined through the steps S501A-S503A, and the determined first precoding sequence is further used as the first precoding to realize the precoding of the first data stream.

In the case of URA omnidirectional radiation under a single precoding Array (Array), the first precoding in the embodiment of the present application is obtained according to a preset first precoding matrix with size p×q; p and Q are integers greater than 0, and the product of P and Q is equal to N, N representing the number of antennas, N being an integer greater than 0. Thus, referring to fig. 5B, the specific steps for generating the first precoding matrix are as follows:

S501B: a plurality of precoding matrices of size p×q are determined.

A precoding matrix H' of size p×q is defined.

The aperiodic autocorrelation function of the precoding matrix may satisfy the formula thirty:

the characteristic polynomial of the precoding matrix may satisfy the following formula thirty-one:

feature polynomial H' (x, y) and non-periodic autocorrelation function

The relationship between them satisfies the following formula thirty-two:

wherein ,

for matrix->

Is a matrix of the syndromes. p=1, 2, …, P; q=1, 2, …, Q, < >>

Representing pitch angle, θ represents azimuth angle. />

I.e. the implementation of omni-directional precoding in URA scenarios is equivalent to determining a precoding sequence with an ideal aperiodic correlation.

The precoding matrix may be a Huffman precoding matrix, and the Huffman precoding matrix may be constructed by a binary accompanying polynomial or may be obtained by iteration of a Huffman precoding sequence.

Firstly, determining the size of the Huffman precoding matrix as P multiplied by Q; then, referring to the above-described manner of determining the Huffman precoding sequence, a Huffman precoding sequence H of length P is generated _P And length-Q pre-encoded Huffman sequence H _Q . Finally, a Huffman matrix H' is constructed by multiplication of the general matrix of the following formula thirty-three.

Wherein H' is a precoding matrix of size PxQ,

S502B: the energy ratio of each precoding matrix of size P x Q is calculated.

The energy ratio of each precoding matrix of size p×q satisfies the following formula thirty-four:

wherein H' is a precoding matrix of size PxQ,

S503B: from a plurality of precoding matrices of size p×q, a precoding matrix having the largest energy ratio is selected as a first precoding matrix.

Therefore, the first precoding matrix can be flexibly and effectively determined through the steps S501B-S503B, and the determined first precoding matrix is further used as the first precoding, so as to realize the precoding of the first data stream.

Based on the same technical concept, the embodiments of the present application provide a wireless communication device, where the wireless communication device includes modules or units corresponding to each other one by one to perform the method/operation/step/action described in the first communication device in the embodiment of fig. 4, where the modules or units may be implemented by using hardware circuits, software, or a combination of hardware circuits and software. The communication device may have a structure as shown in fig. 6.

As shown in fig. 6, the communication device 600 may include a transceiver module 601, and the transceiver module 601 may implement corresponding communication functions. In particular, the transceiver module 601 may include a receiving module and/or a transmitting module, where the receiving module may be configured to receive information and/or data, and the transmitting module may be configured to transmit information and/or data. The transceiver module may also be referred to as a communication interface or transceiver unit.

Optionally, the communication device 600 further includes a processing module 602, where the processing module 602 corresponds to a processing unit and may be used for performing data processing.

Optionally, the communication device 600 may further include a storage module 603, where the storage module 603 corresponds to a storage unit and may be used to store instructions and/or data, and the processing module 602 may read the instructions and/or data in the storage module, so that the communication device implements the foregoing method embodiments.

The communication device 600 may be used to perform the actions performed by the first communication device in the fig. 4 embodiment described above. The communication device 600 may be the first communication device or a component that may be configured to the first communication device. The transceiver module 601 is configured to perform the operations related to the reception on the communication device side in the above method embodiment, and the processing module 602 is configured to perform the operations related to the processing by the first communication device in the above embodiment of fig. 4.

Alternatively, the transceiver module 601 may include a transmitting module and a receiving module. The transmitting module is configured to perform the transmitting operation in the embodiment of fig. 4. The receiving module is configured to perform the receiving operation in the embodiment of fig. 4 described above.

It should be noted that, the communication apparatus 600 may include a transmitting module, and not include a receiving module. Alternatively, the communication device 600 may include a receiving module instead of a transmitting module. In particular, it may be determined whether the above-described method performed by the communication apparatus 600 includes a transmitting action and a receiving action.

As an example, the communication device 600 is configured to perform the actions performed by the first communication device in the embodiment shown in fig. 4.

For example, the processing module 602 performs precoding processing on the first data stream by using first precoding to obtain a precoded data stream;

the transceiver module 601 sends the precoded data streams using N antennas.

It should be understood that the specific process of each module (unit) performing the corresponding process has been described in detail in the above method embodiment, and is not described herein for brevity.

The processing module 602 in the above embodiments may be implemented by at least one processor or processor-related circuits. The transceiver module 601 may be implemented by a transceiver or transceiver related circuitry. The memory module 603 may be implemented by at least one memory.

The present application also provides a communication device 700, which communication device 700 may be a first communication device or a processor, or chip, of the first communication device, which communication device 700 may be configured to perform the operations performed by the first communication device in the embodiment of fig. 4 described above.

Fig. 7 shows a simplified schematic diagram of a first communication device when the communication device 700 is a transmitter. As shown in fig. 7, 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 circuits (not shown), an antenna 713, and input and output devices (not shown). Memory 730 may store computer program code.

The processor 720 is mainly used for processing communication protocols and communication data, pre-encoding data streams, executing software programs, processing data of the software programs, and the like. The memory is mainly used for storing software programs and data. The radio frequency circuit is mainly used for converting a baseband signal and a radio frequency signal and processing the radio frequency signal. The antenna 713 is mainly used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. An input/output device. For example, touch screens, display screens, keyboards, etc. are mainly used for receiving data input by a user and outputting data to the user. It should be noted that some kinds of communication devices may not have an input/output device.

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 circuit, and the radio frequency circuit performs radio frequency processing on the baseband signal and then transmits the radio frequency signal outwards in the form of electromagnetic waves through the antenna. When data is transmitted to the terminal device, the radio frequency circuit receives a radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor, and the processor 720 converts the baseband signal into data and processes the data. For ease of illustration, only one memory, processor, and transceiver are shown in fig. 7, and in an actual end device product, one or more processors and one or more memories may be present. The memory may also be referred to as a storage medium or storage device, etc. The memory may be provided separately from the processor or may be integrated with the processor, which is not limited by the embodiments of the present application.

In the embodiment of the present application, the antenna and the radio frequency circuit having the transmitting and receiving function may be regarded as a transmitting and receiving unit (transmitting and receiving module) of the terminal device, and the processor having the processing function may be regarded as a processing unit (processing module) of the first communication apparatus.

As shown in fig. 7, the communication device includes a processor 720, where the processor 720 may also be referred to as a processing module, a processing board, a processing module, a processing device, and the like.

Optionally, a transceiver 710 and a memory 730 are also included in the transmitter. The transceiver 710 may also be referred to as a transceiver module, transceiver device, etc.

Alternatively, the means for implementing the receiving function in the transceiver 710 may be regarded as a receiving module, and the means for implementing the transmitting function in the transceiver 710 may be regarded as a transmitting unit or a transmitting module), i.e. the transceiver 710 comprises a transmitter 711 and a receiver 712. The transceiver 710 may also be referred to as a transceiver, transceiver module, transceiver circuitry, or the like. The transmitter 611 may also sometimes be referred to as a transmitter, a transmitting module, a transmitting circuit, or the like. The receiver 712 may also be sometimes referred to as a receiver, a receiving module, a receiving circuit, or the like.

For example, in one implementation, the processor 720 is configured to perform the processing actions of the first communication device in the embodiment illustrated in fig. 4 above, and the transceiver 710 is configured to perform the transceiving actions of the first communication device in the embodiment illustrated in fig. 4 above. For example, the transceiver 710 is used to perform the operation of S402 in the embodiment shown in fig. 4. The processor 720 is configured to perform the processing operation of S401 in the embodiment shown in fig. 4.

It should be appreciated that fig. 7 is only an example and not limiting, and that the first communication device including the transceiver and the processor, and the memory described above may not rely on the structure shown in fig. 7 above.

When the communication device 700 is a chip, the chip includes a processor, a memory, and a transceiver. Wherein the transceiver may be an input-output circuit or a communication interface; the processor may be an integrated processing module or microprocessor or an integrated circuit on the chip. The sending operation of the terminal device in the above method embodiment may be understood as the output of the chip, and the receiving operation of the terminal device in the above method embodiment may be understood as the input of the chip.

The division of the modules in the embodiments of the present application is schematically only one logic function division, and there may be another division manner in actual implementation, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, or may exist separately and physically, or two or more modules may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules.

The present application also provides a computer readable storage medium having stored thereon computer instructions for implementing the method performed by the first communication device in the above method embodiment.

For example, the computer program, when executed by a computer, enables the computer to implement the method performed by the first communication device in the embodiment of fig. 4 described above.

Embodiments of the present application also provide a computer program product comprising instructions which, when executed by a computer, cause the computer to implement the method performed by the first communication device in the embodiment of fig. 4 described above.

The embodiment of the application also provides a communication system, which includes the first communication device (transmitting device) and the second communication device (receiving device) in the embodiment of fig. 4.

The embodiment of the application further provides a chip device, which comprises a processor, and the processor is used for calling the computer degree or the computer instruction stored in the memory, so that the processor executes a wireless communication method of the embodiment shown in fig. 4.

In a possible implementation, the input of the chip device corresponds to the receiving operation in the embodiment shown in fig. 4, and the output of the chip device corresponds to the transmitting operation in the embodiment shown in fig. 4.

Optionally, the processor is coupled to the memory through an interface.

Optionally, the chip device further comprises a memory, in which the computer degree or the computer instructions are stored.

The processor mentioned in any of the above may be a general purpose central processing unit, a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of a program of a wireless communication method of the embodiment shown in fig. 4. The memory mentioned in any of the above may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM), etc.

It should be noted that, for convenience and brevity, the explanation and the beneficial effects of the related content in the communication device provided above may refer to the method embodiment provided in fig. 4, and are not repeated herein.

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 above the hardware layer, and an application layer running above the operating system layer. The hardware layer may include a central processing unit (central processing unit, CPU), a memory management module (memory management unit, MMU), and a memory (also referred to as a main memory). The operating system of the operating system layer may be any one or more computer operating systems that implement business processing through processes (processes), for example, a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or windows operating system, etc. The application layer may include applications such as a browser, address book, word processor, instant messaging software, and the like.

It should be noted that at least one of the embodiments of the present application includes one or more of the following; wherein, a plurality refers to greater than or equal to two. In addition, it should be understood that in the description of this application, the words "first," "second," and the like are used merely for distinguishing between the descriptions and not for indicating or implying any relative importance or order.

The terminology used in the following embodiments is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of this application and the appended claims, the singular forms "a," "an," "the," and "the" are intended to include, for example, "one or more" such forms of expression, unless the context clearly indicates to the contrary. It should also be understood that in embodiments of the present application, "one or more" refers to one or more than two (including two); "and/or", describes an association relationship of the association object, indicating that three relationships may exist; for example, a and/or B may represent: a alone, a and B together, and B alone, wherein A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship.

Reference in the specification to "one embodiment" or "some embodiments" or the like means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," and the like in various places throughout this specification are not necessarily all referring to the same embodiment, but mean "one or more, but not all, embodiments" unless expressly specified otherwise. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless expressly specified otherwise.

From the above description of embodiments, it will be apparent to those skilled in the art that embodiments of the present application may be implemented in hardware, or firmware, or a combination thereof. When implemented in software, the functions described above may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. Taking this as an example but not limited to: computer readable media can include RAM, ROM, electrically erasable programmable read-Only memory (electrically erasable programmable read Only memory, EEPROM), compact-disk-read-Only memory (CD-ROM) or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Furthermore, it is possible to provide a device for the treatment of a disease. Any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (digital subscriber line, DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the fixing of the medium. As used in the embodiments of the present application, discs (disks) and disks include Compact Discs (CDs), laser discs, optical discs, digital versatile discs (digital video disc, DVDs), floppy disks, and blu-ray discs where disks usually reproduce data magnetically, while disks reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

In summary, the foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement, etc. made according to the disclosure of the present application should be included in the protection scope of the present application.

Claims

1. A method of wireless communication, comprising:

precoding the first data stream by using first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0;

and transmitting the precoded data streams by using N antennas.

2. The method of claim 1, wherein the first precoding matrix is a maximum energy ratio among a plurality of P x Q precoding matrices.

3. The method of claim 2, wherein the P x Q precoding matrix satisfies the following formula:

wherein H' is the precoding matrix with the size of P multiplied by Q,

4. The method of claim 2, wherein the energy ratio of the P x Q precoding matrix satisfies the following formula:

wherein H' is a precoding matrix of size PxQ,

5. The method of claim 1, wherein the first precoding sequence is a largest energy ratio among a plurality of length N precoding sequences.

6. The method of claim 5, wherein each of the length-N precoding sequences is derived from a characteristic polynomial of the length-N precoding sequence.

7. The method of claim 6, wherein the characteristic polynomial of the length N precoding sequence satisfies the following equation:

wherein ,

represents root radius>

Represents the root of the N-1 times units, B is in the set BC is an element in a set C, the set B is a subset of the set a, the set C is a complement of the set B, the set a= {0,1, …, N-2}, N represents a sequence length, e is a natural constant (euler's number), i is an imaginary unit, K is a constant not equal to 0, and K is used for normalizing the precoding sequence with the length N.

8. The method of claim 6, wherein the energy ratio of the length N precoding sequence satisfies the following equation:

/>

9. A method according to claim 1 or 3, characterized in that when P x Q = 4 x 8, the first precoding matrix fulfils the following formula:

wherein ,

is H ₄ Transposed matrix, H ₄ H is the first precoding sequence of length 4 ₈ Is the first precoding sequence of length 8.

10. A method according to claim 1 or 3, characterized in that when P x Q = 4 x 16, the first precoding matrix fulfils the following formula:

wherein ,

is H ₄ Transposed matrix, H ₄ H is the first precoding sequence of length 4 ₁₆ Is the first precoding sequence of length 16.

11. A method according to claim 1 or 3, characterized in that when P x Q = 8 x 16, the first precoding matrix fulfils the following formula:

wherein ,

is H ₈ Transposed matrix of (H) ₈ H is the first precoding sequence of length 8 ₁₆ Is the first precoding sequence of length 16.

12. The method according to claim 1 or 6, wherein when N is 4, the first precoding sequence is a first sequence or the first precoding sequence is a conjugate inverse of the first sequence;

The first sequence satisfies the following sequence:

13. The method according to claim 1 or 6, wherein when N is 8, the first precoding sequence is a second sequence or the first precoding sequence is a conjugate inverse of the second sequence;

the second sequence satisfies the following sequence:

14. The method according to claim 1 or 6, wherein when N is 16, the first precoding sequence is a third sequence or the first precoding sequence is a conjugate inverse of the third sequence;

the third sequence satisfies the following sequence:

15. A wireless communications apparatus, comprising: a transceiver module and a processing module;

the processing module is used for carrying out precoding processing on the first data stream by utilizing first precoding to obtain a precoded data stream; the first precoding is obtained according to a first precoding sequence with a preset length of N, or the first precoding is obtained according to a first precoding matrix with a preset size of P multiplied by Q, P and Q are integers more than 0, the product of P and Q is equal to N, and N is an integer more than 0;

And the receiving and transmitting module is used for transmitting the precoded data streams by using N antennas.

16. The apparatus of claim 15, wherein the first precoding matrix is a maximum energy ratio among a plurality of P x Q precoding matrices.

17. The apparatus of claim 16, wherein the P x Q precoding matrix satisfies the following equation:

wherein H' is the precoding matrix with the size of P multiplied by Q,

is H _P Transposed matrix of (H) _P For a precoding sequence of length P, H _Q The value of PQ is equal to the number of antennas, and P and Q are positive integers greater than 0.

18. The apparatus of claim 16, wherein the energy ratio of the P x Q precoding matrix satisfies the following equation:

wherein H' is a precoding matrix of size PxQ,

19. The apparatus of claim 15, wherein the first precoding sequence is a largest energy ratio among a plurality of length N precoding sequences.

20. The apparatus of claim 19, wherein each of the length-N precoding sequences is derived from a characteristic polynomial of the length-N precoding sequence.

21. The apparatus of claim 20, wherein the characteristic polynomial of the length N precoding sequence satisfies the following equation:

wherein ,

represents root radius>

Representing N-1 times of unit roots, B being one element in a set B, C being one element in a set C, the set B being a subset of a set a, the set C being a complement of the set B, the set a= {0,1, …, N-2}, N representing a sequence length, e being a natural constant (euler's number), i being an imaginary unit, K being a constant different from 0, the K being used for normalizing the precoding sequence of length N.

22. The apparatus of claim 19, wherein the energy ratio of the length N precoding sequence satisfies the following equation:

23. The apparatus according to claim 15 or 17, wherein the first precoding matrix satisfies the following formula when p×q=4×8:

wherein ,

24. The apparatus according to claim 15 or 17, wherein the first precoding matrix satisfies the following formula when p×q=4×16:

wherein ,

25. The apparatus according to claim 15 or 17, wherein the first precoding matrix satisfies the following formula when p×q=8×16:

wherein ,

26. The apparatus according to claim 15 or 20, wherein when N is 4, the first precoding sequence is a first sequence or the first precoding sequence is a conjugate inverse of the first sequence;

the first sequence satisfies the following sequence:

27. The apparatus according to claim 15 or 20, wherein when N is 8, the first precoding sequence is a second sequence or the first precoding sequence is a conjugate inverse of the second sequence;

The second sequence satisfies the following sequence:

28. The apparatus according to claim 15 or 20, wherein when N is 16, the first precoding sequence is a third sequence or the first precoding sequence is a conjugate inverse of the third sequence;

the third sequence satisfies the following sequence:

29. A communication device, the device comprising a processor and a communication interface;

the communication interface is used for receiving the code instruction and transmitting the code instruction to the processor; the processor executes the code instructions to perform the method of any one of claims 1 to 14.

30. A chip comprising at least one processor and a transceiver, the transceiver and the at least one processor being interconnected by a circuit, the processor executing instructions to perform the method of any one of claims 1 to 14.

31. A computer readable storage medium, storing a computer program which, when run on a processor, causes the method of any one of claims 1 to 14 to be performed.

32. A computer program product comprising a computer program which, when run on a computer, causes the method of any one of claims 1 to 14 to be performed.