CN104581959B - A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method - Google Patents
A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method Download PDFInfo
- Publication number
- CN104581959B CN104581959B CN201510027052.2A CN201510027052A CN104581959B CN 104581959 B CN104581959 B CN 104581959B CN 201510027052 A CN201510027052 A CN 201510027052A CN 104581959 B CN104581959 B CN 104581959B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msup
- user
- base station
- msubsup
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/121—Wireless traffic scheduling for groups of terminals or users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of time division duplex cellular network uplink opportunistic interference alignment and removing methods, mainly solve the problems, such as the uplink interference in cellular network, implementation step is：(1) each cell base station determines the reception signal space of oneself, and the base for receiving signal space is broadcast to user all in network；(2) each base station pilot signal transmitted, user estimate channel state information accordingly；(3) each user calculates the pre-coding matrix and dispatching criterion value of itself, and dispatching criterion value is fed back to the base station for oneself service；(4) base station selected service user；(5) selected user sends data；(6) base station uses successive interference cancellation techniques decoding data.The present invention utilizes the back haul link between multi-user diversity gain and base station, improves network throughput, and with relatively low implementation complexity, available for cellular network communication.
Description
Technical field
The present invention relates to wireless communication fields, and in particular to the opportunistic interference in cellular network uplink communication aligns and disappears
Except method, available for the uplink interference management in cellular network.
Background field
The fast development of wireless traffic so that requirement of the user to network rate is higher and higher, this causes cordless communication network
Capacity is urgently promoted.In order to improve the capacity of cellular network, cellular network of new generation tends to the mode using full rate multiplexing
To improve the utilization ratio of frequency spectrum resource.But this mode can bring serious inter-cell interference.Effective interference management is bee
A urgent problem in nest network.
Traditional interference avoidance method by the orthogonal communication resource of neighbor cell allocation to avoid interference, but this side
Method greatly reduces the multiplexing efficiency of frequency spectrum resource.The interference alignment schemes of newest proposition are considered as a kind of solution wireless network
The effective ways of interference.Interference alignment is by designing a son letter for sending the multiple interference signals of precoding and snapping to user
In number dimensional space, so that other signal dimension spaces can carry out glitch-free transmission.However traditional interference alignment
Method, originator usually require global channel state information or need substantial amounts of iterative operation that transmission precoding is calculated
Matrix, this so that traditional interference alignment schemes implementation complexity is higher.On the other hand, due to the limitation of feasibility condition, ginseng
With disturbing the communication link number alignd that will be restricted, so as to limit the capacity of network.
The content of the invention
In view of the deficiencies of the prior art, the present invention is intended to provide a kind of interference pair of time division duplex cellular network uplink opportunistic
Neat and removing method, by the way that the multi-user diversity gain in cellular network and the back haul link between base station is made full use of to solve net
Interference problem in network simultaneously promotes network capacity.
To achieve these goals, the present invention adopts the following technical scheme that：
A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method include the following steps：
The base station of each cells of S1 determines the reception signal space of itself, and the base of itself reception signal space is broadcast to
All users in network, the base U of the reception signal space of i-th of base stationiIt represents as follows：
Ui=[u1,i,u2,i,...,uS,i], i=1 ..., L；
Wherein, each cell corresponds to a base station, and L is the number i.e. number of base station of cell in network, and S is each base
It stands the number of users that can at most service simultaneously；
The each base station pilot signal transmitteds of S2, each user estimate corresponding base station under itself all in accordance with pilot signal
Row channel matrix, and obtain corresponding up channel matrix using the down channel matrix；
The up channel square that each users of S3 obtain according to the base and estimation in each base station received signal space received
Battle array calculates the transmission pre-coding matrix and dispatching criterion value of itself, and dispatching criterion value is fed back to the base station for oneself service；
Each base stations of S4 carry out user's scheduling, then calculate and determine quilt according to the dispatching criterion value of the user feedback received
Select the transmit power of user；
The transmission power value determined in step S4 is sent to selected user accordingly by each base stations of S5；
User is chosen described in S6 and uses the hair received in the transmission pre-coding matrix and step S5 obtained in step S3
Performance number is sent, sends data；
The each base stations of S7 use the data message that its user serviced is decoded by method for eliminating serial interference.
It should be noted that in step S2, the conjugate transposition of down channel matrix is up channel matrix.
It should be noted that in step S3, transmission pre-coding matrix and dispatching criterion the value calculating of user is as follows：
v[k,i]=eigmin(Q[k,i])；
η[k,i]=λmin(Q[k,i])；
Wherein, v[k,i]For the transmission pre-coding matrix of k-th of user in i-th of cell, eigmin(Q[k,i]) it is matrix Q[k,i]Minimal eigenvalue corresponding to feature vector；η[k,i]For the dispatching criterion value of k-th of user in i-th of cell, λmin
(Q[k,i]) it is matrix Q[k,i]Minimal eigenvalue；Matrix Q[k,i]The up channel square of k-th of user in i-th of cell
The base of the reception signal space of battle array and respective base station is drawn.
Further, it is necessary to illustrate, for k-th of user in the 1st cell, matrix Q[k,1]It calculates as follows：
Wherein,For the up channel matrix of k-th of user in the 1st cell to the 1st base station, k=1 ...,
K, K are number of users total in each cell；(·)HRepresent conjugate transposition operation；
And for k-th of user in jth (j=2 ..., L) a cell, Q[k,j]It calculates as follows：
Wherein,For k-th of user in j-th of cell to the up channel matrix of l-th of base station, PmaxTo be each
The maximum transmit power of user, k=1 ..., K.
It should be noted that the step S4 is specifically included：
4.1) i=L is made；
4.2) i-th of base station performs user's selection course：First, i-th of base station selected T (T >=S) is a has minimum scheduling
The user of criterion value is as candidate user, and the set that this T candidate user is formed is denoted asThis T candidate user will
The transmission pre-coding matrix being calculated in step S3 is sent to the base station for oneself service；
4.3) makeWhereinRepresent i-th of base station fromSelected in user set；
4.4) for each user of i-th of base stationCalculate vector g[k,i]:
Wherein, v[k,i]For the transmission pre-coding matrix of user k,For user k to i-th of base serve it
The up channel matrix stood, π (j), j=1 ..., r-1 represent j-th of user that base station has been selected；As r=1,
4.5) makeCalculate userTransmit power P[k,i]：
Wherein, σ2For noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, Represent the inter-cell interference suffered by kth user in cell i,Represent the set of the selected user in l-th of base station；
4.6) if i-th of base station selected user k, i-th of base station have selected family π (j), j=1 ..., r-1 to need to update
For its transmit power to meet the requirement of minimum Signal to Interference plus Noise Ratio, i-th of base station of note has selected the newest transmit power of family π (j) to be
Wherein,It represents to have selected the inter-cell interference suffered by family π (j) in cell i, calculate as follows：
AndIt represents to have selected the intra-cell interference suffered by family π (j) in cell i, computational methods are as follows：
4.7) since the maximum transmit power of each user is PmaxIf user k can be chosen, it is necessary to be met following
Condition：
Write the set of sufficient conditions above all overIn the collection of candidate user be combined intoI.e.
The selection method of r-th of service user of i-th of base station is as follows：
4.8) update setAndIt is as follows：
It represents from setMiddle removal element π (r), PiThe transmission work(at family has currently been selected for i-th of base station
Rate；
If 4.9)And r ＜ S, make r=r+1, and return to step 4.4), otherwise, enter step 4.9)；
If 4.10) i ＞ 1, i-th of base station is by back haul link by Pi,The 1st ..., i-1 base station are sent to, and
Make i=i-1, return to step 4.2), otherwise, enter step S5.
It should be noted that the step S7 is specifically included：
7.1) i=1 is made；
7.2) as i=1, i-th of base station decodes the information of oneself institute's service user using following receiving filter：
Wherein UiIt gives in step sl,It gives in step s 4,Represent set
The number of middle element；
As i ＞ 1, i-th of base station comes from the 1st ..., decoded user data x in i-1 base station according to what is received[k',l], k' ∈ Kl, l=1 ..., i-1 rebuild the interference signal If from the 1st ..., i-1 celli, and by interference signal from
It is subtracted in the signal oneself received：
Then the information of oneself institute's service user is decoded using following receiving filter：
Wherein UiIt gives in step sl,It gives in step s 4,Represent set
The number of middle element；
Decoded information is sent to decoded base station not yet by i-th of base station by the back haul link between base station, i.e.,
I+1 ..., L base station；
If 7.3) i ＜ L, return to step 7.2), otherwise, step S7 terminates.
The beneficial effects of the present invention are：
1st, the service user for each base station of method choice that the present invention is dispatched by opportunistic need not use the side of iteration
Method is to obtain the transmission pre-coding matrix of user and the receiving filter of base station, so as to relatively low implementation complexity；
2nd, the present invention by using interference cancellation techniques eliminate cell portion between disturb, relax tradition interference alignment can
The limitation of row condition so that more users can add network capacity with simultaneous transmission data；
3rd, the present invention takes full advantage of the multi-user diversity gain in cellular network and the backhaul link resource of base station,
Add the handling capacity of network.
Description of the drawings
Fig. 1 is the realization general flow chart of the present invention；
Fig. 2 is the sub-process figure that user's scheduling is carried out in the present invention.
Specific embodiment
Below with reference to attached drawing, the invention will be further described, it is necessary to which explanation, the present embodiment is with this technology side
Premised on case, detailed embodiment and specific operating process are provided, but protection scope of the present invention is not limited to this implementation
Example.
As shown in Figure 1, a kind of time division duplex cellular network uplink opportunistic interference alignment and removing method include following step
Suddenly：
The base station of each cells of S1 determines the reception signal space of itself, and the base of itself reception signal space is broadcast to
All users in network, the base U of the reception signal space of i-th of base stationiIt represents as follows：
Ui=[u1,i,u2,i,...,uS,i], i=1 ..., L；
Wherein, each cell corresponds to a base station, and L is the number i.e. number of base stations of cell in network, and S is each base station
The number of users that can at most service simultaneously；
The each base station pilot signal transmitteds of S2, each user estimate corresponding base station under itself all in accordance with pilot signal
Row channel matrix, and obtain corresponding up channel matrix using the down channel matrix；The conjugation of down channel matrix turns
It puts as up channel matrix.
The up channel square that each users of S3 obtain according to the base and estimation in each base station received signal space received
Battle array calculates the pre-coding matrix and dispatching criterion value of itself, and dispatching criterion value is fed back to the base station for oneself service；It prelists
The calculating process of code matrix and dispatching criterion value is as follows：
K-th of user's calculating matrix Q in step 3.1, i-th of cell[k,i], wherein, i=1 ..., L, k=1 ...,
K, L are the numbers of cell in network, and K is number of users total in each cell.
For k-th of user in the 1st cell, Q[k,1]Computational methods it is as follows：
Wherein,For k-th of user in the 1st cell to the up channel matrix of the 1st base station, ()HIt represents
Conjugate transposition operation.
For k-th of user in jth (j=2 ..., L) a cell, Q[k,j]Computational methods are as follows：
Wherein,For k-th of user in j-th of cell to the up channel matrix of l-th of base station, PmaxTo be each
The maximum transmit power of user, k=1 ..., K；
K-th of user in step 3.2, i-th of cell is to the matrix Q that is calculated[k,i]Eigenvalues Decomposition is carried out, can be obtained
Pre-coding matrix is sent to it and dispatching criterion value is respectively
v[k,i]=eigmin(Q[k,i])；
η[k,i]=λmin(Q[k,i])；
Wherein, v[k,i]For the transmission pre-coding matrix of k-th of user in i-th of cell, eigmin(Q[k,i]) it is matrix Q[k,i]Minimal eigenvalue corresponding to feature vector；η[k,i]For the dispatching criterion value of k-th of user in i-th of cell, λmin
(Q[k,i]) it is matrix Q[k,i]Minimal eigenvalue.
Each base stations of S4 carry out user's scheduling, and calculate and determine user according to the dispatching criterion value of the user feedback received
Transmit power；User's scheduling process is as shown in Figure 2：
Step 4.1 makes i=L；
Step 4.2, i-th of base station perform user's selection.First, i-th of base station selected T (T >=S) is a has minimum scheduling
The user of criterion value is as candidate user, and the set that this T candidate user is formed is denoted asThis T candidate user will
The transmission pre-coding matrix being calculated in step S3 is sent to the base station for oneself service；
Step 4.3, orderWhereinRepresent i-th of base station fromThe set of the user of middle selection；
Step 4.4, for each userCalculate vector g[k,i]
Wherein, v[k,i]For the transmission pre-coding matrix of k-th of user in i-th of cell being obtained in step 3.2,
For k-th of user in i-th of cell to the up channel matrix of i-th of base station serve it, π (j), j=
1 ..., r-1 represents j-th of user that base station has been selected；As r=1,
Step 4.5, order
Step 4.6 calculates userTransmit power P[k,i]
Wherein, σ2For noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, Represent the inter-cell interference suffered by kth user in cell i,Represent the set of the selected user in l-th of base station；
If step 4.7, i-th of base station selected user k, i-th of base station has selected family π (j), j=1 ..., r-1 to need
Its transmit power is updated to meet the requirement of minimum Signal to Interference plus Noise Ratio.Remember that the newest transmit power of family π (j) has been selected in i-th of base station
For
Wherein：It represents to have selected the inter-cell interference suffered by family π (j) in cell i, computational methods are as follows：
AndIt represents to have selected the intra-cell interference suffered by family π (j) in cell i, computational methods are as follows：
Step 4.8, due to each user maximum transmit power be PmaxIf user k can be chosen, it is necessary to be met
The following conditions：
Write the set of sufficient conditions above all overIn the collection of user be combined intoI.e.
The selection method of r-th of service user of i-th of base station is as follows：
Step 4.9, update setAndIt is as follows
It represents from setMiddle removal element π (r), PiCurrently to have selected the transmit power at family.
If step 4.10,And r ＜ S make r=r+1, and return to step 4.4；Otherwise, 4.11 are entered step.
If step 4.11, i ＞ 1, i-th of base station is by back haul link by Pi,The 1st is sent to ..., i-1 base
It stands, and makes i=i-1, otherwise return to step 4.2, enters step S5.
The transmission power value determined in step S4 is sent to selected user by each base stations of S5；
Selected user described in S6 uses the transmission received in the pre-coding matrix and step S5 obtained in step S3
Performance number sends data；
The each base stations of S7 use the data message that its user serviced is decoded by method for eliminating serial interference.Specific solution
Code process is as follows：
Specific decoding process is as follows：
Step 7.1 makes i=1；
Step 7.2, as i=1, i-th of base station decodes the information of oneself institute's service user using following receiving filter：
Wherein UiIt gives in step sl,It gives in step s 4,Represent set
The number of middle element；
As i ＞ 1, i-th of base station comes from the 1st ..., the decoded user data in i-1 base station according to what is receivedIt rebuilds and comes from the 1st ..., the interference signal If of i-1 celli,
And subtract interference signal from the signal oneself received, then oneself institute is decoded using following receiving filter
The information of service user
Wherein UiIt gives in step sl,It gives in step s 4,Represent set
The number of middle element；
Decoded information is sent to decoded base station not yet by i-th of base station by the back haul link between base station, i.e.,
I+1 ..., L base station；
If step 7.3, i ＜ L, return to step 7.2, otherwise, algorithm terminates.
For those skilled in the art, it can be made various corresponding according to above technical solution and design
Change and deform, and all these change and deformation, should be construed as being included within the protection domain of the claims in the present invention.
Claims (4)
1. a kind of time division duplex cellular network uplink opportunistic interference alignment and removing method, which is characterized in that including walking as follows
Suddenly：
The base station of each cells of S1 determines the reception signal space of itself, and the base of itself reception signal space is broadcast to net
All users in network, the base U of the reception signal space of i-th of base stationiIt represents as follows：
Ui=[u1,i,u2,i,...,uS,i], i=1 ..., L；
Wherein, each cell corresponds to a base station, and L is the number i.e. number of base stations of cell in network, and S is most for each base station
The number of users that can be serviced simultaneously；
The each base station pilot signal transmitteds of S2, each user estimate corresponding base station to the downlink of itself all in accordance with pilot signal
Channel matrix, and obtain corresponding up channel matrix using the down channel matrix；
The up channel matrix that each users of S3 obtain according to the base and estimation in each base station received signal space received,
The transmission pre-coding matrix and dispatching criterion value of itself are calculated, and dispatching criterion value is fed back into the base station for oneself service；With
The transmission pre-coding matrix and dispatching criterion value at family calculate as follows：
v[k,i]=eigmin(Q[k,i])；
η[k,i]=λmin(Q[k,i])；
Wherein, v[k,i]For the transmission pre-coding matrix of k-th of user in i-th of cell, eigmin(Q[k,i]) it is matrix Q[k,i]
Minimal eigenvalue corresponding to feature vector；η[k,i]For the dispatching criterion value of k-th of user in i-th of cell, λmin(Q[k ,i]) it is matrix Q[k,i]Minimal eigenvalue；Matrix Q[k,i]The up channel matrix of k-th of user in i-th of cell and
The base of the reception signal space of respective base station is drawn；
For k-th of user in the 1st cell, matrix Q[k,1]It calculates as follows：
<mrow>
<msup>
<mi>Q</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mn>1</mn>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>=</mo>
<msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>H</mi>
<mn>1</mn>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mn>1</mn>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<msub>
<mi>U</mi>
<mn>1</mn>
</msub>
<msubsup>
<mi>U</mi>
<mn>1</mn>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mn>1</mn>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mn>1</mn>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>;</mo>
</mrow>
Wherein,For the up channel matrix of k-th of user in the 1st cell to the 1st base station, k=1 ..., K, K are
Number of users in each cell；(·)HRepresent conjugate transposition operation；
And for k-th of user in jth (j=2 ..., L) a cell, Q[k,j]It calculates as follows：
<mrow>
<msup>
<mi>Q</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<msub>
<mi>P</mi>
<mrow>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
</msub>
<msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>H</mi>
<mi>l</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<msub>
<mi>U</mi>
<mi>l</mi>
</msub>
<msubsup>
<mi>U</mi>
<mi>l</mi>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mi>l</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>;</mo>
</mrow>
Wherein,For k-th of user in j-th of cell to the up channel matrix of l-th of base station, PmaxFor each user
Maximum transmit power, k=1 ..., K；
Each base stations of S4 carry out user's scheduling, then calculate and determine to be chosen according to the dispatching criterion value of the user feedback received
The transmission power value of user；
The transmission power value determined in step S4 is sent to selected user accordingly by each base stations of S5；
User is chosen described in S6 and uses the transmission work(received in the transmission pre-coding matrix and step S5 obtained in step S3
Rate value sends data；
The each base stations of S7 use the data message that its user serviced is decoded by method for eliminating serial interference.
2. a kind of time division duplex cellular network uplink opportunistic interference alignment according to claim 1 and removing method,
It is characterized in that, in step S2, the conjugate transposition of down channel matrix is up channel matrix.
3. a kind of time division duplex cellular network uplink opportunistic interference alignment according to claim 1 and removing method,
It is characterized in that, the step S4 is specifically included：
4.1) i=L is made；
4.2) i-th of base station performs user's selection course：First, i-th of base station selected T (T >=S) is a has minimum dispatching criterion
The user of value is as candidate user, and the set that this T candidate user is formed is denoted asThis T candidate user is by step
The transmission pre-coding matrix being calculated in S3 is sent to the base station for oneself service；
4.3) makeWhereinRepresent i-th of base station fromThe set of the user of middle selection；
4.4) for each user of i-th of base stationCalculate vector g[k,i]:
<mrow>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>=</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mi>i</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<msup>
<mi>v</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>-</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>r</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<mfrac>
<mrow>
<msup>
<mrow>
<mo>(</mo>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mi>i</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<msup>
<mi>v</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
</mrow>
<mrow>
<mo>|</mo>
<mo>|</mo>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
</mfrac>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>;</mo>
</mrow>
Wherein, v[k,i]For user k to the transmission pre-coding matrix of i-th of base station serve it,For user k to for
It provides the up channel matrix of i-th of base station of service, and π (j), j=1 ..., r-1 are represented j-th that base station i has been selected
User；As r=1,
4.5) makeCalculate userTransmit power P[k,i]：
<mrow>
<msup>
<mi>P</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>=</mo>
<mfrac>
<mrow>
<mo>(</mo>
<msubsup>
<mi>I</mi>
<mrow>
<mi>I</mi>
<mi>C</mi>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>+</mo>
<msup>
<mi>&sigma;</mi>
<mn>2</mn>
</msup>
<mo>)</mo>
<mi>&delta;</mi>
</mrow>
<mrow>
<mo>|</mo>
<mo>|</mo>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Wherein, σ2For noise power-value, δ is the required minimum Signal to Interference plus Noise Ratio of user, Represent that the minizone in cell i suffered by k-th of user is done
It disturbs,Represent the set of the selected user in l-th of base station；
If 4.6) i-th of base station selected user k, i-th of base station has selected family π (j), j=1 ..., r-1 to need to update its hair
Power is sent to meet the requirement of minimum Signal to Interference plus Noise Ratio, i-th of base station of note has selected the newest transmit power of family π (j) to be
<mrow>
<msubsup>
<mi>P</mi>
<mi>k</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>=</mo>
<mfrac>
<mrow>
<mo>(</mo>
<msubsup>
<mi>I</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>I</mi>
<mi>U</mi>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>I</mi>
<mrow>
<mi>I</mi>
<mi>C</mi>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>+</mo>
<msup>
<mi>&sigma;</mi>
<mn>2</mn>
</msup>
<mo>)</mo>
<mi>&delta;</mi>
</mrow>
<mrow>
<mo>|</mo>
<mo>|</mo>
<msup>
<mi>g</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Wherein,It represents to have selected the inter-cell interference suffered by family π (j) in cell i, calculate as follows：
AndIt represents to have selected the intra-cell interference suffered by family π (j) in cell i, computational methods are as follows：
<mrow>
<msubsup>
<mi>I</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>I</mi>
<mi>U</mi>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>=</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mi>j</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>r</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<msubsup>
<mi>P</mi>
<mi>k</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msup>
<mrow>
<mo>(</mo>
<msup>
<mi>f</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mi>i</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<msup>
<mi>v</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
<mo>+</mo>
<msup>
<mi>P</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<mo>|</mo>
<msup>
<mrow>
<mo>(</mo>
<msup>
<mi>f</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>H</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mi>i</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<msup>
<mi>v</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
<mo>;</mo>
</mrow>
4.7) since the maximum transmit power of each user is PmaxIf user k can be chosen, it is necessary to meet the following conditions：
<mrow>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
<mo>{</mo>
<msub>
<mi>max</mi>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mo>...</mo>
<mo>,</mo>
<mi>r</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>P</mi>
<mi>k</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>,</mo>
<msup>
<mi>P</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>k</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>}</mo>
<mo>&le;</mo>
<msub>
<mi>P</mi>
<mrow>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
</msub>
</mrow>
Write the set of sufficient conditions above all overIn the collection of candidate user be combined intoI.e.
The selection method of r-th of service user of i-th of base station is as follows：
4.8) update setAndIt is as follows：
<mrow>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mo>&lsqb;</mo>
<msubsup>
<mi>P</mi>
<mrow>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>r</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>P</mi>
<mrow>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>r</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>r</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msubsup>
<mo>,</mo>
<mo>...</mo>
<mo>,</mo>
<msup>
<mi>P</mi>
<mrow>
<mo>&lsqb;</mo>
<mi>&pi;</mi>
<mrow>
<mo>(</mo>
<mi>r</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>&rsqb;</mo>
</mrow>
</msup>
<mo>&rsqb;</mo>
</mrow>
It represents from setMiddle removal element π (r), PiThe transmit power at family has been selected for current i-th of base station；
If 4.9)And r ＜ S, make r=r+1, and return to step 4.4), otherwise, enter step 4.10)；
If 4.10) i ＞ 1, i-th of base station is by back haul link by Pi,The 1st ..., i-1 base station are sent to, and makes i=
I-1, return to step 4.2), otherwise, enter step S5.
4. a kind of time division duplex cellular network uplink opportunistic interference alignment according to claim 3 and removing method,
It is characterized in that, the step S7 is specifically included：
7.1) i=1 is made；
7.2) as i=1, i-th of base station decodes the information of oneself institute's service user using following receiving filter：
Wherein UiIt gives in step sl, f[π(x),i], x=1 ...,It gives in step s 4,Represent setIn
The number of element；
As i ＞ 1, i-th of base station comes from the 1st ..., decoded user data x in i-1 base station according to what is received[k′,l],L=1 ..., i-1 rebuilds the interference signal If from the 1st ..., i-1 celli, and by interference signal from oneself
It is subtracted in the signal received：
Then the information of oneself institute's service user is decoded using following receiving filter：
Wherein UiIt gives in step sl, f[π(x),i], x=1 ...,It gives in step s 4,Represent setIn
The number of element；
I-th of base station by decoded information by the back haul link between base station be sent to not yet decoded base station, i.e., i-th+
1 ..., L base station；
If 7.3) i ＜ L, return to step 7.2), otherwise, step S7 terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510027052.2A CN104581959B (en) | 2015-01-20 | 2015-01-20 | A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510027052.2A CN104581959B (en) | 2015-01-20 | 2015-01-20 | A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104581959A CN104581959A (en) | 2015-04-29 |
| CN104581959B true CN104581959B (en) | 2018-05-18 |
Family
ID=53096893
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510027052.2A Active CN104581959B (en) | 2015-01-20 | 2015-01-20 | A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104581959B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106713192A (en) * | 2015-07-20 | 2017-05-24 | 北京三星通信技术研究有限公司 | Multi-user data transmission method and equipment |
| CN106357570B (en) * | 2016-08-26 | 2019-05-21 | 西安电子科技大学 | A kind of time-division interference alignment schemes of full duplex base station cellular network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103166685A (en) * | 2013-02-04 | 2013-06-19 | 重庆邮电大学 | Interference aligning method based on combined power distribution in LTE |
| CN103269238A (en) * | 2013-04-28 | 2013-08-28 | 华为技术有限公司 | Method for interference alignment and interference offset, system, user equipment and base stations |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW201438419A (en) * | 2013-03-06 | 2014-10-01 | Interdigital Patent Holdings | Interference management and interference alignment in wireless networks |
-
2015
- 2015-01-20 CN CN201510027052.2A patent/CN104581959B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103166685A (en) * | 2013-02-04 | 2013-06-19 | 重庆邮电大学 | Interference aligning method based on combined power distribution in LTE |
| CN103269238A (en) * | 2013-04-28 | 2013-08-28 | 华为技术有限公司 | Method for interference alignment and interference offset, system, user equipment and base stations |
Non-Patent Citations (2)
| Title |
|---|
| Opportunistic Interference Alignment for Interference-Limited Cellular TDD Uplink;Bang Chul Jung，Won-Yong Shin;《IEEE COMMUNICATIONS LETTERS》;20110228;第15卷(第2期);148-150 * |
| 提升MIMO干扰信道容量的干扰对齐方案;宋林中，等;《计算机工程》;20141130;第40卷(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104581959A (en) | 2015-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104640220B (en) | A kind of frequency and power distribution method based on NOMA systems | |
| CN102983935B (en) | Precoding, pre-coding/pre-decoding method and emitter and mobile terminal based on interference alignment | |
| CN101984571B (en) | Pre-coding method for multi-user MIMO system | |
| CN101754346B (en) | Intercell interference suppression method based on channel coherence multi-subscriber dispatching | |
| WO2021159551A1 (en) | User matching method and power distribution method in mimo-noma downlink communication system | |
| CN102055563B (en) | Adaptive joint linear precoding method applicable to multi-base station coordination | |
| CN103248461B (en) | Based on the multiple cell interference alignment iterative algorithm of beam forming | |
| CN101925070B (en) | Resource allocation method for cognitive system based on space multiplexing | |
| CN108650006A (en) | Non-orthogonal multiple cut-in method based on extensive MIMO | |
| CN102647728B (en) | Method for beam forming of down link, transmitting terminal and multi-cell cooperative system | |
| CN109005592A (en) | Power distribution method in single antenna NOMA system | |
| CN103384228B (en) | Continuous precoding and the user of a kind of multiuser MIMO broadcast channel select unified algorithm | |
| CN114423028B (en) | CoMP-NOMA cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
| CN102158270B (en) | Sub-channel selecting and pre-code sending method of multi-user MIMO (Multiple Input Multiple Output) system | |
| CN102291727B (en) | Distributed cooperative beam forming and designing method | |
| CN102891740A (en) | Inter-cell interference suppression method based on blind interference alignment | |
| CN107947841A (en) | Extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method | |
| CN104581959B (en) | A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method | |
| CN103347299A (en) | Centralized resource management method based on genetic algorithm | |
| CN101989869B (en) | Joint pre-coding and power control method for multi-antenna cellular network | |
| CN103607260B (en) | System total interference leakage minimum pre-coding matrix group selection algorithm based on MIMO | |
| CN112261662A (en) | Transmission method for improving energy efficiency of NOMA cooperative communication system | |
| CN103338457B (en) | A kind of user choosing method based on cooperative scheduling beam forming | |
| CN102752071A (en) | Down-link pre-encoding method used for multipoint cooperative system and central processing node | |
| CN109275163A (en) | A kind of non-orthogonal multiple access joint bandwidth and method of rate allocation based on structuring sequencing feature |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |