CN105991241A - Sending method of large time delay CDD space multiplexing of two-dimensional antenna array - Google Patents

Abstract

The present invention provides a sending method of large time delay CDD space multiplexing of a two-dimensional antenna array. The user data is subjected to the pre-coding operation as described in the specification, wherein the number of the data layers is less than or equal to M, and the number of the ports T is equal to M*N; N and M are respectively taken as the number of the ports of the two-dimensional antenna array at the horizontal direction and the vertical direction; W(i) is the pre-coding matrix with the dimension of M*v, an M antenna codebook is employ to perform Kronecker multiply with a column vector P; and the column vector P is defined as follows: P=[x0 x1...xN-1]<T>, q belongs to 0, 1, ..., Q-1, and Q is a positive integer larger than or equal to N. The sending method of large time delay CDD space multiplexing of a two-dimensional antenna array supports the large time delay CDD space multiplexing of users' more antenna ports and supports multi-user large time delay CDD space multiplexing at the same time.

Description

The sending method of the long time delay CDD spatial reuse of two-dimensional antenna array

Technical field

The present invention relates to wireless communication field, the long time delay CDD particularly relating to a kind of two-dimensional antenna array is empty Between the sending method of multiplexing.

Background technology

In the R8 version of long evolving system (Long-Term Evolution), there is multiple descending transmission Pattern, wherein TM3 sending mode uses a kind of long time delay CDD (Cyclic delay diversity) space The sending method of multiplexing, this method is by carrying out different circulations by the data symbol sent on each antenna Postpone, obtain frequency diversity gain with this.The pre-encode operation theory diagram of the method as it is shown in figure 1, First data carry out layer mapping, and the data after layer maps are multiplied with a unitary matrice again, complete different layers Between the function of data mixing, be multiplied with circulation delay matrix the most again, use different on different antennas Cycle time-delay, adds the frequency selectivity of each antenna, finally takes advantage of a pre-coding matrix, completes based on letter The precoding function of road state.Whole precoding process is represented by the following formula:

$\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]=W\left(i\right)D\left(i\right)U\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right],$

Wherein, v is the data numbers of plies, and T is port number,Number for every port According to symbol numbers, and equal to every layer in data symbol number, $\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right]$ It is that layer maps the v number of plies obtained According to vector, U be dimension be the unitary matrice of υ × υ, D (i) be dimension be the circulation delay matrix of υ × υ, W (i) is Dimension is the pre-coding matrix of M × v, $\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]$ It is 0～the T-port data vector obtained after precoding.

The maximum supported port number of the sending method of current above-mentioned long time delay CDD spatial reuse is 4, Only can support layer two, layer three, the spatial reuse of layer four, and the method is limited to precoding process, layer reflects After data after penetrating are multiplied with a unitary matrice, data between user's different layers will mix, therefore without Method supports the CDD spatial reuse of multi-user.

In third generation partner program (3rd Generation Partnership Project is called for short 3GPP) LTE65 meeting has been directed towards full dimension MIMO technique (Full-Dimension MIMO, letter It is referred to as FD-MIMO) project verification, the descending sender of more antennas port is supported for study two-dimensional aerial array Formula.On the one hand two-dimensional antenna array can provide and more send port, supports the single user of higher order further CDD spatial reuse, to improve user performance；On the other hand can be ensured by the precoding of vertical dimensions Class between different user is orthogonal, it is provided that the probability of multi-user's CDD spatial reuse, can promote down Row throughput of system.

Summary of the invention

The present invention proposes the sending method of the long time delay CDD spatial reuse of a kind of two-dimensional antenna array, the party Method carries out following pre-encode operation to user data:

$\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]=(W\left(i\right)\&CircleTimes;P)D\left(i\right)U\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right],$

Wherein, v is the data numbers of plies, and v is less than or equal to M；T is port number, T=M × N；M、 N is respectively the port number horizontally and vertically of described two-dimensional antenna array；For the data symbol number of every port, and equal to every layer in data Symbol numbers； $\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right]$ It is that layer maps the v layer data vector obtained；U be dimension be the unitary matrice of υ × υ； D (i) be dimension be the circulation delay matrix of υ × υ；W (i) be dimension be the pre-coding matrix of M × v, use M Antenna codebook；P is a column vector, and W (i) and P is Kronecker and amasss； $\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]$ It is by described pre- 0～the T-port data vector obtained after encoding operation；Column vector P is defined as follows:

