CN104581959A - Uplink opportunistic interference alignment and elimination method of time-division duplex cellular network - Google Patents

Abstract

The invention discloses an uplink opportunistic interference alignment and elimination method of a time-division duplex cellular network. The method mainly solves the problem of uplink interference in the cellular network and includes the steps that (1) cell base stations determine respective signal receiving spaces and broadcast bases of the signal receiving spaces to all users in the network; (2) the base stations send pilot signals, and the users estimate channel state information according to the pilot signals; (3) the users calculate respective pre-coding matrixes and scheduling criterion values and feed the scheduling criterion values back to the base stations serving themselves; (4) the base stations select the users to serve; (5) the selected users send data; (6) the base stations decode the data according to the serial interference elimination technology. The network throughput is increased through multi-user diversity gain and return links between the base stations, and the method is low in implementation complexity and can be used for cellular network communication.

Description

The up opportunistic interference alignment of a kind of time division duplex cellular network and removing method

Technical field

The present invention relates to wireless communication field, be specifically related to the opportunistic interference alignment in cellular network uplink communication and removing method, can be used for the uplink interference management in cellular network.

Background field

The fast development of wireless traffic makes the requirement of user to network rate more and more higher, and this makes cordless communication network capacity urgently promote.In order to improve the capacity of cellular network, the mode that cellular network of new generation tends to use full rate multiplexing is to improve the utilization ratio of frequency spectrum resource.But this mode can bring serious presence of intercell interference.Effective interference management is a urgent problem in cellular network.

Traditional interference avoidance method by the orthogonal communication resource of neighbor cell allocation to avoid interference, but this method greatly reduces the multiplexing efficiency of frequency spectrum resource.The interference alignment schemes of up-to-date proposition is considered to a kind of effective ways solving wireless network interference.Interference alignment sends precoding by design and multiple interference signal is snapped in a sub-signal dimension space of user, thus makes other signal dimension spaces to carry out glitch-free transmission.But traditional interference alignment schemes, make a start and usually need the channel condition information of the overall situation or need a large amount of iterative operations to calculate transmission pre-coding matrix, this makes traditional interference alignment schemes implementation complexity higher.On the other hand, due to the restriction of feasibility condition, the communication link number participating in interference alignment will be restricted, thus limits the capacity of network.

Summary of the invention

For the deficiencies in the prior art, the present invention aims to provide a kind of time division duplex cellular network up opportunistic interference alignment and removing method, promotes network capacity by making full use of the multi-user diversity gain in cellular network and the back haul link between base station with the interference problem solved in network.

To achieve these goals, the present invention adopts following technical scheme:

The up opportunistic interference alignment of a kind of time division duplex cellular network and removing method comprise the steps:

The Received signal strength space of self is determined in the base station of each community of S1, and the base in self Received signal strength space is broadcast to users all in network, the base U in the Received signal strength space of i-th base station _ibe expressed as follows:

U _i＝[u _1,i,u _2,i,...,u _S,i],i＝1,...,L；

Wherein, an all corresponding base station, each community, L is the number of network small area and the number of base station, and S is the number of users that each base station can be served at most simultaneously;

S2 each base station pilot signal transmitted, each use estimates the down channel matrix of corresponding base station to self according to pilot signal per family, and utilizes this down channel matrix to obtain corresponding up channel matrix;

The each user of S3 is according to the base in each base station received signal space received, and the up channel matrix that estimation obtains, and calculates self transmission pre-coding matrix and dispatching criterion value, and dispatching criterion value is fed back to the base station for oneself service;

User scheduling, according to the dispatching criterion value of the user feedback received, is carried out in each base station of S4, then calculates and determines to be selected the transmitted power of user;

The transmission power value determined in step S4 sends to accordingly by selection user by each base station of S5;

Used by selection user the transmission power value received in the transmission pre-coding matrix and step S5 obtained in step S3 described in S6, send data;

Each base station of S7 uses the data message of its user served that to be decoded by method for eliminating serial interference.

It should be noted that, in step S2, the conjugate transpose of down channel matrix is up channel matrix.

