METHOD OF DETERMINING PRECODING MATRIX AND CORRESPONDING COMMUNICATION METHODS AND DEVICES

Abstract

In order to improve the performance of the precoding scheme for closely-spaced cross-polarized CLA antennas, the invention proposes a new precoding codebook and precoding matrix. The invention also proposes a method for determining precoding matrix based on the new precoding codebook, and corresponding method and device for communicating by using this precoding matrix. The precoding codebook and matrix proposed in the invention has better performance.

Description

TECHNICAL FIELD

The invention relates to multi-antenna technology, particularly relates to precoding method in the multi-antenna technology.

BACKGROUND OF THE ART

According to the agreed way forward for Rel-10 feedback [1], a precoder for a subband is composed of two matrices, one of which targets wideband and/or long-term channel properties, denoted by W₁, and the other targets frequency-selective and/or short-term channel properties, denoted by W₂. The eNB determines the W₁ via long-term wideband feedback, and determines the W₂ via short-term narrowband feedback.

For closely-spaced multi-antenna, the precoding scheme could take the antenna-related characteristic brought by the closely spacing into consideration, so as to simplify the design of the precoding scheme. The industry has discussed about the precoding codebook of the closely-spaced cross-polarized CLA. In R1-103026, Samsung has proposed their two-stage feedback approach with W₁ a M×r matrix and W₂ a M×M square matrix; and in R1-101742, Ericsson has proposed their two-stage feedback approach with W₁ a M×2 matrix and W₂ a 2×r matrix, wherein M is the amount of the antennas and r is the amount of the data flows. The performance of both above approaches under the MU-MIMO scenario, such as data throughput, is not satisfying.

SUMMARY OF THE INVENTION

The invention proposes a precoding scheme based on a new code book, and this scheme has better data throughput.

According to a first aspect of the invention, it is proposed a method for determining precoding matrix for sub-band precoding, wherein the transmitter has two set of cross-polarized antennas, the channel vectors of the two set of antennas with different polarization direction are H₁ and H₂ respectively, these antennas are closely-spaced, M is the amounts of the transmitting antennas, r is the amount of the data flows, the channel vectors H₁ and H₂ satisfy the following complex relationship:

H ₂ =/βe ^jδ H ₁

Wherein β is the amplitude of the complex relationship between the two channel vector, and δ is the angle of the complex relationship between the two channel vector;

the method comprises the following steps:a. determining, according to long-term channel related information, an optimized first matrix W₁ with a dimension of M×M, the first matrix corresponding to wideband and/or long-term channel properties, and the first matrix W₁ is selected from first codebook below:

$W_1=\left(\begin{array}{cc}R& 0\\ 0& R\end{array}\right),R=\left(\begin{array}{c}{v}_1^{*}\\ {}^{-\mathrm{j\theta }}v_1^{*}\\ ⋮\\ {}^{-j\left(M/2-1\right)\theta }v_1^{*}\end{array}\right)=\left(\begin{array}{cccc}1& {}^{j\theta }& \dots & {}^{j\left(M/2-1\right)\theta }\\ {}^{-\mathrm{j\theta }}& 1& \dots & {}^{j\left(M/2-2\right)\theta }\\ ⋮& \dots & \ddots & ⋮\\ {}^{-j\left(M/2-1\right)\theta }& \dots & \dots & 1\end{array}\right)$

Wherein, R is a proximity of the transmitting space correlation matrix of H₁, v₁=[1,e^−jθ, . . . ,e^{−j(M/2-1)θ}] is a dominant eigenvector of the transmitting space correlation matrix of H₁, proximated by DFT vector, θ is the angle difference between the two neighboring item of the DFT vector;

b. multiplying the optimized first matrix W₁ with each second matrix W₂ with a dimension of M×r in a second codebook, so as to obtain a plurality of candidate precodingmatrices, wherein the second matrix W₂ corresponds to frequency-selective and/or short-term channel properties and is selected from second codebook below:

W ₂=(W₂¹,W₂²,W₂^r),

wherein, W₂ⁱ is the i-th column of W₂, letting n=└(i−1)/2┘+1, the n-th element of W₂ⁱ is 1, and the (n+M/2)-th element is βe^jδ when mod(i,2)=1, is 1/βe^−jδ when mod(i,2)=0 and other elements are 0;c. selecting an optimized one from the plurality of candidate precoding matrices for precoding the data to be transmitted based on predefined rules, according to the short-term channel properties.

