CN104811277B - Relay communications system and its channel sort method based on channel sequence and network code - Google Patents
Relay communications system and its channel sort method based on channel sequence and network code Download PDFInfo
- Publication number
- CN104811277B CN104811277B CN201510240866.4A CN201510240866A CN104811277B CN 104811277 B CN104811277 B CN 104811277B CN 201510240866 A CN201510240866 A CN 201510240866A CN 104811277 B CN104811277 B CN 104811277B
- Authority
- CN
- China
- Prior art keywords
- mtd
- mtr
- mrow
- msub
- msup
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of relay communications system and channel sort method based on channel sequence and network code, it is characterized in that the channel order module in data uplink stage via node receives K reception signal and is sent to signal quantization module after carrying out the reception signal after channel bank sequence is sorted；Signal quantization module is sent to signal network coding module for carrying out network code after channel quantitative processing is carried out to the reception signal after sequence, finally estimates the network encoded format of the first packet and the second packet after sequence.The present invention can effectively reduce communication error sign ratio, improve data rate and power system capacity, reduce dependency degree of the information transfer to quality of wireless channel, and the especially performance boost under low signal-to-noise ratio becomes apparent.
Description
Technical field
It is specifically a kind of based on channel sequence and net the present invention relates to the two-way relay communication system in wireless telecommunications
The relay communications system and its channel sort method of network coding.
Background technology
Existing patent (publication number CN103281271 A, number of patent application CN201310207093) discloses one kind and passed through
The method that channel quantitative carries out physical-layer network coding.During the channel quantitative of this method, two end segments are not accounted for
Otherness of the point to the channel quality of via node.Specifically, because the wireless channel of two end nodes to via node passes
The difference of defeated environment, the channel fading coefficient of two end nodes to via nodes vary.Channel difference is not distinguished and straight
Connect pairEstimate make it that the accuracy of estimation is not high, signal transacting error sign ratio is larger.
The content of the invention
The present invention is to overcome the shortcomings of the prior art part, there is provided a kind of based on channel sequence and network code
Relay communications system and its channel sort method, to can effectively reduce communication error sign ratio, improve data rate and system
Capacity, reduces dependency degree of the information transfer to quality of wireless channel, and the especially performance boost under low signal-to-noise ratio becomes apparent.
The present invention adopts the following technical scheme that to solve technical problem：
The present invention it is a kind of based on channel sequence and network code bi-directional relaying wireless communication system the characteristics of be to include：One
Individual via node R, the first end node S1With the second end node S2；The via node R has K root antennas；K is positive integer；It is described
First end node S1With the second end node S2Each there is an antenna；The via node R includes channel order module, signal
Quantization modules and signal network coding module；
The first end node S1With the second end node S2Respective antenna in a manner of symbol synchronization simultaneously to described
Via node R sends the first packet x1' and the second packet x2′；
The via node R receives the first packet x respectively using the K roots antenna1' and the second packet x2'
Physics superposed signal, so as to be formed comprising noisy K reception signal and be sent to the channel order module, by the K
Individual reception signal is designated as Y '={ y1′,y2′,…,yi′,…,yK′}；yi' represent that i-th antenna of the via node R receives
Signal；1≤i≤K；And there is yi'=hi,1′x1′+hi,2′x2′+ni′；hi,1' represent the first end node S1To the via node R
I-th antenna channel fading coefficient；hi,2' represent the second end node S2To the letter of i-th antenna of the via node R
Road fading coefficients；niThe interchannel noise of ' i-th antenna for being the via node R；
The channel order module receives the K reception signal and carries out the reception signal after channel bank sequence is sorted
The signal quantization module is sent to after Y；
The signal quantization module is sent to the letter after carrying out channel quantitative processing to the reception signal Y after the sequence
Number network code module is used to carry out network code, finally estimates the first packet x after the sequence1With the second packet
x2Network encoded format be
The via node R is by the network encoded formatFirst end node is sent to by any antenna
S1With the second end node S2；
The first end node S1With the second end node S2The network encoded format is received by respective antenna respectivelyAnd the first packet x with itself respectively1' and the second packet x of itself2' XOR is carried out, so that
The first end node S1Obtain the second end node S2The the second packet x sent2′；The second end node S2Obtain institute
State the first end node S1The the first packet x sent1', complete bi-directional relaying communication process.
A kind of channel sort method of the bi-directional relaying wireless communication system based on channel sequence and network code of the present invention
The characteristics of be the steps of carrying out：
Step 1, the via node R extract the channel fading coefficient, obtain channel matrix
Step 2, using formula (1) and formula (2) channel matrix is obtained respectivelyIn two column element moulds
Quadratic sum sum1And sum2：
Step 3, the quadratic sum sum to the two column elements mould1And sum2It is compared, according to the difference of K values, if K=
1, i.e., described via node R only have 1 antenna, then
If sum1≥sum2, then first after channel matrix H and sequence after being sorted respectively using formula (3) and formula (4)
Packet x1With the second packet x2：
H=[h1,1 h1,2]=[h1,1′ h1,2′] (3)
If sum1＜ sum2, then first after channel matrix H and sequence after being sorted respectively using formula (5) and formula (6)
Packet x1With the second packet x2：
H=[h1,1 h1,2]=[h1,1′ h1,2′] (5)
So as to which the reception signal after being sorted is designated as y1=h1,1x1+h1,2x2+n1；
If K >=2, i.e., described via node R, which only has, is no less than 2 antennas, then
If sum1≥sum2, then first after channel matrix H and sequence after being sorted respectively using formula (7) and formula (8)
Packet x1With the second packet x2：
If sum1＜ sum2, then after the channel matrix H and sequence after being sorted respectively using formula (9) and formula (10)
One packet x1With the second packet x2：
So as to which the reception signal after being sorted is designated as Y={ y1,y2,…,yi,…,yK}；And there is yi=hi,1x1+hi,2x2+
ni。
Compared with the prior art, the present invention has the beneficial effect that：
1st, the present invention fully excavates two end nodes to the otherness of quality of wireless channel between via node, is carrying out letter
Road quantifies, with before physical-layer network coding, to increase the processing step for being ranked up channel, preferentially to preferable channel
The data that end node is sent are estimated, by comparing two end nodes to two groups of wireless channel fading coefficients moulds of via node
SquareWithAnd necessary exchange is carried out, ensure that the signal of the end node with preferable channel quality can be with
By priority treatment and estimation, so as to reduce pairSurviving error when being estimated, is improved pairEstimated
The accuracy rate of meter, and then error sign ratio when two end nodes in trunking traffic carry out data exchange is reduced, improve estimation
Accuracy rate and communication data rate, expanded the message capacity of relay system；
2nd, the present invention can be operated in by channel sequence and network code, designed wireless both-way trunk communication system
Under worse channel circumstance and more low signal-to-noise ratio, so as to reduce dependence of the bidirectional relay system to wireless channel.
Brief description of the drawings
Fig. 1 is the structural representation of relay system of the present invention；
Fig. 2 be relay system up channel of the present invention sort method embodiment in channel sort method flow chart；
Fig. 3 be the present invention in K=1 and prior art error sign ratio comparison diagram；
Fig. 4 be the present invention in K=2 and prior art error sign ratio comparison diagram；
Fig. 5 be the present invention in K=3 and prior art error sign ratio comparison diagram.
Embodiment
As shown in figure 1, in wireless both-way trunk communication system TWRC, including：One via node R and two end segments
Point, i.e. the first end node S1With the second end node S2；Via node R has K root antennas；K is positive integer；First end node S1With
Second end node S2Each there is an antenna；The signal transmission of two-way relay communication system is made up of two stages, including number
According to up stage and data descending phase；Via node R signal processing is as shown in Fig. 2 including channel order module, letter
Number quantization modules and signal network coding module；Wherein, channel fading coefficient known to the extraction of channel order module, obtains dimension
For the channel matrix of K × 2, calculate the quadratic sum of each row each element mould and be compared and arrange exchange, row, which exchange, ensures sequence
The quadratic sum of the secondary series each element mould of channel matrix afterwards is more than or equal to the quadratic sum of first row each element mould.
In the data uplink stage, end node S1With end node S2Respective antenna in a manner of symbol synchronization simultaneously to
Via node R sends the first packet x1' and the second packet x2', the signal that via node R i-th antenna receives is actual
On be x1' and x2' mixing superposition, i.e., as shown in formula (1)：
yi'=hi,1′x1′+hi,2′x2′+ni′ (1)
In formula (1), yi' represent the complex signal that i-th antenna of the via node R receives；1≤i≤K；hi,1' and
hi,2' two end node S are represented respectively1And S2To the channel fading coefficient of via node R i-th antenna, obey average be 0,
Variance is 1 multiple Gauss random distribution；x1′,x2' ∈ { ± 1 ± j } represents end node S respectively1And S2After QPSK is modulated
Send signal；niThe channel multiple Gauss noise of ' expression via node R i-th antenna, its real and imaginary parts obey average and are
0th, variance σ2Normal distribution.
Via node R receives the first packet x respectively using the K roots antenna1' and the second packet x2' superposition
Signal, so as to form K reception signal Y '={ y containing interchannel noise1′,y2′,…,yi′,…,yK', based on K reception
Signal Y ', via node R carry out signal transacting, it is desirable to obtain to packet x1' and x2' network code formEstimate
EvaluationTherefore, the channel order module is sent it to；
Channel order module receives K reception signal and sent after carrying out the reception signal Y after channel bank sequence is sorted
Give signal quantization module；
Signal quantization module is sent to signal network coding mould after channel quantitative processing is carried out to the reception signal Y after sequence
Block carries out network code, finally estimates the first packet x after sequence1With the second packet x2Network encoded format
In the data downstream stage, via node R is by network encoded formatIs broadcast to by any antenna
One end node S1With the second end node S2；
First end node S1With the second end node S2The network encoded format is received by respective antenna respectivelyAnd the first packet x of itself preserved respectively with the up stage before1' and the second packet x of itself2' carry out
XOR, so as to solve the information for wanting to obtain so that the first end node S1Obtain the second end node S2The packet of transmission
x2′；Second end node S2Obtain the first end node S1The packet x of transmission1′。
Wherein, channel order module is the steps of carrying out：
Step 1, assume the fully known channel information of via node, and channel is block decline, i.e., in packet
In time, channel fading coefficient is to maintain constant, and the decline for each wrapping experience is separate.Via node R is carried
Channel fading coefficient is taken to obtain channel matrixWherein hi,m, i=1 ..., K, m=1,2 represent end node
SmTo the channel fading coefficient of i-th antenna of via node, it is 0 to obey average, and variance is 1 multiple Gauss random distribution.
Step 2, using formula (2) and formula (3) channel matrix is obtained respectivelyIn two column element moulds
Quadratic sum sum1And sum2：
Step 3, the quadratic sum sum to the two column elements mould1And sum2It is compared, according to the difference of K values, if K=
1, i.e., described via node R only have 1 antenna, then
If sum1≥sum2, then first after channel matrix H and sequence after being sorted respectively using formula (4) and formula (5)
Packet x1With the second packet x2：
H=[h1,1 h1,2]=[h1,1′ h1,2′] (4)
If sum1＜ sum2, then first after channel matrix H and sequence after being sorted respectively using formula (6) and formula (7)
Packet x1With the second packet x2：
H=[h1,1 h1,2]=[h1,1′ h1,2′] (6)
So as to which the reception signal after being sorted is designated as y1=h1,1x1+h1,2x2+n1；
If K >=2, i.e., described via node R, which only has, is no less than 2 antennas, then
If sum1≥sum2, then first after channel matrix H and sequence after being sorted respectively using formula (8) and formula (9)
Packet x1With the second packet x2：
If sum1＜ sum2, then after the channel matrix H and sequence after being sorted respectively using formula (10) and formula (11)
One packet x1With the second packet x2：
So as to which the reception signal after being sorted is designated as Y={ y1,y2,…,yi,…,yK}；And there is yi=hi,1x1+hi,2x2+
ni。
During k=1, the reception signal after sequence is y1=h1,1x1+h1,2x2+n1, by channel order module, ensure | h1,1|
≥|h1,2|.In signal quantization module, quantization coefficient h is used1,1Or h1,1/ (1+j) adaptively quantifies to reception signal,
Obtain finally by estimatorOrSpecifically,
In formula (12), L=Round (h1,2/h1,1), Round (t) represents to take the integer closest to t, real and imaginary parts difference
Taken the computing closest to integer；Expression is taken to h1,2/h1,1The portion left after rounding
Point, i.e. h1,2/h1,1=Round (h1,2/h1,1)+Res(h1,2/h1,1)。
Compared with prior art, invention increases channel order module, sorted by necessary channel (to channel matrix
Row exchange), ensure | h1,1|≥|h1,2|, after the computing of formula (12), it is a smaller value to ensure residual error, so as to improve
It is rightThe precision of estimation.
During K >=2, by above-mentioned channel order module, we ensure that the packet (note with preferable channel quality：Because
Only two packets, thus " preferable " and " best " is equivalent here) channel matrix H after sequence secondary series.
That is the quadratic sum of the mould of the channel fading coefficient of the secondary series of channel matrix H after sequence is necessarily more than or equal to first row.
The signal with reference to disclosed in existing patent (publication number CN103281271A, number of patent application CN 201310207093)
Quantization and network coding method, in signal quantization module, via node R carries out QR decomposition to the channel matrix H after sequence first,
H=QR is obtained, wherein, Q is K*K square formation and meets Q*QH=I；R is 2*K upper triangular matrix, and it is from the 3rd row to line k
Element be zero.
H after decomposition is substituted into and receives vector expression, abbreviation obtains being equivalent in the first of the reception vector expression
Between layer signal and the second middle layer signal, it is as follows：
In formula (13), w1It is the first middle layer signal；w2It is the second middle layer signal；r1,1It is upper triangular matrix R the 1st row
1st column element；r1,2It is the column element of the 1st rows of matrix R the 2nd；r2,2It is the column element of the 2nd rows of matrix R the 2nd；n1And n2It is multiple Gauss respectively
Noise, its real and imaginary parts all obey 0 average, variances sigma2Normal distribution.
In network code module, valuation will be carried out first by the second middle layer signal, and obtain the second end node hair
The encoded signal valuation sent, it is as follows：
It is then based onCalculated using the first middle layer signal
From above-mentioned steps it can be seen that, for x2The accuracy rate estimated is extremely important, will because if estimation error
Directly result in pairEstimation error.
Compared with prior art, invention increases channel order module, sorted by necessary channel (to channel matrix
Row exchange), ensure the signal with preferable channel quality in secondary series, after QR is decomposed, ensure the r in (13)2,2It is
Larger value, so as to improve pairWithThe accuracy of estimation.
The error sign ratio pair of the technology of the present invention and prior art when Fig. 3, Fig. 4, Fig. 5 list K=1, K=2, K=3 respectively
Than figure, it can be seen that increase channel sequence step can significantly reduce the error sign ratio of trunking traffic, in low signal-to-noise ratio
Under performance improve it is more notable.The technology of the present invention improves the traffic rate of wireless both-way trunk system, it is worked
In the wireless environment of low signal-to-noise ratio.
Claims (1)
1. a kind of bi-directional relaying wireless communication system based on channel sequence and network code, it is characterized in that including：One relaying
Node R, the first end node S1With the second end node S2；The via node R has K root antennas；K is positive integer；The first end
Node S1With the second end node S2Each there is an antenna；The via node R includes channel order module, signal quantization mould
Block and signal network coding module；
The first end node S1With the second end node S2Respective antenna in a manner of symbol synchronization simultaneously to the relaying
Node R sends the first packet x1' and the second packet x2′；
The via node R receives the first packet x respectively using the K roots antenna1' and the second packet x2' physics
Superposed signal, so as to be formed comprising noisy K reception signal and be sent to the channel order module, the K are connect
The collection of letters number is designated as Y '={ y1′,y2′,…,yi′,…,yK′}；yi' represent the letter that i-th antenna of the via node R receives
Number；1≤i≤K；And there is yi'=hi,1′x1′+hi,2′x2′+ni′；hi,1' represent the first end node S1To the of the via node R
The channel fading coefficient of i root antennas；hi,2' represent the second end node S2Channel to i-th antenna of the via node R declines
Fall coefficient；niThe interchannel noise of ' i-th antenna for being the via node R；
After the channel order module receives the K reception signal and carries out the reception signal Y after channel bank sequence is sorted
It is sent to the signal quantization module；Wherein described channel bank sequence module is the steps of carrying out channel sequence：
Step 1, the via node R extract the channel fading coefficient, obtain channel matrix
Step 2, using formula (1) and formula (2) channel matrix is obtained respectivelyIn two column element moulds it is flat
Side and sum1And sum2：
<mrow>
<msub>
<mi>sum</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<mo>|</mo>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>sum</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<mo>|</mo>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
Step 3, the quadratic sum sum to the two column elements mould1And sum2It is compared, according to the difference of K values, if K=1, i.e.,
The via node R only has 1 antenna, then
If sum1≥sum2, then the channel matrix H after being sorted respectively using formula (3) and formula (4) and the first data after sequence
Wrap x1With the second packet x2：
H=[h1,1 h1,2]=[h1,1′ h1,2′] (3)
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
If sum1＜ sum2, then the channel matrix H after being sorted respectively using formula (5) and formula (6) and the first data after sequence
Wrap x1With the second packet x2：
H=[h1,1 h1,2]=[h1,2′ h1,1′] (5)
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
So as to which the reception signal after being sorted is designated as y1=h1,1x1+h1,2x2+n1；
If K >=2, i.e., described via node R, which only has, is no less than 2 antennas, then
If sum1≥sum2, then the channel matrix H after being sorted respectively using formula (7) and formula (8) and the first data after sequence
Wrap x1With the second packet x2：
<mrow>
<mi>H</mi>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
</mrow>
If sum1＜ sum2, then the first number after the channel matrix H and sequence after being sorted respectively using formula (9) and formula (10)
According to bag x1With the second packet x2：
<mrow>
<mi>H</mi>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
</mtd>
<mtd>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mn>2</mn>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
<mtd>
<mtable>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>h</mi>
<mrow>
<mi>K</mi>
<mo>,</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>1</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msup>
<msub>
<mi>x</mi>
<mn>2</mn>
</msub>
<mo>&prime;</mo>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
So as to which the reception signal after being sorted is designated as Y={ y1,y2,…,yi,…,yK}；And there is yi=hi,1x1+hi,2x2+ni；
The signal quantization module is sent to the signal net after carrying out channel quantitative processing to the reception signal Y after the sequence
Network coding module is used to carry out network code, finally estimates the first packet x after the sequence1With the second packet x2's
Network encoded format is
The via node R is by the network encoded formatThe first end node S is sent to by any antenna1With
Second end node S2；
The first end node S1With the second end node S2The network encoded format is received by respective antenna respectivelyAnd the first packet x with itself respectively1' and the second packet x of itself2' XOR is carried out, so that institute
State the first end node S1Obtain the second end node S2The the second packet x sent2′；The second end node S2Described in acquisition
First end node S1The the first packet x sent1', complete bi-directional relaying communication process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510240866.4A CN104811277B (en) | 2015-05-12 | 2015-05-12 | Relay communications system and its channel sort method based on channel sequence and network code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510240866.4A CN104811277B (en) | 2015-05-12 | 2015-05-12 | Relay communications system and its channel sort method based on channel sequence and network code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104811277A CN104811277A (en) | 2015-07-29 |
| CN104811277B true CN104811277B (en) | 2018-03-09 |
Family
ID=53695802
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510240866.4A Active CN104811277B (en) | 2015-05-12 | 2015-05-12 | Relay communications system and its channel sort method based on channel sequence and network code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104811277B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101697510A (en) * | 2009-11-05 | 2010-04-21 | 华为技术有限公司 | Method and device for transmitting uplink data |
| CN101702830A (en) * | 2009-10-28 | 2010-05-05 | 北京邮电大学 | Method for transmitting network coding user collaborative matching in wireless relay system |
| CN102055565A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Space diversity method for physical layer network coding in communication system |
| CN102098239A (en) * | 2009-12-10 | 2011-06-15 | 中兴通讯股份有限公司 | Channel estimation method and device as well as VAMOS system |
| CN103281271A (en) * | 2013-05-29 | 2013-09-04 | 中国空间技术研究院 | Method for conducting physical layer network coding in relay system through channel quantization |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8908624B2 (en) * | 2009-10-22 | 2014-12-09 | Interdigital Patent Holdings, Inc. | Method and apparatus for a two-way relaying scheme with physical layer network coding |
-
2015
- 2015-05-12 CN CN201510240866.4A patent/CN104811277B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702830A (en) * | 2009-10-28 | 2010-05-05 | 北京邮电大学 | Method for transmitting network coding user collaborative matching in wireless relay system |
| CN101697510A (en) * | 2009-11-05 | 2010-04-21 | 华为技术有限公司 | Method and device for transmitting uplink data |
| CN102098239A (en) * | 2009-12-10 | 2011-06-15 | 中兴通讯股份有限公司 | Channel estimation method and device as well as VAMOS system |
| CN102055565A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Space diversity method for physical layer network coding in communication system |
| CN103281271A (en) * | 2013-05-29 | 2013-09-04 | 中国空间技术研究院 | Method for conducting physical layer network coding in relay system through channel quantization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104811277A (en) | 2015-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102047580B (en) | Mobile communication system, reception device, and method | |
| CN102938668B (en) | Sending method and method of reseptance and utilize their wireless device | |
| CN104113398B (en) | MIMO blind Channel Estimation fuzziness minimizing technologies based on Orthogonal Space-Time Block Code | |
| CN103685096B (en) | A kind of MIMO-OFDM system channel estimation method based on optimal pilot | |
| CN102237921B (en) | Physical layer network coding method for bidirectional relay channel of cellular system | |
| CN107046433A (en) | A kind of extensive mimo system up-link low complex degree Iterative detection algorithm | |
| CN101242388A (en) | Channel estimation method for high-speed single-carrier frequency domain balance ultra-wide broadband system | |
| CN102857284A (en) | Data transmitting method, data receiving method, data transmitting device, data receiving device and system | |
| CN101848060A (en) | Self-adaptive cooperation relay method through network coding | |
| CN102510324B (en) | Signal transmission method based on network coding in multi-input and multi-output Y channel | |
| CN105812042A (en) | Data transmission method for C-RAN (C-Radio Access Network) architecture massive MIMO (Multi-Input Multi-Output) system based on compressed sensing | |
| CN107276933A (en) | For the channel estimation methods based on second-order statistic in uplink multi-users mimo system | |
| CN104579613A (en) | Joint encoding modulation method based on no-rate codes and V-OFDM | |
| CN101322365B (en) | Noise power interpolation in a multi-carrier system | |
| CN104811277B (en) | Relay communications system and its channel sort method based on channel sequence and network code | |
| CN101944942B (en) | Low-complexity adaptive transmission multi-antenna transmission method and system | |
| CN104618293B (en) | A kind of optimization method of the unitary transformation matrix of smooth singular value decomposition | |
| CN104135347A (en) | Dirty paper coding and decoding method based on joint lattice forming technology in cognitive network | |
| CN103441966B (en) | Distributed MIMO frequency deviation and channel estimation based on ECM under a kind of high speed | |
| CN103812615A (en) | Coding method for Luby transform code in distributed communication system, and relay communication method | |
| CN106656879A (en) | High speed and higher-order variable step size self-adaptive equalization method | |
| CN102332946A (en) | Cooperated multipoint (CoMP) downlink joint transmission method capable of eliminating inter-cell interference and inter-flow interference at same time | |
| CN104104418A (en) | High transmission rate and bandwidth utilization rate of MIMO Multi-h CPM wireless communication method | |
| CN102223343B (en) | Method for multiplexing fractional domain resources in communication system of mixed carrier system | |
| CN107517169A (en) | A kind of half-blind channel estimating method of cloud Radio Access Network integration and cooperation sub-clustering |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220617 Address after: 230001 floor 6, block B, blue diamond Shangjie, No. 335, Suixi Road, Bozhou road street, Luyang District, Hefei City, Anhui Province Patentee after: Hefei Luyang Technology Innovation Group Co.,Ltd. Address before: Tunxi road in Baohe District of Hefei city of Anhui Province, No. 193 230009 Patentee before: Hefei University of Technology |