PILOT ALLOCATION METHOD BASED ON COHERENCE TIME FOR LARGE-SCALE MIMO SYSTEM

Abstract

Disclosed is a pilot allocation method based on coherence time for a large-scale multiple input multiple-output (MIMO) system. The present invention achieves optimal allocation of pilot resources by fully utilizing the feature that different users possibly have different moving speeds and coherence time of corresponding channels is accordingly different, thereby improving overall data transmission performance of the system and achieving certain practicability. Moreover, the present invention effectively uses limited transmission resources in the case of limited total transmission resources, thereby improving overall data transmission performance of the system and effectively reducing pilot contamination.

Claims

1. A pilot allocation method based on coherence time for a large-scale multiple-input multiple-output (MIMO) system, comprising the following steps: step 1: grouping L cells into L.sub.f cells formed by a plurality of rapidly moving users and L.sub.s cells formed by a plurality of slowly moving users, wherein each cell has K randomly distributed users, each user undergoes independent channel information, the L.sub.f cells form a set Γ.sub.f, and the L.sub.s cells form a set Γ.sub.s; step 2: calculating coherence time of each user at a carrier frequency of the system; step 3: setting a first minimum coherence time length of the users in the set Γ.sub.f as a unit coherence time T, wherein T is a channel estimation interval for all the plurality of rapidly moving users in the set Γ.sub.f, selecting a second minimum coherence time length T.sub.m in the set Γ.sub.s, and setting that $Q=.Math.\frac{T_m}{T}.Math.,$ so that QT is a channel estimation interval for all the plurality of slowly moving users in the set Γ.sub.s, wherein a number of the unit coherence time is N.sub.c; step 4: estimating, by a base station, channel information of all the users within a first unit coherence time, and performing downlink data transmission according to channel estimates, to obtain a system downlink achievable rate C.sub.1; step 5: determining, within an nth unit coherence time, whether mod(n,Q) is equal to 1 or whether Q is equal to 1, wherein mod( ) represents a modulo operation; if mod(n,Q)=1 or Q=1, the plurality of rapidly moving users in the set Γ.sub.f and the plurality of slowly moving users in the set Γ.sub.s update channel estimation vales; or otherwise, only the plurality of rapidly moving users in the set Γ.sub.f update the channel estimates; and step 6: entering a (n+1)th unit coherence time, and repeating the step 5 till a determination within the N.sub.cth unit coherence time is done.

2. The pilot allocation method according to claim 1, wherein a speed of the plurality of rapidly moving users in the step 1 ranges from 35 km/h to 120 km/h, and a speed of the plurality of slowly moving users ranges from 1 km/h to 15 km/h.

3. The pilot allocation method according to claim 1, wherein the number of the unit coherence time Nc in the step 3 is equal to Q.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0017] FIG. 1 shows comparison of downlink achievable rate versus user number between a pilot allocation method of the present invention and a conventional method without allocation.

DETAILED DESCRIPTION OF THE INVENTION

[0018] The technical solution of the present invention is further explained below with reference to the accompanying drawings.

[0019] The present invention provides a pilot allocation method based on coherence time for a large-scale MIMO system, where the solution includes the following process:

[0020] Step 1: There>are L cells, each cell has one base station and K users, M represents the total number of antennas of the base station, and g.sub.ik.sup.j represents a channel vector from the kth user in the ith cell to the base station of the jth cell, where k=1, 2, 3 . . . K, g.sub.ik.sup.j√{square root over (β.sub.ik.sup.j)}h.sub.ik.sup.j, h.sub.ik.sup.j represents a complex fast fading vector from the kth user terminal in the ith cell to the base station of the jth cell, h.sub.ik.sup.j remains unchanged within a coherence time length T.sub.ik, T.sub.ik represents channel coherence time of the kth user terminal in the ith cell, and β.sub.ik.sup.j represents a slow fading coefficient from the kth user terminal in the ith cell to the base station of the jth cell. The slow fading coefficient β.sub.ik.sup.j is obtained by using a long-term estimation method.