P=[x₀ x₁ ... x_N-1]^T,Q ∈ 0,1 ..., and Q-1}, k=0,1 ..., N-1, Q are for being more than Positive integer in N.

Preferably, column vector P is also relevant to the order i of data symbol, and column vector P is defined as follows:

P=[x₀(i) x₁(i) ... x_N-1(i)]^T,Q ∈ 0,1 ..., Q-1}, k=0,1 ..., N-1.

Preferably, q is fixed value.

Preferably, q is dynamic value, and eNB dynamically can adjust according to the vertical channel status information of UE feedback Whole q value.

Preferably, U is DFT matrix；D (i) is diagonal matrix, and the diagonal entry of h row is e^-j2πih/v, h=0,1 ..., v-1.

Preferably, 4 antenna codebooks during M=4, W (i) use LTE R8 version.

Preferably, M=8, W (i) use 8 antenna codebooks.

Preferably, the data to multiple users carry out described pre-encode operation respectively and obtain the 0～T end of each user Mouth data vector, is then overlapped 0～the T-port data vector of the plurality of user and sends, respectively The data acquisition of user identical U matrix, D (i) matrix and W (i) matrix, the data acquisition of different user is not with Same q value, the number of the plurality of user is less than or equal to N.

The sending method of the present invention, under two-dimensional antenna array situation, supports the big of single user more antennas port Time delay CDD spatial reuse, supports the long time delay CDD spatial reuse of multi-user simultaneously.

Accompanying drawing explanation

In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to enforcement In example or description of the prior art, the required accompanying drawing used is briefly described, it should be apparent that, retouch below Accompanying drawing in stating is some embodiments of the present invention, for those of ordinary skill in the art, is not paying On the premise of creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.

Fig. 1 is the pre-encode operation theory diagram of background technology；

Fig. 2 is the pre-encode operation theory diagram of the embodiment of the present invention 1.

Detailed description of the invention

For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the present invention Accompanying drawing in embodiment, is clearly and completely described the technical scheme in the embodiment of the present invention, it is clear that Described embodiment is a part of embodiment of the present invention rather than whole embodiments；It should be noted that In the case of not conflicting, the embodiment in the application and the feature in embodiment can be mutually combined.Based on Embodiment in the present invention, those of ordinary skill in the art are obtained under not making creative work premise Every other embodiment, broadly fall into the scope of protection of the invention.

All embodiments of the invention are two-dimensional antenna array scene, and antenna port number is T=M × N, M is the port number of the horizontal direction of two-dimensional antenna array, and N is the vertical direction of two-dimensional antenna array Port number.

Embodiment 1

The present embodiment as a example by single user, pre-encode operation theory diagram such as Fig. 2 institute of the data of unique user Showing, its difference with the prior art is: during pre-encode operation, pre-coding matrix in advance with one Column vector is Kronecker and is amassed.Whole precoding process is represented by the following formula:

$\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]=(W\left(i\right)\&CircleTimes;P)D\left(i\right)U\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right],$

Wherein, data number of plies v of user is necessarily less than the port number M equal to horizontal direction；For the data symbol number of every port, and equal to every layer in data symbols Number number； $\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right]$ It is that layer maps the v layer data vector obtained；U be dimension be the unitary matrice of υ × υ；D(i) Be dimension be the circulation delay matrix of υ × υ；W (i) be dimension be the pre-coding matrix of M × v, use M antenna Code book； $\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]$ 0～the T-port data vector obtained after being by described pre-encode operation, P is one Length is equal to the column vector of the port number N of vertical direction, and it is defined as follows:

P=[x₀ x₁ ... x_N-1]^T,Q ∈ 0,1 ..., and Q-1}, k=0,1 ..., N-1,

Q is the positive integer more than or equal to N, and when Q is equal to N, P vector is DFT vector；When Q is more than During N, P vector is the DFT vector of over-sampling.

Q take 0,1 ..., an arbitrary value in the range of Q-1}, q can be that fixed value can also be for dynamic value.

Such as, when q is fixed value, it is assumed that q=1, then $P={\left[\begin{array}{cccc}1& e^{j\frac{2\mathrm{\&pi;}}{Q}}& ...& e^{j\frac{2\mathrm{\&pi;}}{Q}(N-1)}\end{array}\right]}^T.$