It should be noted that, in step S3, transmission pre-coding matrix and the dispatching criterion value of user are calculated as follows:

v ^[k,i]＝eig _min(Q ^[k,i])；

η ^[k,i]＝λ _min(Q ^[k,i])；

Wherein, v ^{[k, i]}be the transmission pre-coding matrix of the kth user in i-th community, eig _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}the characteristic vector corresponding to minimal eigenvalue; η ^{[k, i]}be the dispatching criterion value of the kth user in i-th community, λ _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}minimal eigenvalue; Matrix Q ^{[k, i]}base according to the up channel matrix of a kth user in i-th community and the Received signal strength space of respective base station draws.

Further, it should be noted that, for the kth user in the 1st community, matrix Q ^{[k, 1]}be calculated as follows:

$Q^{[k,1]}={\left(H_1^{[k,1]}\right)}^H{U}_1{U}_1^H{H}_1^{[k,1]};$

Wherein, be the up channel matrix of the kth user in the 1st community to the 1st base station, k=1 ..., K, K are number of users total in each community; () ^hrepresent conjugate transposition operation;

And for jth (j=2 ..., L) a kth user in individual community, Q ^{[k, j]}be calculated as follows:

$Q^{[k,j]}=\underset{l=1}{\overset{j-1}{\mathrm{\Σ}}}{P}_{\max }{\left(H_l^{[k,j]}\right)}^H{U}_l{U}_l^H{H}_l^{[k,j]};$

Wherein, for the user of the kth in jGe community is to the up channel matrix of l base station, P _maxfor the maximum transmit power of each user, k=1 ..., K.

It should be noted that, described step S4 specifically comprises:

4.1) i=L is made;

4.2) i-th base station performs user's selection course: first, i-th individual user alternatively user with minimum dispatching criterion value of base station selected T (T>=S), and the set that this T candidate user forms is designated as the transmission pre-coding matrix calculated in step S3 is sent to the base station into oneself service by this T candidate user;

4.3) make wherein represent i-th base station from selected in the set of user;

4.4) for each user of i-th base station compute vector g ^{[k, i]}:

$g^{[k,i]}=U_i^H{H}_i^{[k.i]}{v}^{[k,i]}-\underset{j=1}{\overset{r-1}{\mathrm{\Σ}}}\frac{{\left(g^{[\mathrm{\π}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}}{{\left|\right|g^{[\mathrm{\π}\left(j\right),i]}\left|\right|}^2}{g}^{[\mathrm{\π}\left(j\right),i]};$

Wherein, v ^{[k, i]}for the transmission pre-coding matrix of user k, for user k is to the up channel matrix of i-th base station providing service for it, π (j), j=1 ..., r-1 represents the jth user selected base station; As r=1,

4.5) make calculate user transmitted power P ^{[k, i]}:

$P^{[k,i]}=\frac{(I_{\mathrm{IC}}^{[k,i]}+{\mathrm{\σ}}^2)\mathrm{\δ}}{{\left|\right|g^{[k,i]}\left|\right|}^2}$

Wherein, σ ²for noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, represent the presence of intercell interference suffered by kth user in cell i, represent the set of the user selected by l base station;

4.6) if i-th base station selected user k, family π (j) is selected, j=1 in i-th base station ..., r-1 needs to upgrade its transmitted power to meet the requirement of minimum Signal to Interference plus Noise Ratio, remembers that i-th base station has selected the up-to-date transmitted power at family π (j) to be

$P_k^{[\mathrm{\π}\left(j\right),i]}=\frac{(I_{k,\mathrm{IU}}^{[\mathrm{\π}\left(j\right),i]}+I_{\mathrm{IC}}^{[\mathrm{\π}\left(j\right),i]}+{\mathrm{\σ}}^2)\mathrm{\δ}}{{\left|\right|g^{[\mathrm{\π}\left(j\right),i]}\left|\right|}^2};$

Wherein, represent in cell i the presence of intercell interference selected suffered by family π (j), be calculated as follows:

And represent in cell i the intra-cell interference selected suffered by family π (j), its computational methods are as follows:

$I_{k,\mathrm{IU}}^{[\mathrm{\π}\left(j\right),i]}=\underset{m=j+1}{\overset{r-1}{\mathrm{\Σ}}}{P}_k^{[\mathrm{\π}\left(m\right),i]}{\left|\right|{\left(f^{[\mathrm{\π}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[\mathrm{\π}\left(m\right),i]}{v}^{[\mathrm{\π}\left(m\right),i]}\left|\right|}^2+P^{[k,i]}{\left|\right|{\left(f^{[\mathrm{\π}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}\left|\right|}^2;$

4.7) because the maximum transmit power of each user is P _maxif user k can be selected, must meet the following conditions:

$\max \{{\max }_{j=1,...,r-1}{P}_k^{[\mathrm{\π}\left(j\right),i]},P^{[k,i]}\}\≤P_{\max }$

Write the set of the condition of being enough to all over in the set of candidate user be namely

The system of selection of r service-user of i-th base station is as follows:

4.8) set is upgraded and as follows:

$P_i=[P_{\mathrm{\π}\left(r\right)}^{[\mathrm{\π}\left(1\right),i]},P_{\mathrm{\π}\left(r\right)}^{[\mathrm{\π}(r-1),i]},...,P^{[\mathrm{\π}\left(r\right),i]}]$

represent from set middle removal element π (r), P _ibe i-th current transmitted power having selected family in base station;

4.9) if and r < S, makes r=r+1, and returns step 4.4), otherwise, enter step 4.9);

4.10) if i > 1, i-th base station by back haul link by P _i, send to the 1st ..., i-1 base station, and make i=i-1, return step 4.2), otherwise, enter step S5.

It should be noted that, described step S7 specifically comprises:

7.1) i=1 is made;

7.2) as i=1, i-th base station uses the information of oneself institute's service-user of following receiving filter decoding:

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

As i > 1, i-th base station according to receive from the 1st ..., the user data x after i-1 base station decodes ^{[k', l]}, k' ∈ K _l, l=1 ..., i-1, rebuilds from the 1st ..., the interference signal If of i-1 community _i, and interference signal is deducted from the signal that oneself receives:

Then the information of oneself institute's service-user of following receiving filter decoding is used:

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

Decoded information is sent to the base station of also not decoding by i-th base station by the back haul link between base station, and namely i-th+1 ..., L base station;

7.3) if i < is L, step 7.2 is returned), otherwise step S7 terminates.

Beneficial effect of the present invention is:

1, the service-user of each base station of method choice dispatched by opportunistic of the present invention, is not needed to use the method for iteration with the receiving filter of the transmission pre-coding matrix and base station that obtain user, thus has lower enforcement complexity;

2, the present invention disturbs by utilizing interference cancellation techniques to eliminate between cell portion, relaxes the restriction of tradition interference alignment feasibility condition, makes more user can transmit data simultaneously, add network capacity;

3, the present invention takes full advantage of the multi-user diversity gain in cellular network, and the backhaul link resource of base station, adds the throughput of network.

Accompanying drawing explanation

Fig. 1 of the present inventionly realizes general flow chart;

Fig. 2 is the sub-process figure carrying out user scheduling in the present invention.

Embodiment

Below with reference to accompanying drawing, the invention will be further described, it should be noted that, the present embodiment, premised on the technical program, provide detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to the present embodiment.

As shown in Figure 1, the up opportunistic interference alignment of a kind of time division duplex cellular network and removing method comprise the steps:

The Received signal strength space of self is determined in the base station of each community of S1, and the base in self Received signal strength space is broadcast to users all in network, the base U in the Received signal strength space of i-th base station _ibe expressed as follows:

U _i＝[u _1,i,u _2,i,...,u _S,i],i＝1,...,L；

Wherein, an all corresponding base station, each community, L is number and the number of base stations of network small area, and S is the number of users that each base station can be served at most simultaneously;

S2 each base station pilot signal transmitted, each use estimates the down channel matrix of corresponding base station to self according to pilot signal per family, and utilizes this down channel matrix to obtain corresponding up channel matrix; The conjugate transpose of down channel matrix is up channel matrix.

