CN118869164A

CN118869164A - Determination, transmission method, first communication node, second communication node and medium

Info

Publication number: CN118869164A
Application number: CN202310478665.2A
Authority: CN
Inventors: 袁志锋; 李卫敏; 马一华; 李志岗
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2023-04-27
Filing date: 2023-04-27
Publication date: 2024-10-29
Also published as: WO2024222470A1

Abstract

The application discloses a determining and transmitting method, a first communication node, a second communication node and a medium, wherein the determining method is applied to the first communication node and comprises the following steps: combining the data symbols received by the M receiving antennas to obtain combined data symbols; the combining weights required for combining the data symbols received by the M receiving antennas are determined by the received data symbols, and M is an integer greater than 1.

Description

Determination, transmission method, first communication node, second communication node and medium

Technical Field

The present application relates to the field of communications technologies, for example, to determining, transmitting methods, a first communication node, a second communication node, and a medium.

Background

In scenarios where the communication channel quality is poor, the signal to noise ratio (Signal to Noise Ratio, SNR) or signal to interference plus noise ratio (Signal to Interference plus Noise Ratio, SINR) will be low; where the SNR or SINR of the pilot signal is also low, this results in a lower accuracy of the pilot-based channel estimation, and a larger gap between the final demodulation decoding performance and the performance under ideal channel estimation.

Disclosure of Invention

The application provides a determining and transmitting method, a first communication node, a second communication node and a medium.

In a first aspect, an embodiment of the present application provides a determining method, applied to a first communication node, the method including:

combining the data symbols received by the M receiving antennas to obtain combined data symbols;

The combining weights required for combining the data symbols received by the M receiving antennas are determined by the received data symbols, and M is an integer greater than 1.

In a second aspect, an embodiment of the present application provides a transmission method, applied to a second communication node, where the method includes:

Determining a signal transmitted to a first communication node, the signal being a signal that does not contain pilots, the signal comprising data symbols, combining weights required for the data symbol combining being determined based on the data symbols;

The signal is transmitted.

In a third aspect, an embodiment of the present application provides a first communication node, including:

one or more processors;

A storage means for storing one or more programs;

The one or more programs, when executed by the one or more processors, cause the one or more processors to implement the methods of determining as the present application.

In a fourth aspect, an embodiment of the present application provides a second communication node, including:

one or more processors;

A storage means for storing one or more programs;

When the one or more programs are executed by the one or more processors, the one or more processors are caused to implement a transmission method as in the present application.

In a fifth aspect, an embodiment of the present application provides a storage medium storing a computer program which, when executed by a processor, implements the method of the present application.

With respect to the above embodiments and other aspects of the application and implementations thereof, further description is provided in the accompanying drawings, detailed description and claims.

Drawings

FIG. 1 is a schematic flow chart of a determining method according to an embodiment of the present application;

Fig. 2 is a schematic structural diagram of a communication system according to an embodiment of the present application;

Fig. 3 is a schematic flow chart of a transmission method according to an embodiment of the present application;

Fig. 4a is a QPSK constellation according to an embodiment of the present application;

Fig. 4b is a standard constellation diagram provided in an embodiment of the present application;

FIG. 4c is a constellation without Gaussian white noise after rotational scaling according to an embodiment of the application;

fig. 4d is a constellation diagram with gaussian white noise according to an embodiment of the present application;

FIG. 4e is a schematic diagram of a partitioning method according to an embodiment of the present application;

FIG. 4f is a schematic diagram of another partitioning method provided by an embodiment of the present application;

fig. 4g is a constellation diagram including a constellation point center provided by an embodiment of the present application;

Fig. 4h is a constellation diagram of frequency offset when present according to an embodiment of the present application;

fig. 4i is a segmented constellation diagram according to an embodiment of the present application;

fig. 4j is a first segment of a constellation diagram according to an embodiment of the present application;

fig. 4k is a second segment constellation provided in an embodiment of the present application;

Fig. 5 is a schematic structural diagram of a determining apparatus according to an embodiment of the present application;

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

fig. 7 is a schematic structural diagram of a first communication node according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a second communication node according to an embodiment of the present application.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present application more apparent, embodiments of the present application will be described in detail hereinafter with reference to the accompanying drawings. It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be arbitrarily combined with each other.

The steps illustrated in the flowchart of the figures may be performed in a computer system, such as a set of computer-executable instructions. Also, while a logical order is depicted in the flowchart, in some cases, the steps depicted or described may be performed in a different order than presented herein.

The terms "first," "second," and the like, herein, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.

In an exemplary implementation, fig. 1 is a schematic flow chart of a determining method according to an embodiment of the present application. The method is suitable for improving demodulation and decoding performance under the condition of poor communication channel quality, and can be executed by the determining device provided by the application, and the device can be realized by software and/or hardware and is integrated on the first communication node. The first communication node may be a base station.

Fig. 2 is a schematic structural diagram of a communication system provided in an embodiment of the present application, and referring to fig. 2, the communication system includes a first communication node 1 and a second communication node 2. Assuming that the first communication node 1, such as a base station (receiver), has M receiving antennas, where M is greater than or equal to 1, and assuming that the M long channel vector that a signal transmitted by a terminal (or a transmitter) to the M receiving antennas of the base station experiences is h= [ h ₁,h₂,...h_M]^t, which is an M long column vector, the channel weight that a signal transmitted by a terminal (or a transmitter) to the M receiving antennas of the base station experiences is h _m, that is, the M-th element of the channel vector h. And assuming that the terminal transmitting signal comprises a pilot signal p and a data signal s, which are both row vectors, and assuming that the pilot length is PL and the data symbol length is N, p is a PL long row vector and s is an N long row vector. Specifically, the N long row vector s may be expressed as s= [ s ₁,s₂,...s_M ]. Again, assuming that the energy of the pilot row vector p or 2 norms p ² = PL, the energy of the data row vector s or 2 norms s ² = N, this is consistent with the normalized energy of the data symbols.

Thus, the pilot signals received by the M receiving antennas of the base station are: y _p＝hp+n_p.

Where y _p is a two-dimensional array or matrix of M x PL and n _p is the noise or interference experienced on the pilot signal.

The data signals received by the M receiving antennas are: y _s＝hs+n_s.

Where y _s is a two-dimensional array or matrix of M x N and N _s is the noise or interference experienced on the pilot signal.

When looking at one antenna alone, the pilot signal received by the mth receiving antenna of the base station is: y _p,m＝h_mp+n_p,m.

