CN101090304A - Cooperation transmission method based on joint network channel code - Google Patents

Abstract

This invention relates to a coordinate transmission based on joint network- channel coding utilizing the maximum system transmission rate to structure an odd-even check matrix, which includes coding odd-even check matrixes of a source channel, a relay channel and a network channel, and the source node codes the source information with the source channel odd-even check matrix and broadcasts it to the relay and the destination nodes, the relay node uses the relay channel matrix to code its own information and send it to the destination node and uses the network code matrix to code the source coded and relay coded information to get network coded information to pick up extra information and carry out low density odd-even check coding it to be sent to the destination node, which decodes the information sent by the source node and the relay node jointly.

Description

Collaborative transmission method based on joint network channel code

Technical field

The present invention relates to Radio Transmission Technology, relate in particular to the collaborative transmission method of the joint network channel code of realizing based on low density parity check code.

Background technology

At cellular network, sensor network, wireless networks such as wireless self-organization network, the transmission of signal can be experienced the influence of multipath fading, Doppler frequency shift and other interference, and is very big in receiving terminal restoring signal difficulty.

Prior wireless network uses multiple-input and multiple-output (Multi-Input Multi-Output, abbreviation MIMO) technology is in conjunction with OFDM (Orthogonal Frequency Division Multiplexing, be called for short OFDM) technology, improve power system capacity to a great extent, improved the rate of information throughput.Because the complexity of mimo system is very high, complicated more in conjunction with system after the other technologies, thus this technology is for space high-speed mobile node and inapplicable.Simultaneously, because the spatial movement node is subjected to size, the restriction of power, the antenna amount of transmitting terminal and receiving terminal also can't reach the requirement of diversity.

Along with system component, agreement and algorithm design are more and more meticulousr, can support more interactive function between individuality, the focus of communication circle research appears and becomes rapidly in the deversity scheme that a class is new---communication for coordination (Cooperative Communications) technology.In the large-scale wireless communication network environment, communication between the mobile node, no longer only rely on the mutual contact mode of determining, and increased randomness, and under the collaborative help of other node, constitute the virtual multi-antenna system, diversity under the network environment and multiplexing is provided, thereby makes full use of space resources, opposing decline effectively, shade and other disturb, and reach the purpose of reliable communication.By communication for coordination is the diversity gain that system brings, and is called collaboration diversity.

Communication for coordination makes full use of the broadcast characteristic of wireless channel and the transmission performance that the space diversity characteristic improves wireless network.In the cooperative communication mode, the conspiracy relation between the user also will send the information of oneself in the time of not only can helping the partner to send information of same.By collaboration diversity, wireless terminal is cooperation transmission information each other, forms mulitpath in network.Receiving terminal can be remedied owing to decline by the collaborative redundant information that produces, shade covers with other and disturbs the influence that channel is caused.Communication for coordination has increased the degree of freedom of channel, this technology can improve communication reliability and communication quality to a great extent, can bring higher message transmission rate, user's use is compared the less gross power of non-synergistic mechanism and just can be reached equal message transmission rate, immediate interest is the battery life cycle that prolongs portable terminal, increases coverage; And can reduce susceptibility to channel variation, thus reduce outage probability, obtain better service quality, service quality comprises: the error rate, frame error rate, outage probability etc.

Present already present collaborative transmission method comprises: simple relay is amplified forwarding, and decoding is transmitted and coding cooperation.Wherein the relaying amplification is transmitted and is deciphered to transmit and relatively is applicable to traditional relay transmission technology, and relaying does not need to send self information, from the angle of network, has reduced the throughput of whole network undoubtedly.Collaborative transmission needs more intelligent and transmission policy more efficiently, and coding cooperation is a kind of collaborative transmission policy that meets These characteristics, but the design of encoding is most important.

Network code is the development of an impact occurring again of the communications field in recent years.Thought is that the node in nothing is made an uproar cable network adopts the coding that does not add redundancy, promptly carry out information processing, the information that receives is encoded, and then be routed to destination node at node, broken through the fixed mode of transfer of data all the time, can effectively improve and not have the cable network capacity of making an uproar.But for wireless network, link transmission can have and makes an uproar, and increasing redundant information in coding is the most direct protected mode.The distinctive data-transmission mode of network code---merge in the node information of carrying out, conform to the coding cooperation strategy of collaborative transmission, still, at wireless environment, network code can not directly use, and does not meet the hypothesis of not having the link of making an uproar.