[0021] Step 2: There are L.sub.f cells formed by rapidly moving users and L.sub.s cells formed by slowly moving users in the L cells, the L.sub.f cells form a set Γ.sub.f, and the L.sub.s cells form a set Γ.sub.s, where L.sub.f+L.sub.s=L, L.sub.b≧1, and L.sub.s>1. A unit coherence time length T is set to min{T.sub.ik}.sub.iεΓf,∀k, where T is a channel estimation interval for all the users in the set Γ.sub.f. For the cells in Γ.sub.s, a multiple of T.sub.m=min{T.sub.ik}.sub.iεΓf,∀k relative to T is calculated and is rounded down, which is recorded as Q, that is.

[00002]$Q=.Math.\frac{T_m}{T}.Math..$

Then, QT is a channel estimation interval for the users in Γ.sub.s. This solution considers that the number of the unit coherence time is N.sub.c, and N.sub.c is at least greater than Q.

[0022] Step 3: Within the first unit coherence time T, all the users in the L cells first perform uplink pilot transmission simultaneously, and ρ.sub.k is used to indicate average pilot. transmit. power of the kth user. Then, in a channel estimation phase, a signal received by the base station of the ith cell is as follows:

[00003]$\begin{array}{cc}{Y}_{\mathrm{Bi}}=\underset{j=1}{\overset{L}{.Math.}}.Math..Math.\underset{k=1}{\overset{K}{.Math.}}.Math.\sqrt{{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{jk}}^i}.Math.h_{\mathrm{jk}}^i.Math.{\varphi }_k+Z& \left(1\right)\end{array}$

[0023] where √{square root over (τ)}φ.sub.k is a pilot signal of the kth user, φ.sub.kis a unit orthogonal pilot sequence matrix, τ is a pilot length, τ≧K, it is set herein that τ=K, Z is additive white Gaussian noise, each element of Z conforms to CN (0, 1), β.sub.jk.sup.i represents a slow fading coefficient from the kth user terminal in the jth cell to the base station of the ith cell, and h.sub.jk.sup.i represents a complex fast fading vector from the kth user terminal in the jth cell to the base station of the ith cell. The following formula may be obtained by minimum mean square error (MMSE) estimation:

[00004]$\begin{array}{cc}{\hat{h}}_{\mathrm{ik}}^i=\frac{\sqrt{{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^i}}{1+\underset{j=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{jk}}^i}.Math.Y_{\mathrm{Bi}}.Math.{\varphi }_k^H.& \left(2\right)\end{array}$

[0024] A channel vector g.sub.ik.sup.j from the kth user terminal in the ith cell to the base station of the ith cell may be decomposed into g.sub.ik.sup.j=ĝ.sub.ik.sup.i+{tilde over (g)}.sub.ik.sup.i, and a channel estimation vector is ĝ.sub.ik.sup.i=√{square root over (β.sub.ik.sup.i)}ĥ.sub.ik.sup.i, where β.sub.ik.sup.j is a slow fading factor from the kth user terminal in the ith cell to the base station of the ith cell, and ĥ.sub.jk.sup.i, is a fast fading estimation vector from the kth user terminal in the ith cell to the base station of the ith cell. According to the nature of MMSE estimation, ĝ.sub.ik.sup.i˜CN(0, σ.sub.ik.sup.2I.sub.M) and {tilde over (g)}.sub.ik.sup.i˜CN(0, ε.sub.ik.sup.2I.sub.M) are mutually independent channel estimation error vectors, where I.sub.M is an M-dimensional unit matrix,

[00005]${\sigma }_{\mathrm{ik}}^2=\frac{{{\mathrm{\tau \rho }}_k\left({\beta }_{\mathrm{ik}}^i\right)}^2}{1+\underset{j=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{jk}}^i}$

is a variance of each element of the channel estimation vector, and ε.sub.ik.sup.2=β.sub.ik.sup.i−σ.sub.ik.sup.2 is a variance of each element of the channel estimation error vector.

[0025] Step 4: Afterwards, the base station performs downlink data transmission, and then a downlink signal y.sub.ik received by the kth user in the ith cell is as follows:

[00006]$\begin{array}{cc}{y}_{\mathrm{ik}}=\underset{j=1}{\overset{L}{.Math.}}.Math..Math.\underset{k=1}{\overset{K}{.Math.}}.Math.\sqrt{P_d}.Math.{\left(g_{\mathrm{ik}}^j\right)}^H.Math.p_{\mathrm{jt}}.Math.s_{\mathrm{jt}}+{\upsilon }_{\mathrm{ik}}& \left(3\right)\end{array}$

where s.sub.jt is a signal to be transmitted to the tth user in the jth cell, and E[|s.sub.jt|.sup.2]=1. The base station performs, by using channel estimation information, linear precoding on the signal to be transmitted, where P.sub.jt is a precoding vector of the tth user in the jth cell. P.sub.d is downlink data power, and υ.sub.ik is a unit additive noise. It can be seen from the formula (3) above that, the downlink signal received by the kth user in the ith cell is interfered by downlink data of other users.

[0026] Step 5: A downlink achievable rate of the kth user is calculated, and it is set that a.sub.ik.sup.jt=(g.sub.ik.sup.j).sup.Hp.sub.jt and a.sub.ik.sup.ik=(g.sub.ik.sup.i).sup.Hp.sub.ik, where a.sub.ik.sup.jt and a.sub.ik.sup.jt are temporary variables and have no specific meaning. The formula (3) is rewritten into:

[00007]$\begin{array}{cc}{y}_k=\underset{\mathrm{signal}}{\underset{}{\sqrt{P_d}.Math.E\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right].Math.s_{\mathrm{ik}}}}+\underset{\mathrm{interference}}{\underset{}{\begin{array}{c}\sqrt{P_d}.Math.\left(a_{\mathrm{ik}}^{\mathrm{ik}}-E\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]\right).Math.s_{\mathrm{ik}}+\\ \underset{j=1}{\overset{L}{.Math.}}.Math..Math.\underset{\left(j,t\right)\ne \left(i,k\right)}{\overset{K}{.Math.}}.Math..Math.\sqrt{P_d}.Math.a_{\mathrm{ik}}^{\mathrm{ik}}.Math.s_{\mathrm{ik}}\end{array}}}+\underset{\mathrm{noise}}{\underset{}{D_{\mathrm{IL}}}}& \left(4\right)\end{array}$

