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
- msubsup
- base station
- user
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000001413 cellular effect Effects 0.000 title claims abstract description 16
- 239000011159 matrix material Substances 0.000 claims abstract description 62
- 230000005540 biological transmission Effects 0.000 claims description 23
- 238000004364 calculation method Methods 0.000 claims description 10
- 150000001875 compounds Chemical class 0.000 claims description 3
- 230000002452 interceptive effect Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 6
- 230000008030 elimination Effects 0.000 description 4
- 238000003379 elimination reaction Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
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 invention relates to the field of wireless communication, in particular to an opportunistic interference alignment and elimination method in cellular network uplink communication, which can be used for uplink interference management in a cellular network.
Background field of the invention
The rapid development of wireless services makes the network rate requirements of users higher and higher, which makes the capacity of wireless communication networks to be improved urgently. In order to increase the capacity of cellular networks, a new generation of cellular networks tends to use full frequency reuse to increase the efficiency of utilization of spectrum resources. But this approach can cause severe inter-cell interference. Efficient interference management is an urgent problem to be solved in cellular networks.
The conventional interference avoidance method avoids interference by allocating orthogonal communication resources to adjacent cells, but this method greatly reduces the multiplexing efficiency of spectrum resources. The newly proposed interference alignment method is considered to be an effective method for solving interference of a wireless network. Interference alignment is achieved by designing transmission precoding so that a plurality of interference signals are aligned to one sub-signal dimensional space of a user, and therefore other signal dimensional spaces can be transmitted without interference. However, in the conventional interference alignment method, the originating terminal generally needs global channel state information or needs a large number of iterative operations to calculate a transmission precoding matrix, which makes the conventional interference alignment method more complex to implement. On the other hand, due to the limitation of feasibility conditions, the number of communication links participating in interference alignment will be limited, thereby limiting the capacity of the network.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to provide an uplink opportunistic interference alignment and elimination method for a time division duplex cellular network, which solves the interference problem in the network and improves the network capacity by fully utilizing multi-user diversity gain in the cellular network and a backhaul link between base stations.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for aligning and eliminating uplink opportunistic interference of a time division duplex cellular network comprises the following steps:
s1 the base station of each cell determines its own receiving signal space and broadcasts its base to all users in the network, the base U of the i-th base station' S receiving signal spaceiIs represented as follows:
Ui＝[u1,i,u2,i,...,uS,i],i＝1,...,L；
each cell corresponds to a base station, L is the number of cells in the network, namely the number of base stations, and S is the number of users which can be served by each base station at most simultaneously;
s2, each base station sends pilot signal, each user estimates the corresponding base station to own downlink channel matrix according to the pilot signal, and obtains the corresponding uplink channel matrix by using the downlink channel matrix;
s3, each user calculates the sending pre-coding matrix and the dispatching criterion value according to the received base of the signal receiving space of each base station and the uplink channel matrix obtained by estimation, and feeds the dispatching criterion value back to the base station serving the user;
s4, each base station carries out user scheduling according to the received scheduling criterion value fed back by the user, and then calculates and determines the sending power of the selected user;
s5, each base station sends the sending power value determined in the step S4 to the corresponding selected user;
s6 the selected user transmits data using the transmission precoding matrix obtained in step S3 and the transmission power value received in step S5;
s7 each base station decodes data information of its served users using a successive interference cancellation method.
In step S2, the conjugate transpose of the downlink channel matrix is the uplink channel matrix.
In step S3, the transmission precoding matrix and the scheduling criterion value of the user are calculated as follows:
v[k,i]＝eigmin(Q[k,i])；
η[k,i]＝λmin(Q[k,i])；
wherein v is[k,i]Transmitting a precoding matrix, eig, for the kth user in the ith cellmin(Q[k,i]) Is a matrix Q[k,i]η corresponding to the minimum eigenvalue of[k,i]Scheduling criterion value, λ, for the kth user in the ith cellmin(Q[k,i]) Is a matrix Q[k,i]The minimum eigenvalue of (d); matrix Q[k,i]And obtaining the uplink channel matrix of the kth user in the ith cell and the basis of the received signal space of the corresponding base station.
Further, it should be noted that, for the kth user in the 1 st cell, the matrix Q is[k,1]The calculation is as follows:
wherein,an uplink channel matrix from a kth user to a 1 st base station in a 1 st cell is defined, wherein K is 1. (.)HRepresents a conjugate transpose operation;
and for the kth user in the jth (j 2...., L) cell, Q[k,j]The calculation is as follows:
wherein,is an uplink channel matrix, P, from the kth user to the l base station in the jth cellmaxK is the maximum transmit power per user, 1.
It should be noted that step S4 specifically includes:
4.1) let i ═ L;
4.2) the ith base station performs the user selection process: firstly, the ith base station selects T (T ≧ S) users with the minimum scheduling criterion value as candidate users, and records the set formed by the T candidate users as a setThe T candidate users send the transmission precoding matrix calculated in step S3 to the base station serving themselves;
4.3) orderWhereinMeans the ith base stationThe set of selected users;
4.4) for each user of the ith base stationCalculating the vector g[k,i]:
Wherein v is[k,i]For k transmit precoding matrices for the users,an uplink channel matrix from a user k to an ith base station for providing service, wherein pi (j), j is 1, and r-1 represents a jth user which is selected by the base station; when r is equal to 1, the compound is,
4.5) orderComputing usersTransmit power P[k,i]：
Wherein σ2Is the noise power value, delta is the minimum signal to interference plus noise ratio required by the user, indicating the inter-cell interference experienced by the kth user in cell i,represents a set of users selected by the ith base station;
4.6) if the ith base station selects user k, the ith base station has selected user pi (j), j is 1, r-1 needs to update its transmission power to meet the requirement of minimum signal-to-interference-and-noise ratio, and the latest transmission power of the ith base station selected user pi (j) is recorded as
Wherein,the inter-cell interference to the selected users pi (j) in the cell i is represented by the following calculation:
whileThe method for representing the intra-cell interference suffered by the selected users pi (j) in the cell i comprises the following steps:
4.7) maximum transmission power per user is PmaxIf user k can be selected, the following conditions must be satisfied:
set of notes satisfying the above conditionsThe set of candidate users in (1) isNamely, it is
The method for selecting the r-th service user of the ith base station is as follows:
4.8) update setAndthe following were used:
representing a slave setRemoving the elements pi (r), PiThe transmission power of the current selected user for the ith base station;
4.9) ifAnd r < S, let r ═ r +1, and return to step 4.4), otherwise, go to step 4.9);
4.10) if i > 1, the ith base station will transmit P over the backhaul linki，Sending to the 1 st, 1., i-1 st base station, and making i equal to i-1, returning to step 4.2), otherwise, entering step S5.
It should be noted that step S7 specifically includes:
7.1) making i ═ 1;
7.2) when i is 1, the ith base station decodes the information of the user served by itself using the following receiving filter:
wherein U isiGiven already in step S1,given already in step S4,representation collectionThe number of middle elements;
when i is more than 1, the ith base station decodes the user data x according to the received data from the 1 st,[k',l]，k'∈Kl1, i-1, reconstructing an interference signal If from the 1 st, 1iAnd subtracting the interfering signal from the self-received signal:
the information of the users served by itself is then decoded using the following receive filters:
wherein U isiGiven already in step S1,given already in step S4,representation collectionThe number of middle elements;
the ith base station sends the decoded information to base stations which are not decoded yet through a backhaul link between the base stations, namely the (i + 1) · L base stations;
7.3) if i < L, return to step 7.2), otherwise, step S7 ends.
The invention has the beneficial effects that:
1. the invention selects the service user of each base station by an opportunistic scheduling method without using an iterative method to obtain the sending pre-coding matrix of the user and the receiving filter of the base station, thereby having lower implementation complexity;
2. the invention eliminates the interference among partial cells by utilizing the interference elimination technology, relaxes the limitation of the feasibility condition of the traditional interference alignment, enables more users to transmit data simultaneously and increases the network capacity;
3. the invention fully utilizes the multi-user diversity gain in the cellular network and the return link resource of the base station, thereby increasing the throughput of the network.
Drawings
FIG. 1 is a general flow chart of an implementation of the present invention;
fig. 2 is a sub-flowchart of user scheduling in the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings, and it should be noted that the present embodiment is based on the technical solution, and the detailed implementation and the specific operation process are given, but the protection scope of the present invention is not limited to the present embodiment.
As shown in fig. 1, a method for aligning and eliminating uplink opportunistic interference in a time division duplex cellular network includes the following steps:
s1 the base station of each cell determines its own receiving signal space and broadcasts its base to all users in the network, the base U of the i-th base station' S receiving signal spaceiIs represented as follows:
Ui＝[u1,i,u2,i,...,uS,i],i＝1,...,L；
each cell corresponds to a base station, L is the number of cells in the network, namely the number of base stations, and S is the number of users which can be served by each base station at most simultaneously;
s2, each base station sends pilot signal, each user estimates the corresponding base station to own downlink channel matrix according to the pilot signal, and obtains the corresponding uplink channel matrix by using the downlink channel matrix; the conjugate transpose of the downlink channel matrix is the uplink channel matrix.
S3, each user calculates the pre-coding matrix and the dispatching criterion value according to the received base of the signal receiving space of each base station and the uplink channel matrix obtained by estimation, and feeds the dispatching criterion value back to the base station serving the user; the calculation process of the pre-coding matrix and the scheduling criterion value is as follows:
step 3.1, computing matrix Q of kth user in ith cell[k,i]Where i 1., L, K1., K, L is the number of cells in the network, and K is the total number of users in each cell.
For the kth user in cell 1, Q[k,1]The calculation method of (2) is as follows:
wherein,for the uplink channel matrix from the kth user in cell 1 to the 1 st base station, (-)HRepresenting a conjugate transpose operation.
For the kth user in the jth (j 2...., L) cell, Q[k,j]The calculation method is as follows:
wherein,is an uplink channel matrix, P, from the kth user to the l base station in the jth cellmaxK is the maximum transmit power per user, K1.,;
step 3.2, the matrix Q obtained by calculating the kth user pair in the ith cell[k,i]The characteristic value decomposition is carried out to obtain a sending pre-coding matrix and a scheduling criterion value of
v[k,i]＝eigmin(Q[k,i])；
η[k,i]＝λmin(Q[k,i])；
Wherein v is[k,i]Transmitting a precoding matrix, eig, for the kth user in the ith cellmin(Q[k,i]) Is a matrix Q[k,i]η corresponding to the minimum eigenvalue of[k,i]Scheduling criterion value, λ, for the kth user in the ith cellmin(Q[k,i]) Is a matrix Q[k,i]The minimum eigenvalue of (c).
S4, each base station carries out user scheduling according to the received scheduling criterion value fed back by the user and calculates and determines the sending power of the user; the user scheduling process is shown in fig. 2:
step 4.1, making i equal to L;
and 4.2, the ith base station executes user selection. Firstly, the ith base station selects T (T ≧ S) users with the minimum scheduling criterion value as candidate users, and records the set formed by the T candidate users as a setThe T candidate users send the transmission precoding matrix calculated in step S3 to the base station serving themselves;
step 4.3, orderWhereinMeans the ith base stationA set of users selected in (1);
step 4.4, for each userCalculating the vector g[k,i]
Wherein v is[k,i]For the transmission precoding matrix of the kth user in the ith cell obtained in step 3.2,the uplink channel matrix from the kth user in the ith cell to the ith base station providing service for the kth user is represented by pi (j), wherein j is 1, and r-1 represents the jth user selected by the base station; when r is equal to 1, the compound is,
step 4.5, order
Step 4.6, calculate userTransmit power P[k,i]
Wherein σ2Is the noise power value, delta is the minimum signal to interference plus noise ratio required by the user, indicating the inter-cell interference experienced by the kth user in cell i,represents a set of users selected by the ith base station;
step 4.7, if the ith base station selects user k, the ith base station has selected user pi (j), j equals 1. Note that the latest transmission power of the ith base station selected user pi (j) is
Wherein:indicates cell iThe calculation method of the inter-cell interference suffered by the selected user pi (j) is as follows:
whileThe method for representing the intra-cell interference suffered by the selected users pi (j) in the cell i comprises the following steps:
step 4.8, because the maximum transmission power of each user is PmaxIf user k can be selected, the following conditions must be satisfied:
set of notes satisfying the above conditionsThe set of users in (1) isNamely, it is
The method for selecting the r-th service user of the ith base station is as follows:
step 4.9, updateCollectionAndas follows
Representing a slave setRemoving the elements pi (r), PiIs the transmit power of the currently selected user.
Step 4.10, ifAnd r is less than S, let r be r +1, and return to step 4.4; otherwise, go to step 4.11.
Step 4.11, if i > 1, the ith base station sends P through the backhaul linki，Sending to the 1 st, 1., i-1 st base station, and making i equal to i-1, returning to step 4.2, otherwise, entering step S5.
S5 each base station transmitting the transmission power value determined in step S4 to the selected user;
s6 the selected user transmits data using the precoding matrix obtained in step S3 and the transmission power value received in step S5;
s7 each base station decodes data information of its served users using a successive interference cancellation method. The specific decoding process is as follows:
the specific decoding process is as follows:
step 7.1, changing i to 1;
and 7.2, when i is equal to 1, the ith base station decodes the information of the user served by the ith base station by using the following receiving filter:
wherein U isiGiven already in step S1,given already in step S4,representation collectionThe number of middle elements;
when i is more than 1, the ith base station decodes the user data according to the received user data from the 1 stReconstructing an interference signal If from a 1 st, 1.. i-1 th celli，
And subtracts the interference signal from the received signal and then decodes the information of the user served by itself using the following receiving filter
Wherein U isiGiven already in step S1,given already in step S4,representation collectionThe number of middle elements;
the ith base station sends the decoded information to base stations which are not decoded yet through a backhaul link between the base stations, namely the (i + 1) · L base stations;
and 7.3, if i is less than L, returning to the step 7.2, and otherwise, finishing the algorithm.
Various changes and modifications can be made by those skilled in the art based on the above technical solutions and concepts, and all such changes and modifications should be included in the protection scope of the present claims.
Claims (4)
1. A method for aligning and eliminating uplink opportunistic interference of a time division duplex cellular network is characterized by comprising the following steps:
s1 the base station of each cell determines its own receiving signal space and broadcasts its base to all users in the network, the base U of the i-th base station' S receiving signal spaceiIs represented as follows:
Ui＝[u1,i,u2,i,...,uS,i],i＝1,...,L；
each cell corresponds to a base station, L is the number of cells in the network, namely the number of base stations, and S is the number of users which can be served by each base station at most simultaneously;
s2, each base station sends pilot signal, each user estimates the corresponding base station to own downlink channel matrix according to the pilot signal, and obtains the corresponding uplink channel matrix by using the downlink channel matrix;
s3, each user calculates the sending pre-coding matrix and the dispatching criterion value according to the received base of the signal receiving space of each base station and the uplink channel matrix obtained by estimation, and feeds the dispatching criterion value back to the base station serving the user; the sending precoding matrix and scheduling criterion value of the user are calculated as follows:
v[k,i]＝eigmin(Q[k,i])；
η[k,i]＝λmin(Q[k,i])；
wherein v is[k,i]Transmitting a precoding matrix, eig, for the kth user in the ith cellmin(Q[k,i]) Is a matrix Q[k,i]η corresponding to the minimum eigenvalue of[k,i]Scheduling criterion value, λ, for the kth user in the ith cellmin(Q[k ,i]) Is a matrix Q[k,i]The minimum eigenvalue of (d); matrix Q[k,i]Obtaining the uplink channel matrix of the kth user in the ith cell and the basis of the received signal space of the corresponding base station;
for the kth user in cell 1, the matrix Q[k,1]The calculation is 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,an uplink channel matrix from a kth user to a 1 st base station in a 1 st cell is defined, wherein K is 1. (.)HRepresents a conjugate transpose operation;
and for the kth user in the jth (j 2...., L) cell, Q[k,j]The calculation is 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,is an uplink channel matrix, P, from the kth user to the l base station in the jth cellmaxK is the maximum transmit power per user, K1.,;
s4, each base station carries out user scheduling according to the received scheduling criterion value fed back by the user, and then calculates and determines the sending power value of the selected user;
s5, each base station sends the sending power value determined in the step S4 to the corresponding selected user;
s6 the selected user transmits data using the transmission precoding matrix obtained in step S3 and the transmission power value received in step S5;
s7 each base station decodes data information of its served users using a successive interference cancellation method.
2. The method as claimed in claim 1, wherein in step S2, the conjugate transpose of the downlink channel matrix is the uplink channel matrix.
3. The method according to claim 1, wherein the step S4 specifically includes:
4.1) let i ═ L;
4.2) the ith base station performs the user selection process: firstly, the ith base station selects T (T ≧ S) users with the minimum scheduling criterion value as candidate users, and records the set formed by the T candidate users as a setThe T candidate users send the transmission precoding matrix calculated in step S3 to the base station serving themselves;
4.3) orderWhereinMeans the ith base stationA set of users selected in (1);
4.4) for each user of the ith base stationCalculating the 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 is[k,i]The transmit precoding matrix for user k to the ith base station serving it,an uplink channel matrix from a user k to an ith base station for providing service, wherein pi (j), j is 1, and r-1 represents a jth user which is selected by the base station i; when r is equal to 1, the compound is,
4.5) orderComputing usersTransmit 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 σ2Is the noise power value, delta is the minimum signal to interference plus noise ratio required by the user, indicating the intercell interference experienced by the kth user in cell i,represents a set of users selected by the ith base station;
4.6) if the ith base station selects user k, the ith base station has selected user pi (j), j is 1, r-1 needs to update its transmission power to meet the requirement of minimum signal-to-interference-and-noise ratio, and the latest transmission power of the ith base station selected user pi (j) is recorded as
<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,the inter-cell interference to the selected users pi (j) in the cell i is represented by the following calculation:
whileThe method for representing the intra-cell interference suffered by the selected users pi (j) in the cell i comprises the following steps:
<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) maximum transmission power per user is PmaxIf user k can be selected, the following conditions must be satisfied:
<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>
set of notes satisfying the above conditionsThe set of candidate users in (1) isNamely, it is
The method for selecting the r-th service user of the ith base station is as follows:
4.8) update setAndthe following were used:
<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>
representing a slave setRemoving the elements pi (r), PiThe transmission power of the selected user for the current ith base station;
4.9) ifAnd r < S, let r be r +1, and return to step 4.4), otherwise, go to step 4.10);
4.10) if i > 1, the ith base station will transmit P over the backhaul linki，Sending to the 1 st, 1., i-1 st base station, and making i equal to i-1, returning to step 4.2), otherwise, entering step S5.
4. The method as claimed in claim 3, wherein the step S7 specifically includes:
7.1) making i ═ 1;
7.2) when i is 1, the ith base station decodes the information of the user served by itself using the following receiving filter:
wherein U isiGiven in step S1, f[π(x),i],x＝1,...,Given already in step S4,representation collectionThe number of middle elements;
when i is more than 1, the ith base station decodes the user data x according to the received data from the 1 st,[k′,l],i-1, reconstruct an interference signal If from the 1 st, 1., i-1 th celliAnd subtracting the interfering signal from the self-received signal:
the information of the users served by itself is then decoded using the following receive filters:
wherein U isiGiven in step S1, f[π(x),i],x＝1,...,Given already in step S4,representation collectionThe number of middle elements;
the ith base station sends the decoded information to base stations which are not decoded yet through a backhaul link between the base stations, namely the (i + 1) · L base stations;
7.3) if i < L, return to step 7.2), otherwise, step S7 ends.
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 |
|---|---|---|
| CN102983935B (en) | Precoding, pre-coding/pre-decoding method and emitter and mobile terminal based on interference alignment | |
| CN107613567B (en) | Wireless sensor network resource allocation method based on wireless energy transmission | |
| CN110190881B (en) | Downlink MIMO-NOMA power distribution method with optimal weight rate | |
| CN102055563B (en) | Adaptive joint linear precoding method applicable to multi-base station coordination | |
| CN105337651A (en) | User selection method of non-orthogonal multiple access system downlink under limited feedback | |
| CN102882570B (en) | Optimum transceiving combined processing method for communication among equipment in mobile communication network | |
| CN106301521B (en) | A kind of transmission method and device of the energy in wireless energy supply communication network and information | |
| CN104702395B (en) | Fair and high efficiency federated resource distribution method in a kind of cooperative cognitive network | |
| CN105450274B (en) | Based on the extensive multiple antennas relay system number of users optimization method that efficiency is optimal | |
| CN103986509A (en) | Cooperative multi-point transmission method based on interference alignment and interference neutralization | |
| CN105704721A (en) | D2D-P multiplexing cellular network communication method capable of increasing frequency spectrum utilization rate | |
| CN104219703B (en) | A kind of two benches interference alignment schemes in isomery cellular network downlink communication | |
| CN104202790B (en) | A kind of MIMO-CCRN bottleneck effect removing methods based on power adaptive | |
| CN102325375A (en) | Resource allocation method and device | |
| CN104581959B (en) | A kind of time division duplex cellular network uplink opportunistic interference alignment and removing method | |
| CN102291727A (en) | Distributed cooperative beam forming and designing method | |
| CN103078703A (en) | Transmission method of CoMP (Coordinated Multi-point) system applied to down link | |
| CN101841849B (en) | Method and base station for processing uplink synergistic data in orthogonal frequency division multiplexing system | |
| CN103607260B (en) | System total interference leakage minimum pre-coding matrix group selection algorithm based on MIMO | |
| CN103152807A (en) | Method for distributing power between multiple base stations and multiple antennae of TDD (Time Division Duplex) cooperative wireless network | |
| CN112261662A (en) | Transmission method for improving energy efficiency of NOMA cooperative communication system | |
| CN101989869A (en) | Joint pre-coding and power control method for multi-antenna cellular network | |
| CN103973345A (en) | Base station antenna dispatching method based on user distance | |
| CN103346867B (en) | Multiple cell multi-user's co-channel interference suppression method based on triangle decomposition and SLNR algorithm | |
| CN102752071A (en) | Downlink precoding method and central processing node for multipoint cooperative system |
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 |