Summary of the invention

Technical problem to be solved by this invention is, can not effectively take into account the problem of system's diversity gain and network throughput at existing collaborative transmission method, a kind of collaborative transmission method based on joint network channel code is provided, can effectively resist the decline of time varying channel, improve transmission of Information speed, improve the bandwidth availability ratio of network and the power utilization of system.

To achieve these goals, the invention provides a kind of collaborative transmission method, comprise the steps: based on joint network channel code

System's parity matrix of tectonic syntaxis network channel code also is stored in source node, via node and destination node; Described system parity matrix comprises source chnnel coding parity matrix, trunk channel encoded parity matrix and network code parity matrix;

Described source node utilizes the generator matrix of described source chnnel coding parity matrix correspondence that source information is encoded, and obtains the information sequence after the source code, and to described via node and the broadcasting of described destination node;

Described via node utilizes the generator matrix of described trunk channel encoded parity matrix correspondence that self information is encoded, and obtains the information sequence after relaying is encoded, and sends to described destination node;

The generator matrix that described via node utilizes described network code parity matrix correspondence after to the source code that receives information sequence and the information sequence behind the described relaying coding encode, obtain the information behind the network code, therefrom extract extra check information sequence, and described extra check information sequence carried out low-density checksum coding, send to described destination node;

Described destination node receives the information sequence of described source node and the transmission of described via node and carries out joint decoding.

Described source chnnel coding parity matrix is positioned at the upper left quarter of described system parity matrix, and the upper left corner element of described source chnnel coding parity matrix is positioned at element place, the described system parity matrix upper left corner; Described trunk channel encoded parity matrix is positioned at the lower right of described source chnnel coding parity matrix, and the upper left corner element of described trunk channel encoded parity matrix is positioned at bottom-right first element place of element, the chnnel coding parity matrix lower right corner, described source; Described source chnnel coding parity matrix and described trunk channel encoded parity matrix do not have the row and column of sharing in described system parity matrix; Described network code parity matrix is positioned at the bottom of described system parity matrix, the columns of described network code parity matrix is identical with the columns of described system parity matrix, the upper left corner element of described network code parity matrix is positioned at first element place, left side of the next line of described trunk channel encoded parity matrix last column, and the lower left corner element of described network parity matrix is positioned at the element place, the lower left corner of described system parity matrix.Described network code parity matrix and source chnnel coding parity matrix and trunk channel encoded parity matrix are shared the distributing position of the element " 1 " of row and are determined by the optimization method of maximization system transmissions speed; The right part of described network code parity matrix adopts accurate to corner structure, and the next line element position of the same row of each element of diagonal entry and diagonal is put set; Except that described source chnnel coding parity matrix, trunk channel encoded parity matrix and network code parity matrix element " 1 " present position, described system other positions of parity matrix are " 0 ".

Adopt time division multiplexing mode transmission information sequence, one time transmission course is divided into two time slots; Information sequence and described via node the information sequence to described destination node send relaying coding after of described source node behind described via node and destination node broadcast source coding all carries out at first time slot; The extra check information sequence of described via node after described destination node sends low-density checksum coding carried out at second time slot.

Technique scheme can effectively be resisted the decline of time varying channel, has improved transmission of Information speed, and has improved the bandwidth availability ratio of network and the power utilization of system greatly.

Below by drawings and Examples, technical scheme of the present invention is described in further detail.

Description of drawings

Fig. 1 is the system transmissions model of the collaborative transmission method based on joint network channel code of the present invention;

Fig. 2 is system's parity matrix one example structure figure of the collaborative transmission method based on joint network channel code of the present invention;

Fig. 3 is the collaborative transmission method one embodiment flow chart based on joint network channel code of the present invention.

Embodiment

The present invention is by the collaborative transmission method of co-design network channel code, and the decline that can effectively resist time varying channel improves transmission of Information speed.

As shown in Figure 1, the system transmissions model for the collaborative transmission method based on joint network channel code of the present invention comprises source node S, via node R and destination node D.Source node S and via node R send data to destination node D, and via node R not only will assist source node S to finish the once task that sends, and also needs to send the information of oneself.