According to a second aspect of the invention, it is proposed a method, in a user equipment, for feeding precoding matrix for sub-band precoding back to an eNodeB, comprising the steps of:

• • determining said optimized first matrix W₁ and precoding matrix, by using a method according to the aforesaid first aspect of the invention;
  • determining an optimized second matrix W₂ corresponding to said optimized precoding matrix;
  • providing, for the eNodeB, identifications of said optimized first matrix W₁ and said second matrix W₂.

Correspondingly, the invention also proposes a device, in a user equipment, for feeding precoding matrix for sub-band precoding back to an eNodeB, comprising:

• • a determining means, for determining said optimized first matrix W₁ and precoding matrix, by using a method according to the aforesaid first aspect of the invention, and determining an optimized second matrix W₂ corresponding to said optimized precoding matrix;
  • a sender, for providing, for the eNodeB, identifications of said optimized first matrix W₁ and said second matrix W₂.

According to the third aspect of the invention, it is proposed a method, in an eNodeB, for precoding data, comprising:

• • receiving identifications of an optimized first matrix W₁ and second matrix W₂, fed back by a user equipment;
  • determining, from the first codebook and the second code book in a method according to the aforesaid first aspect of the invention, the optimized first matrix W₁ and second matrix W₂ according to the identifications;
  • multiplying the optimized first matrix W₁ and second matrix W₂, and obtaining optimized precoding matrix;
  • precoding data to be transmitted by using the optimized precoding matrix, so as to transmit the data to the user equipment.

Correspondingly, the invention also proposes a device, in an eNodeB, for precoding data, comprising:

• • a receiver, for receiving identifications of an optimized first matrix W₁ and second matrix W₂ fed back by a user equipment;
  • a inquiring means, for determining, from the first codebook and the second code book in a method according to the aforesaid first aspect of the invention, the optimized first matrix W₁ and second matrix W₂, from the identifications;
  • a calculating means, for multiplying the optimized first matrix W₁ and second matrix W₂, and obtaining optimized precoding matrix;
  • a precoder, for precoding data to be transmitted by using the optimized precoding matrix, so as to transmit the data to the user equipment. The above and other features will be elucidated in the following detailed embodiments, or become obvious from the following detailed embodiments.

DETAILED EMBODIMENTS

Firstly, the design of codebook according to the invention will be elucidated as following.

For two groups of cross-polarized antennas, by observation, the inventors find that there exists a fast-varying complex vector relationship between the two antenna groups, as described by the following formula:

H ₂ =βe ^jδ H ₁  (1)