When q is dynamic value, can by UE by vertical channel status information feedback to eNB, and by eNB Determining this q value, process is: UE carries out channel estimation according to vertical CSI-RS, it is thus achieved that vertical channel Status information, travels through all of q value, obtains optimal q value, can be described as vertical optimum code word, and feeds back Receive above-mentioned vertical optimum code word to eNB, eNB, report situation in conjunction with other UE, calculate according to scheduling Method, determines the q value of current UE.

Embodiment 2

In embodiment 1, P vector is unrelated with the order of data symbol, i.e. equal to symbols all in current data Use identical P vector.And P is relevant to the order of data symbol in the present embodiment, have an advantage in that: For adjacent different pieces of information symbol, use different precodings, i.e. adjacent-symbol to carry out out of phase and add Power, changes the reusing degree between distinct symbols.In the present embodiment, P vector is defined as follows:

P=[x₀(i) x₁(i) ... x_N-1(i)]^T,Q ∈ 0,1 ..., and Q-1}, k=0,1 ..., N-1,

Same, q can take fixed value or dynamic value.

Embodiment 3

The present embodiment is based on embodiment 1, it is assumed that M=8, v=5, then U be dimension be the tenth of the twelve Earthly Branches of 5 × 5 Matrix；D (i) be dimension be the circulation delay matrix of 5 × 5.The present embodiment U uses DFT matrix, and D (i) adopts With diagonal matrix, and the diagonal entry of h row is e^-j2πih/5, wherein h=0,1 ..., 4, specific as follows:

$U=\frac{1}{\sqrt{5}}\left[\begin{array}{ccccc}1& 1& 1& 1& 1\\ 1& e^{-j2\mathrm{\&pi;}/5}& e^{-j4\mathrm{\&pi;}/5}& e^{-j6\mathrm{\&pi;}/5}& e^{-j8\mathrm{\&pi;}/5}\\ 1& e^{-j4\mathrm{\&pi;}/5}& e^{-j8\mathrm{\&pi;}/5}& e^{-j12\mathrm{\&pi;}/5}& e^{-j16\mathrm{\&pi;}/5}\\ 1& e^{-j6\mathrm{\&pi;}/5}& e^{-j12\mathrm{\&pi;}/5}& e^{-j18\mathrm{\&pi;}/5}& e^{-j24\mathrm{\&pi;}/5}\\ 1& e^{-j8\mathrm{\&pi;}/5}& e^{-j16\mathrm{\&pi;}/5}& e^{-j24\mathrm{\&pi;}/5}& e^{-j32\mathrm{\&pi;}/5}\end{array}\right],$

$D\left(i\right)=\left[\begin{array}{ccccc}1& 0& 0& 0& 0\\ 0& e^{-j2\mathrm{\&pi;i}/5}& 0& 0& 0\\ 0& 0& e^{-j4\mathrm{\&pi;i}/5}& 0& 0\\ 0& 0& 0& e^{-j6\mathrm{\&pi;i}/5}& 0\\ 0& 0& 0& 0& e^{-j8\mathrm{\&pi;i}/5}\end{array}\right].$

Embodiment 4

On the basis of embodiment 1, the present embodiment further explains how to support the long time delay CDD of multi-user Spatial reuse.For multiple users, first the data of each user are carried out pre-encode operation respectively and obtain respectively 0～the T-port data vector of user, is then overlapped 0～the T-port data vector of the plurality of user And send, the number of plies of the most each user remains a need for less than or equal to M shell, each with using identical U per family Matrix, D (i) matrix and W (i) matrix.Multiple users carry out the P vector composition one of employing during pre-encode operation Individual matrix P, specific as follows:

$P=\left[\begin{array}{cccc}{x}_{00}& x_{01}& ...& x_{0(j-1)}\\ x_{10}& x_{11}& ...& x_{1(j-1)}\\ ...& ...& ...& ...\\ x_{(N-1)0}& x_{(N-1)1}& ...& x_{(N-1)(j-1)}\end{array}\right],x_{\mathrm{kr}}=e^{j\frac{2\mathrm{\&pi;}}{Q}{\mathrm{kq}}_r},q_r\&Element;\mathrm{0,1},...,Q-1,k=\mathrm{0,1},...,N-1,r=\mathrm{0,1},...,j-1$

The r user selects the r of P matrix to arrange the P vector as oneself, and the data of different user Use no q value, use q_rRepresent, so by the weak dependence between different lines vector, it is possible to district Divide the wave beam of different user.In order to ensure the orthogonality between user or weak dependence, number j of user must The long time delay CDD spatial reuse of N number of user the most at most must can be supported less than or equal to N.