The each user of S3 is according to the base in each base station received signal space received, and the up channel matrix that estimation obtains, and calculates self pre-coding matrix and dispatching criterion value, and dispatching criterion value is fed back to the base station for oneself service; The computational process of pre-coding matrix and dispatching criterion value is as follows:

Kth user's compute matrix Q in step 3.1, i-th community ^{[k, i]}, wherein, i=1 ..., L, k=1 ..., K, L are the numbers of network small area, and K is number of users total in each community.

For the kth user in the 1st community, Q ^{[k, 1]}computational methods as follows:

$Q^{[k,1]}={\left(H_1^{[k,1]}\right)}^H{U}_1{U}_1^H{H}_1^{[k,1]};$

Wherein, be the up channel matrix of the kth user in the 1st community to the 1st base station, () ^hrepresent conjugate transposition operation.

For jth (j=2 ..., L) a kth user in individual community, Q ^{[k, j]}computational methods are as follows:

$Q^{[k,j]}=\underset{l=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{P}_{\max }{\left(H_l^{[k,j]}\right)}^H{U}_l{U}_l^H{H}_l^{[k,j]};$

Wherein, for the user of the kth in jGe community is to the up channel matrix of l base station, P _maxfor the maximum transmit power of each user, k=1 ..., K;

A kth user in step 3.2, i-th community is to the matrix Q calculated ^{[k, i]}carry out Eigenvalues Decomposition, can be obtained it and send pre-coding matrix and dispatching criterion value and be respectively

v ^[k,i]＝eig _min(Q ^[k,i])；

η ^[k,i]＝λ _min(Q ^[k,i])；

Wherein, v ^{[k, i]}be the transmission pre-coding matrix of the kth user in i-th community, eig _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}the characteristic vector corresponding to minimal eigenvalue; η ^{[k, i]}be the dispatching criterion value of the kth user in i-th community, λ _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}minimal eigenvalue.

User scheduling, according to the dispatching criterion value of the user feedback received, is carried out in each base station of S4, and calculates the transmitted power determining user; User scheduling process is as shown in Figure 2:

Step 4.1, make i=L;

Step 4.2, i-th base station perform user and select.First, i-th individual user alternatively user with minimum dispatching criterion value of base station selected T (T>=S), and the set that this T candidate user forms is designated as the transmission pre-coding matrix calculated in step S3 is sent to the base station into oneself service by this T candidate user;

Step 4.3, order wherein represent i-th base station from the set of the user of middle selection;

Step 4.4, for each user compute vector g ^{[k, i]}