[0027] where p.sub.ik is a precoding vector expression of the kth user in the ith cell.

[0028] The formula (4) shows the signal, the interference, and the noise, and thus the downlink achievable rate of the kth user in the ith cell is obtained as follows:

[00008]$\begin{array}{cc}{R}_{\mathrm{ik}}={\log }_2\left(1+\frac{P_d.Math.E^2\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]}{P_d.Math.\mathrm{var}\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]+\underset{j=1}{\overset{L}{.Math.}}.Math..Math.\underset{\left(j,t\right)\ne \left(i,k\right)}{\overset{K}{.Math.}}.Math..Math.P_d.Math.E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jt}}.Math.}^2\right]+1}\right).& \left(5\right)\end{array}$

[0029] Step 6: A system downlink achievable rate is calculated, and then a precoding vector based on MF is as follows:

[00009]$\begin{array}{cc}{p}_{\mathrm{ik}}=\frac{{\hat{g}}_{\mathrm{ik}}^i}{\sqrt{K}.Math..Math.{\hat{g}}_{\mathrm{ik}}^i.Math.}=\frac{{\hat{g}}_{\mathrm{ik}}^i}{{\alpha }_{\mathrm{ik}}.Math.\sqrt{\mathrm{MK}}}& \left(6\right)\end{array}$

where

[00010]${\alpha }_{\mathrm{ik}}=\frac{.Math.{\hat{g}}_{\mathrm{ik}}^i.Math.}{\sqrt{M}}$

is a normalization factor, and

[00011]$\underset{M.fwdarw.\infty }{\lim }.Math.{\alpha }_{\mathrm{ik}}^2=\underset{M.fwdarw.\infty }{\lim }.Math.\frac{{\left({\hat{g}}_{\mathrm{ik}}^i\right)}^H.Math.{\hat{g}}_{\mathrm{ik}}^i}{M}={\sigma }_{\mathrm{ik}}^2.$

[0030] Therefore, the following formulas are obtained:

[00012]$\begin{array}{cc}E\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]=\frac{1}{{\alpha }_{\mathrm{ik}}.Math.\sqrt{\mathrm{MK}}}.Math.E\left[{\left(g_{\mathrm{jk}}^i\right)}^H.Math.{\hat{g}}_{\mathrm{ik}}^{\text{?}}\right]=\sqrt{\frac{M}{K}}.Math.{\sigma }_{\mathrm{ik}}& \left(7\right)\\ \mathrm{var}\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]=E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{ik}}.Math.}^2\right]-E^2\left[a_{\mathrm{ik}}^{\mathrm{ik}}\right]=\frac{{\beta }_{\mathrm{ik}}^i}{K}.Math..Math.\text{?}.Math.\text{indicates text missing or illegible when filed}& \left(8\right)\end{array}$

[0031] If t≠k, the following formula is obtained:

[00013]$\begin{array}{cc}E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jt}}.Math.}^2\right]=\frac{1}{{\alpha }_{\mathrm{jt}}^2.Math.\mathrm{MK}}.Math.E\left[{.Math.{\left(g_{\mathrm{ik}}^j\right)}^H.Math.{\hat{g}}_{\mathrm{jt}}^j.Math.}^2\right]=\frac{{\beta }_{\mathrm{ik}}^j}{K}& \left(9\right)\end{array}$

[0032] If t=k, and j≠i, the following formula is obtained:

[00014]$\begin{array}{cc}E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jt}}.Math.}^2\right]=\frac{1}{{\alpha }_{\mathrm{jt}}^{\text{?}}.Math.\mathrm{MK}}.Math.E\left[{.Math.{\left(g_{\mathrm{ik}}^{\text{?}}\right)}^H.Math.{\hat{g}}_{\mathrm{ik}}^j.Math.}^2\right]=\frac{{\beta }_{\mathrm{ik}}^j}{K}+\frac{M.Math..Math.{\mathrm{\tau \rho }}_k={\left({\beta }_{\mathrm{ik}}^j\right)}^2}{\left(1+\underset{l=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^j\right).Math.K}.Math..Math.\text{?}.Math.\text{indicates text missing or illegible when filed}& \left(10\right)\end{array}$

[0033] Therefore, the downlink achievable rate of the user k in the ith cell is as follows:

[00015]$\begin{array}{cc}{R}_{\mathrm{ik}}-{\log }_2\left(1+\frac{P_d.Math.M.Math..Math.{\sigma }_{\mathrm{ik}}^2}{P_d.Math.\underset{j=1}{\overset{L}{.Math.}}.Math..Math.{\beta }_{\mathrm{ik}}^j+P_d.Math.\underset{j=1,\text{?}}{\overset{L}{.Math.}}.Math..Math.\frac{M.Math..Math.\tau .Math..Math.{{\rho }_k\left({\beta }_{\mathrm{ik}}^j\right)}^2}{\left(1+\underset{l=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^j\right).Math.k}+K}\right).Math..Math.\text{?}.Math.\text{indicates text missing or illegible when filed}& \left(11\right)\end{array}$

[0034] Then, when M is infinite, the system downlink achievable rate is as follows:

[00016]$\begin{array}{cc}{C}_1.Math.\text{?}.Math.\underset{M.fwdarw.\infty }{\lim }.Math.R_{\mathrm{ik}}=\frac{T-K}{T}.Math.\underset{k=1}{\overset{K}{.Math.}}.Math.{\log }_2\left(1+\frac{{\sigma }_{\text{?}}^2}{\underset{j=1,j\ne i}{\overset{L}{.Math.}}.Math.\frac{\tau .Math..Math.{{\rho }_k\left({\beta }_{\mathrm{ik}}^j\right)}^2}{\left(1+\underset{l=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^j\right)}.Math.}\right).Math..Math.\text{?}.Math.\text{indicates text missing or illegible when filed}& \left(12\right)\end{array}$

[0035] Step 7: Within the nth unit coherence time, it is determined, according to whether mod(n,Q) is equal to 1 or whether Q is equal to 1, whether pilot estimation is needed for the users in Γ.sub.s, where n≦N.sub.c, and mod( ) herein represents a modulo operation. If mod(n,Q)=1 or Q=1, all the users in the L cells are allocated with pilots, that is, the users in Γ.sub.s update the channel estimates, and following the process within the first unit coherence time, calculation of the system downlink achievable rate is performed according to Step 3 to Step 6; or otherwise, the users only in Γ.sub.f update the channel estimates, that is, it is not required to allocate pilots for the users in Γ.sub.s, and channel estimation is performed according to Step 3, provided that L in the formulas (1) and (2) is replaced with L.sub.f. In calculating the system downlink achievable rate, the process from the formula (3) to the formula (9) is repeated. For calculation using the formula (10), two cases where iεΓ.sub.f and iεΓ.sub.s are taken into consideration:

[00017]$\mathrm{If}.Math..Math.i.Math.\in .Math.{\Gamma }_f,E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jk}}.Math.}^2\right]=\frac{{\beta }_{\mathrm{ik}}^j}{K}.Math.\frac{\mathrm{M\tau }.Math..Math.{{\rho }_k\left({\beta }_{\mathrm{ik}}^j\right)}^2}{\left(1+\underset{l=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^j\right).Math.k},.Math.\mathrm{where}$$\stackrel{\_}{L}=\{\begin{array}{c}{L}_f,j\in {\Gamma }_f\\ L,j\in {\Gamma }_s\end{array}.$

[0036] If iεΓ.sub.s, and when jεΓ.sub.s,

[00018]$E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jk}}.Math.}^2\right]=\frac{{\beta }_{\mathrm{ik}}^j}{K}+\frac{\mathrm{M\tau }.Math..Math.{{\rho }_k\left({\beta }_{\mathrm{ik}}^j\right)}^2}{\left(1+\underset{l=1}{\overset{L}{.Math.}}.Math..Math.{\mathrm{\tau \rho }}_k.Math.{\beta }_{\mathrm{ik}}^j\right).Math.K};$