Same, q_rFixed value or dynamic value can be taken.

Embodiment 5

In embodiment 4, P vector one P matrix of composition of multiple users, in P matrix, each P vector is all Unrelated with the order of data symbol, and in the present embodiment each P in P matrix vector all with data symbol Order is correlated with, specific as follows:

$P=\left[\begin{array}{cccc}{x}_{00}\left(i\right)& x_{01}\left(i\right)& ...& x_{0(j-1)}\left(i\right)\\ x_{10}\left(i\right)& x_{11}\left(i\right)& ...& x_{1(j-1)}\left(i\right)\\ ...& ...& ...& ...\\ x_{(N-1)0}\left(i\right)& x_{(N-1)1}\left(i\right)& ...& x_{(N-1)(j-1)}\left(i\right)\end{array}\right],$ Wherein,

q_r∈ 0,1 ..., Q-1, k=0,1 ..., N-1, r=0,1 ..., j-1.

One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can Completing with the hardware relevant by programmed instruction, aforesaid program can be stored in an embodied on computer readable and deposit In storage media, this program upon execution, performs to include the step of said method embodiment；And aforesaid storage Medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CD.

Last it is noted that above example is only in order to illustrate technical scheme, rather than it is limited System；Although the present invention being described in detail with reference to previous embodiment, those of ordinary skill in the art It is understood that the technical scheme described in foregoing embodiments still can be modified by it, or to it Middle part technical characteristic carries out equivalent；And these amendments or replacement, do not make appropriate technical solution Essence departs from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (9)

1. the sending method of the long time delay CDD spatial reuse of two-dimensional antenna array, it is characterised in that to User data carries out following pre-encode operation:

$\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(T-1)}\left(i\right)\end{array}\right]=(W\left(i\right)\&CircleTimes;P)D\left(i\right)U\begin{array}{c}\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right],\end{array}$

Wherein, v is the data numbers of plies, and v is less than or equal to M；T is port number, T=M × N；M、 N is respectively the port number horizontally and vertically of described two-dimensional antenna array； For the data symbol number of every port, and equal to every layer in data Symbol numbers； $\left[\begin{array}{c}{x}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ x^{(\mathrm{\&upsi;}-1)}\left(i\right)\end{array}\right]$ It is that layer maps the v layer data vector obtained；U be dimension be the unitary matrice of υ × υ； D (i) be dimension be the circulation delay matrix of υ × υ；W (i) be dimension be the pre-coding matrix of M × v, use M Antenna codebook；P is a column vector, and W (i) and P is Kronecker and amasss； $\left[\begin{array}{c}{y}^{\left(0\right)}\left(i\right)\\ .\\ .\\ .\\ y^{(\mathrm{T\&upsi;}-1)}\left(i\right)\end{array}\right]$ It is by described pre- 0～the T-port data vector obtained after encoding operation；Column vector P is defined as follows:

P=[x₀ x₁ ... x_N-1]^T,Q ∈ 0,1 ..., and Q-1}, k=0,1 ..., N-1, Q are for being more than or equal to The positive integer of N.

Method the most according to claim 1, it is characterised in that: column vector P also with data symbol Order i is correlated with, and column vector P is defined as follows:

P=[x₀(i) x₁(i) ... x_N-1(i)]^T,Q ∈ 0,1 ..., Q-1}, k=0,1 ..., N-1.

Method the most according to claim 1 and 2, it is characterised in that: q is fixed value.

Method the most according to claim 1 and 2, it is characterised in that: q is dynamic value.

Method the most according to claim 4, it is characterised in that: eNB according to UE feed back vertical Channel condition information dynamically adjusts q value.

Method the most according to claim 1 and 2, it is characterised in that: U is DFT matrix；D (i) is Diagonal matrix, and the diagonal entry of h row is e^-j2πih/v, h=0,1 ..., v-1.

Method the most according to claim 1 and 2, it is characterised in that: M=4, W (i) use LTE 4 antenna codebooks in R8 version.

Method the most according to claim 1 and 2, it is characterised in that: M=8, W (i) use 8 Antenna codebook.

Method the most according to claim 1 and 2, it is characterised in that:

The data of multiple users are carried out described pre-encode operation respectively and obtains 0～the T-port data of each user Vector, is then overlapped 0～the T-port data vector of the plurality of user and sends, each user's Data acquisition identical U matrix, D (i) matrix and W (i) matrix, the data acquisition of different user by different q values, The number of the plurality of user is less than or equal to N.