$g^{[k,i]}=U_i^H{H}_i^{[k.i]}{v}^{[k,i]}-\underset{j=1}{\overset{r-1}{\mathrm{\&Sigma;}}}\frac{{\left(g^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}}{{\left|\right|g^{[\mathrm{\&pi;}\left(j\right),i]}\left|\right|}^2}{g}^{[\mathrm{\&pi;}\left(j\right),i]};$

Wherein, v ^{[k, i]}for the transmission pre-coding matrix of the kth user in i-th community obtaining in step 3.2, for the kth user in i-th community is to the up channel matrix of i-th base station providing service for it, π (j), j=1 ..., r-1 represents the jth user selected base station; As r=1,

Step 4.5, order

Step 4.6, calculating user transmitted power P ^{[k, i]}

$P^{[k,i]}=\frac{(I_{\mathrm{IC}}^{[k,i]}+{\mathrm{\&sigma;}}^2)\mathrm{\&delta;}}{{\left|\right|g^{[k,i]}\left|\right|}^2};$

Wherein, σ ²for noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, represent the presence of intercell interference suffered by kth user in cell i, represent the set of the user selected by l base station;

If the base station selected user k of step 4.7 i-th, family π (j) is selected, j=1 in i-th base station ..., r-1 needs to upgrade its transmitted power to meet the requirement of minimum Signal to Interference plus Noise Ratio.Remember that i-th base station has selected the up-to-date transmitted power at family π (j) to be

$P_k^{[\mathrm{\&pi;}\left(j\right),i]}=\frac{(I_{k,\mathrm{IU}}^{[\mathrm{\&pi;}\left(j\right),i]}+I_{\mathrm{IC}}^{[\mathrm{\&pi;}\left(j\right),i]}+{\mathrm{\&sigma;}}^2)\mathrm{\&delta;}}{{\left|\right|g^{[\mathrm{\&pi;}\left(j\right),i]}\left|\right|}^2};$

Wherein: represent in cell i the presence of intercell interference selected suffered by family π (j), its computational methods are as follows:

And represent in cell i the intra-cell interference selected suffered by family π (j), its computational methods are as follows:

$I_{k,\mathrm{IU}}^{[\mathrm{\&pi;}\left(j\right),i]}=\underset{m=j+1}{\overset{r-1}{\mathrm{\&Sigma;}}}{P}_k^{[\mathrm{\&pi;}\left(m\right),i]}{\left|\right|{\left(f^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[\mathrm{\&pi;}\left(m\right),i]}{v}^{[\mathrm{\&pi;}\left(m\right),i]}\left|\right|}^2+P^{[k,i]}{\left|\right|{\left(f^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}\left|\right|}^2;$

Step 4.8, due to the maximum transmit power of each user be P _maxif user k can be selected, must meet the following conditions:

$\max \{{\max }_{j=1,...,r-1}{P}_k^{[\mathrm{\&pi;}\left(j\right),i]},P^{[k,i]}\}\&le;P_{\max }$

Write the set of the condition of being enough to all over in the set of user be namely

The system of selection of r service-user of i-th base station is as follows:

Step 4.9, renewal set and as follows

$P_i=[P_{\mathrm{\&pi;}\left(r\right)}^{[\mathrm{\&pi;}\left(1\right),i]},P_{\mathrm{\&pi;}\left(r\right)}^{[\mathrm{\&pi;}(r-1),i]},...,P^{[\mathrm{\&pi;}\left(r\right),i]}];$

represent from set middle removal element π (r), P _ifor the current transmitted power having selected family.

If step 4.10 and r < S, makes r=r+1, and returns step 4.4; Otherwise, enter step 4.11.

If step 4.11 i > 1, i-th base station by back haul link by P _i, send to the 1st ..., i-1 base station, and make i=i-1, return step 4.2, otherwise, enter step S5.

The transmission power value determined in step S4 sends to by the user selected by each base station of S5;

Used the transmission power value received in the pre-coding matrix and step S5 obtained in step S3 described in S6 by the user selected, send data;

Each base station of S7 uses the data message of its user served that to be decoded by method for eliminating serial interference.Concrete decode procedure is as follows:

Concrete decode procedure is as follows:

Step 7.1, make i=1;

Step 7.2, as i=1, i-th base station uses following receiving filter to decode the information of oneself institute's service-user:

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

As i > 1, i-th base station according to receive from the 1st ..., the user data after i-1 base station decodes rebuild from the 1st ..., the interference signal If of i-1 community _i,

And interference signal is deducted from the signal that oneself receives, then use the information of oneself institute's service-user of following receiving filter decoding

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

Decoded information is sent to the base station of also not decoding by i-th base station by the back haul link between base station, and namely i-th+1 ..., L base station;

If step 7.3 i < is L, return step 7.2, otherwise algorithm terminates.

For those skilled in the art, according to above technical scheme and design, various corresponding change and distortion can be made, and all these change and distortion, within the protection range that all should be included in the claims in the present invention.

Claims (6)

1. time division duplex cellular network up opportunistic interference alignment and a removing method, is characterized in that, comprise the steps:

The Received signal strength space of self is determined in the base station of each community of S1, and the base in self Received signal strength space is broadcast to users all in network, the base U in the Received signal strength space of i-th base station _ibe expressed as follows:

U _i＝[u _1,i,u _2,i,...,u _S,i],i＝1,...,L；

Wherein, an all corresponding base station, each community, L is number and the number of base stations of network small area, and S is the number of users that each base station can be served at most simultaneously;

S2 each base station pilot signal transmitted, each use estimates the down channel matrix of corresponding base station to self according to pilot signal per family, and utilizes this down channel matrix to obtain corresponding up channel matrix;

The each user of S3 is according to the base in each base station received signal space received, and the up channel matrix that estimation obtains, and calculates self transmission pre-coding matrix and dispatching criterion value, and dispatching criterion value is fed back to the base station for oneself service;

User scheduling, according to the dispatching criterion value of the user feedback received, is carried out in each base station of S4, then calculates and determines to be selected the transmitted power of user;

The transmission power value determined in step S4 sends to accordingly by selection user by each base station of S5;

Used by selection user the transmission power value received in the transmission pre-coding matrix and step S5 obtained in step S3 described in S6, send data;

Each base station of S7 uses the data message of its user served that to be decoded by method for eliminating serial interference.

2. a kind of time division duplex cellular network according to claim 1 up opportunistic interference alignment and removing method, it is characterized in that, in step S2, the conjugate transpose of down channel matrix is up channel matrix.

3. a kind of time division duplex cellular network according to claim 1 up opportunistic interference alignment and removing method, it is characterized in that, in step S3, transmission pre-coding matrix and the dispatching criterion value of user are calculated as follows:

v ^[k,i]＝eig _min(Q ^[k,i])；

η ^[k,i]＝λ _min(Q ^[k,i])；

Wherein, v ^{[k, i]}be the transmission pre-coding matrix of the kth user in i-th community, eig _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}the characteristic vector corresponding to minimal eigenvalue; η ^{[k, i]}be the dispatching criterion value of the kth user in i-th community, λ _min(Q ^{[k, i]}) be matrix Q ^{[k, i]}minimal eigenvalue; Matrix Q ^{[k, i]}base according to the up channel matrix of a kth user in i-th community and the Received signal strength space of respective base station draws.

4. a kind of time division duplex cellular network according to claim 3 up opportunistic interference alignment and removing method, is characterized in that, for the kth user in the 1st community, and matrix Q ^{[k, 1]}be calculated as follows:

$Q^{[k,1]}={\left(H_1^{[k,1]}\right)}^H{u}_1{U}_1^H{H}_1^{[k,1]};$

Wherein, be the up channel matrix of the kth user in the 1st community to the 1st base station, k=1 ..., K, K are the number of users in each community; () ^hrepresent conjugate transposition operation;

And for jth (j=2 ..., L) a kth user in individual community, Q ^{[k, j]}be calculated as follows:

$Q^{[k,j]}=\underset{l=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{P}_{\max }{\left(H_l^{[k,j]}\right)}^H{U}_l{H}_l^H{H}_l^{[k,j]};$

Wherein, for the user of the kth in jGe community is to the up channel matrix of l base station, P _maxfor the maximum transmit power of each user, k=1 ..., K.

5. a kind of time division duplex cellular network according to claim 1 up opportunistic interference alignment and removing method, it is characterized in that, described step S4 specifically comprises:

4.1) i=L is made;

4.2) i-th base station performs user's selection course: first, i-th individual user alternatively user with minimum dispatching criterion value of base station selected T (T>=S), and the set that this T candidate user forms is designated as the transmission pre-coding matrix calculated in step S3 is sent to the base station into oneself service by this T candidate user;

4.3) make wherein represent i-th base station from the set of the user of middle selection;