or otherwise,

[00019]$E\left[{.Math.a_{\mathrm{ik}}^{\mathrm{jk}}.Math.}^2\right]=\frac{{\beta }_{\mathrm{ik}}^j}{K}.$

[0037] Corresponding downlink system achievable rates may be obtained after substitution. After the determination within the nth unit coherence time is done, the process enters next unit coherence time, and Step 7 is repeated to perform the determination, till the determination within the N.sub.cth unit coherence time is done.

[0038] Step 8: the downlink achievable rates calculated within the Nc unit coherence times are added to obtain a total downlink achievable rate: C=Σ.sub.n−1.sup.N.sup.cC.sub.n.

[0039] Simulation Test 1

[0040] Parameters in a simulation scenario are as follows: it is set that, there are L=4 cells, a cell radius is 500 m, a base station is located in the center of the cell, users are evenly distributed within a cell range that is at least 35cm away from the base station, and a large-scale fading factor model includes geometric fading with an average fading exponent γ=3.8 dB and log-normally distributed shadow fading with a standard deviation σ.sub.shadow=8 dB, where L.sub.f=L.sub.s=2, and L.sub.f is corresponding to a set Γ.sub.f and L.sub.s is corresponding to a set Γ.sub.s. A moving speed of users in Γ.sub.f ranges from 35 km/h to 120 km/h, and a moving speed of users in Γ.sub.s ranges from 1 km/h to 15 km/h. Coherence time of a user having the maximum moving speed is set as unified coherence time T of all the users in Γ.sub.f, the minimum coherence time length in Γ.sub.s is recorded as a unit coherence time T.sub.m, and it is set that

[00020]$Q=.Math.\frac{T_m}{T}.Math..$

Then, unified coherence time of all the users in Γ.sub.s is QT. The Monte Carlo method is used in the test, 5000 times of independent distribution of users is randomly generated for simulation, and the simulation result is an average of the 5000 times.

[0041] As shown in FIG. 1, comparison of downlink achievable rate versus user number between a pilot allocation method of the present invention and a conventional method without allocation is shown. In FIG. 1, the horizontal coordinate indicates a user number, and the vertical coordinate indicates a downlink achievable rate in bps/Hz. In the figure, a solid line indicates an achievable rate curve for the pilot allocation method of the present invention, and a dotted line indicates an achievable rate curve for the conventional method without allocation. It can be seen from FIG. 1 that, the user number is from 5 to 20 in this simulation scenario, and downlink achievable rates obtained by using the pilot allocation method of the present invention are all higher than those obtained by using the conventional method without allocation. As the user number increases, a performance gain also rises.

[0042] Many variations and modifications can be made by those skilled in the art from the forgoing description according to preferred embodiments of the present invention, without departing from the scope of technical concept of the present invention. The technical scope of the present invention is not limited to the content of the specification and should be determined according to the scope of claims.