Wherein H₁ is the channel vector representing one antenna group on one polarization and H₂ is the channel vector representing the other antenna group on the other polarization, β is the amplitude of the complex relationship between the two channel vector, and δ is the angle of the complex relationship between the two channel vectors. H₁ can be treated as the long-term wideband static channel. This observation agrees with the theoretical analysis on cross-polarized antennas in reference document ((L. Jiang, L. Thiele, and V. Jungnickel, “On the Modelling of Polarized MIMO Channel,” 13th European Wireless Conference, Paris, France, April 2007).

For closely-spaced antennas, the dominant eigenvector in H₁, v₁, can be approximated by a DFT vector:

v ₁=[1,e^−jθ, . . . ,e^{−j(M/2-1)θ}]  (2)

For single layer (rank) (the amount of data flows is 1), the precoding matrix for sub-band precoding is described as the following formula:

$\begin{array}{cc}W=\left(\begin{array}{cc}R& 0\\ 0& R\end{array}\right)\left(\begin{array}{c}1\\ 0\\ \beta {}^{j\delta }\\ 0\end{array}\right)=\left(\begin{array}{c}{v}_1^T\\ \beta {}^{\mathrm{j\delta }}v_1^T\end{array}\right)& \left(3\right)\end{array}$

Wherein

$W_1=\left(\begin{array}{cc}R& 0\\ 0& R\end{array}\right)$

with a dimension of M×M,

$R=\left(\begin{array}{c}{v}_1^{*}\\ {}^{-\mathrm{j\theta }}v_1^{*}\\ ⋮\\ {}^{-j\left(M/2-1\right)\theta }v_1^{*}\end{array}\right)=\left(\begin{array}{cccc}1& {}^{j\theta }& \dots & {}^{j\left(M/2-1\right)\theta }\\ {}^{-\mathrm{j\theta }}& 1& \dots & {}^{j\left(M/2-2\right)\theta }\\ ⋮& \dots & \ddots & ⋮\\ {}^{-j\left(M/2-1\right)\theta }& \dots & \dots & 1\end{array}\right)$

And the precoding matrix W₂=[1,0,βe^jδ,0]^T with a dimension of M×1. For closely-spaced cross-polarized CLA antennas, W₁ can be treated as a channel correlation matrix of the two groups of cross-polarized antennas, and R can be treated as the channel correlation matrix of the group of antennas corresponding to H₁.

For two layers (the amount of data flows is 2), W₁ doesn't change, and W₂ is determined according to the following formula:

$W_2=\left(\begin{array}{cc}1& 1\\ 0& 0\\ \beta {}^{j\delta }& \frac{1}{\beta }{}^{-\mathrm{j\delta }}\\ 0& 0\end{array}\right).$

Generally, for the case that the amount of data flows is r, W₂=(W₂¹,W₂², . . . ,W₂^r) wherein, W₂ⁱ is the i-th column of W₂, letting n=└(i−1)/2┘+1, the n-th element of W₂ⁱ is 1, and the (n+M/2)-th element is βe^jδ when mod(i,2)=1, is 1/βe^−jδ when mod(i,2)=0 and other elements are 0.

For example, in an embodiment, for M transmitting antennas and maximum 2 layers, the 16 codewords w_2,i in the 4-bit second codebook W₂ are determined by the formula in the following table 1:

TABLE 1
Serial No.            Codeword
i = 0, . . . , 24 − 1 W                                              2                        ,                        i                                                              =                                          (                                                                                                                                                                                                                                              1                                                                                                                                1                                                                                                                                                                                                                                                                                                                                                                                                                    0                                                                                                                                0                                                                                                                                                                                                                                                                                                                                        β                                m                                                                                                                                                                                            j                                                                                                                                                                                                                                                  δ                                    n                                                                                                                                                                                                                                                                          1                                                                  β                                  m                                                                                                                                                                                                                                                                -                                    j                                                                                                                                                                                                                                                                                    δ                                    n                                                                                                                                                                                                                                                            0                                                                                                                                                                                                                                                                                                                                                                                                                    0                                                                                              )
                      wherein, m = └i/22┘ and n = mod(i, 22).

wherein β₀=0.5, β₁=1, β₂=2, β₃=4, and δ₀=−π/2, δ₁=π/2, δ₃=π. The 256 codewords w_1,i in the 8-bit first codebook are determined by the formula in the following table 2:

TABLE 2
Serial No.            Codeword
i = 0, . . . , 28 − 1 W                                              1                        ,                        i                                                              =                                          (                                                                                                                                  R                              n                                                                                                                                                                                                                                                                    0                                                                                                                                                            0                                                                                                                                              α                                m                                                                                                                          R                                n                                                                                                                                                        )
                      and                    ,                                                                  R                        n                                            =                                              (                                                                                                            1                                                                                                                      r                                                                                                                                                                                                                                                                                                          j                                                                                                                                                                                                                                                                θ                                      n                                                                                                                                                                                                                          …                                                                                                                                                        r                                                                                                            M                                      /                                      2                                                                        -                                    1                                                                                                                                                                                                                                                                                j                                                                                                                    (                                                                                                                              M                                            /                                            2                                                                                    -                                          1                                                                                )                                                                                                                                                                                        θ                                      n                                                                                                                                                                                                                                                                                                              r                                                                                                                                                                                                                                                                                                                                                -                                      j                                                                                                                                                                                                                                                                                                    θ                                      n                                                                                                                                                                                                                          1                                                                                      ⋱                                                                                      ⋮                                                                                                                                          ⋮                                                                                      ⋱                                                                                      1                                                                                                                      r                                                                                                                                                                                                                                                                                                          j                                                                                                                                                                                                                                                                θ                                      n                                                                                                                                                                                                                                                                                                                                                r                                                                                                            M                                      /                                      2                                                                        -                                    1                                                                                                                                                                                                                                                                                -                                                                              j                                                                                                                          (                                                                                                                                    M                                              /                                              2                                                                                        -                                            1                                                                                    )                                                                                                                                                                                                                                θ                                      n                                                                                                                                                                                                                          …                                                                                                                      r                                                                                                                                                                                                                                                                                                                                                -                                      j                                                                                                                                                                                                                                                                                                    θ                                      n                                                                                                                                                                                                                          1                                                                                                      )                                                              ,
                      m = └i/26┘ and n = mod(i, 26).

wherein, α₀=0.25, α₁=0.5, α₂=1, α₃=2 r=1, and θ_n=nπ/32, n=0, . . . , 2⁶−1.

The selected values of the amplitude α and β are used for covering the amplitude of the complex relationship falling into a certain range, and the selected values of the angle difference δ, θ are used for covering the cases that the angle difference falls into difference location ranged from 0-2Π, in order to evenly and completely provide a plurality of candidate complex relationships for selecting the nearest first matrix and second matrix according to the channel status information. It should be noted, in case that the bit number of the first codebook and second codebook, namely the amount of the first matrices and the second matrices, change, the values of the amplitude and angle difference can be adjusted correspondingly, so as to evenly and completely provide a plurality of candidate complex relationships.

The codewords determined according to the invention is described by the above embodiment. It should be noted that the invention is not limited by this set of codeword, and those skilled in the art could determine other suitable codeword based on the disclosure in the invention.

The following part will describe the embodiment of carrying out precoding communication based on the codewords determined by the invention.

Firstly, the user equipment (UE) measures long-term channel properties, and selects, from the first codebook such as the codebook in table 2, an optimized first matrix W₁ with a dimension of M×M, according to the long-term channel properties. It is well known for those skilled in the art that how to select a corresponding optimized codeword according to the long-term channel properties, and the description will not give unnecessary detail.

After that, to multiply the first matrix W₁ with each second matrix W₂ with a dimension of M×r in a second codebook, so as to obtain a plurality of candidate precoding matrices. The second codebook is such as the codebook as shown in table 1.

Then, the UE selects an optimized precoding matrix from the plurality of candidate precoding matrices based on predefined rules, according to the measured short-term channel properties. The predefined rules are such as to select a candidate precoding matrix enabling a maximum channel capacity. It should be noted that other rules are also applicable, and the description will not give unnecessary details.

Then, the UE can determine an optimized second matrix W₂ corresponding to the optimized precoding matrix.

At last, the UE provides, for the eNodeB, identifications of the optimized first matrix W₁ and the second matrix W₂. The identifications are such as the serial numbers of the matrix in the codebook.

On the side of the eNodeB, it receives identifications of the optimized first matrix W₁ and second matrix W₂ fed back by user equipments. Then, the eNodeB determines, from the first codebook and the second code book, the optimized first matrix W₁ and second matrix W₂, according to the identifications.

After that, the eNodeB multiplies the optimized first matrix W₁ and second matrix W₂ and obtains an optimized precoding matrix for sub-band pre coding.

At last, the eNodeB precodes data to be transmitted by using the optimized precoding matrix, so as to transmit the data to the user equipment. The inventor simulates the performance of the codebook proposed in the invention, and compares it with the simulation results of the schemes proposed in the prior art. The following table 3 shows the assumed wireless network environment, based on which the simulation is carried out.

TABLE 3
                               Assumptions used for
Parameter                      evaluation
Deployment scenario            3GPP case 1 3D, SCM-UMa with
                               large angle spread.
                               Speed: 3 km/h
Antenna configuration (eNodeB) CLA, 0.5 wavelengths between
                               antennas (4 Tx: xx)
Antenna configuration (UE)     Cross-polarized at UE (2 Rx:
                               +)
Downlink transmission scheme   Single-cell Tx
                               correlation-aided MU-MIMO,
                               rank 1 per UE
Downlink scheduler             Proportional fair in time and
                               frequency
Feedback assumptions           Subband PMI, subband CQI,
                               long-term wideband Tx
                               covariance report
                               PMI/CQI/RI report with 5 ms
                               periodicity, 6 ms delay
                               Tx correlation report with
                               100 ms periodicity, 6 ms delay
                               Subband CQI with measurement
                               error: N(0.1 dB) per PRB
Downlink HARQ scheme           Chase combining
Downlink receiver type         MMSE
Channel estimation             Ideal
Control channel and reference  As agreed in ITU assumption
signal overhead                with DL CCH of 3 OFDM symbols
                               LTE Rel.8: 0.3158
                               LTE-A: 0.3063

The simulation result is shown by the following table 4:

	TABLE 4
	Average throughput	Cell edge
	R1-101742	2.8 (100%)	0.08 (100%)
	R1-103026	2.3 (82.1%)	0.10 (125%)
	The invention	3.0 (107.1%)	0.11 (137.5%)

It can be seen that the invention achieve better performance than the art. Those ordinary skilled in the art could understand and realize modifications to the disclosed embodiments, through studying the description, drawings and appended claims. The word “comprising” does not exclude the presence of elements or steps not listed in a claim or in the description. The word “a” or “an” preceding an element does not exclude the presence of a plurality of such elements. In the practice of present invention, several technical features in the claim can be embodied by one component. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim.

Claims

1. A method for determining precoding matrix for sub-band precoding, wherein the transmitter has two sets of cross-polarized antennas, the channel vectors of the two sets of antennas with different polarization direction are H1 and H2 respectively, these antennas are closely spaced, M is the amount of the transmitting antennas, r is the amount of the data flows, the channel vectors H1 and H2 of two sets of antennas satisfy the following complex relationship: H2=/βejδH1 Wherein β is the amplitude of the complex relationship between the two channel vectors, and δ is the angle of the complex relationship between the two channel vectors;the method comprises:determining, according to long-term channel related information, an optimized first matrix W1 with a dimension of M×M, the first matrix corresponding to wideband and/or long-term channel properties, and the first matrix W1 is selected from a first codebook below:

2. A method as claimed in claim 1, wherein, for the second codebook W2, when the amount of data flows is 1, W2=[1,0,βejδ,0]T and when the amount of data flows is 2,

3. A method as claimed in claim 2, wherein, for M transmitting antennas and maximum 2 ranks, the codeword in the 4-bit second codebook W2 are determined by the following formula:

4. A method as claimed in claim 1, wherein the mode of the correlation factor of the closely-spaced antennas is greater than a predetermined threshold, or the distance between the antennas is equal to or less than half of the wavelength of the signal.

5. A method, in a user equipment, for feeding precoding matrix for sub-band precoding back to an eNodeB, comprising: determining said optimized first matrix W1 and precoding matrix, by using a method as claimed in claim 1;determining an optimized second matrix W2 corresponding to said optimized precoding matrix;providing, for the eNodeB, identifications of said optimized first matrix W1 and said second matrix W2.

6. A method, in an eNodeB, for precoding data, comprising: receiving identifications of an optimized first matrix W1 and an optimized second matrix W2, fed back by a user equipment;determining, from the first codebook and the second code book in a method according to claim 1, the optimized first matrix W1 and second matrix W2, according to the identifications;multiplying the optimized first matrix W1 and second matrix W2, and obtaining an optimized precoding matrix;precoding data to be transmitted by using the optimized precoding matrix, so as to transmit the data to the user equipment.

7. A device, in a user equipment, for feeding precoding matrix for sub-band precoding back to an eNodeB, comprising: a determining means, for determining an optimized first matrix W1 and a precoding matrix, by using a method as claimed in claim 1, and determining an optimized second matrix W2 corresponding to said optimized precoding matrix;a sender, for providing, for the eNodeB, identifications of said optimized first matrix W1 and said second matrix W2.

8. A device, in an eNodeB, for precoding data, comprising: a receiver, for receiving identifications of an optimized first matrix W1 and an optimized second matrix W2, fed back by a user equipment;a inquiring means, for determining, from the first codebook and the second code book in a method according to claim 1, the optimized first matrix W1 and second matrix W2, from the identifications;a calculating means, for multiplying the optimized first matrix W1 and second matrix W2, and obtaining an optimized precoding matrix;a precoder, for precoding data to be transmitted by using the optimized precoding matrix, so as to transmit the data to the user equipment.