4.4) for each user of i-th base station compute vector g ^{[k, i]}:

$g^{[k,i]}=U_i^H{H}_i^{[k,i]}{v}^{[k,i]}-\underset{j=1}{\overset{r-1}{\mathrm{\&Sigma;}}}\frac{{\left(g^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}}{{\left|\right|g^{[\mathrm{\&pi;}\left(j\right),i]}\left|\right|}^2}{g}^{[\mathrm{\&pi;}\left(j\right),i]};$

Wherein, v ^{[k, i]}for the transmission pre-coding matrix of user k, for user k is to the up channel matrix of i-th base station providing service for it, π (j), j=1 ..., r-1 represents the jth user that base station i has selected; As r=1,

4.5) make calculate user transmitted power P ^{[k, i]}:

$P^{[k,i]}=\frac{(I_{\mathrm{IC}}^{[k,i]}+{\mathrm{\&sigma;}}^2)\mathrm{\&delta;}}{{\left|\right|g^{[k,i]}\left|\right|}^2};$

Wherein, σ ²for noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, represent the presence of intercell interference suffered by kth user in cell i, represent the set of the user selected by l base station;

4.6) if i-th base station selected user k, family π (j) is selected, j=1 in i-th base station ..., r-1 needs to upgrade its transmitted power to meet the requirement of minimum Signal to Interference plus Noise Ratio, remembers that i-th base station has selected the up-to-date transmitted power at family π (j) to be

