CN102694628B - Interference suppression method for multi-user MIMO collaborative relay system - Google Patents

Interference suppression method for multi-user MIMO collaborative relay system Download PDF

Info

Publication number
CN102694628B
CN102694628B CN201210139074.4A CN201210139074A CN102694628B CN 102694628 B CN102694628 B CN 102694628B CN 201210139074 A CN201210139074 A CN 201210139074A CN 102694628 B CN102694628 B CN 102694628B
Authority
CN
China
Prior art keywords
user
mrow
msup
relay
signal
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.)
Expired - Fee Related
Application number
CN201210139074.4A
Other languages
Chinese (zh)
Other versions
CN102694628A (en
Inventor
王勇
艾云
李晖
杨柳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201210139074.4A priority Critical patent/CN102694628B/en
Publication of CN102694628A publication Critical patent/CN102694628A/en
Application granted granted Critical
Publication of CN102694628B publication Critical patent/CN102694628B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Radio Transmission System (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an interference suppression method for a multi-user MIMO collaborative relay system, mainly solving the problem that each user has multiple antennas in a common-channel multi-user relay system. The interference suppression method comprises the steps that: a user determines a beamforming vector by adopting a signal space alignment method, and sends out a signal after weighting the signal with the beamforming vector in a multiple-access time slot; a relay constructs a precoding matrix based on an orthogonal projection principle, and amplifies and sends the received signal after precoding; the user receives the signal and suppresses interference signals between user pairs by adopting a decoding vector, and conducts a maximum likelihood detection to obtain the needed signal. According to the invention, a network transmission rate and a resource utilization rate are improved, diversity gains of multiple antennas are achieved, channel fading resisting capability of the system is enhanced, and a bit error ratio is decreased. Further, the interference suppression method of the invention can be applied in a transmission mode under centralized management and control of a wireless ad hoc network and base station, wherein data can be exchanged directly through user-relay-user mode.

Description

Interference suppression method based on multi-user MIMO cooperative relay system
Technical Field
The invention belongs to the technical field of communication, relates to a signal space alignment method, in particular to an interference suppression method for a multi-user MIMO cooperative relay system, and can be used for wireless communication.
Background
In real life, real-time reliable two-way communication is often needed, such as real-time file interaction between users, video calls, dedicated monitoring systems, and the like. Two-way communication requires that both ends of communication can send and receive signals simultaneously, and because geographical position interval or direct transmission channel quality are bad, the user who expects to realize two-way communication can not realize reliable communication by self-networking, and can utilize relay assistance to finish two-way communication at this moment. Relaying generally falls into two modes, namely a decode-and-forward type DF and an amplify-and-forward type AF. The decoding and forwarding type relay is to decode the received signal firstly, and if the received signal is correct, the received signal is transmitted after being recoded; the amplify-and-forward relay is to amplify and forward the received signal directly. Compared with the decoding forwarding type relay, the amplifying forwarding type relay has lower signal processing time delay and complexity and is more suitable for real-time two-way communication. The cooperative relay technology performs joint processing on the received multipath signals to complete simultaneous communication of a plurality of nodes, so that the coverage range can be expanded, and the spectrum efficiency of wireless transmission is improved. In addition, the MIMO technology is combined, so that the system error rate can be effectively reduced, the system capacity area is enlarged, and the system performance is improved.
Due to the broadcasting characteristic of wireless communication, co-channel interference is inevitably generated by signals simultaneously transmitted by multiple users in the same frequency band, and the difficulty and complexity of an anti-interference algorithm are increased due to the introduction of MIMO. The latest result of multi-user co-channel interference is a signal space alignment algorithm, and the core idea is to design a beam forming vector, align an interference signal which is not expected by a receiving node to the same signal subspace, and construct an expected signal to a corresponding orthogonal subspace through an interference suppression matrix, so as to realize interference suppression.
The patent of Beijing post and telecommunications university "a multi-stream bidirectional relay transmission method based on amplify-and-forward" (patent application No. 201110200566.5, publication No. CN 102355291A). The patent application mainly provides a multi-input multi-output bidirectional relay transmission method based on amplification forwarding, and the method comprises the following steps: the relay selects the antenna through the channel matrixes of the two users; and then carrying out bidirectional relay transmission according to the selected antenna subset to finish signal interaction. The patent application has the following disadvantages: under the same time-frequency resource, the relay can only realize the information exchange between two users, and can not realize the two-way information transmission of a plurality of user pairs, thereby reducing the network transmission rate and the system capacity.
The patent of Beijing post and telecommunications university "a network coding transmission method" (patent application No. 201010533192.4, publication No. CN 101997647A). The patent application mainly provides a cooperative relay transmission method of network coding, which comprises the following steps: and respectively carrying out network coding on the signals by the relay according to the obtained multiple user pairs, and then overlapping the network coded signals of different user pairs and then broadcasting and transmitting the signals. The patent application has the following disadvantages: the method is only suitable for the scene that a user configures a single antenna, but not suitable for the scene that the user configures a plurality of antennas, so that the potential diversity gain can not be obtained, and the channel fading resistance of the system is weak.
Disclosure of Invention
The invention aims to provide an interference suppression method based on a multi-user MIMO cooperative relay system aiming at the defects of the prior art so as to improve the network transmission rate and the resource utilization rate, obtain the diversity gain of multiple antennas, enhance the channel fading resistance of the system and reduce the error rate.
The basic idea for realizing the purpose of the invention is that in the first time slot, namely the multiple access time slot, a user adopts a signal space alignment method to determine a beam forming vector, and the beam forming vector is used for weighting and then transmitting a signal to be transmitted; the relay acquires a pre-coding matrix according to the equivalent channel matrix, performs pre-coding processing on the received multi-user signal, and sends out the signal in a second time slot, namely a broadcast sending time slot after amplification; the user receives the signal and adopts the decoding vector to restrain the interference signal between the user pairs, and then carries out maximum likelihood detection to obtain the required signal. The method comprises the following implementation steps:
(1) determining pairing combination needing communication by each user, determining respective beam forming vectors by adopting a signal space alignment method according to the pairing combination, and obtaining equivalent channel vectors from the users to the relay;
(2) each user modulates the signal to be transmitted to obtain a modulation signal, and the modulation signal is weighted by adopting the determined beam forming vector in the multiple access time slot and then transmitted;
(3) the relay uses the equivalent channel vector from each user to the relay to construct a precoding matrix P:
3a) equivalent channel vectors of K-1 user pairs except the ith user pair are arranged side by side to form an N x (K-1) dimensional matrix Ui=(u[r,1],...,u[r,i-1],u[r,i+1],...,u[r,K]) Wherein N is the number of relay antennas, and K is the number of user pairs;
3b) computing an orthogonal projection matrix corresponding to the ith user pairWherein I is an identity matrix, and I is an identity matrix,is UiThe conjugate transpose matrix of (a);
3c) constructing a relay precoding matrix according to the projection matrix:wherein,as a power normalization factor, | | · | | | represents a 2 norm of the vector;
(4) the relay receives the signals sent by each user, and the signals received are amplified after being subjected to left multiplication by the precoding matrix P and then are sent out in a broadcast sending time slot;
(5) the user carries out interference suppression on the received relay sending signal and demodulates after detection:
5a) the user receives the signal transmitted by the relay, and uses v[i]HThe received signal is processed as a decoding vector according to the following formulaLeft multiplication:
y ^ [ i ] = v [ i ] H y [ i ]
suppressing interference signals between user groups and decoding a desired signal, wherein v[i]HBeamforming vector v for user i[i]Conjugate transpose of (y)[i]For the signal received by the user i,the signal is a received signal after interference suppression;
5b) detecting the received signals after the interference suppression by adopting a maximum likelihood method;
5c) and demodulating the detected signal to obtain a receiving signal required by the user.
In the interference suppression method based on the multi-user MIMO cooperative relay system, the signal space alignment method adopted in step (1) determines respective beamforming vectors, and the following signal space alignment conditions are used for determining:
<math> <mrow> <mi>span</mi> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>=</mo> <mi>span</mi> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mo>&ForAll;</mo> <mi>i</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>K</mi> <mo>)</mo> </mrow> </mrow> </math>
where span (-) denotes the space spanned by the matrix column vector, r denotes the relay, i and i + K denote the two users of the ith user pair that need to exchange information, v[i]And v[i+K]Beamforming vectors, H, representing user i and user i + K, respectively[r,i]And H[r,i+K]And uplink channel transmission matrixes from the user i and the user i + K to the relay are respectively obtained by the relay and then fed back to each user.
In the above interference suppression method based on the multi-user MIMO cooperative relay system, the user-to-relay equivalent channel vector in step (1) is obtained by the following formula:
u[r,i]=H[r,i]v[i]=H[r,i+K]v[i+K]
wherein u is[r,i]And representing equivalent channel vectors from two users in the ith user pair to the relay respectively.
In the above interference suppression method based on the multi-user MIMO cooperative relay system, the signal space alignment method in step (1) is implemented under the condition that the number of relay antennas is less than the total number of antennas of two users performing signal space alignment in each user pair.
In the interference suppression method based on the multi-user MIMO cooperative relay system, the modulation method in step (2) adopts a binary phase modulation method.
In the interference suppression method based on the multi-user MIMO cooperative relay system, the precoding matrix P in step (3) is implemented on the condition that the number of relay antennas is greater than or equal to the number of user pairs.
In the above interference suppression method based on the multi-user MIMO cooperative relay system, the maximum likelihood method in step 5b) is performed according to the following formula:
<math> <mrow> <msup> <mover> <mi>s</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> </munder> <msup> <mrow> <mo>|</mo> <msup> <mover> <mi>y</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>-</mo> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <mi>&beta;</mi> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> </math>
wherein,detecting the resulting signal, s, from user i + K for user i[i]And s[i+K]The transmit signals for user i and user i + K respectively,for the received signal, P, of user i after interference suppressioniOrthogonal projection matrix u for the corresponding ith user pair as described in step 3b)[r,i]Equivalent channel vector, α, for user i to relayiA power normalization factor corresponding to the ith user pair, beta is a relay amplification factor, and argmin represents a variable value at which the objective function takes a minimum value, (. DEG)HRepresents a conjugate transpose operator, | · non-conducting phosphor2Representing the square of the complex modulus.
In the above interference suppression method based on the multi-user MIMO cooperative relay system, the demodulation in step 5c) adopts a demodulation mode corresponding to modulation.
Compared with the prior art, the invention has the following advantages:
first, because the invention adopts the signal space alignment method and designs the precoding matrix by using the orthogonal projection principle, the interference signal between the user pairs of the common channel is inhibited, a plurality of user pairs configured with a plurality of antennas can simultaneously carry out data transmission, and the utilization rate of system resources and the network transmission rate are improved.
Secondly, because the user adopts the multi-antenna technology, the invention fully utilizes the multi-antenna to obtain higher diversity gain, improves the reliability of the wireless communication system and reduces the error rate.
Thirdly, the invention can be applied to a transmission mode of directly exchanging data by a user-relay-user under the centralized management control of the wireless self-organizing network and the base station.
Drawings
FIG. 1 is a schematic diagram of a system model suitable for use with the present invention;
FIG. 2 is a flow chart of the present invention;
fig. 3 is a bit error rate simulation diagram of the present invention.
Detailed Description
The present invention is described in further detail below with reference to the attached drawings.
Referring to fig. 1, the system model to which the present invention is applied includes K user pairs and a relay, where each user pair includes two users that need to communicate, i being user i and user i + K, where i is 1,2, …, and K. The number of antennas configured by each user is M, and the number of antennas configured by the relay is N. The whole communication process is divided into two time slots, the first time slot is a multiple access time slot, and the second time slot isThe slots are broadcast transmission slots. In a multiple access time slot, each user adopts a signal space alignment method to send signals to the relay, wherein the transmission matrix of an uplink channel from the user i to the relay r is H[r,i](ii) a In a broadcast sending time slot, a relay performs precoding processing on a received signal by adopting an orthogonal projection principle and then performs amplification broadcast, wherein a downlink channel transmission matrix from the relay r to a user i is H[i,r]. Both the user and the relay communicate in time division duplex mode, assuming that the transmission channel satisfies the reciprocity, H[i,r]Is H[r,i]The conjugate transpose matrix of (2). The following user and relay antenna constraint conditions are obtained by a signal space alignment method and an orthogonal projection principle:
<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>2</mn> <mi>M</mi> <mo>-</mo> <mi>N</mi> <mo>></mo> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mi>N</mi> <mo>&GreaterEqual;</mo> <mi>K</mi> </mtd> </mtr> </mtable> </mfenced> </math>
according to the above constraints, the system can adopt various antenna combinations, such as: a first combination K ═ 2, M ═ 3, and N ═ 2; a second combination K ═ 2, M ═ 2, and N ═ 3; the third combination K is 3, M is 2, N is 3, etc., and in this embodiment, the number of users K is 2, the number of users' antennas M is 2, and the number of relay antennas N is 3.
Referring to fig. 2, the implementation steps of the invention are as follows:
step 1, the user determines a beamforming vector.
1a) And determining pairing combination needing communication by each user, aligning two paths of signals belonging to the same user pair in signals to be transmitted to the same signal subspace by adopting a signal space alignment method according to the pairing combination, and determining respective beam forming vectors.
The specific implementation mode of the signal space alignment in the embodiment of the invention is carried out according to the following formula:
<math> <mrow> <mi>span</mi> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>=</mo> <mi>span</mi> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mo>&ForAll;</mo> <mi>i</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>K</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
where span (-) denotes the space spanned by the matrix column vector, r denotes the relay, i and i + K denote the two users of the ith user pair who need to exchange signals, H[r,i]And H[r,i+K]Uplink channel transmission matrixes from the user i and the user i + K to the relay respectively, wherein the channel transmission matrixes are obtained through the relay and then fed back to each user v[i]And v[i+K]The beamforming vectors representing user i and user i + K, respectively, are stored in the document A novel signaling on the MIMO Y channel signal path alignThe condition that the antennas must satisfy is given in the statement for network coding, that is, the number of relay antennas must be less than the total number of antennas of two users performing signal space alignment in each user pair: 2M-N > 0;
1b) after the signal spaces are aligned, the equivalent channel vectors from two users in the ith user pair to the relay respectively are as follows: u. of[r,i]=H[r,i]v[i]=H[r,i+K]v[i+K]
Step 2, the user sends signals
Each user sends a signal W to be transmitted[i]Modulating to obtain a modulated signal s[i]The modulation method adopts binary phase modulation or quaternary phase modulation or quadrature amplitude modulation, and the embodiment of the invention adopts binary phase modulation.
In the multiple access time slot, each user uses the beam forming vector v of the user in step 1 a) to the modulated signal to be transmitted[i]And weighting is carried out, and all the users send out the weighted signals to be sent at the same time.
Step 3, the relay constructs a precoding matrix
The relay generates orthogonal projection matrixes corresponding to different user pairs according to the equivalent channel vector, all the orthogonal projection matrixes are added after power normalization to obtain a relay precoding matrix, and the precoding construction steps are as follows, taking the ith user pair as an example:
3a) equivalent channel vector u using K-1 user pairs except the ith user pair[r,1],...,u[r,i-1],u[r,i+1],...,u[r,K]Open into space L, and this makes K-1 equivalent channel vectors form N (K-1) dimensional matrix U side by sidei=(u[r,1],...,u[r,i-1],u[r,i+1],...,u[r,K]) In order to make the space L orthogonal to the space LExist, then LThe dimension of the relay antenna is required to be more than or equal to 1, namely the number of the relay antennas meets the condition that N is more than or equal to K;
3b) from matrix UiGenerating an orthogonal projection matrix corresponding to the ith user pair asWherein I is a unit matrix (.)HRepresenting a conjugate transpose operator;
from the properties of the orthogonal projection matrix, Pi=Pi HAnd for the equivalent channel vector u of K-1 user pairs except the ith user pair[r,1],…,u[r,i-1],u[r,i+1],…,u[r,K]All have Piu[r,j]=0,u[r,j]K, j ≠ i, which represents the equivalent channel vector for the jth user pair, j =1[r,i]Having P ofiu[r,i]≠0;
3c) And (3) normalizing the power of the orthogonal projection matrixes corresponding to all the K users and then adding to obtain P, namely a relay precoding matrix:
<math> <mrow> <mi>P</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <msub> <mi>P</mi> <mi>i</mi> </msub> </mrow> </math>
wherein,is the power normalization factor corresponding to the ith user pair, where | · | | | represents the 2-norm of the vector.
And 4, relaying precoding and amplifying forwarding.
4a) Receiving signals sent by each user through a relay:
<math> <mrow> <msup> <mi>y</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>]</mo> </mrow> </msup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>]</mo> </mrow> </msup> </mrow> </math>
<math> <mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <mrow> <mo>(</mo> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>]</mo> </mrow> </msup> <mo>,</mo> </mrow> </math>
wherein H[r,i]And H[r,i+K]Are the channel transmission matrixes from two users in the ith user pair to the relay respectively, v[i]And v[i+K]Respectively representing the beamforming vectors, s, of two users of the ith pair[i]And s[i+K]Respectively representing the transmission signals of two users in the ith pair of users, u[r,i]Representing the equivalent channel vectors, n, of two users in the ith pair to the relay, respectively[r]A relay complex Gaussian noise vector;
4b) the relay uses the precoding matrix P to carry out left multiplication on the received user transmission signal, and amplifies the precoded signal according to the relay power constraint to obtain a relay signal x to be transmitted[r]And transmits it in a broadcast transmission slot,
x[r]=βPy[r]
wherein,for relay amplification factor, PrIs composed ofSecondary power transmission, PnReceiving noise power for relays, | ·| non-wovenFRepresenting the F-norm of the matrix.
And 5, receiving the signal by the user, decoding and detecting.
Taking user i as an example, the received signal processing procedure is as follows:
5a) user i receives the signal transmitted by the relay, and the received signal is expressed as:
y[i]=H[i,r]x[r]+n[i,r]
=H[r,i]Hx[r]+n[i,r]
wherein x is[r]For relaying the transmitted signal, n[i,r]For complex white Gaussian noise vectors, H, received by the user[i,r]Channel transmission matrix for relaying to user i, H[r,i]Transmitting a matrix for a channel from a user i to the relay;
5b) user i employs its beamforming vector v[i]Conjugate transpose of v[i]HFor received signal y as decoding vector[i]Performing left-multiplication decoding to complete interference suppression, and obtaining a decoding signal as follows:
y ^ [ i ] = v [ i ] H y [ i ]
<math> <mrow> <mo>=</mo> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> <mi>H</mi> </mrow> </msup> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> <mi>H</mi> </mrow> </msup> <mi>&beta;</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <msub> <mi>&alpha;</mi> <mi>j</mi> </msub> <msub> <mi>P</mi> <mi>j</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> </mrow> </math>
<math> <mrow> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>H</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <msup> <mi>v</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <mi>&beta;</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <msub> <mi>&alpha;</mi> <mi>j</mi> </msub> <msub> <mi>P</mi> <mi>j</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>,</mo> </mrow> </math>
<math> <mrow> <mo>=</mo> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> <mi>H</mi> </mrow> </msup> <mi>&beta;</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <msub> <mi>&alpha;</mi> <mi>j</mi> </msub> <msup> <msub> <mi>P</mi> <mi>j</mi> </msub> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> </mrow> </math>
<math> <mrow> <mo>=</mo> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <mi>&beta;</mi> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <mi>&beta;</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <msub> <mi>&alpha;</mi> <mi>j</mi> </msub> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>j</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>j</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> </mrow> </math>
wherein, y[i]For the received signal of user i, s[i]And s[i+K]Transmitting signals, s, for user i and user i + K, respectively[j]And s[j+K]Transmitting signals, P, for user j and user j + K, respectivelyiOrthogonal projection matrix for the corresponding i-th user pair, pjFor orthogonal projection matrices, u, corresponding to the jth user pair[r,i]Equivalent channel vector, u, for user i to relay[r,j]Equivalent channel vector, v, for user j to relay[i]Beamforming vector, α, for user iiFor the power normalization factor, alpha, of the corresponding ith user pairjIs the power normalization factor corresponding to the j user pair, beta is the relay amplification factor, n[i]For the accumulated noise of decoded user i, (-)HRepresenting the conjugate transpose operator.
As can be seen from the above equation, the decoded signalConsisting of 3 parts, including a useful signal alpha for a user iiβ(Piu[r,i])Hu[r,i](s[i]+s[i+K]) Of interfering signalsAnd a noise signal n[i]
From the properties of the orthogonal projection matrix, Pju[r,i]0, j ≠ i, i.e. decoded signalInterference signal inIs 0, therefore, in the received signal of user i, the interference of the signals of other user pairs to the signal of the ith user pair can be eliminated, and the following steps are carried out:
<math> <mrow> <msup> <mover> <mi>y</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>=</mo> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <mi>&beta;</mi> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>n</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>;</mo> </mrow> </math>
5c) maximum likelihood method for decoding signal by user iDetecting to obtain the signal sent by the user i + K
<math> <mrow> <msup> <mover> <mi>s</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> </munder> <msup> <mrow> <mo>|</mo> <msup> <mover> <mi>y</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>-</mo> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <mi>&beta;</mi> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
Wherein,the resulting signal from user i + K is detected for user i,for the decoded signal of user i, s[i]And s[i+K]Transmitting signals, P, for user i and user i + K, respectivelyiOrthogonal projection matrix u for the corresponding ith user pair as described in step 3b)[r,i]Equivalent channel vector, α, for user i to relayiBeta is a relay amplification factor, argmin represents a variable value when the objective function takes a minimum value, | · survival |, et2Represents the square of the complex modulus;
5d) user i pair detectionTo the signalDemodulating to obtain the receiving signal required by the user
The demodulation adopts a demodulation mode corresponding to the modulation in the step 2. The demodulation in the embodiment of the invention adopts a binary phase demodulation mode.
The effect of the invention can be further illustrated by the simulation result:
1. simulation scenarios and conditions
Fig. 1 is a simulation scenario of the method of the present invention, where the number of user antennas M is 2, the number of relay antennas N is 3, the number of user logarithms K is 2, and each element in the channel transmission matrix is subject to a complex gaussian distribution with a mean value of 0 and a variance of 1.
2. Simulation content and simulation result
The simulation result of the bit error rate is shown in fig. 3, wherein a curve a is a bit error rate curve of the existing method, and a curve B is a bit error rate curve of the invention. Fig. 3 shows that the method effectively reduces the system error rate and improves the channel fading resistance and the noise resistance of the system.