The present invention adopts time division multiplexing, only needs to carry out more meeting the wireless transmission environment synchronously in the frame rank.Suppose the signal transmission experience unit interval one time, transmission course can be divided into two time period t and 1-t.X, V, W and Y are respectively the information that source node S sends, the information that via node R receives, and the information that information that via node R sends and destination node D receive, subscript 1,2 is represented first time slot and second time slot respectively.SR represents the channel of source node to via node, and RD represents the channel of via node to destination node, and SD represents the channel of source node to destination node.

As shown in Figure 2, be system's parity matrix structure chart of the collaborative transmission method based on joint network channel code of the present invention.System's parity check matrix H _SYSCheck-node of every behavior, whenever classify a variable node as, have one " limit " between element in the matrix " 1 " corresponding check-node of representative and the variable node, the information in the decode procedure is constantly upgraded between variable node and check-node along these limits exactly.System's parity check matrix H _SYSComprise M _S* N _SSource chnnel coding parity check matrix H _S, M _R* N _RTrunk channel encoded parity matrix H _R, and N _n* (N _S+ N _R+ N _n) the network code parity check matrix H _nWherein, N _S, N _R, N _nBe respectively the information sequence length after destination node first time slot receives source code, the information sequence length behind the relaying coding, and the information sequence length behind the second Timeslot source node and the via node process network code; M _S=N _S-K _S, M _R=N _R-K _R, wherein, K _S, K _RBe respectively the preceding information sequence length of source node and via node coding.

Source chnnel coding parity check matrix H _SBe positioned at system's parity check matrix H _SYSUpper left quarter, source chnnel coding parity check matrix H _SUpper left corner element be positioned at system's parity check matrix H _SYSElement place, the upper left corner.Trunk channel encoded parity matrix H _RBe positioned at source chnnel coding parity check matrix H _SThe lower right, trunk channel encoded parity matrix H _RUpper left corner element be positioned at source chnnel coding parity check matrix H _SBottom-right first element of lower right corner element.H _SAnd H _RThere is not shared row and column.The network code parity check matrix H _nBe positioned at system's parity check matrix H _SYSThe bottom, the network code parity check matrix H _nColumns and system's parity check matrix H _SYSColumns identical, the network code parity check matrix H _nUpper left corner element be positioned at trunk channel encoded parity matrix H _RFirst element place, the left side of the next line of last column, the network parity check matrix H _nLower left corner element be positioned at system's parity check matrix H _SYSElement place, the lower left corner.Remove source chnnel coding parity check matrix H _S, trunk channel encoded parity matrix H _RAnd network code parity check matrix H _nOutside the position of element " 1 ", system's parity check matrix H _SYSOther positions are " 0 ".

H _SYSMust meet following restriction as system's parity matrix:

$H_n{[{X_{S,1}}^{N_S},{X_{R,1}}^{N_R},{X_{n,1}}^{N_n}]}^T=0;$ $H_S{\left[{X_{S,1}}^{N_S}\right]}^T=0;$ $H_R={\left[{X_{R,1}}^{N_R}\right]}^T=0$

$R_{\mathrm{sys}}=\frac{K_S+K_R}{N_S+N_R+N_n},N_R=\mathrm{\β}{N}_S,N_n=\mathrm{\γ}{N}_S$

Symbol X _i ^jExpression X _i, X _I+1..., X _j, j＞i, X _{S, 1} ^NS, X _{R, 1} ^NR, X _{N, 1} ^NnBe respectively the information sequence after destination node first time slot receives source code, the information sequence behind the relaying coding and second Timeslot source and relaying are through the check information sequence behind the network code.

R _SYSBe system transmissions speed.

The beta, gamma corpse is respectively the information sequence length and the ratio of the information sequence length after the source code behind the relaying coding, reaches the information sequence length ratio of information after check information sequence length behind the network code and the source code.

With the structure of Fig. 2, under the condition of given noise, by the maximization speed R of system _SYSOptimization method determine the network code parity check matrix H _nWith source chnnel coding parity check matrix H _SWith trunk channel encoded parity matrix H _RShare the distributing position of the element " 1 " of row, system's parity check matrix H of tectonic syntaxis planned network one chnnel coding _SYSThereby, guarantee decoding performance effectively, obtain good diversity gain.