Y _p,m is a two-dimensional array of 1 x PL or a PL long row vector.

The pilot signal received by the mth receiving antenna is: y _s,m＝h_ms+n_s,m.

Y _s,m is a two-dimensional array of 1*N or an N-long row vector.

In the related art, the base station estimates h _m based on the pilot signal y _p,m received by the mth receiving antenna, but cannot obtain accurate h _m from y _p,m due to noise or interference n _p,m, and can only obtainThen uses the channel estimation on all antennas to combine the received data symbols, i.eThen normalized, an estimate of the data symbol can be obtained, which is expressed in matrix form as follows:

The base station obtains an estimated value of the space domain channel vector h according to the pilot signals y _p received by the M receiving antennas Then pass throughAn estimate of the data symbols may be obtained.

However, when the signal-to-noise ratio or signal-to-interference-and-noise ratio of the received signal is relatively low, the channel estimation of the prior artCompared with the true h, the method has larger deviation, and finally leads to the data symbol after spatial domain combinationThe demodulation performance of (c) is relatively poor.

In order to solve the above technical problem, as shown in fig. 1, the determining method includes:

S110, combining the data symbols received by the M receiving antennas to obtain combined data symbols; the combining weights required for combining the data symbols received by the M receiving antennas are determined by the received data symbols, and M is an integer greater than 1.

The determining method is applied to a first communication node, which includes at least M receiving antennas. The data symbols received by the M receiving antennas are acquired in the step. And then combining the received data symbols to obtain combined data symbols. The data symbols received by the M antennas can be combined according to the data symbols only without pilot frequency channel estimation. The SIGNAL-to-NOISE RATIO (SNR) of the combined data symbols can be significantly improved compared with the SNR of the original data symbols on each receiving antenna, which is helpful for improving the demodulation and decoding performance.

The merge weight may be regarded as a weight at the time of merging. In this embodiment, the combining weights are determined according to the received data symbols, so that when the combined data symbols are obtained, combining can be completed based on the data symbols only. The determination method of the combining weights is not limited herein, and may be determined based on the number of the receiving antennas, for example, a row vector y _s,k formed by N data symbols received by the kth receiving antenna of the first communication node and a row vector y _s,m formed by N data symbols received by the mth receiving antenna.

In one embodiment, this step may be performed byOr (b)The combined data symbols are determined.A power normalized constellation can be obtainedThe normalized constellation is multiplied by a real number M. Different data symbols may correspond to different combining weights.

The first communication node may receive the signal transmitted by the second communication node via the receiving antenna. The signal does not contain a pilot signal, and the signal includes a data symbol. The present embodiment performs spatial combining based on the data symbols in the signal.

The determining method provided by the application utilizes the channel information included in the data symbols, and can determine the combined data symbols only through the data symbols, thereby realizing airspace combination with better performance. And the demodulation and decoding performance is improved under the scene of poor communication channel quality.

On the basis of the above embodiments, modified embodiments of the above embodiments are proposed, and it is to be noted here that only the differences from the above embodiments are described in the modified embodiments for the sake of brevity of description.

In one embodiment, combining the data symbols received by the M receiving antennas to obtain a combined data symbol includes:

combining the data symbols received by the M receiving antennas through the following formula to obtain combined data symbols:

Wherein, For combining the required combining weights, N is the length of the data symbol in the received symbol, y _s,k and y _s,m are row vectors formed by the N data symbols received by the kth and mth receiving antennas of the first communication node, y _s*_,m is the conjugate transpose of y _s,m, and is an N-long column vector; k is an arbitrary integer of 1 or more and M or less.

In one embodiment, the determining method further comprises:

Combining pilot symbols received by M receiving antennas to obtain combined pilot symbols;

estimating complex weight values in the combined data symbols based on the combined pilot symbols;

and based on the complex weighted value, balancing the combined data symbols.

The combined data symbols have complex weights, for example, 4 receiving antennas, the complex weights are (h ₁ ²+|h₂ ²+|h₃ ²+|h₄ ²)h₁. In this embodiment, complex weights are also determined, and then the complex weights are equalized, so that the constellation diagram of the modulation symbol stream becomes a standard constellation diagram, and the modulation symbol stream is further demodulated and decoded.

The pilot symbols may be combined using combining weights when combining the pilot symbols. Such as multiplying each pilot symbol by a corresponding combining weight and then summing. Different pilot symbols may correspond to different combining weights.

In one embodiment, the combined pilot symbols are determined by one of the following formulas:

And Complex weights on the corresponding power normalized constellation can be obtainedCorresponding to complex weights on the normalized constellation multiplied by M.

The combined pilot symbols include complex weight values, which may be determined after the combined pilot symbols are determined. Such as complex weights, based on the combined pilot symbols, pilot length, and pilot row vectors.

The method of equalization is not limited, such as dividing the combined data symbols by complex weights.

In one embodiment, k is taken to be greater than or equal to 1 and less than or equal to all integers in M, so as to obtain M combined data symbol vectors: And M combined pilot symbols Estimating complex weight values in the corresponding combined data symbols y _s,c,k based on the M combined pilot symbols y _p,c,k; equalizing y _s,c,k based on the complex weighted value of y _s,c,k to obtain equalized data symbols; and adding the M groups of balanced data symbols to divide the M groups of balanced data symbols to obtain a final data symbol.

In one embodiment, the pilot symbols received by the M receive antennas are combined by the following formula:

Wherein, In order to combine the required combining weights, y _p,m is a row vector formed by pilot signals received by the mth antenna of the first communication node, N is the length of data symbols in the received symbols, y _s,k is a row vector formed by N data symbols received by the kth receiving antenna of the first communication node,A conjugate transpose of a row vector y _s,m formed by N data symbols received by an mth receiving antenna of the first communication node is an N-long column vector; k is an arbitrary integer of 1 or more and M or less.

In one embodiment, the method further comprises:

Taking k in the following formula to be more than or equal to 1 and less than or equal to all integers in M to obtain pilot frequency symbols after M combination

Estimating complex weighted values in the corresponding combined data symbols based on the M combined pilot symbols;

Based on the estimated complex weighted value, carrying out equalization on the corresponding combined data symbols to obtain equalized data symbols;

and adding the M groups of balanced data symbols to divide the M groups of balanced data symbols to obtain a final data symbol.

taking k from the following formula to be more than or equal to 1 and less than or equal to all integers in M to obtain M combined data symbols:

in one embodiment, combining pilot symbols received by M receiving antennas to obtain a combined pilot symbol includes:

In one embodiment, estimating complex weights in the combined data symbols based on the combined pilot symbols comprises:

And estimating complex weighted values in the corresponding combined data symbols based on the M combined pilot symbols.

The corresponding combined data symbols may be combined data symbols corresponding to the combined pilot symbols. The combined pilot symbol and the combined data symbol may be corresponding through k, where the combined data symbol with the same value of k corresponds to the combined pilot symbol. Different values of k may correspond to different groups. The result of taking 1 as k may be a first set of combined pilot symbols and a first set of combined data symbols.

Means for determining the complex weight is not limited herein and reference may be made to estimating the complex weight in the combined data symbols based on the combined pilot symbols.

The present embodiment may estimate, for each of the M combined pilot symbols, a complex weight value in the corresponding combined data symbol of the group, e.g., based on the combined pilot symbol of the first group, a complex weight value in the corresponding first combined data symbol.

In one embodiment, equalizing the combined data symbols based on the complex weighted values comprises:

When equalizing the data symbols, the complex weighted value corresponding to each combined data symbol may be used to equalize the combined data symbols, and the equalization mode is not limited. And if the data symbol is corresponding to each complex weighted value, carrying out equalization on the combined data symbol corresponding to the complex weighted value to obtain an equalized data symbol.

And if the pilot symbols after the first combination are combined, the complex weighted values in the data symbols after the first combination are corresponding, and the data symbols after the first combination are balanced based on the complex weighted values in the data symbols after the first combination.

In this embodiment, each group may be equalized separately, for example, the combined pilot symbol of the i-th group may be used to estimate the complex weight value in the combined data symbol of the i-th group, and the combined data symbol of the i-th group may be equalized based on the complex weight value estimated by the i-th group. I is an arbitrary integer of 1 or more and M or less.

The complex weight value of each combined data symbol may be estimated based on the corresponding combined pilot symbol.

After determining the M groups of equalized data symbols, the corresponding average value, that is, the M groups of equalized data symbols are added together and divided by M, to be the final data symbol.

In one embodiment, the determining method further comprises:

determining complex weighted values on the combined data symbols by the geometry of the combined data symbols;

and based on the complex weighted value, balancing the combined data symbols.

In this embodiment, when the combined data symbols are equalized, the complex weighted value may be determined based on the combined data symbols, and the combining and equalization of the data symbols may be completed only by the data symbols, without using pilot symbols.

The present embodiment may determine the complex weight value based on the rotation scaling amount of the geometry of the combined data symbols, and the specific determination manner is not limited herein.

In one embodiment, the determining the complex weight value on the combined data symbol by the geometry of the combined data symbol includes:

And determining complex weighted values on the combined data symbols through constellation diagrams corresponding to the combined data symbols.

The embodiment may present a constellation of the combined data symbols based on the constellation, and determine the rotation scaling amount by analyzing the constellation, where the rotation scaling amount suffered by the constellation may be a complex weighted value on the combined data symbols. There is no limitation on how the amount of rotational scaling to which the constellation is subjected is determined, e.g., the constellation may be subjected to a partition analysis, and then the analysis results for each partition may be summarized.

In one embodiment, the determining the complex weighted value on the combined data symbol according to the constellation diagram corresponding to the combined data symbol includes:

Partitioning the two-dimensional signal plane;

For each partition, determining a center of constellation points within the partition based on the intra-partition constellation points;

Complex weight values on the combined data symbols are determined based on the determined centers.

The two-dimensional signal plane of the constellation is partitioned, and the number of partitions is not limited here, and may be divided into 2 partitions or 4 partitions, for example. The partitioning method is not limited here, and the partitioning may be performed with respect to each quadrant of the two-dimensional signal plane. Wherein the two-dimensional signal plane is also called as a two-dimensional plane.

In one embodiment, the four quadrants of the two-dimensional plane may correspond to one partition, or the four quadrants may be rotated, and then the rotated quadrants may be used as the partitioned partitions. The degree of rotation is not limited herein. Such as 45 degrees.

The present embodiment may determine for each partition the center of the constellation point within that partition. The center of the constellation point may be the average of the constellation points within the corresponding partition. Each constellation point may correspond to a modulation symbol, and the number of constellation points in the partition is divided by the sum of modulation symbols in the partition to obtain the center of the constellation point in the partition.

After determining the center of each partition, the average value may be obtained based on the rotation of the centers of the partitions to obtain the complex weighted value. For example, after each partition is rotated to one partition, the average value of the centers after rotation is determined as a complex weighted value.

In one embodiment, the determining complex weight values on the combined data symbols based on the determined center includes:

and carrying out the following operation on the determined center to obtain complex weighted values on the combined data symbols:

c＝(c1+c2')/2，c2'＝-c2；

Where c is a complex weight, c1 is the center of the constellation point in the first partition, and c2 is the center of the constellation point in the second partition.

The present embodiment shows a manner of determining complex weight values in the case of division into two partitions.

c＝(c1+c2'+c3'+c4')/4，c2'＝c2*j，c3'＝-c3，c4'＝-c4*j；

wherein c is a complex weighted value, c1 is the center of a constellation point in the first partition, c2 is the center of a constellation point in the second partition, c3 is the center of a constellation point in the third partition, and c4 is the center of a constellation point in the fourth partition.

The present embodiment shows a method of determining complex weight values in the case of dividing into four partitions.

In one embodiment, the determining method further comprises:

Respectively rotating the equalized data symbols by a plurality of set degrees to obtain a plurality of rotated data symbols;

demodulating and decoding the rotated data symbols.

The set degree is not limited herein, and may be one or more of 90 °, 180 °, and 270 °. The rotated data symbols can be demodulated and decoded after the rotated data symbols are obtained. The translated rotated data symbols are accurate for the corresponding channel estimates.

In one embodiment, the combined data symbols include one or more of the following:

a complex weighted value; phase rotation caused by time-offset frequency offset.

Because of the time-offset present in the transmission, the transmitted signal undergoes phase rotation introduced by the time-offset in addition to weighting of the wireless channel. Although phase rotation is introduced, the data merging method is not affected by the phase rotation. The combined data symbols may be phase rotated with a complex weight h and a time offset. After determining the phase rotation, the embodiment may equalize the phase rotation to obtain a standard constellation.

In one embodiment, the determining method further comprises:

Dividing constellation points included in a constellation diagram corresponding to the combined data symbols into a plurality of sections;

for each segment of constellation points, a phase rotation of the combined data symbols is determined.

The present embodiment may determine the phase rotation from the constellation. Because of the introduction of phase rotation, the constellation diagram is rotated, so the embodiment can segment the constellation diagram to process constellation points in a segmentation way, determine the rotation amount of each segment, and further determine the phase rotation.

The present embodiment is not limited to the manner of segmentation, and may be divided into at least two segments, for example. Such as dividing each segment into at least two segments. Each segment may correspond to a different range of degrees. The segmented constellation points are adjacent in time-frequency.

In determining the phase rotation for each segment of constellation points, the amount of rotation for each segment of constellation points may be determined, and then the phase rotation may be determined using the amounts of rotation for adjacent segments of constellation points.

In one embodiment, the determining, for each segment of constellation points, a phase rotation of the combined data symbol includes:

Partitioning the two-dimensional signal plane;

for each section of constellation points, the centers of the constellation points in each section of the partitions are respectively determined;

Determining an amount of rotation of the segment constellation point based on the determined center;

A phase rotation is determined based on the rotation amount.

For each segment of constellation point, a method of determining a rotation amount when determining a complex weighted value on the combined data symbol through a constellation diagram corresponding to the combined data symbol can be adopted, and the rotation amount of each segment of constellation point is determined. For each segment of constellation points, a center within each partition is determined, and then a rotation amount of the corresponding segment of constellation points is determined based on each partition center.

The phase rotation is then determined based on the determined rotation amount. Such as phase rotation, by the amount of rotation of the constellation points of adjacent segments.

In an exemplary embodiment, the present application further provides a transmission method, and fig. 3 is a schematic flow chart of a transmission method provided by the embodiment of the present application, where the method is suitable for a situation of improving demodulation decoding performance under a situation of ensuring that a communication channel of a first communication node is poor in quality in a situation of improving transmission efficiency, and the method may be performed by a transmission device of the present application, where the device may be implemented by software and/or hardware and is integrated on a second communication node. Reference may be made to the above embodiments for details of this embodiment, which are not described herein.

As shown in fig. 3, the transmission method includes the steps of:

S310, determining a signal transmitted to the first communication node, the signal being a signal not comprising pilots, the signal comprising data symbols, the combining weights required for the data symbol combining being determined based on the data symbols.

S320, transmitting the signal.

The spatial combining and channel equalization of the first communication node may not require pilot symbols, also known as pilot signals, so the signal sent by the second communication node to the first communication node may not include pilot signals. Therefore, the overhead of pilot frequency is avoided, and the transmission efficiency is improved.

According to the transmission method provided by the application, the transmitted signal does not need to include the pilot frequency signal, so that the transmission efficiency is improved, the first communication node can perform space domain combination and channel equalization based on the signal, and the demodulation decoding performance is improved under the scene of poor communication channel quality.

The application is illustrated below: in the scene of poor communication channel quality, the SNR or SINR of the pilot signal is low, which results in channel estimation based on pilot and estimation of time offset, the accuracy is low, and the final demodulation decoding performance is larger than the performance under ideal channel estimation/time offset estimation. The method provided by the application enables the demodulation and decoding performance to be more approximate to the ideal channel estimation under the condition of low SNR or low SINR.

The application fully utilizes the channel information contained in the received data symbols to realize airspace combination with better performance.

H information is also included in the received data symbol y _s＝hs+n_s, and the application can estimate h information by using y _s＝hs+n_s, so that spatial domain combination can be realized.

Taking 4 receiving antennas of the base station as an example, the signals received by the 4 receiving antennas are respectively

y_s,1＝h₁s+n_s,1；

y_s,2＝h₂s+n_s,2；

y_s,3＝h₃s+n_s,3；

y_s,4＝h₄s+n_s,4

So that

Since the data and noise are independent, when N is relatively large,

So that the number of the parts to be processed,

Similarly, the following is true:

so that the number of the parts to be processed,

Finally, add

Thus, the first and second substrates are bonded together,

Wherein,

Since n' is the addition of 4 independent noiseWhereas (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁ s is actually the result of maximum ratio combining/spatial matched filtering combining of the data symbols received by the 4 antennas, i.e. coherent superposition of the data symbols received by the 4 antennas, so that the SNR of the data symbols obtained after such combining can be significantly improved over the SNR of the data symbols originally on each receiving antennaBy passing throughAfter combining, the signal portions are: (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁s＝4h₁ s, noise fractionIs Gaussian white noise (AWGN) with variance of 4σ ₂, and SNR isThe SNR is seen to be improved by a factor of 4, i.e. 6dB. This is consistent with the SNR gain of MRC combining based on ideal channel estimates at the 4 receive antennas. Therefore, the operation between the data symbols y _s,1,y_s,2,y_s,3,y_s,4 received by the 4 antennas only, i.e(Corresponding to combining the data symbols received by the M receiving antennas to obtain combined data symbols, where M is 4), and 4 data symbol streams with relatively low signal-to-noise ratio (SNR) received by the 4 antennas can be combined into one data symbol stream with high signal-to-noise ratio without pilot channel estimation. This combined data symbol stream may then be further equalized later.

Data-only merging methodThe data portion (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁ s is not yet standard modulation symbols because s also has a complex weight (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁, which also needs to be estimated and equalized to make the constellation of the modulation symbol stream standard, before going to the next demodulation decoding step.

Since (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁ s+n' is a relatively high signal-to-noise ratio modulation symbol stream, the estimation and equalization of complex weights on this symbol stream can be achieved by two methods, 1) by pilot estimation, 2) by the modulation symbol itself geometry, as follows:

1, estimating complex weights (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁ (i.e. combining pilot symbols received by M receiving antennas to obtain combined pilot symbols) on spatial-domain combined data symbol stream by spatial-domain combined pilot signals, estimating complex weights in the combined data symbols based on the combined pilot symbols)

The method of spatial combining pilot signals is the same as the spatial domain of the above data, namely the spatial combining weight is also calculated byThe spatial domain combination of the final pilot signals is obtained as follows:

(corresponding to combining pilot symbols received by the M receive antennas, the pilot symbols are combined by the following formula: )。

The PL long pilot row vector p is known, and pp ^*＝p² = PL, so:

the desired (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁) can be obtained.

The complex weights on the spatial-domain combined data symbol stream are estimated by the constellation geometry channel estimation method (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁) (i.e., the complex weights on the combined data symbols are determined by the combined data symbol geometry).

For convenience of description: let h= (h ₁ ²+h₂ ²+h₃ ²+h₄2)h₁, thus,

In one embodiment, a method for estimating h from hs+n 'is proposed, assuming that the data symbol s is a QPSK modulation symbol, fig. 4a is a QPSK-shaped constellation provided in the embodiment of the present application, and referring to fig. 4a, the constellation corresponding to the QPSK modulation symbol has a simple geometry, and even if hs+n' is received by the receiver, that is, the modulation symbol s undergoes a rotation scaling of a complex weighted channel h, the constellation corresponding to the modulation symbol s is only a QPSK constellation subjected to rotation scaling, and the geometry is still relatively simple, so that the complex weighted value on the combined data symbol is determined by the constellation corresponding to the combined data symbol.

Fig. 4b is a standard constellation diagram according to an embodiment of the present application. Fig. 4c is a constellation diagram without gaussian white noise after rotation scaling according to an embodiment of the present application. Fig. 4d is a constellation diagram with gaussian white noise according to an embodiment of the present application. Where fig. 4b is a standard constellation corresponding to the transmitted modulation symbol s, fig. 4c is a constellation corresponding to the received rotation scaled modulation symbol hs (i.e. a complex weight h multiplied by s, or may also be denoted as h·s), the rotation scaling amount being the complex number h. The constellation of fig. 4c illustrates a constellation corresponding to a received modulation symbol without AWGN. The constellation corresponding to the received modulation symbol hs + n' with AWGN is shown in fig. 4 d. It can also be seen from fig. 4d that the constellation corresponding to hs+n' can also maintain a simple geometry. Thus, the receiver can estimate the amount of rotational scaling h to which the constellation is subjected using the geometry of the constellation as in fig. 4 d. The method of the specific method is as follows:

first, the two-dimensional plane or the two-dimensional signal plane is divided into 4 partitions (i.e., the two-dimensional signal plane is partitioned), for example, two typical methods for dividing the two-dimensional signal plane into 4 partitions are:

First, 4 quadrants are 4 partitions, that is, x-axis and y-axis are partition lines, fig. 4e is a schematic diagram of a partition method according to an embodiment of the present application, as shown in fig. 4e, where diagonal filling is partition 1, thin-dot filling is partition 2, vertical filling is partition 3, and brick filling is partition 4. The setting position of the partition is not limited here, and for example, the diagonal filling area may be partition 2, the fine-dot filling area may be partition 3, the vertical filling area may be partition 4, and the brick filling area may be partition 1.

The second is: 4 partitions formed by rotating the first 4 partitions by 45 ° are required partitions, and fig. 4f is a schematic diagram of another partition method provided by an embodiment of the present application, as shown in fig. 4 f. That is:

Taking the ray from a dot to 45 degrees to the ray from the dot to 135 degrees as a partition 1, and filling by oblique lines;

Taking the ray from a dot to 135 degrees to the ray from the dot to 225 degrees as a partition 2, and filling with fine points;

taking the ray from the round point to 225 degrees to the ray from the round point to 315 degrees as a partition 3, and filling with vertical lines;

The areas 4 are divided from the circular point to 315 DEG ray to the circular point to 45 DEG ray, and the areas are filled with bricks.

The setting positions of the partitions in the second partition mode are not limited here, and may be:

taking the ray from a dot to 45 degrees to the ray from the dot to 135 degrees as a partition 2, and filling by oblique lines;

Taking the ray from a round point to 135 degrees to the ray from the round point to 225 degrees as a partition 3, and filling with fine points;

Taking the ray from the round point to 225 degrees to the ray from the round point to 315 degrees as a partition 4, and filling with vertical lines;

the partition 1 is filled with bricks by taking the ray from the round point to 315 degrees to the ray from the round point to 45 degrees.

Besides the two partitioning methods of fig. 4e and fig. 4f, other methods of dividing the two-dimensional plane into 4 partitions are also possible, but when the two partitioning methods of fig. 4e and fig. 4f are adopted, the judgment of which partition a constellation point belongs to can be achieved simply by performing some simple addition and subtraction on the coordinates of the constellation point, without requiring more complex multiplication operations, so that the implementation is simpler.

After the receiver divides the two-dimensional signal plane into 4 partitions, the constellation points in each partition (each constellation point corresponds to one modulation symbol) are added up, and then divided by the number of constellation points in the partition (i.e. the number of modulation symbols), and the obtained constellation points are the centers of the constellation points in the partition (i.e. for each partition, the centers of the constellation points in the partition are determined based on the constellation points in the partition).

Fig. 4d is hs+n' i.e. a QPSK constellation with complex h-weighting and AWGN. Taking the partitioning as shown in fig. 4e as an example, after the constellation points are partitioned into 4 parts, fig. 4g is a constellation diagram including a constellation point center according to an embodiment of the present application, as shown in fig. 4 g:

the constellation points in partition 1 are added up and divided by the number of constellation points in the partition to obtain the center c1 of the constellation points in the partition 1, as a triangle in fig. 4 g.

The constellation points in partition 2 are added up and divided by the number of constellation points in the partition to obtain the center c2 of the constellation points in the partition 2, such as the quadrangle in fig. 4 g.

The constellation points in partition 3 are added up and divided by the number of constellation points in the partition to obtain the center c3 of the constellation points in the partition 3, as five-pointed star in fig. 4 g.

The constellation points in partition 4 are added up and divided by the number of constellation points in the partition to obtain the center c4 of the constellation points in the partition 4, such as the hexagram in fig. 4 g.

Then, the rotation scaling of the whole constellation can be obtained by the centers of the constellation points of all the partitions, for example, taking the first partition as an example, i.e. fig. 4g as an example, and the calculated centers of the 4 partitions are respectively c1, c2, c3 and c4. Then:

the center c2 of partition 2 is rotated 90 ° clockwise to obtain c2', i.e. c2' =c2×j;

The center of partition 3 is rotated 180 ° clockwise to obtain c3', i.e., c3' = -c3;

the center of partition 4 is rotated 90 ° counter-clockwise to obtain c4', i.e. c4' = -c4 j;

The resulting complex number c can then be used as an estimate of the rotational scaling of the entire constellation by calculating c= (c1+c2 ' +c3' +c4 ')/4 (i.e. based on the determined center, complex weight values on the combined data symbols are determined).

When AWGN is present, a handoff may occur when AWGN is relatively large for some of the modulation symbols. In order to estimate the rotation scaling amount more accurately, it is generally necessary to use the two partition methods of fig. 4e and fig. 4f described above, then calculate the rotation scaling amount of the constellation according to the method described above for each partition, and then use the one with the larger two rotation scaling amount modulus values as the rotation scaling amount of the constellation.

After the receiver estimates the rotation scaling amount of the constellation diagram, the rotation scaling experienced by the constellation diagram can be balanced out, and the constellation diagram which is not distorted and is only influenced by the AWGN is obtained.

Phase ambiguity exists by estimating the constellation rotation scaling amount from the constellation geometry. For QPSK, the rotation scaling amount estimated from hs+n' may be one of 4 cases of h, j.h, -h, -j.h, where j=sqrt (-1), is a unit imaginary number; that is, the estimated rotational scaling amount may be h, h rotated 90 °, h rotated 180 °, h rotated 270 °, one of these 4 cases. Therefore, there are also 4 kinds of phase ambiguities in the equalized modulation symbol. The equalized N long modulation symbols need to be uniformly multiplied by 1, j, -1, -j, respectively, to form 4N long modulation symbol streams, which are all sent to demodulation and decoding, that is, need to be decoded 4 times, wherein the pair of decoding is the one corresponding to the accurate channel estimation. Or the equalized N long modulation symbols are required to be uniformly rotated by 0 degree, rotated by 90 degrees, rotated by 180 degrees and rotated by 270 degrees respectively, so as to form 4N long modulation symbol streams, which are all sent to demodulation and decoding, namely, the decoding is required to be performed for 4 times, wherein the decoding pair corresponds to the accurate channel estimation (namely, the equalized data symbols are respectively rotated by a plurality of set degrees to obtain a plurality of rotated data symbols, and the data symbols after the rotation are demodulated and decoded).

It can be seen that the spatial domain MRC combination is realized only through the operation of the data symbols without depending on pilot channel estimation,

And then the channel equalization is realized by the characteristics of the combined Data modulation symbols, and the whole process does not need to depend on pilot signals, so that pilot signals can be completely not inserted into signals transmitted by a transmitter, and all the signals are Data symbols, so that the signals are pilot-free transmission signals or Data-only transmission signals. Thus, all the transmitting resources are used for bearing data symbols, the overhead of pilot frequency is avoided, and the transmission efficiency can be higher. For example, in the current NR/LTE standard, the pilot overhead of the Physical Uplink shared channel (Physical Uplink SHARED CHANNEL, PUSCH) may generally reach 1/7, even 2/7, and by the method of the present application, the pilot overhead may be completely saved, that is, the transmission efficiency may be improved by 7/6-1=17%, or 7/5-1=40%.

The data-only merging methodIt can be said that y _s, 1 is the reference. Similarly, the data combining method may be as follows based on the received signals of other antennas, for example, based on y _s, 2:

And so on for the rest.

Taking 4 receiving antennas as an example, for the general M receiving antennas, a data-only combining method based on y _s, 1 is as follows:

The data-only merging method based on any y _s, k is as follows:

The value range of k is a positive integer greater than or equal to 1 and less than or equal to M (namely, the data symbols received by M receiving antennas are combined through the following formula to obtain combined data symbols:

Combining these methods to obtain hs+n' similar to the above 4 antennas, estimating h by the above two methods, equalizing, and then obtaining standard constellation diagram, and sending to demodulation and decoding.

For the case of the time-offset, if the time-offset exists in the transmission, the transmitted signal undergoes phase rotation introduced by the time-offset in addition to the weighting of the wireless channel. The pilot signals received by the M receiving antennas of the base station are:

y_p＝hpE_p+n_p。

the data signals received by the M receiving antennas are:

y_s＝hsE_s+n_s；

Wherein E _p is a PL-PL diagonal matrix and E _s is an N-N diagonal matrix; the element on the diagonal of E _p E_s is the phase rotation introduced by the time offset.

When looking at one antenna alone, the pilot signal received by the mth receiving antenna of the base station is:

y_p,m＝h_mpE_p+n_p,m；

y _p,m is a two-dimensional array of 1 x PL or a PL long row vector.

The pilot signal received by the mth receiving antenna is: y _s,m＝h_msE_s+n_s,m.

Although the phase rotation is introduced because of the time-frequency offset, that is, E _p E_s is introduced, the data combining method is not affected by E _p E_s. Taking the base station 4 receiving antennas as an example, the signals received by the 4 receiving antennas are respectively:

y_s,1＝h₁sE_s+n_s,1；

y_s,2＝h₂sE_s+n_s,2；

y_s,3＝h₃sE_s+n_s,3；

y_s,4＝h₄sE_s+n_s,4。

So that

Since the phase rotation is a complex number modulo 1, the phase rotation is a complex numberIs equal to the unit array; and the data and noise after phase rotation are still independent, so when N is relatively large, the data and noise can be ensured:

thus, MRC spatial combining may be implemented with the following equation, even if there is a time-frequency offset:

Here again, let h= (1+h ₂ ²+h₃ ²+h₄2)h₁, therefore, pilot frequency is not needed, and hsE _s +n' can be obtained by spatial domain combination of data only, i.e. the combined symbol stream is a constellation with complex weights h and time offset phase rotations, where complex weights are consistent with the previous ones without time offset.

Method 1, estimating (1+h) by spatial domain combined pilot signals ₂ ²+h₃ ²+h₄2)h₁

Note that the method of spatial combining of pilot signals is the same as the spatial domain of the above data, i.e., the spatial combining weights are also calculated byThe spatial domain combination of the final pilot signals is obtained as follows:

The PL long pilot row vector p is known, so:

(|h₁|²+|h₂|²+|h₃|²+|h₄|²)h₁E_s, can be obtained by using (|h₁|²+|h₂|²+|h₃|²+|h₄|²)h₁E_p because E _p and E _s have the same time frequency offset and phase rotations at different time frequency positions, and E _s can be calculated by knowing E _p with a certain corresponding relation.

Method 2, estimation by modulating the geometry of the symbols (|h₁|²+|h₂|²+|h₃|²+|h₄|²)h₁E_s.

For convenience of description: in this manner h＝(|h₁|²+|h₂|²+|h₃|²+|h₄|²)h₁, is provided for the purpose of,

The phase rotation caused by the time-frequency offset (i.e. the E _s diagonal array) is estimated from the hsE _s +n 'constellation, and if the transmission adopts the QPSK constellation as shown in fig. 4a, the N long modulation symbol row vectors hsE _s +n' after spatial combining will be similar to the constellation of fig. 4g on the two-dimensional signal plane due to the phase rotation caused by the time-frequency offset. Fig. 4h is a constellation diagram of frequency offset when present according to an embodiment of the present application. The constellation of fig. 4h is frequency offset when present. Although the constellation is rotated, the constellation may be segmented, with each segment estimating a constellation rotation amount.

Fig. 4i is a segmented constellation provided by an embodiment of the present application, and fig. 4j is a first segment constellation provided by an embodiment of the present application. Fig. 4k is a second segment constellation provided in an embodiment of the present application. Fig. 4i is a block diagram of dividing the constellation point of fig. 4g into two sections of time-frequency adjacent symbols (corresponding to dividing the constellation points included in the constellation diagram corresponding to the combined data symbol into multiple sections), wherein the block diagram is filled with a first section, the block diagram is filled with a second section, and then the rotation amounts c _a of the constellation points of the first section are respectively estimated by using the above channel estimation method based on the geometry of the constellation diagram, as shown in fig. 4 j; the rotation of the second segment constellation point c _b is shown in fig. 4 k. The time-frequency offset phase rotation on the constellation points can then be estimated using the rotation amounts of the adjacent segment constellation points (i.e., for each segment constellation point, the phase rotation of the combined data symbol is determined). Finally, h in the combined modulation symbol stream hsE _s +n' and phase rotation E _s caused by frequency offset in time can be balanced to obtain a standard modulation symbol; the equalized modulation symbols are then sent to demodulation decoding.

In wireless communication, it is very important to enhance coverage and enhance performance of edge users, and the application can significantly improve transmission performance of weak users.

In an exemplary embodiment, the present application provides a determining apparatus, and fig. 5 is a schematic structural diagram of a determining apparatus provided by an embodiment of the present application; the apparatus may be integrated on a first communication node, the apparatus comprising: the merging module 510 is configured to: combining the data symbols received by the M receiving antennas to obtain combined data symbols; the combining weights required for combining the data symbols received by the M receiving antennas are determined by the received data symbols, and M is an integer greater than 1.

The determining device provided in this embodiment is used to implement the determining method of the embodiment of the present application, and the determining device provided in this embodiment has similar implementation principles and technical effects to the determining method of the embodiment shown in fig. 1, and will not be described herein.

In one embodiment, the merging module 510 is specifically configured to:

Wherein, In order to combine the required combining weights, N is the length of the data symbol in the received symbol, y _s, ^k and y _s,m are the row vectors formed by the N data symbols received by the kth and mth receiving antennas of the first communication node,Transpose the conjugate of y _s,m, an N long column vector; k is an arbitrary integer of 1 or more and M or less.

In one embodiment, the apparatus further comprises: a first equalization module comprising:

the combining unit is used for combining pilot frequency symbols received by the M receiving antennas to obtain combined pilot frequency symbols;

an estimation unit configured to estimate complex weight values in the combined data symbols based on the combined pilot symbols;

and the first equalization unit is used for equalizing the combined data symbols based on the complex weighted value.

In one embodiment, the merging unit is merged by the following formula:

Wherein, In order to combine the required combining weights, y _p,m is a row vector formed by pilot signals received by the mth antenna of the first communication node, N is the length of data symbols in the received symbols, y _s, k is a row vector formed by N data symbols received by the kth receiving antenna of the first communication node,A conjugate transpose of a row vector y _s,m formed by N data symbols received by an mth receiving antenna of the first communication node is an N-long column vector; k is an arbitrary integer of 1 or more and M or less.

In one embodiment, the merging module 510 is specifically configured to:

In one embodiment, the merging unit is specifically configured to:

In one embodiment, the estimation unit is specifically configured to:

In one embodiment, the first equalization unit is specifically configured to:

In one embodiment, the determining apparatus further includes a second equalization module, including:

A first determining unit configured to determine complex weighted values on the combined data symbols by the geometry of the combined data symbols;

and the second equalization unit is used for equalizing the combined data symbols based on the complex weighted value.

In one embodiment, the first determining unit is specifically configured to:

In one embodiment, the first determining unit includes:

a partitioning subunit configured to partition the two-dimensional signal plane;

a first determining subunit configured to determine, for each partition, a center of a constellation point within the partition based on the intra-partition constellation point;

A second determining subunit configured to determine a complex weight value on the combined data symbol based on the determined center.

In one embodiment, the second determining subunit is specifically configured to:

c＝(c1+c2')/2，c2'＝-c2；

c＝(c1+c2'+c3'+c4')/4，c2'＝c2*j，c3'＝-c3，c4'＝-c4*j；

In one embodiment, the determining apparatus further comprises a rotation module configured to:

demodulating and decoding the rotated data symbols.

In one embodiment, the determining apparatus further comprises a segmentation module, including:

The segmentation unit is used for dividing constellation points included in the constellation diagram corresponding to the combined data symbols into multiple segments;

A second determining unit arranged to determine, for each segment of constellation points, a phase rotation of the combined data symbols.

In one embodiment, the second determining unit is specifically configured to:

Partitioning the two-dimensional signal plane;

A phase rotation is determined based on the rotation amount.

In an exemplary embodiment, the present application provides a transmission apparatus, where the transmission apparatus is configured on a second communication node, and fig. 6 is a schematic structural diagram of a transmission apparatus provided by an embodiment of the present application, and as shown in fig. 6, the apparatus includes:

A determining module 610 arranged to determine a signal transmitted to the first communication node, the signal being a signal not containing pilots, the signal comprising data symbols, the combining weights required for the combining of the data symbols being determined based on the data symbols;

a transmitting module 620 arranged to transmit the signal.

The transmission device provided in this embodiment is used to implement the transmission method in this embodiment, and the implementation principle and technical effects of the transmission device provided in this embodiment are similar to those of the transmission method in this embodiment, and are not described herein again.

In an exemplary embodiment, the embodiment of the present application further provides a first communication node, and fig. 7 is a schematic structural diagram of the first communication node provided by the embodiment of the present application. The first communication node provided by the application comprises one or more processors 71 and a storage device 72; the first communication node may have one or more processors 71, one processor 71 being exemplified in fig. 7; the storage device 72 is used for storing one or more programs; the one or more programs are executed by the one or more processors 71, causing the one or more processors 71 to implement the determination methods as described in embodiments of the present application.

The first communication node further comprises: a communication device 73, an input device 74 and an output device 75.

The processor 71, the storage means 72, the communication means 73, the input means 74 and the output means 75 in the first communication node may be connected by a bus or other means, in fig. 7 by way of example.

The input means 74 may be used to receive entered numeric or character information and to generate key signal inputs relating to user settings and function control of the first communication node. The output means 75 may comprise a display device such as a display screen.

The communication device 73 may include a receiver and a transmitter. The communication device 73 is provided to perform information transmission and reception communication according to the control of the processor 71.

The storage device 72, which is a computer-readable storage medium, may be configured to store a software program, a computer-executable program, and a module, such as program instructions/modules corresponding to the determination method according to the embodiment of the present application (e.g., the merging module 510 in the determination device). The storage device 72 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for a function; the storage data area may store data created according to the use of the first communication node, etc. In addition, the storage 72 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, the storage device 72 may further include memory remotely located with respect to the processor 71, which may be connected to the first communication node via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

In an exemplary embodiment, the embodiment of the present application further provides a second communication node, and fig. 8 is a schematic structural diagram of the second communication node provided by the embodiment of the present application. As shown in fig. 8, the second communication node provided by the present application includes one or more processors 81 and a storage device 82; the number of processors 81 in the second communication node may be one or more, one processor 81 being taken as an example in fig. 8; the storage 82 is used for storing one or more programs; the one or more programs are executed by the one or more processors 81, so that the one or more processors 81 implement the transmission method as described in the embodiments of the present application.

The second communication node further comprises: a communication means 83, an input means 84 and an output means 85.

The processor 81, the storage 82, the communication means 83, the input means 84 and the output means 85 in the second communication node may be connected by a bus or other means, in fig. 8 by way of example.

The input means 84 may be used to receive entered numeric or character information and to generate key signal inputs related to user settings and function control of the second communication node. The output means 85 may comprise a display device such as a display screen.

The communication means 83 may comprise a receiver and a transmitter. The communication means 83 is provided for performing information transmission and reception communication in accordance with the control of the processor 81.

The storage device 82, which is a computer-readable storage medium, may be configured to store a software program, a computer-executable program, and modules, corresponding to the transmission method according to the embodiment of the present application, for example, the determining module 610 and the transmitting module 620 in the transmission device. The storage 82 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for a function; the storage data area may store data created according to the use of the second communication node, etc. In addition, the storage 82 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, the storage 82 may further include memory remotely located with respect to the processor 81, which may be connected to the second communication node via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

In an exemplary embodiment, the embodiment of the present application further provides a storage medium storing a computer program, where the computer program is executed by a processor to implement any one of the methods of the present application, and the storage medium storing a computer program, where the computer program is executed by the processor to implement the determining method and the transmitting method in the embodiment of the present application.

The determining method comprises the following steps:

The transmission method comprises the following steps:

The signal is transmitted.

The computer storage media of embodiments of the application may take the form of any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), a flash Memory, an optical fiber, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. A computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to: electromagnetic signals, optical signals, or any suitable combination of the preceding. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, radio Frequency (RF), and the like, or any suitable combination of the foregoing.

Computer program code for carrying out operations of the present application may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The foregoing description is only exemplary embodiments of the application and is not intended to limit the scope of the application.

It will be appreciated by those skilled in the art that the term terminal device encompasses any suitable type of wireless user equipment, such as a mobile telephone, a portable data processing device, a portable web browser or a car mobile station.

In general, the various embodiments of the application may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.

Embodiments of the application may be implemented by a data processor of a mobile device executing computer program instructions, e.g. in a processor entity, either in hardware, or in a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (InstructionSetArchitecture, ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages.

The block diagrams of any of the logic flows in the figures of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on a memory. The Memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), optical storage devices and systems (digital versatile Disk (Digital Video Disc, DVD) or Compact Disk (CD)), and the like. The computer readable medium may include a non-transitory storage medium. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general purpose computers, special purpose computers, microprocessors, digital signal processors (DIGITAL SIGNAL Processing, DSP), application SPECIFIC INTEGRATED Circuits (ASIC), programmable logic devices (Field-Programmable GATE ARRAY, FGPA), and processors based on a multi-core processor architecture.

The foregoing detailed description of exemplary embodiments of the application has been provided by way of exemplary and non-limiting examples. Various modifications and adaptations to the above embodiments may become apparent to those skilled in the art without departing from the scope of the application, which is defined in the accompanying drawings and claims. Accordingly, the proper scope of the application is to be determined according to the claims.

Claims

1. A method of determining, for application to a first communication node, the method comprising:

2. The method of claim 1, wherein combining the data symbols received by the M receive antennas to obtain the combined data symbols comprises:

Wherein, In order to combine the required combining weights, N is the length of the data symbol in the received symbol, y _s,k and y ^s,m are the row vectors formed by the N data symbols received by the kth and mth receiving antennas of the first communication node,Transpose the conjugate of y _s,m, an N long column vector; k is an arbitrary integer of 1 or more and M or less.

3. The method as recited in claim 1, further comprising:

and based on the complex weighted value, balancing the combined data symbols.

4. A method according to claim 3, wherein the pilot symbols received by the M receive antennas are combined by the formula:

5. The method of claim 1 wherein combining the data symbols received by the M receive antennas to obtain the combined data symbols comprises:

6. The method as recited in claim 5, further comprising:

7. The method as recited in claim 1, further comprising:

and based on the complex weighted value, balancing the combined data symbols.

8. The method of claim 7, wherein said determining complex weights on the combined data symbols from the geometry of the combined data symbols comprises:

9. The method of claim 8, wherein the determining complex weights on the combined data symbols from the constellation corresponding to the combined data symbols comprises:

Partitioning the two-dimensional signal plane;

10. The method of claim 9, wherein the determining complex weight values on the combined data symbols based on the determined center comprises:

c＝(c1+c2')/2，c2'＝-c2；

11. The method of claim 9, wherein the determining complex weight values on the combined data symbols based on the determined center comprises:

c＝(c1+c2'+c3'+c4')/4，c2'＝c2*j，c3'＝-c3，c4'＝-c4*j；

12. The method as recited in claim 7, further comprising:

demodulating and decoding the rotated data symbols.

13. The method of claim 1, wherein the combined data symbols comprise one or more of:

14. The method as recited in claim 13, further comprising:

15. The method of claim 14, wherein determining the phase rotation of the combined data symbols for each segment of constellation points comprises:

Partitioning the two-dimensional signal plane;

A phase rotation is determined based on the rotation amount.

16. A transmission method for use in a second communication node, the method comprising:

The signal is transmitted.

17. A first communication node, comprising:

one or more processors;

A storage means for storing one or more programs;

When executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-15.

18. A second communication node, comprising:

one or more processors;

A storage means for storing one or more programs;

The one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of claim 16.

19. A storage medium storing a computer program which, when executed by a processor, implements the method of any one of claims 1-16.