Claims (8)

1. An interference suppression method based on a multi-user MIMO cooperative relay system comprises the following steps:
(1) determining pairing combination needing communication by each user, determining respective beam forming vectors by adopting a signal space alignment method according to the pairing combination, and obtaining equivalent channel vectors from the users to the relay;
(2) each user modulates the signal to be transmitted to obtain a modulation signal, and the modulation signal is weighted by adopting the determined beam forming vector in the multiple access time slot and then transmitted;
(3) the relay uses the equivalent channel vector from each user to the relay to construct a precoding matrix P:
3a) equivalent channel vectors of K-1 user pairs except the ith user pair are arranged side by side to form an N x (K-1) dimensional matrix Ui=(u[r,1],...,u[r,i-1],u[r,i+1],...,u[r,K]) Wherein N is the number of relay antennas, K is the number of user pairs, and r represents a relay;
3b) computing an orthogonal projection matrix corresponding to the ith user pairWherein I is an identity matrix, and I is an identity matrix,is UiThe conjugate transpose matrix of (a);
3c) constructing a relay precoding matrix according to the projection matrix:wherein,as a power normalization factor, | | · | | | represents a 2 norm of the vector;
(4) the relay receives the signals sent by each user, and the signals received are amplified after being subjected to left multiplication by the precoding matrix P and then are sent out in a broadcast sending time slot;
(5) the user carries out interference suppression on the received relay sending signal and demodulates after detection:
5a) the user receives the signal transmitted by the relay, and uses v[i]HThe received signal is pre-multiplied as a decoding vector according to the following formula:
y ^ [ i ] = v [ i ] H y [ i ]
suppressing interference signals between user groups and decoding a desired signal, wherein v[i]HBeamforming vector v for user i[i]Conjugate transpose of (y)[i]For the signal received by the user i,the signal is a received signal after interference suppression;
5b) detecting the received signals after the interference suppression by adopting a maximum likelihood method;
5c) and demodulating the detected signal to obtain a receiving signal required by the user.
2. The interference suppression method based on the multi-user MIMO cooperative relay system according to claim 1, wherein the signal space alignment method is adopted in step (1) to determine respective beamforming vectors, and the respective beamforming vectors are determined by using the following signal space alignment conditions:
span(H[r,i]v[i])=span(H[r,i+K]v[i+K])
where span (-) denotes the space spanned by the matrix column vector, r denotes the relay, i and i + K denote the two users of the ith user pair that need to exchange information, v[i]And v[i+K]Beamforming vectors, H, representing user i and user i + K, respectively[r,i]And H[r,i+K]And uplink channel transmission matrixes from the user i and the user i + K to the relay are respectively obtained by the relay and then fed back to each user.
3. The interference suppression method based on multi-user MIMO cooperative relay system according to claim 1, wherein the user-to-relay equivalent channel vector in step (1) is obtained by the following formula:
u[r,i]=H[r,i]v[i]=H[r,i+K]v[i+K]
wherein u is[r,i]And representing equivalent channel vectors from two users in the ith user pair to the relay respectively.
4. The interference suppression method based on multi-user MIMO cooperative relay system according to claim 1, wherein the signal space alignment method in the step (1) is implemented if the number of relay antennas is less than the total number of antennas of two users performing signal space alignment in each user pair.
5. The interference suppression method based on the multi-user MIMO cooperative relay system according to claim 1, wherein the modulation method in the step (2) adopts a binary phase modulation method.
6. The interference suppression method based on multi-user MIMO cooperative relay system according to claim 1, wherein the precoding matrix P in the step (3) is implemented on the condition that the number of relay antennas is greater than or equal to the number of user pairs.
7. The interference suppression method based on multi-user MIMO cooperative relay system according to claim 1, wherein the maximum likelihood method in the step 5b) is performed according to the following formula:
<math> <mrow> <msup> <mover> <mi>s</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> </munder> <msup> <mrow> <mo>|</mo> <msup> <mover> <mi>y</mi> <mo>^</mo> </mover> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>-</mo> <msub> <mi>&alpha;</mi> <mi>i</mi> </msub> <mi>&beta;</mi> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mi>H</mi> </msup> <msup> <mi>u</mi> <mrow> <mo>[</mo> <mi>r</mi> <mo>,</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mrow> <mo>(</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>]</mo> </mrow> </msup> <mo>+</mo> <msup> <mi>s</mi> <mrow> <mo>[</mo> <mi>i</mi> <mo>+</mo> <mi>K</mi> <mo>]</mo> </mrow> </msup> <mo>)</mo> </mrow> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> </math>
wherein,information from user i + K, s, detected for user i[i]And s[i+K]The transmission information for user i and user i + K respectively,for the interference suppressed received signal, p, of user iiOrthogonal projection matrix u for the corresponding ith user pair as described in step 3b)[r,i]Equivalent channel vector, α, for user i to relayiA power normalization factor corresponding to the ith user pair, beta is a relay amplification factor, and argmin represents a variable value at which the objective function takes a minimum value, (. DEG)HRepresents a conjugate transpose operator, | · non-conducting phosphor2Representing the square of the complex modulus.
8. The interference suppression method based on multi-user MIMO cooperative relay system according to claim 1, wherein the demodulation in step 5c) adopts a demodulation mode corresponding to modulation.
CN201210139074.4A 2012-05-07 2012-05-07 Interference suppression method for multi-user MIMO collaborative relay system Expired - Fee Related CN102694628B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210139074.4A CN102694628B (en) 2012-05-07 2012-05-07 Interference suppression method for multi-user MIMO collaborative relay system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210139074.4A CN102694628B (en) 2012-05-07 2012-05-07 Interference suppression method for multi-user MIMO collaborative relay system