H _nDesign except that considering that it to the verifying function that source node and via node provided, needs also to consider the network code complexity that the embodiment of the invention is at H _SYSThe lower right corner adopt accurately to corner structure, the next line element position of the same row of each element of diagonal entry and diagonal is put set.Thereby, simplified cataloged procedure, the control encoder complexity is～O (N _n).

Maximization system transmissions speed R _SYS, promptly the optimizing process of co-design network one channel coding rate is as follows.

Known variables comprises: interchannel noise, the code rate of source node and via node.Final separate for maximum system transmission rate R _SYSCorresponding LDPC degree distribution (λ (x), ρ (x)), $\mathrm{\λ}\left(x\right)=\underset{i=2}{\overset{d_v}{\mathrm{\Σ}}}{\mathrm{\λ}}_i{x}^{i-1},$ $\mathrm{\ρ}\left(x\right)=\underset{i=2}{\overset{d_c}{\mathrm{\Σ}}}{\mathrm{\ρ}}_i{x}^{i-1}$ Be with $\mathrm{\λ}=[{\mathrm{\λ}}_2...{\mathrm{\λ}}_{d_v}],$ $\mathrm{\ρ}=[{\mathrm{\ρ}}_2...{\mathrm{\ρ}}_{d_c}]$ Be the multinomial of coefficient, λ _i(ρ _i) expression is that with degree the quantity on " limit " that variable (verification) node of " i " links to each other accounts for the ratio of total limit number.After having determined the degree distribution (λ (x), ρ (x)) of LDPC,, just can obtain corresponding check matrix by placing " 1 " of satisfying above-mentioned distribution at random.

System transmissions speed R _SYSWith the pass of (λ (x), ρ (x)) be: $R_{\mathrm{sys}}=1-{\∫}_0^1\mathrm{\ρ}\left(x\right)\mathrm{dx}/{\∫}_0^1\mathrm{\λ}\left(x\right)\mathrm{dx}.$ In order to simplify the optimizing process of LDPC sign indicating number, built-in check node distribution ρ (x) finds the solution optimum λ (x).Concrete optimizing process is as follows:

At first be optimized condition setting:

Introduce the notion of node degree, promptly spend the ratio that accounts for total variable node number for the variable node of " i ",

${\mathrm{\λ}}_i^N=\frac{{\mathrm{\λ}}_i/i}{{\mathrm{\Σ}}_{i=2}^{\mathrm{dv}}\frac{{\mathrm{\λ}}_i}{i}}$

With matrix H _SYSBe divided into three parts such as Fig. 2, H _SYS1, H _SYS2, H _SYS3, their check-node degree is respectively: ρ _SYS1, ρ _SYS2, ρ _SYS3ρ _S, ρ _R, ρ _SYSBe respectively H _S, H _R, H _SYSThe check-node degree distribute.ρ _S, ρ _RHas following structure: ρ _S=x ^I-1, ρ _R=x ^J-1

ρ _SYSThe check-node degree be distributed as:

${\mathrm{\&rho;}}_{\mathrm{sys}1}=\frac{{\mathrm{ax}}^{k-1}+{\mathrm{bx}}^{i-1}}{a+b+c+d+e},$ ${\mathrm{\&rho;}}_{\mathrm{<figure-callout\; id="2"\; label="sys"\; filenames="A20071011871700171.png"\; state="\{\{state\}\}">sys</figure-callout>}2}=\frac{{\mathrm{cx}}^{l-1}+{\mathrm{dx}}^{j-1}}{a+b+c+d+e}$

a＝γ·k；b＝(1-R _S)·i；c＝γ·l；d＝(1-R _R)β·j；e≈γ·2

I, j, k, l are the degree of node.

ρ _SYS1The check-node degree concentrate and to be two parts, one is spent the former H for i _S, its two, the redundancy check node degree that network code provides is k, k＜i.ρ _SYS2Also has same structure.ρ _SYS3Structure: ρ _SYS3=2.

Target function: $\max R=\max (1-\&Integral;\mathrm{\&rho;}\left(x\right)\mathrm{dx}\&CenterDot;\underset{i=2}{\overset{\mathrm{dv}}{\mathrm{\&Sigma;}}}i{\mathrm{\&lambda;}}_i^N)$ Be equal to

Structural limitations: ${\mathrm{\&lambda;}}_S^N\left(1\right)={\mathrm{\&lambda;}}_R^N\left(1\right)={\mathrm{\&lambda;}}_{\mathrm{SYS}}^N\left(1\right)=1$

