CN104202277B - A kind of design method for the linear transceiver of secondary user network for recognizing junction network - Google Patents

A kind of design method for the linear transceiver of secondary user network for recognizing junction network Download PDF

Info

Publication number
CN104202277B
CN104202277B CN201410415140.5A CN201410415140A CN104202277B CN 104202277 B CN104202277 B CN 104202277B CN 201410415140 A CN201410415140 A CN 201410415140A CN 104202277 B CN104202277 B CN 104202277B
Authority
CN
China
Prior art keywords
msub
mrow
user
mtr
mtd
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
CN201410415140.5A
Other languages
Chinese (zh)
Other versions
CN104202277A (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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201410415140.5A priority Critical patent/CN104202277B/en
Publication of CN104202277A publication Critical patent/CN104202277A/en
Application granted granted Critical
Publication of CN104202277B publication Critical patent/CN104202277B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The present invention provides a kind of design method for the linear transceiver of secondary user network for recognizing junction network, designs linear precoder for each user's source transmitter, eliminates time interference of the user transmitter to primary user；Linear receiver is designed for each secondary ownership goal receiving terminal, eliminates interference of the primary user to secondary receiver user；For each secondary user's relaying design beam forming, interfering with each other eliminating the secondary user of interference, elimination of the relaying primary user, and maximize the handling capacity of time user.The present invention can eliminate at the same time time user primary user's interference, primary user disturbs secondary user and secondary user interfere with each other, and maximize secondary user throughput；Secondary number of users, relaying quantity are not limited, its value is greater than or equal to 1, suitable for cognition junction network including single user list junction network, that there is any user to relay quantity.

Description

A kind of design method for the linear transceiver of secondary user network for recognizing junction network
Technical field
The present invention relates to wireless communication physical layer new technical field, relates more specifically to a kind of secondary use for recognizing junction network The design method of the linear transceiver of family network.
Background technology
Cognitive radio technology can efficiently using the Radio Spectrum Resource of day nearly exhaustion because receiving much concern.The technology Can on the premise of not influencing to obtain primary user's communication of spectrum authorization, make secondary user for not obtaining spectrum authorization use same frequency range into Row communication.The mode of spectrum sharing is broadly divided into two kinds of overlay and underlay.Wherein overlay modes provide time user Can only use frequency spectrum when primary user is idle, and underlay modes are in the premise for ensureing secondary user and not impacted to primary user It is lower to allow time user and primary user while common spectrum.Wireless relaying technique using collaboration communication as representative, is confrontation wireless communication Path is lost and the effective ways of decline, has the advantages that cost is low, energy consumption is low, handling capacity is big, wide coverage, relaying is negative Forward signal is blamed, in the middle when more antennas are equipped with, optimal transceiver design, can be greatly improved communication efficiency.
There are secondary user the cognitive radio networks of relaying to be known as recognizing junction network.Transceiver design is cognition trunk network One of popular research direction of network.Design content includes：The design of secondary user transmitter precoder, linear receiver design and in Designed after beam forming.The transceiver design research of junction network is recognized mainly for underlay patterns.In this mode, have There are the primary user of spectrum authorization and the secondary user network without spectrum authorization to communicate at the same time with frequency.Secondary user, which must assure that, not to drop The communication quality of low primary user；At the same time, secondary user is but faced with the interference for carrying out primary user signal.By being set for secondary user Transceiver is counted, can effectively be solved the above problems.In underlay recognizes junction network, have in relevant transceiver design For non-relay cognitive radio networks, some is directed to single relaying, single antenna or single user cognitive radio networks, but right The content studied of transceiver design of cognition junction network with multi-user, more relaying, multiple antennas is not much.It is existing to grind It is to minimize relay forwarding noise power as target to study carefully, and lacks and eliminates time user at the same time to primary user's interference, primary user couple Interfered with each other between secondary user's interference and secondary user, and maximize the content of the transceiver design of time user throughput.
The content of the invention
It is real it is an object of the invention to propose a kind of design method for the linear transceiver of secondary user network for knowing junction network Now eliminate time user primary user's interference, primary user disturbs secondary user and secondary user interfere with each other, and maximize time use Family handling capacity.
In order to achieve the above object, the technical solution adopted by the present invention is：
A kind of design method for the linear transceiver of secondary user network for recognizing junction network, wherein secondary user network is including secondary User's source transmitter, secondary ownership goal receiving terminal and secondary user's relaying, secondary user's source transmitter are awarded not obtaining frequency spectrum Using the frequency range transmitting signal for the primary user for having obtained spectrum authorization in the case of power, pass through secondary user's relay forwarding to secondary user Intended recipient end receives；Linear precoder is designed for each secondary user's source transmitter, eliminates time user transmitter to primary The interference at family；Linear receiver is designed for each secondary ownership goal receiving terminal, eliminates interference of the primary user to secondary receiver user； For each secondary user's relaying design beam forming, interfering with each other eliminating the secondary user of interference, elimination of the relaying primary user, and Maximize the handling capacity of time user.
The linear precoder is linear Zero Forcing precoder.By the way that the transmitting signal of secondary user source is limited in spy In fixed signal kernel, time interference of the user source to primary user's receiver is eliminated.
The linear receiver is linear zero forcing receiver.By the way that the signal for carrying out primary user is limited in specific signal In kernel, interference of the primary user to secondary ownership goal end receiver is eliminated.
The design method of the linear Zero Forcing precoder is as follows：
S11 calculates the equivalent channel matrix from each secondary user source to primary user's receiver
S12：To equivalent channel matrixCarry out singular value decomposition；
S13：Time force zero linear precoder of user's source is formed with column vector corresponding with zero singular value；
Wherein, primary user's source, receiving terminal use S respectivelyi、D0Represent, U0For the linear receiver matrix of receiving terminal.
The design method of the linear zero forcing receiver is as follows：
S21：Calculate from primary user's transmitter to the equivalent channel matrix at each secondary ownership goal end
S22：To equivalent channel matrixCarry out singular value decomposition；
S23：The force zero linear receiver at time ownership goal end is formed with column vector corresponding with zero singular value；
Wherein, primary user's source, receiving terminal use S respectively0、DiRepresent, V0For the pre-coding matrix of main user's source.
The design method of the beam forming is as follows：
S31：By the way that to beam forming matrix vector quantization, beam forming matrix { W is relayed asking L1,W2,...,WLAsk Topic is converted into a beam forming vector w；
S32：The bar interfered with each other the condition for eliminating interference of the relaying primary user's receiver and eliminating time user The condition that the product that part is separately converted to two equivalent matrixes and beam forming vector w is zero, passes through Kronecker products and piecemeal Matrix, constructs the two equivalent matrix As and B；
Wherein,
S33：Look for the base vector of A and B kernel intersections subspace；Order
Singular value decomposition is carried out to CThe kernel of C is tried to achieve, as the kernel intersection of A and B, the zero of C Space matrix is：
S34：Using the method for exhaustion, by CnullIn each base vector substitute into network throughput expression formula, finding makes time user network The base vector of network handling capacity maximum, it is w to make it；
S35：Base vector w is subjected to plan vectoring operations, obtains the beam forming matrix W for each relayingl；
Wherein, the K source S of secondary user1、......、SKRepresent, K destination end D1、......、DKRepresent, L Relay R1、......、RLRepresent, secondary user's source precoder, destination end receiver, relaying beam forming use V respectivelyi (i=1 ..., K), Ui(i=1 ..., K), Wl(l=1 ..., L) represents that the total transmission power of relaying is PR, from node A to The channel H of node BBARepresent.
The signal of relay forwarding is limited in specific signal kernel, while eliminates relaying to primary user's receiver Interfering with each other between interference and secondary user, on this basis, maximizes the handling capacity of time user network.
Realizing the condition of the Zero Forcing precoder and force zero linear receiver is：
min(Mi-d0,Ni-d0)≥di
Wherein, MiAntenna number, N for secondary user sourceiFor the antenna number of target, diFor parallel channel number.
The relaying will realize that interference eliminates, and need to meet：
Jl＞ d0With
Wherein, JiFor the antenna number of relaying.
The beneficial effects of the invention are as follows：
1st, the present invention eliminate at the same time time user primary user's interference, primary user disturbs secondary user and secondary user it is mutual Interference, and maximize time user throughput；
2nd, in the present invention, secondary number of users, relaying quantity are not limited, its value is greater than or equal to 1, suitable for bag Include cognition junction network including single user list junction network, that there is any user to relay quantity.
Brief description of the drawings
Fig. 1：Multi-user, more relayings, multiple antennas cognition junction network block diagram；
Fig. 2：Zero Forcing precoder design, zero-forcing receiver design, the stream of throughput-maximized relaying beam forming design Cheng Tu；
Fig. 3：When secondary user have K=4 source-destinations traffic to, L=5 relaying when, the average throughput performance of secondary user Schematic diagram (the antenna number M of primary user0=N0=2, parallel channel number d0=1, primary user's Signal to Noise Ratio (SNR)PU=10dB, secondary user's Source and target end antenna number Mi=Ni=4, i=1 ..., 4；The antenna number J of relayingl=6, l=1 ..., 5, parallel channel number di =3), whereinRepresent the throughput-maximized algorithm of the present invention,Represent that noise power minimizes algorithm,Represent straight Connect amplification method for transformation；
Fig. 4：When secondary user have K=4 source-destinations traffic to, L=5 relaying when, the Mean Speed performance of primary user is shown It is intended to (the antenna number M of primary user0=N0=2, parallel channel number d0=1, primary user's Signal to Noise Ratio (SNR)PU=10dB, the source of secondary user With destination end antenna number Mi=Ni=4, i=1 ..., 4；The antenna number J of relayingl=6, l=1 ..., 5, parallel channel number di= 3), whereinRepresent inventive algorithm,Represent existing algorithm.
Embodiment
The content of the invention is calculated and implemented with digital integrated circuit chip.Illustrate implementation detail below.
Symbol operation instruction：With capitalization overstriking letter representing matrix, small letter overstriking letter represents vector；ZT、ZH、Z-1、Z1 /2, det (Z), vec (Z) represent to seek matrix Z transposition, conjugate transposition, inverse, evolution, determinant, vector quantization respectively；Null (Z) table Show the kernel of matrix Z；zT、zHExpression asks transposition, conjugate transposition to vector z；IMRepresent M × M unit matrixs；Representing matrix Kronecker product.
System describe：What the present invention considered has multi-user, more relayings, the underlay cognitive radio networks of multiple antennas As shown in Figure 1.Primary user and time user communicate with frequency at the same time.Primary user's transmitter is S0, receiving terminal D0, S0And D0Match somebody with somebody respectively Standby M0And N0Root antenna.If d0For the parallel data stream quantity of primary user, M0×d0Matrix V0For S0Pre-coding matrix, N0×d0 Matrix U0For D0Receiver processing array, d0×1Vector s0It is expressed as S0The signal of transmission.Secondary user uses double bounce trunking traffic Mode, includes K user couple, source SiBy L non-regenerative relaying to target DiTransmission signal (i=1,2 ..., K).Source SiWith Target DiIt is equipped with MiAnd NiRoot antenna, relays RlIt is equipped with JlRoot antenna (l=1,2 ..., L).If diFor the parallel of secondary user i Number of data streams, Mi×diMatrix ViExpression source SiPre-coding matrix, Jl×JlMatrix WlTo relay RlRelaying beam forming square Battle array, Ni×diMatrix UiFor DiReceiver matrix, di× 1 vector siExpression source SiThe signal of transmission, di×diDiagonal matrixFor power allocation matrix, For source SiTransmission power, i=1 ..., K.N0×M0MatrixRepresent primary user S0To D0Channel, Jl×MiMatrixRepresent time user source SiTo relaying RlChannel, Ni×JlSquare Battle arrayRepresent relaying RlTo target DiChannel, Ni×M0MatrixRepresent primary user S0To secondary ownership goal DiChannel, Jl×M0MatrixRepresent primary user S0To relaying RlChannel, N0×MiMatrixExpression source SiTo primary user D0Letter Road, N0×JlMatrixRepresent relaying RlTo primary user D0Channel.
K carries out double bounce communication in the case where not interfered to primary user to secondary user using L relaying.Information is transmitted Process is divided into two isometric time slots：In first time slot, K source S1,...,SKAt the same time to L relaying R1,...,RLSend letter Number, relay Rl(l=1 ..., L) received signal is
In second time slot, L relaying R1,...,RLAt the same time to K target D1,...,DKForward signal.Relay RlHair Penetrating signal isRelay RlTransmission power beL relaying has total power constraint, i.e.,
Target Di (i=1 ..., K) receives signal and is
As it can be seen that in junction network is recognized, primary user faces the interference from time subscriber signal transmitting terminal (source and relaying), Secondary user faces interfering with each other between interference and secondary user from primary user.The present invention is linear for time user transmitter design Precoder, linear receiver is designed for each receiving terminal, and designs beam forming for each relaying.Wherein, time user is designed The Zero Forcing precoder of transmitter, eliminates time interference of the user transmitter to primary user；The linear zero-forcing detector of design time user Machine, eliminates interference of the primary user to secondary receiver user；On this basis, design relaying beam forming, eliminates relaying to primary Interfering with each other between the secondary user of interference, elimination at family, and maximize the handling capacity of time user.
As shown in Fig. 2, Zero Forcing precoder, zero-forcing receiver, throughput-maximized relaying beam forming are designed.
1st, secondary user's source linear transmitter Zero Forcing precoder design：
Design the precoder { V in K source1,V2,...,VK, the interference to primary user is eliminated, that is, is met
Calculate equivalent channel matrixIt is rightSingular value decomposition is carried out to obtain TakeIn d corresponding with zero singular valueiColumn vector forms source SiPrecoder Vi, i=1 ..., K.
2nd, the linear zero-forcing receiver design of secondary ownership goal：
Design the linear receiver { U of K target1,U2,...,UK, the interference for carrying out primary user is eliminated, that is, is met
Calculate equivalent channel matrixIt is rightSingular value decomposition is carried out to obtain TakeIn d corresponding with zero singular valueiColumn vector forms target DiLinear receiver Ui, i=1 ..., K.
3rd, the beam forming design of secondary user relay maximize handling capacity：
By the beam forming matrix { W of L relaying1,W2,...,WLVector quantization：
Obtain vector w, you can obtain { W1,W2,...,WL}.Method is as follows：
3.1) structural matrix A, B, C.OrderAnd construct Lower column matrix：L=1 ..., L
3.2) singular value decomposition is carried out to Matrix C
3.3) right unitary matrice VCIn be zero with value the corresponding NC column vector of singular value beUse them Form the null space matrix of C
Wherein
3.4) poor searching method is used, by CnullIn each column vector substitute into time user network handling capacity expression formula (8), the vector of expression formula value maximum will be made as optimal solution w*.Secondary user network handling capacity (i.e. time user rate) expression formula For：
Wherein
3.5) according to the form of (3), to w*Inverse vector is carried out, obtains relaying beam forming matrix { W1,W2,...,WL}。
Fig. 3 and Fig. 4 shows that time user has situation of four source destinations traffics to (K=4) five relayings (L=5).Its In, the antenna number M of primary user0=N0=2, parallel channel number d0=1, primary user's Signal to Noise Ratio (SNR)PU=10dB.The source of secondary user and Destination end antenna number Mi=Ni=4, i=1 ..., 4；The antenna number J of relayingl=6, l=1 ..., 5, parallel channel number di=3. Fig. 3 shows that in the case of using different transceiver design algorithms the average and speed of secondary user is with secondary user's signal-to-noise ratio SNRSUThe situation of change, it is seen that the algorithm that this patent proposes can obtain the secondary user throughput for being substantially better than existing algorithm Energy.Fig. 4 shows the influence of different transceiver design strategies that time user uses to the traffic rate performance of primary user, it is seen that makes The algorithm proposed with this patent, makes the communication of time user not influence the rate capability of primary user.
In the present invention, secondary number of users K, relaying quantity L are not limited, its value is greater than or equal to 1, suitable for bag Include cognition junction network including single user list junction network, that there is any user to relay quantity.The day of each user source Line number need not be equal, and the antenna number of each ownership goal need not be equal, and the antenna number of each user's relaying need not be equal.It is real Now the condition of Zero Forcing precoder and force zero linear receiver is：min(Mi-d0,Ni-d0)≥di, wherein the antenna of secondary user source Number is Mi, target antenna number be Ni.Relaying will realize that interference eliminates, and need to meet Jl＞ d0And
The present invention is applicable not only to narrow-band communication system, can also be applied in OFDM broadband systems.Recognize in wideband OFDM Know in junction network, can be directly using the method for the present invention on each OFDM subcarriers.
Obviously, the above embodiment of the present invention is only intended to clearly illustrate example of the present invention, and is not pair The restriction of embodiments of the present invention.For those of ordinary skill in the field, may be used also on the basis of the above description To make other variations or changes in different ways.There is no necessity and possibility to exhaust all the enbodiments.It is all this All any modification, equivalent and improvement made within the spirit and principle of invention etc., should be included in the claims in the present invention Protection domain within.

Claims (5)

  1. A kind of 1. design method for the linear transceiver of secondary user network for recognizing junction network, wherein secondary user network includes time use Family source transmitter, secondary ownership goal receiving terminal and secondary user relaying, secondary user's source transmitter are not obtaining spectrum authorization In the case of using oneself obtain spectrum authorization primary user frequency range transmitting signal, pass through secondary user's relay forwarding to secondary ownership goal Receiving terminal receives, it is characterised in that designs linear precoder for each user's source transmitter, eliminates time user transmitter Interference to primary user；Linear receiver is designed for each secondary ownership goal receiving terminal, eliminates primary user to secondary receiver user Interference；It is mutual eliminating the secondary user of interference, elimination of the relaying primary user for each secondary user's relaying design beam forming Interference, and maximize the handling capacity of time user；The linear precoder is linear Zero Forcing precoder；The linear reception Machine is linear zero forcing receiver；The design method of the linear Zero Forcing precoder is as follows：
    S11：Calculate the equivalent channel matrix from each secondary user source to primary user's receiver
    S12：To equivalent channel matrixCarry out singular value decomposition；
    S13：Time force zero linear precoder of user's source is formed with column vector corresponding with zero singular value；
    Wherein, secondary user's source, primary user's receiving terminal use S respectivelyi、D0Represent, U0For the linear receiver matrix of receiving terminal.
  2. 2. the design method of the linear transceiver of secondary user network of cognition junction network according to claim 1, its feature It is,
    The design method of the linear zero forcing receiver is as follows:
    S21：Calculate from primary user's transmitter to the equivalent channel matrix at each secondary ownership goal end
    S22：To equivalent channel matrixCarry out singular value decomposition；
    S23：The force zero linear receiver at time ownership goal end is formed with column vector corresponding with zero singular value；
    Wherein, primary user's source, secondary user's receiving terminal use S respectively0、DiRepresent, V0For the pre-coding matrix of main user's source.
  3. 3. the design method of the linear transceiver of secondary user network of cognition junction network according to claim 2, its feature It is, the design method of the beam forming is as follows：
    S31：By the way that to beam forming matrix vector quantization, beam forming matrix { W is relayed asking L1,W2,···,WLAsk Topic is converted into a beam forming vector w；
    <mrow> <mi>w</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mi>v</mi> <mi>e</mi> <mi>c</mi> <mo>(</mo> <msub> <mi>W</mi> <mn>1</mn> </msub> <mo>)</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mi>v</mi> <mi>e</mi> <mi>c</mi> <mo>(</mo> <msub> <mi>W</mi> <mi>L</mi> </msub> <mo>)</mo> </mtd> </mtr> </mtable> </mfenced> </mrow>
    S32：The condition point interfered with each other the condition for eliminating interference of the relaying primary user's receiver and eliminating time user The condition that the product of two equivalent matrixes and beam forming vector w are zero is not converted into, passes through Kronecker products and piecemeal square Battle array, constructs the two equivalent matrix As and B；
    <mrow> <mi>A</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <msub> <mi>A</mi> <mn>1</mn> </msub> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>A</mi> <mi>K</mi> </msub> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Wherein,
    <mrow> <msub> <mover> <mi>H</mi> <mo>&amp;OverBar;</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mi>i</mi> </msub> </mrow> </msub> <mo>=</mo> <mo>&amp;lsqb;</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mn>0</mn> </msub> </mrow> </msub> <mo>,</mo> <mo>...</mo> <mo>,</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>,</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>,</mo> <mo>...</mo> <mo>,</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mi>K</mi> </msub> </mrow> </msub> <mo>&amp;rsqb;</mo> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mi>K</mi> <mo>,</mo> <mi>l</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mi>L</mi> </mrow>
    <mrow> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>=</mo> <mo>&amp;lsqb;</mo> <msubsup> <mover> <mi>H</mi> <mo>&amp;OverBar;</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>l</mi> </msub> <msub> <mi>S</mi> <mi>i</mi> </msub> </mrow> <mi>T</mi> </msubsup> <mo>&amp;CircleTimes;</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>D</mi> <mn>0</mn> </msub> <msub> <mi>R</mi> <mn>1</mn> </msub> </mrow> </msub> <mo>...</mo> <msubsup> <mover> <mi>H</mi> <mo>&amp;OverBar;</mo> </mover> <mrow> <msub> <mi>R</mi> <mi>L</mi> </msub> <msub> <mi>S</mi> <mi>i</mi> </msub> </mrow> <mi>T</mi> </msubsup> <mo>&amp;CircleTimes;</mo> <msub> <mover> <mi>H</mi> <mo>~</mo> </mover> <mrow> <msub> <mi>D</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>L</mi> </msub> </mrow> </msub> <mo>&amp;rsqb;</mo> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mi>K</mi> <mo>;</mo> </mrow>
    S33：The base vector of A and B kernel intersections subspace is looked for, is made
    <mrow> <mi>C</mi> <mo>=</mo> <mfenced open = "[" close = "]"> <mtable> <mtr> <mtd> <mi>A</mi> </mtd> </mtr> <mtr> <mtd> <mi>B</mi> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Singular value decomposition is carried out to CThe kernel of C is tried to achieve, as the kernel intersection of A and B, the kernel of C Matrix is:
    <mrow> <msub> <mi>C</mi> <mrow> <mi>n</mi> <mi>u</mi> <mi>l</mi> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mo>{</mo> <msqrt> <mfrac> <msub> <mi>P</mi> <mi>R</mi> </msub> <mrow> <msubsup> <mi>c</mi> <mn>1</mn> <mi>H</mi> </msubsup> <msub> <mi>B</mi> <mrow> <mi>p</mi> <mi>c</mi> </mrow> </msub> <msub> <mi>c</mi> <mn>1</mn> </msub> </mrow> </mfrac> </msqrt> <mi>c</mi> <mo>,</mo> <msqrt> <mfrac> <msub> <mi>P</mi> <mi>R</mi> </msub> <mrow> <msubsup> <mi>c</mi> <mn>2</mn> <mi>H</mi> </msubsup> <msub> <mi>B</mi> <mrow> <mi>p</mi> <mi>c</mi> </mrow> </msub> <msub> <mi>c</mi> <mn>2</mn> </msub> </mrow> </mfrac> </msqrt> <mi>c</mi> <mo>,</mo> <mo>...</mo> <mo>,</mo> <msqrt> <mfrac> <msub> <mi>P</mi> <mi>R</mi> </msub> <mrow> <msubsup> <mi>c</mi> <mi>N</mi> <mi>H</mi> </msubsup> <msub> <mi>B</mi> <mrow> <mi>p</mi> <mi>c</mi> </mrow> </msub> <msub> <mi>c</mi> <mi>N</mi> </msub> </mrow> </mfrac> </msqrt> <msub> <mi>c</mi> <mi>N</mi> </msub> <mo>}</mo> <mo>;</mo> </mrow>
    S34：Using the method for exhaustion, by CnullIn each base vector substitute into network throughput expression formula, finding makes time user network handle up Maximum base vector is measured, it is w to make it；
    S35：Base vector w is subjected to plan vectoring operations, obtains the beam forming matrix W for each relayingl
    Wherein, the K source S of secondary user1,…,SKRepresent, K destination end D1,…,DKRepresent, L relay is used R1,…,RLRepresent, secondary user's source precoder, destination end receiver, relaying beam forming use V respectivelyi(i=1 ..., K), Ui(i=1 ..., K), Wl(l=1 ..., L) represents that the total transmission power of relaying is PR, the channel H from node A to node BBA Represent,Mean that J1×J1Unit matrix,Mean that JL×JLUnit matrix.
  4. 4. the design method of the linear transceiver of secondary user network of cognition junction network according to claim 3, its feature It is, realizing the condition of the Zero Forcing precoder and force zero linear receiver is：
    min(Mi-d0,Ni-d0)≥di
    Wherein, MiAntenna number, N for secondary user sourceiFor the antenna number of target, diFor parallel channel number.
  5. 5. the design method of the linear transceiver of secondary user network of cognition junction network according to claim 4, its feature It is, the relaying will realize that interference eliminates, and need to meet：
    Jl＞ d0With
    Wherein, JlFor relay antenna number.
CN201410415140.5A 2014-08-21 2014-08-21 A kind of design method for the linear transceiver of secondary user network for recognizing junction network Expired - Fee Related CN104202277B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410415140.5A CN104202277B (en) 2014-08-21 2014-08-21 A kind of design method for the linear transceiver of secondary user network for recognizing junction network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410415140.5A CN104202277B (en) 2014-08-21 2014-08-21 A kind of design method for the linear transceiver of secondary user network for recognizing junction network

Publications (2)

Publication Number Publication Date
CN104202277A CN104202277A (en) 2014-12-10
CN104202277B true CN104202277B (en) 2018-04-27

Family

ID=52087507

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410415140.5A Expired - Fee Related CN104202277B (en) 2014-08-21 2014-08-21 A kind of design method for the linear transceiver of secondary user network for recognizing junction network

Country Status (1)

Country Link
CN (1) CN104202277B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106102073B (en) * 2016-07-05 2019-09-10 重庆邮电大学 A kind of isomery cognition wireless network dl interference alignment schemes
CN106301630B (en) * 2016-07-29 2018-12-18 浙江工业大学 A kind of anti-interference frequency spectrum access method based on beam forming
CN106533516B (en) * 2016-12-21 2020-02-07 中国人民解放军理工大学 Physical layer secure transmission method of multi-antenna multi-relay cognitive eavesdropping network
CN111901058B (en) * 2020-07-31 2021-07-02 电子科技大学 Multi-antenna auxiliary broadband spectrum sensing method based on sub-nyquist sampling

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102420679A (en) * 2011-09-30 2012-04-18 北京邮电大学 Relay collaborative precoding-based multi-user two-way communication method
CN102892123A (en) * 2012-09-26 2013-01-23 清华大学 Robust wave beam forming method in multi-antenna multi-user relay cognitive radio network
CN103152086A (en) * 2013-02-05 2013-06-12 上海交通大学 Method for processing beam forming robustness signal on relay end of bi-direction multi-relay system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2498402B (en) * 2012-01-16 2014-01-15 Toshiba Res Europ Ltd Enhancing the reliability of spectrum sensing with partial soft information feedback in a cognitive relay network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102420679A (en) * 2011-09-30 2012-04-18 北京邮电大学 Relay collaborative precoding-based multi-user two-way communication method
CN102892123A (en) * 2012-09-26 2013-01-23 清华大学 Robust wave beam forming method in multi-antenna multi-user relay cognitive radio network
CN103152086A (en) * 2013-02-05 2013-06-12 上海交通大学 Method for processing beam forming robustness signal on relay end of bi-direction multi-relay system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
多用户MIMO中继通信系统中线性处理器设计;赵睿等;《河南师范大学学报(自然科学版)》;20120319;第39卷(第6期);正文第51页第22-26行 *

Also Published As

Publication number Publication date
CN104202277A (en) 2014-12-10

Similar Documents

Publication Publication Date Title
CN109743729B (en) Secret transmission method of wireless energy-carrying cooperative system
Chen et al. Multi-antenna relay aided wireless physical layer security
Rodriguez et al. Physical layer security in wireless cooperative relay networks: State of the art and beyond
Zheng et al. Full-duplex cooperative cognitive radio with transmit imperfections
Shi et al. Joint source-relay design for full-duplex MIMO AF relay systems
Ding et al. A general relaying transmission protocol for MIMO secrecy communications
Jia et al. Spectrum and energy efficiencies for multiuser pairs massive MIMO systems with full-duplex amplify-and-forward relay
CN110752865B (en) Multi-user MIMO communication confidentiality method under relay cooperative network
CN106059705A (en) Relay physical layer safe transmission method
CN104202277B (en) A kind of design method for the linear transceiver of secondary user network for recognizing junction network
Liu et al. A tractable and accurate cross-layer model for multi-hop MIMO networks
Hua et al. Exploiting multiple antennas in cooperative cognitive radio networks
CN106301457B (en) Self-interference removing method in bi-directional full-duplex MIMO relay communications system
CN110519756A (en) Physical layer safety transmission method of full duplex relay network
Fang et al. Massive MIMO for full-duplex cellular two-way relay network: A spectral efficiency study
CN107277839A (en) Interference guidance method and cellular communication system based on spatial domain and power adaptive
Si et al. Performance analysis of spatial modulation aided NOMA with full-duplex relay
CN104202790A (en) Power self-adaptation based MIMO-CCRN bottleneck effect elimination method
Aldababsa Performance of TAS/MRC in NOMA energy harvesting relay networks
CN106507391B (en) Interference guidance method in WLAN
Vahidnia et al. Diversity combining in bi‐directional relay networks with energy harvesting nodes
US20140248835A1 (en) Distributed wireless transmission and reception system, and expanded wireless network
Ashraphijuo et al. On the DoF of Two-Way $2\times 2\times 2$ MIMO Relay Networks
Qian et al. Energy-efficient antenna selection in green MIMO relaying communication systems
Do et al. Exploiting system performance in AF non-orthogonal multiple access network under impacts of imperfect SIC and imperfect hardware

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
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: 20180427

Termination date: 20200821