$P_k^{[\mathrm{\&pi;}\left(j\right),i]}=\frac{(I_{k,\mathrm{IU}}^{[\mathrm{\&pi;}\left(j\right),i]}+I_{\mathrm{IC}}^{[\mathrm{\&pi;}\left(j\right),i]}+{\mathrm{\&sigma;}}^2)\mathrm{\&delta;}}{{\left|\right|g^{[\mathrm{\&pi;}\left(j\right),i]}\left|\right|}^2};$

Wherein, represent in cell i the presence of intercell interference selected suffered by family π (j), be calculated as follows:

And represent in cell i the intra-cell interference selected suffered by family π (j), its computational methods are as follows:

$I_{k,\mathrm{IU}}^{[\mathrm{\&pi;}\left(j\right),i]}=\underset{m=j+1}{\overset{r-1}{\mathrm{\&Sigma;}}}{P}_k^{[\mathrm{\&pi;}\left(m\right),i]}{\left|\right|{\left(f^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[\mathrm{\&pi;}\left(m\right),i]}{v}^{\&lsqb;\mathrm{\&pi;}\left(m\right),i\&rsqb;}\left|\right|}^2+P^{[k,i]}{\left|\right|{\left(f^{[\mathrm{\&pi;}\left(j\right),i]}\right)}^H{U}_i^H{H}_i^{[k,i]}{v}^{[k,i]}\left|\right|}^2;$

4.7) because the maximum transmit power of each user is P _maxif user k can be selected, must meet the following conditions:

$\max \{{\max }_{j=1,...,r-1}{P}_k^{[\mathrm{\&pi;}\left(j\right),i]},P^{[k,i]}\}\&le;P_{\max }$

Write the set of the condition of being enough to all over in the set of candidate user be namely

The system of selection of r service-user of i-th base station is as follows:

4.8) set is upgraded and as follows:

$P_i=[P_{\mathrm{\&pi;}\left(r\right)}^{[\mathrm{\&pi;}\left(1\right),i]},P_{\mathrm{\&pi;}\left(r\right)}^{[\mathrm{\&pi;}(r-1),i]},...,P^{[\mathrm{\&pi;}\left(r\right),i]}]$

represent from set middle removal element π (r), P _ifor current i-th base station has selected the transmitted power at family;

4.9) if and r < S, makes r=r+1, and returns step 4.4), otherwise, enter step 4.10);

4.10) if i > 1, i-th base station by back haul link by P _i, send to the 1st ..., i-1 base station, and make i=i-1, return step 4.2), otherwise, enter step S5.

6. the up opportunistic interference of a kind of time division duplex cellular network is alignd and removing method according to claim 1 or 5, and it is characterized in that, described step S7 specifically comprises:

7.1) i=1 is made;

7.2) as i=1, i-th base station uses the information of oneself institute's service-user of following receiving filter decoding:

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

As i > 1, i-th base station according to receive from the 1st ..., the user data x after i-1 base station decodes ^{[k ', l]}, rebuild from the 1st ..., the interference signal If of i-1 community _i, and interference signal is deducted from the signal that oneself receives:

Then the information of oneself institute's service-user of following receiving filter decoding is used:

Wherein U _iit is given in step sl, it is given in step s 4 which, represent set the number of middle element;

Decoded information is sent to the base station of also not decoding by i-th base station by the back haul link between base station, and namely i-th+1 ..., L base station;

7.3) if i < is L, step 7.2 is returned), otherwise step S7 terminates.