Stability limit: decoding can stable convergence, and degree is that 2 node must satisfy certain restriction, is stability condition, and be converted into the node corresponding kilsyth basalt and show.Source chnnel coding parity matrix, trunk channel encoded parity matrix and system's parity matrix all will satisfy this condition.

$\frac{2{\mathrm{\&lambda;}}_{\mathrm{\&zeta;},2}^N}{{\mathrm{\&Sigma;}}_{i=2}^{\mathrm{dv}}i{\mathrm{\&lambda;}}_{\mathrm{\&zeta;},i}^N}<\frac{e^{1/2{\mathrm{\&sigma;}}_{\mathrm{\&zeta;}}^2}}{{\mathrm{\&Sigma;}}_{j=2}^{\mathrm{dc}}{\mathrm{\&rho;}}_{\mathrm{\&zeta;},j}(j-1)},\mathrm{\&zeta;}=S,R,\mathrm{SYS}$

The decoding success restriction: utilize Gauss's approximate algorithm to realize, under given noise gate, optimum node degree distributes and must satisfy:

${\mathrm{\&Sigma;}}_{i=2}^{\mathrm{dv}}i{\mathrm{\&lambda;}}_{\mathrm{\&zeta;},i}^N{h}_i(s,r)-r<0,$

r∈(0，φ(s))，ζ＝S，R，SYS