Publications (2)

Publication Number Publication Date
CN102694628A CN102694628A (en) 2012-09-26
CN102694628B true CN102694628B (en) 2014-09-17

Family

ID=46859922

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210139074.4A Expired - Fee Related CN102694628B (en) 2012-05-07 2012-05-07 Interference suppression method for multi-user MIMO collaborative relay system

Country Status (1)

Country Link
CN (1) CN102694628B (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103248461B (en) * 2013-05-03 2015-10-21 华中科技大学 Based on the multiple cell interference alignment iterative algorithm of beam forming
US9634785B2 (en) * 2014-07-31 2017-04-25 Samsung Electronics Co., Ltd Interference cancellation method of user equipment in cellular communication system
CN104158777B (en) * 2014-08-28 2017-09-08 中国民航大学 United orthogonal projects the rangefinder pulse interference suppression method with circulation beam forming
CN104363036B (en) * 2014-11-26 2018-11-16 北京邮电大学 A kind of signal alignment method for multi-user's bidirectional relay system
CN106301457B (en) * 2016-10-08 2019-01-15 西安电子科技大学 Self-interference removing method in bi-directional full-duplex MIMO relay communications system
CN106452547B (en) * 2016-10-21 2019-12-10 浙江万里学院 differential beam forming method for multi-antenna relay communication system
CN106712824A (en) * 2016-12-29 2017-05-24 陕西尚品信息科技有限公司 Interference processing method based on MIMO self-organizing network
CN113225117A (en) * 2021-04-27 2021-08-06 电子科技大学 Multi-user Massive MIMO system signal transmitting and receiving method
CN115441907B (en) * 2021-06-02 2023-06-20 大唐移动通信设备有限公司 Method and network equipment for beamforming transmission of MU-MIMO system
CN116112323B (en) * 2021-11-10 2024-06-07 大唐移动通信设备有限公司 Interference suppression method, device, equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101917218A (en) * 2010-08-06 2010-12-15 上海电机学院 MIMO multi-user system downlink transmission method and system for reducing feedback information
CN102104451A (en) * 2009-12-17 2011-06-22 上海电机学院 Multi-user receiving and transmitting combined precoding method and device in multi-input multi-output system
CN102158312A (en) * 2011-03-18 2011-08-17 西安电子科技大学 Signal-space-alignment-based common-channel multi-user interference suppression method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101572291B1 (en) * 2008-01-02 2015-12-02 인터디지탈 테크날러지 코포레이션 Method and apparatus for cooperative wireless communications

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102104451A (en) * 2009-12-17 2011-06-22 上海电机学院 Multi-user receiving and transmitting combined precoding method and device in multi-input multi-output system
CN101917218A (en) * 2010-08-06 2010-12-15 上海电机学院 MIMO multi-user system downlink transmission method and system for reducing feedback information
CN102158312A (en) * 2011-03-18 2011-08-17 西安电子科技大学 Signal-space-alignment-based common-channel multi-user interference suppression method

Also Published As

Publication number Publication date
CN102694628A (en) 2012-09-26

Similar Documents

Publication Publication Date Title
CN102694628B (en) Interference suppression method for multi-user MIMO collaborative relay system
US8937899B2 (en) Amplify-and-forward relaying in communication systems
US8861637B2 (en) Pre-coding method, pre-decoding method, transmitter and mobile terminal based on interference alignment
JP5264990B2 (en) Data transmission method and system
Roemer et al. Algebraic norm-maximizing (ANOMAX) transmit strategy for two-way relaying with MIMO amplify and forward relays
CN102355291B (en) Multithread bidirectional relay transmission method based on amplification forwarding
CN102882570B (en) Optimum transceiving combined processing method for communication among equipment in mobile communication network
CN102710395B (en) Cooperative transmission method based on united beam forming
CN102340340A (en) Method and system for realizing antenna selection in MIMO relay system
CN102769486B (en) Method for processing relay end signals in bidirectional multi-hop relay system
US8976888B2 (en) Method for uplink multi-user cooperation communication
CN102394682B (en) Multi-user multi-input and multi-output cooperative relay system information processing method
CN108631825B (en) Physical layer safety transmission method for enhancing bidirectional AF relay cooperation wireless communication system
Song et al. Diversity analysis of coded beamforming in MIMO-OFDM amplify-and-forward relaying systems
CN108092928A (en) Polymerization interference is oriented to interference management method, hybrid cellular network, WLAN
Zhang et al. Cooperative spatial multiplexing in multi-hop wireless networks
CN104202277A (en) Design method for secondary user network linear transceiver with cognitive relay network
Chai et al. On two-way communications for cooperative multiple source pairs through a multi-antenna relay
CN101521531B (en) Method of enhancing down-link performance of TD-LTE by antenna selection
Qian et al. Energy-efficient antenna selection in green MIMO relaying communication systems
Degenhardt et al. A network coding approach to non-regenerative multi-antenna multi-group multi-way relaying
KR101072453B1 (en) Cooperative multi hop relay apparatus and method thereof
KR101205996B1 (en) Method for transmitting/receiving video signal in two-way relaying system
Duangsri et al. Performance enhancement for co-channel interference cancellation with smart antenna and power adaptive in cooperative communication
WO2016074193A1 (en) Device-to-device communication apparatus, system and method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140917

Termination date: 20200507