Wherein: $h_i(s,r)=\mathrm{\&phi;}(s+(i-1){\mathrm{\&Sigma;}}_{j=2}^{d_c}{\mathrm{\&rho;}}_j{\mathrm{\&phi;}}^{-1}(1-{(1-r)}^{j-1})),$ S=2/ σ ², σ ²Be the variance of interchannel noise, $\mathrm{\&phi;}\left(x\right)=\left\{\begin{array}{cc}1& x=0\\ 1-\frac{1}{\sqrt{4\mathrm{\&pi;x}}}{\&Integral;}_R\tanh \frac{u}{2}{e}^{-\frac{{(u-x)}^2}{4x}}\mathrm{du}& x>0\end{array}\right.$

Co-design restriction: under co-design network channel code mechanism, if make network code can be effectively for source node and via node provide redundancy check, then must satisfy certain design limit:

$\underset{i=j}{\overset{\max (d_{v1},{\mathrm{<figure-callout\; id="2"\; label="d\; v"\; filenames="A20071011871700171.png"\; state="\{\{state\}\}">d</figure-callout>}}_v,d_{\mathrm{vsys}})}{\mathrm{\&Sigma;}}}{\mathrm{\&lambda;}}_{\mathrm{sys},i}^N\&GreaterEqual;\underset{i=j}{\overset{\max (d_{v1},{\mathrm{<figure-callout\; id="2"\; label="d\; v"\; filenames="A20071011871700171.png"\; state="\{\{state\}\}">d</figure-callout>}}_v,d_{\mathrm{vsys}})}{\mathrm{\&Sigma;}}}\frac{{\mathrm{\&lambda;}}_{S,i}^N+{\mathrm{\&beta;\&lambda;}}_{R,i}^N+[\mathrm{\&gamma;},0,...,0]}{1+\mathrm{\&beta;}+\mathrm{\&gamma;}}$

 j=2,3 ..., max (d _V1, d _V2, d _Vsys) sign indicating number speed limit system:

$R_{\mathrm{\&zeta;}}=1-\frac{m}{n}=1-\frac{{\&Integral;}_0^1{\mathrm{\&rho;}}_{\mathrm{\&zeta;}}\left(x\right)\mathrm{dx}}{{\&Integral;}_0^1{\mathrm{\&lambda;}}_{\mathrm{\&zeta;}}\left(x\right)\mathrm{dx}}$

$=1-\left({\&Integral;}_0^1{\mathrm{\&rho;}}_{\mathrm{\&zeta;}}\left(x\right)\mathrm{dx}\right)\left({\mathrm{\&Sigma;}}_{i=2}^{\mathrm{dv}}i{\mathrm{\&lambda;}}_{\mathrm{\&zeta;},i}^N\right)$

ζ＝S，R，SYS

The embodiment of the invention utilizes above-mentioned optimizing process and project organization can obtain system's parity check matrix H of co-design network channel code _SYSSystem's parity matrix comprises H _S, H _RAnd H _nUtilize these three submatrixs can obtain respective coding generator matrix G respectively _S, G _RAnd G _n

When collaborative transmission, source node utilizes source chnnel coding parity check matrix H _SSource information is encoded, obtain the information after the source code, and to via node R and destination node D broadcasting.Via node R utilizes trunk channel encoded parity matrix H _RThe information that receives from source node is encoded, obtain the information after relaying is encoded, and send to destination node D.Via node R utilizes the network code parity check matrix H _nThe information and the self information that receive from source node are encoded, obtain the information behind the network code, therefrom extract extra check information, and extra check information is carried out low-density checksum coding, send to destination node D.Destination node D receives the information of source node S and via node R transmission, joint decoding.

As shown in Figure 3, for the collaborative transmission method one embodiment flow chart based on joint network channel code of the present invention, comprise the steps:

Step 1, the tectonic syntaxis network-channel system parity check matrix H of passing through _SYS, the design joint network channel code; The distribution of each element is by maximization system transmissions speed R in the matrix _SYSOptimization method determine;

Step 2, first time slot: source information is with bit rate R _SR=I (X ₁V ₁), through H _S

Source node S is utilized M _S* N _SSource chnnel coding parity matrix be K to code length _S=N _S-M _SInformation encode, obtaining code length is N _SSource code after information sequence, and to via node R and destination node D broadcasting; Via node R deciphers after receiving information sequence, and it is to be decoded that destination node D receives behind the information sequence that storage does not process etc.;

Step 3, first time slot: trunk information is with speed R _RD1=I (W ₁Y ₁| X ₁), through H _R

Via node R utilizes M _R* N _RTrunk channel encoded parity matrix be K to code length _R=N _R-M _RSelf information encode, obtaining code length is N _RRelaying coding after information sequence, send to destination node D, it is to be decoded that destination node D receives behind the information sequence that storage does not process etc.;

Step 4, second time slot: via node R is N with the code length that the self information coding is obtained _RRelaying coding back information sequence and the code length that receives be N _SSource code after information sequence as information node, with N _nAs check-node with N _n* (N _S+ N _R+ N _n) the network code parity check matrix H _nEncode, this process is considered as network code, and obtaining code length is (N _S+ N _R+ N _n) network code after information sequence, this information sequence is divided into three parts, is respectively that code length is N _S, N _RAnd N _nInformation sequence, wherein, code length is N _SAnd N _RInformation in the first slot transmission mistake, therefore, extracting code length the information behind network code is N _nInformation sequence as extra check information sequence, be R through bit rate again _SD2LDPC coding after send to destination node D.

Step 5, in second time slot when end, destination node D joint decoding obtains the information sequence from source node S and via node R.Destination node D deciphers in the extra check information sequence behind the LDPC coding that second time slot receives from the relaying node R it, and obtaining code length is N _nExtra check information sequence.Then, destination node D is with joint network channel code system parity check matrix H _SYSBe the Tanner figure that information is transmitted, the code length that the corresponding successively destination node D of the variable node of matrix receives from source node S is N _SSource code after information sequence X _{S, 1} ^NS, the code length that receives from the relaying node R is N _RRelaying coding after information sequence X _{R, 1} ^NRDeciphering the code length that obtains before this is N _nExtra check information sequence X _{N, 1} ^NnThis three partial informations sequence experiences the decline and the noise of three channels respectively, the signal that receives has comprised channel information independent of each other, Tanner figure by a system shares and transmits the likelihood ratio of each bit, can effectively improve decoding efficiency and success rate.

In second time slot, source node can selectively send fresh information or same information to destination node D according to channel condition.When channel condition is relatively good, can select to send new information encoded; When channel condition is poor, can select the information after the source code in the forwarding step 2.

In execution in step 1 tectonic syntaxis network-channel system parity check matrix H _SYSAfter, when transmitting information at every turn, only need repeat above-mentioned steps 2-5, and not need tectonic system parity check matrix H once more _SYS

The foregoing description is a system model with the junction network of three nodes, joint network channel code method based on the low density parity check code realization has been proposed, this method make network code complexity and code length linear～O (n), make it successfully be used for collaborative transmission; With maximization system speed is target, and the parity matrix structure of joint network channel code is optimized, and under same noise gate, has improved system transmissions speed, has saved bandwidth resources; The invention provides a kind of collaborative transmission method based on joint network channel code, this transmission method can effectively resist channel fading under wireless environment, and take into account network throughput, be via node to the source node information decoding after, combine with self information and carry out network code, the information behind the coding is as redundancy check information, for source node and via node provide effective diversity gain, overcome network code intrinsic defective under wireless environment, and a kind of effective application is provided.

It should be noted that at last: above embodiment only in order to explanation the present invention's (utility model) technical scheme, is not intended to limit; Although the present invention/utility model is had been described in detail with reference to previous embodiment, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of each embodiment technical scheme of the present invention's (utility model).

Claims (7)

1, a kind of collaborative transmission method based on joint network channel code is characterized in that, described method comprises:

System's parity matrix of tectonic syntaxis network channel code also is stored in source node, via node and destination node; Described system parity matrix comprises source chnnel coding parity matrix, trunk channel encoded parity matrix and network code parity matrix;

Described source node utilizes the generator matrix of described source chnnel coding parity matrix correspondence that source information is encoded, and obtains the information sequence after the source code, and to described via node and the broadcasting of described destination node;

Described via node utilizes the generator matrix of described trunk channel encoded parity matrix correspondence that self information is encoded, and obtains the information sequence after relaying is encoded, and sends to described destination node;

The generator matrix that described via node utilizes described network code parity matrix correspondence after to the source code that receives information sequence and the information sequence behind the described relaying coding encode, obtain the information behind the network code, therefrom extract extra check information sequence, and described extra check information sequence carried out low-density checksum coding, send to described destination node;

Described destination node receives the information sequence of described source node and the transmission of described via node and carries out joint decoding.

2, the collaborative transmission method based on joint network channel code according to claim 1 is characterized in that:

Described source chnnel coding parity matrix is positioned at the upper left quarter of described system parity matrix, and the upper left corner element of described source chnnel coding parity matrix is positioned at element place, the described system parity matrix upper left corner;

The position of described trunk channel encoded parity matrix in described system parity matrix is positioned at the lower right of described source chnnel coding parity matrix, and the upper left corner element of described trunk channel encoded parity matrix is positioned at bottom-right first element place of element, the chnnel coding parity matrix lower right corner, described source;

Described source chnnel coding parity matrix and described trunk channel encoded parity matrix do not have the row and column of sharing in described system parity matrix;

Described network code parity matrix is positioned at the bottom of described system parity matrix, the columns of described network code parity matrix is identical with the columns of described system parity matrix, the upper left corner element of described network code parity matrix is positioned at first element place, left side of the next line of described trunk channel encoded parity matrix last column, and the lower left corner element of described network parity matrix is positioned at the element place, the lower left corner of described system parity matrix.

3, the collaborative transmission method based on joint network channel code according to claim 2 is characterized in that: described network code parity matrix and source chnnel coding parity matrix and trunk channel encoded parity matrix are shared the distributing position of the element " 1 " of row and are determined by the optimization method of maximization system transmissions speed.

4, the collaborative transmission method based on joint network channel code according to claim 2, it is characterized in that: the right part of described network code parity matrix adopts accurate to corner structure, and the next line element position of the same row of each element of diagonal entry and diagonal is put set; Element " 1 " present position, described system other positions of parity matrix are " 0 " in described source chnnel coding parity matrix, trunk channel encoded parity matrix and network code parity matrix.

5, the collaborative transmission method based on joint network channel code according to claim 1 is characterized in that, adopts time division multiplexing mode transmission information sequence, and one time transmission course is divided into two time slots; Information sequence and described via node the information sequence to described destination node send relaying coding after of described source node behind described via node and destination node broadcast source coding all carries out at first time slot; The extra check information sequence of described via node after described destination node sends low-density checksum coding carried out at second time slot.

6, the collaborative transmission method based on joint network channel code according to claim 5, it is characterized in that, described source node described second time slot according to channel condition after described destination node sends described source code information or the information after the new source code.

7, the collaborative transmission method based on joint network channel code according to claim 1, it is characterized in that, described destination node receives the information sequence of described source node and the transmission of described via node and carries out joint decoding and is specially: at the second time slot end, described destination node with the described system parity matrix of self storage as the information transitive graph, to information sequence behind the information sequence after the source code that receives, the relaying coding and extra check information sequence association decoding.

Images