CN104219026A - United network code relay transmission method based on 3D (three dimensional) Turbo code - Google Patents
United network code relay transmission method based on 3D (three dimensional) Turbo code Download PDFInfo
- Publication number
- CN104219026A CN104219026A CN201410482373.7A CN201410482373A CN104219026A CN 104219026 A CN104219026 A CN 104219026A CN 201410482373 A CN201410482373 A CN 201410482373A CN 104219026 A CN104219026 A CN 104219026A
- Authority
- CN
- China
- Prior art keywords
- sequence
- verification
- bit
- code
- turbo
- 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.)
- Pending
Links
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention discloses a united network code relay transmission method based on a 3D (three dimensional) Turbo code. The united network code relay transmission method based on the 3D Turbo code mainly solves the problem that distributed 3D Turbo code relay use rate is low in the prior art. The united network code relay transmission method based on the 3D Turbo code includes the steps that (1) a modulating signal sequence is obtained; (2) information is broadcasted; (3) a relay node performs Turbo decoding; (4) the relay node performs Turbo coding; (5) a check bit is selected; (6) the relay node performs network coding; (7) a third dimension code modulation sequence is obtained; (8) destination nodes unite to perform decoding. The united network code relay transmission method based on the 3D Turbo code uses the network coding to combine two paths of signals on the relay node, and then transmita the two paths of the signals, and thereby can effectively improve use rate of the relay node. The united network code relay transmission method based on the 3D Turbo code can achieve effective compromise of coding performance and system complexity by changing numerical values of a permeability coefficient, and is suitable for a wireless multiple access system.
Description
Technical field
The invention belongs to communication technical field, further relate to multiple access technique, a kind of combined with network coding relay transmission method based on 3-D Turbo code in joint network channel code and relay cooperative communication technology field.The present invention is at via node place by network code, carries out third dimension coding, form the relay transmission method of a 3-D Turbo code on the whole after two user data accessed by multiple access merge.
Background technology
Utilize relay cooperative transmission technology, extra transmission gain can be obtained, thus can improve the frame error rate performance of destination, effectively can improve the speech quality at edge, mobile user cell.
In traditional collaboration diversity communication, via node forwards after different time-gap processes respectively the multiple signals received.The collaboration communication of coding Network Based allows via node to carry out network code merging to the data received from multiple source node, and the data retransmission then obtained encoding is to destination node.
A kind of relay transmission method based on distributed 3-D Turbo code is proposed in the patent " relay transmission method based on distributed 3-D Turbo code " (application number: 201310030692.X) of Xian Electronics Science and Technology University's application.The trunk channel model of the method comprises a source node, a via node and a destination node, need two time slots to complete whole communication process altogether: first time slot, source node broadcast data is to via node R and destination node D, second time slot, the first decoding of signal that via node will receive, then encode, again third dimension coding is carried out to the part check digit of code word after coding, then code word is forwarded to destination node.The signal that destination node utilizes first time slot direct link to send and repeated link go out the data message of source node at the signal recuperation that second time slot sends.The method is applicable to containing a source node, the trunk channel model of a via node and a destination node.The deficiency that the method exists is: when the multiple access system that two source nodes or multiple source node are formed uses the method to communicate, each source node all needs a relay station, too much relay station can improve the expense of communication network, causes the waste of relay resource.
Summary of the invention
The object of the invention is for the deficiency in above-mentioned prior art, a kind of improving one's methods newly is proposed, namely a kind of relay transmission method of the combined with network coding based on 3-D Turbo code is proposed, under the prerequisite that ensure that destination frame error rate performance, reduce the expense of communication network, take full advantage of relay station.
For achieving the above object, technical thought of the present invention is: first source node to two independently source node identification adopt traditional Turbo code to encode; Secondly carry out the decoding of Turbo code at via node place to received signal, obtain the estimated information of two source nodes; Again Turbo code coding is re-started to its estimated information, then carry out selection check bit by coefficient method, after network code is carried out to the check bit after selection, carry out third dimension coding again; Finally carry out joint decoding in destination node.
The present invention realizes as follows:
(1) modulated signal sequences is obtained:
(1a) two source node S
1and S
2respectively to the original information sequence u of oneself
1and u
2carry out Turbo code coding, obtain the code word T after encoding
1and T
2;
(1b) to the code word T after coding
1and T
2carry out binary system respectively and shift to keying BPSK modulation, obtain the burst C after modulating
1and C
2;
(2) broadcast message:
(2a) during the first time slot, source node S
1burst C is sent to destination node and relay node broadcasts
1;
(2b) during the second time slot, source node S
2burst C is sent to destination node and relay node broadcasts
2;
(3) via node carries out Turbo decoding:
Via node is sequence C to the received signal
1and C
2carry out Turbo decoding respectively, obtain original information sequence u
1and u
2estimated sequence
with
(4) via node carries out Turbo coding:
(4a) via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence
two verification sequence P that length is identical
1and P
2;
(4b) via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence
two verification sequence P that length is identical
3and P
4;
(5) selection check bit:
Adopt infiltration coefficient system of selection, respectively to verification sequence P
1, P
2, P
3, P
4select, obtain the verification sequence D after selecting
1, D
2, E
1, E
2;
(6) via node carries out network code:
Adopt bit alternately to merge method, via node is to the verification sequence D after selection
1, D
2, E
1, E
2carry out network code, obtain the sequence D to be encoded of the third dimension;
(7) third dimension coded modulation sequence is obtained:
(7a) via node is sent in third dimension encoder after interweaving to third dimension sequence D to be encoded, obtains third dimension coding checkout sequence P;
(7b) via node carries out binary phase shift keying BPSK modulation to third dimension coding checkout sequence P, obtains the sequence P ' after third dimension coded modulation, and the sequence P ' after third dimension coded modulation is sent to destination node;
(8) destination node joint decoding:
(8a) in the interval of [1,1000], the iterations of joint decoding is selected arbitrarily;
(8b), after destination node receives the information P ' of via node, external information sequence L ' is translated with the decoder of the third dimension;
(8c) external information sequence L ' is by deinterleaver, obtains the external information sequence L after deinterleaving;
(8d) the external information sequence L after deinterleaving, has the deserializer of an input and four outputs by one, obtain the verification external information sequence L that four length is equal
1, L
2, L
3, L
4;
(8e) destination node is to burst C
1received signal strength carry out Turbo decoding, obtain source node S
1two components verification external information sequence X
1and X
2;
(8f) destination node is to burst C
2received signal strength carry out Turbo decoding, obtain source node S
2two components verification external information sequence X
3and X
4;
(8g) component is verified external information sequence X by destination node
1and X
2respectively with verification external information sequence L
1and L
2merge, obtain two-dimentional check information sequence Y
1and Y
2;
(8h) component is verified external information sequence X by destination node
3and X
4respectively with verification external information sequence L
3and L
4merge, obtain two-dimentional check information sequence Y
3and Y
4;
(8i) destination node is by two-dimentional verification sequence Y
1and Y
2send into burst C
1turbo decoder in, with code word C
1joint decoding, translates component verification external information sequence X
1and X
2renewal sequence;
(8j) destination node is by two-dimentional verification sequence Y
3and Y
4send into burst C
2turbo decoder in, with code word C
2joint decoding, translates component verification external information sequence X
3and X
4renewal sequence;
(8k) adopt infiltration coefficient back-and-forth method, destination node is respectively to the component verification sequence X upgraded
1, X
2, X
3, X
4select, obtain the component verification sequence M after selecting
1, M
2, M
3, M
4;
(8l) destination node is to component verification sequence M
1, M
2, M
3, M
4in bit put in order according to it and alternately merge, obtain the verification sequence M after merging, verification sequence M sent in third dimension decoder, as the prior information of third dimension decoder;
(8m) destination node D judges whether to reach the iterations of selected joint decoding, if so, exports decode results by Turbo decoder, otherwise, perform step (8b).
The present invention and compared with prior art tool have the following advantages:
First, because the present invention is transmitted by same via node after via node place carries out network code to the information coming from two source nodes again, a relay station is needed to cooperate when overcoming each source node transmission in prior art, cause the deficiency that relay resource is wasted, the present invention made has lower communication network expense.
Second, because the present invention is under the cooperation of via node, first the coding of the third dimension is carried out after the information network coding of two source node users being merged again, form a 3-D Turbo code on the whole, and then carry out forwarding transmission, finally carry out joint iterative decoding in destination node, under the prerequisite having ensured receiving terminal frame error rate performance, overcome prior art and be only applicable to a source node, the deficiency of the model of communication system of a via node and a destination node, the present invention made has multiple access system and applies more widely.
Accompanying drawing explanation
Fig. 1 is wireless multiple access of the present invention access junction network model schematic.
Fig. 2 is flow chart of the present invention.
Fig. 3 be the present invention in fixed relay station position, the transmission of distributed 3-D Turbo code and based on the combined with network coding transmission of 3-DTurbo code in the decoding performance analogous diagram of destination node.
Fig. 4 is the position of the present invention at fixed relay station, and the 3-D Turbo code combined with network coding transmission under different infiltration coefficient is in the decoding performance analogous diagram of destination node.
Embodiment
Below in conjunction with accompanying drawing, the present invention will be further described.
The present invention realizes in wireless multiple access access junction network.With reference to accompanying drawing 1, multiple access access junction network of the present invention is by two source node S
1, S
2, a via node R and destination node D forms.First time slot, source node S
1message is sent to destination node and via node.Second time slot, source node S
2message is sent to destination node and via node.3rd time slot, after the message that via node process two source nodes send over, sends it to destination node.Destination node receives source node S
1, S
2after the message that via node R sends over, carry out joint decoding.
With reference to accompanying drawing 2, the step that the present invention realizes is specifically described.
Step 1, obtains modulated signal sequences.
Two source node S
1and S
2respectively to the original information sequence u of oneself
1and u
2carry out Turbo code coding, obtain the code word T after encoding
1and T
2.
The realization of this step is as follows.
Source node S
1to original information sequence u
1carry out Turbo coding, obtain coded sequence T
1=(u
1, p
11, p
12), wherein, u
1it is source node S
1coded sequence T
1information sequence, p
11 is source node S
1coded sequence T
1the verification sequence of first component code; p
12 is source node S
1coded sequence T
1the verification sequence of second component code.
Source node S
2to original information sequence u
2carry out Turbo coding, the coded sequence T obtained
2=(u
2, p
21, p
22), wherein, u
2it is source node S
2coded sequence T
2information sequence, p
21 is source node S
2coded sequence T
2the verification sequence of first component code; p
22 is source node S
2coded sequence T
2the verification sequence of second component code; The Turbo coding method that source node uses can be chosen any one kind of them from existing method, and concrete grammar is see " error control coding " (Shu Lin, Daniel J.Costello, Jr., China Machine Press, 2007).
To the code word T after coding
1and T
2carry out binary system respectively and shift to keying BPSK modulation, obtain the burst C after modulating
1and C
2.
Step 2, broadcast message.
Source node S
1burst C is sent to destination node and relay node broadcasts
1.
Source node S
2burst C is sent to destination node and relay node broadcasts
2.
The signal that destination node and via node receive is expressed as:
Wherein, y
r,irepresent the signal that via node receives, { 1,2} represents source node S to i ∈
1and S
2, h
r,irepresent source node S
iand the channel fading coefficient between via node RN, E
srepresent the transmitting power of source node, c
isignal after presentation code modulation, n
r,irepresent the channel additive white Gaussian noise between via node and destination node; y
d,irepresent the signal that destination node receives, h
d,irepresent source node S
iand the channel fading coefficient between destination node D, n
d,irepresent source node S
iand the channel additive white Gaussian noise between destination node.
Step 3, via node carries out Turbo decoding.
Via node is sequence C to the received signal
1and C
2received signal strength carry out Turbo decoding, obtain source node S
1and S
2original information sequence u
1and u
2estimated sequence
with
turbo interpretation method can be chosen any one kind of them from existing method, and concrete grammar is see " error control coding " (Shu Lin, Daniel J.Costello, Jr., China Machine Press, 2007).
Step 4, via node carries out Turbo coding.
Via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence
two verification sequence P that length is identical
1and P
2.
Via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence u
2two verification sequence P that length is identical
3and P
4.
Step 5, selection check bit.
Adopt infiltration coefficient system of selection, respectively to verification sequence P
1, P
2, P
3, P
4select, obtain the verification sequence D after selecting
1, D
2, E
1, E
2.
The step of infiltration coefficient system of selection is as follows:
The first step, via node, in [0,1] interval, chooses arbitrarily a value of infiltration coefficient λ.
Second step, respectively by four verification sequence P
1, P
2, P
3, P
4be divided into the little verification sequence block comprising a 1/ λ bit, wherein, λ represents infiltration coefficient.
3rd step, the bit selecting arrangement position identical from the composition bit of each little verification sequence block successively, by the bit selected according to the order arrangement selected, obtains the verification sequence D of four verification sequence after selecting
1, D
2, E
1, E
2.
Step 6, via node carries out network code.
Adopt bit alternately to merge method, via node is to the verification sequence D after selection
1, D
2, E
1, E
2carry out network code, obtain the sequence D to be encoded of the third dimension.
The step that bit replaces merging method is as follows:
The first step, according to verification sequence D
1putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
Second step, according to verification sequence D
2putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
3rd step, according to verification sequence E
1putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
4th step, according to verification sequence E
2putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
5th step, is arranged in order the bit that above-mentioned steps extracts, as the composition bit of third dimension sequence to be encoded;
6th step, judges verification sequence E
2in number of bits whether be 0, if so, then via node to select after verification sequence D
1, D
2, E
1, E
2the network code carried out terminates, and obtains the sequence D to be encoded of the third dimension, otherwise, perform the first step.
Step 7, obtains third dimension coded modulation sequence.
Relaying is sent in third dimension encoder after interweaving to third dimension sequence D to be encoded, obtains coding checkout sequence P.
Via node carries out binary phase shift keying BPSK modulation to coding checkout sequence P, obtains the sequence P ' after modulating, the sequence P ' after third dimension coded modulation is sent to destination node.
Step 8, destination node joint decoding.
(8.1) in the interval of [1,1000], the iterations of joint decoding is selected arbitrarily.
(8.2), after destination node receives the sequence P ' of via node transmission, external information sequence L ' is translated with the decoder of the third dimension.
(8.3) external information sequence L ' is by deinterleaver, obtains the external information sequence L after deinterleaving.
(8.4) the external information sequence L after deinterleaving, has the deserializer of an input and four outputs by one, obtain the verification external information sequence L that four length is equal
1, L
2, L
3, L
4.
(8.5) destination node is to burst C
1received signal strength carry out Turbo decoding, obtain source node S
1two components verification external information sequence X
1and X
2.
(8.6) destination node is to the code word C received
2carry out Turbo decoding, obtain source node S
2two components verification external information sequence X
3and X
4.
(8.7) component is verified external information sequence X by destination node
1and X
2respectively with verification external information sequence L
1and L
2merge, obtain two-dimentional check information sequence Y
1and Y
2.
(8.8) component is verified external information sequence X by destination node
3and X
4respectively with verification external information sequence L
3and L
4merge, obtain two-dimentional check information sequence Y
3and Y
4.
(8.9) destination node is by two-dimentional verification sequence Y
1and Y
2send into burst C
1turbo decoder in, with code word C
1joint decoding, translates component verification external information sequence X
1and X
2renewal sequence.
(8.10) destination node is by two-dimentional verification sequence Y
3and Y
4send into burst C
2turbo decoder in, with code word C
2joint decoding, translates component verification external information sequence X
3and X
4renewal sequence.
(8.11) destination node adopts infiltration coefficient back-and-forth method, respectively to component verification sequence X
1, X
2, X
3, X
4select, obtain the component verification sequence M after selecting
1, M
2, M
3, M
4.
The step of infiltration coefficient back-and-forth method is as follows:
The first step, respectively by four verification sequence X
1, X
2, X
3, X
4be divided into the little verification sequence block comprising a 1/ λ bit, wherein, λ represents infiltration coefficient.
Second step, the bit selecting arrangement position identical from the composition bit of each little verification sequence block successively, by the bit selected according to the order arrangement selected, obtains the verification sequence M of four verification sequence after selecting
1, M
2, M
3, M
4.
(8.12) destination node is to component verification sequence M
1, M
2, M
3, M
4in bit put in order according to it and alternately merge, obtain the verification sequence M after merging, verification sequence M sent in third dimension decoder, as the prior information of third dimension decoder.
(8.13) destination node D judges whether to reach the iterations of selected joint decoding, if so, exports decode results by Turbo decoder, otherwise, perform step (8.2).
Below in conjunction with analogous diagram, effect of the present invention is described further.
1, simulated conditions:
The message length arranging user S1 and S2 is 1024, and the Turbo code standard criterion in LTE selected by source node encoder, and generator matrix is G (D)=[1, (1+D
2+ D
3)/(1+D+D
3)], code check is 1/2, wherein uses binomial to replace the parameter f 1=465 of QPP interleaver, f2=224 in Turbo coding.The third dimension encoder employing code check at via node place is the circular convolution rsc encoder of 1, generator matrix
] wherein, the parameter of the binomial displacement QPP interleaver that relaying place uses is f1=71, f2=172.Suppose that the transmitted power of each node is all identical, all channels are slow fading rayleigh channel, and decoder iteration number of times is 16 times.
2, content is emulated:
Emulation experiment 1 of the present invention.Fixed relay station position is 1/2 place that source node arrives destination node, and the destination node decoding performance for distributed 3-D Turbo code relay transmission method and 3-D Turbo code combined with network coding relay transmission method emulates.
Fig. 3 be the present invention in fixed relay station position, the transmission of distributed 3-D Turbo code and based on the combined with network coding transmission of 3-DTurbo code in the decoding performance analogous diagram of destination node.As shown in Figure 3, the abscissa in Fig. 3 represents that source node arrives the signal to noise ratio of destination node to the result of emulation experiment, and ordinate represents the frame error rate FER of destination node.Leg-of-mutton solid line is with to represent frame error rate performance simulation curve of the present invention in Fig. 3.Solid-line curve with circle represents the frame error rate performance simulation curve of distributed 3-D Turbo code relay transmission method.
As seen from Figure 3, be obviously positioned under the solid line being with circle with leg-of-mutton solid line, represent under identical signal to noise ratio, the present invention is better than the frame error rate of distributed 3-D Turbo code relay transmission method in destination node in the frame error rate of destination node
Emulation experiment 2 of the present invention.The position of fixed relay station, is located at 1/2 place of source node to destination node, selects different infiltration coefficients, emulates the destination node decoding performance of 3-D Turbo code combined with network coding relay transmission method.Fig. 4 is the position of the present invention at fixed relay station, and the 3-D Turbo code combined with network coding transmission under different infiltration coefficient is in the decoding performance analogous diagram of destination node.As shown in Figure 4, abscissa represents that source node arrives the signal to noise ratio of destination node to simulation result, and ordinate represents the frame error rate of destination node decoding.The meaning that in Fig. 4, each curve represents is as follows: the curve of band circle represents that infiltration coefficient is the frame error rate performance simulation curve of the 3-D Turbo code combined with network coding relay transmission method of 0.25.Represent that infiltration coefficient is the frame error rate performance simulation curve of the 3-D Turbo code combined with network coding relay transmission method of 0.5 with leg-of-mutton curve.
As seen from Figure 4, obviously be positioned at leg-of-mutton solid line under the solid line being with circle, when representing that infiltration coefficient is 0.5, the frame error rate performance of the destination node of 3-D Turbo code combined with network coding relay transmission method is better than the frame error rate performance of the destination node of 3-D Turbo code combined with network coding relay transmission method when infiltration coefficient is 0.25, and the decoding performance of the larger destination node of infiltration coefficient will be greatly improved.Although transmission rate reduces, the complexity of relaying adds, and performance is improved.
Comprehensively above-mentioned, carry out third dimension coding after two user data that the present invention utilizes network code to be accessed by multiple access merge, transmit after forming a 3-D Turbo code on the whole.The present invention, compared with the transmission method of the distributed 3-D Turbo code of prior art, has obvious performance gain, and along with the increase of to-noise ratio, performance gain constantly expands.Prove that the present invention takes full advantage of trunk channel under the prerequisite that ensure that destination frame error rate performance thus, and reach different performance gains by the size changing infiltration coefficient, the complexity of via node and the effectively compromise of destination node decoding performance can be realized.
Claims (5)
1., based on a combined with network coding relay transmission method for 3-D Turbo code, comprise step as follows:
(1) modulated signal sequences is obtained:
(1a) two source node S
1and S
2, respectively to the original information sequence u of oneself
1and u
2carry out Turbo code coding, obtain the code word T after encoding
1and T
2;
(1b) to the code word T after coding
1and T
2carry out binary system respectively and shift to keying BPSK modulation, obtain the burst C after modulating
1and C
2;
(2) broadcast message:
(2a) during the first time slot, source node S
1burst C is sent to destination node and relay node broadcasts
1;
(2b) during the second time slot, source node S
2burst C is sent to destination node and relay node broadcasts
2;
(3) via node carries out Turbo decoding:
Via node is sequence C to the received signal
1and C
2carry out Turbo decoding respectively, obtain original information sequence u
1and u
2estimated sequence
with
(4) via node carries out Turbo coding:
(4a) via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence
two verification sequence P that length is identical
1and P
2;
(4b) via node is to estimated sequence
carry out Turbo coding, obtain and estimated sequence
two verification sequence P that length is identical
3and P
4;
(5) selection check bit:
Adopt infiltration coefficient system of selection, respectively to four verification sequence P
1, P
2, P
3, P
4select, obtain the verification sequence D after selecting
1, D
2, E
1, E
2;
(6) via node carries out network code:
Adopt bit alternately to merge method, via node is to the verification sequence D after selection
1, D
2, E
1, E
2carry out network code, obtain the sequence D to be encoded of the third dimension;
(7) third dimension coded modulation sequence is obtained:
(7a) via node is sent in third dimension encoder after interweaving to third dimension sequence D to be encoded, obtains third dimension coding checkout sequence P;
(7b) via node carries out binary phase shift keying BPSK modulation to third dimension coding checkout sequence P, obtains the sequence P ' after third dimension coded modulation, and the sequence P ' after third dimension coded modulation is sent to destination node;
(8) destination node joint decoding:
(8a) in the interval of [1,1000], the iterations of joint decoding is selected arbitrarily;
(8b), after destination node receives the sequence P ' of via node transmission, external information sequence L ' is translated with the decoder of the third dimension;
(8c) external information sequence L ' is by deinterleaver, obtains the external information sequence L after deinterleaving;
(8d) the external information sequence L after deinterleaving, has the deserializer of an input and four outputs by one, obtain the verification external information sequence L that four length is equal
1, L
2, L
3, L
4;
(8e) destination node is to the code word C received
1carry out Turbo decoding, obtain source node S
1two components verification external information sequence X
1and X
2;
(8f) destination node is to the code word C received
2carry out Turbo decoding, obtain source node S
2two components verification external information sequence X
3and X
4;
(8g) component is verified external information sequence X by destination node
1and X
2respectively with verification external information sequence L
1and L
2merge, obtain two-dimentional check information sequence Y
1and Y
2;
(8h) component is verified external information sequence X by destination node
3and X
4respectively with verification external information sequence L
3and L
4merge, obtain two-dimentional check information sequence Y
3and Y
4;
(8i) destination node is by two-dimentional verification sequence Y
1and Y
2send into code word C
1turbo decoder in, with code word C
1joint decoding, translates component verification external information sequence X
1and X
2renewal sequence;
(8j) destination node is by two-dimentional verification sequence Y
3and Y
4send into code word C
2turbo decoder in, with code word C
2joint decoding, translates component verification external information sequence X
3and X
4renewal sequence;
(8k) adopt infiltration coefficient back-and-forth method, destination node is respectively to the component verification sequence X upgraded
1, X
2, X
3, X
4select, obtain the component verification sequence M after selecting
1, M
2, M
3, M
4;
(8l) destination node is to component verification sequence M
1, M
2, M
3, M
4in bit put in order according to it and alternately merge, obtain the verification sequence M after merging, verification sequence M sent in third dimension decoder, as the prior information of third dimension decoder;
(8m) destination node D judges whether to reach the iterations of selected joint decoding, if so, exports decode results by Turbo decoder, otherwise, perform step (8b).
2. the combined with network coding relay transmission method based on 3-D Turbo code according to claim 1, is characterized in that, described in step (5), the step of infiltration coefficient system of selection is as follows:
The first step, via node, in [0,1] interval, chooses arbitrarily a value of infiltration coefficient λ;
Second step, respectively by four verification sequence P
1, P
2, P
3, P
4be divided into the little verification sequence block comprising a 1/ λ bit, wherein, λ represents infiltration coefficient;
3rd step, the bit selecting arrangement position identical from the composition bit of each little verification sequence block successively, by the bit selected according to the order arrangement selected, obtains the verification sequence D of four verification sequence after selecting
1, D
2, E
1, E
2.
3. the combined with network coding relay transmission method based on 3-D Turbo code according to claim 1, is characterized in that, the step that bit described in step (6) replaces merging method is as follows:
The first step, according to the verification sequence D after selection
1putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
Second step, according to the verification sequence D after selection
2putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
3rd step, according to the verification sequence E after selection
1putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
4th step, according to the verification sequence E after selection
2putting in order of middle bit, extracts first bit, putting in order of remaining bits is shifted to an earlier date successively;
5th step, is arranged in order the bit that above-mentioned steps extracts, as the composition bit of third dimension sequence to be encoded;
6th step, judges verification sequence E
2in number of bits whether be 0, if so, then via node to select after verification sequence D
1, D
2, E
1, E
2the network code carried out terminates, and obtains the sequence D to be encoded of the third dimension, otherwise, perform the first step.
4. the combined with network coding relay transmission method based on 3-D Turbo code according to claim 1, is characterized in that, the third dimension encoder employing code check described in step (7a) is the circular convolution rsc encoder of 1.
5. the combined with network coding relay transmission method based on 3-D Turbo code according to claim 1, is characterized in that, described in step (8k), the step of infiltration coefficient system of selection is as follows:
The first step, respectively by four verification sequence X
1, X
2, X
3, X
4be divided into the little verification sequence block comprising a 1/ λ bit, wherein, λ represents infiltration coefficient;
Second step, the bit selecting arrangement position identical from the composition bit of each little verification sequence block successively, by the bit selected according to the order arrangement selected, obtains the verification sequence M of four verification sequence after selecting
1, M
2, M
3, M
4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410482373.7A CN104219026A (en) | 2014-09-19 | 2014-09-19 | United network code relay transmission method based on 3D (three dimensional) Turbo code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410482373.7A CN104219026A (en) | 2014-09-19 | 2014-09-19 | United network code relay transmission method based on 3D (three dimensional) Turbo code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104219026A true CN104219026A (en) | 2014-12-17 |
Family
ID=52100196
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410482373.7A Pending CN104219026A (en) | 2014-09-19 | 2014-09-19 | United network code relay transmission method based on 3D (three dimensional) Turbo code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104219026A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105846958A (en) * | 2016-04-01 | 2016-08-10 | 哈尔滨工业大学深圳研究生院 | Distributed system Raptor code transmission method specific to deep space communication |
| CN108365919A (en) * | 2018-02-05 | 2018-08-03 | 西安电子科技大学 | Based on LDLC relay transmissions and corresponding combined decoding method |
| CN109245858A (en) * | 2018-09-25 | 2019-01-18 | 重庆邮电大学 | A kind of modified joint network-Turbo coding method based on decoding forwarding |
| CN109618170A (en) * | 2018-12-04 | 2019-04-12 | 嘉兴国电通新能源科技有限公司 | D2D real-time video streaming transmission method based on network code |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420291A (en) * | 2008-12-08 | 2009-04-29 | 北京邮电大学 | Combined decoding method for network and channel code in relay system |
| CN102185682A (en) * | 2011-06-23 | 2011-09-14 | 西安电子科技大学 | Turbo code/network coding-united relay transmission and corresponding decoding method |
| CN102244561A (en) * | 2011-06-23 | 2011-11-16 | 西安电子科技大学 | Relay transmission method applied to multiple access relay network |
| CN103078716A (en) * | 2013-01-27 | 2013-05-01 | 西安电子科技大学 | Distributed 3-D Turbo code-based relay transmission method |
-
2014
- 2014-09-19 CN CN201410482373.7A patent/CN104219026A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420291A (en) * | 2008-12-08 | 2009-04-29 | 北京邮电大学 | Combined decoding method for network and channel code in relay system |
| CN102185682A (en) * | 2011-06-23 | 2011-09-14 | 西安电子科技大学 | Turbo code/network coding-united relay transmission and corresponding decoding method |
| CN102244561A (en) * | 2011-06-23 | 2011-11-16 | 西安电子科技大学 | Relay transmission method applied to multiple access relay network |
| CN103078716A (en) * | 2013-01-27 | 2013-05-01 | 西安电子科技大学 | Distributed 3-D Turbo code-based relay transmission method |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105846958A (en) * | 2016-04-01 | 2016-08-10 | 哈尔滨工业大学深圳研究生院 | Distributed system Raptor code transmission method specific to deep space communication |
| CN105846958B (en) * | 2016-04-01 | 2019-04-23 | 哈尔滨工业大学深圳研究生院 | Distributed system Raptor decoding transmission method towards deep space communication |
| CN108365919A (en) * | 2018-02-05 | 2018-08-03 | 西安电子科技大学 | Based on LDLC relay transmissions and corresponding combined decoding method |
| CN108365919B (en) * | 2018-02-05 | 2020-04-07 | 西安电子科技大学 | LDLC (Low Density parity check) based relay transmission and corresponding joint decoding method |
| CN109245858A (en) * | 2018-09-25 | 2019-01-18 | 重庆邮电大学 | A kind of modified joint network-Turbo coding method based on decoding forwarding |
| CN109245858B (en) * | 2018-09-25 | 2021-03-23 | 重庆邮电大学 | Improved joint network-Turbo coding method based on decoding forwarding |
| CN109618170A (en) * | 2018-12-04 | 2019-04-12 | 嘉兴国电通新能源科技有限公司 | D2D real-time video streaming transmission method based on network code |
| CN109618170B (en) * | 2018-12-04 | 2021-10-01 | 嘉兴国电通新能源科技有限公司 | D2D real-time video streaming transmission method based on network coding |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101867451B (en) | Multi-user network coding communication method with high-speed parallel encoding and decoding structure | |
| CN103095423B (en) | Based on the multi-user collaborative transmission method communicated between D2D group | |
| CN101383682B (en) | Collaborative diversity method based on constellation rotation quasi-orthogonal space time block code | |
| CN106100795B (en) | Polar code coding cooperation method based on Plotkin construction and information bit re-dormancy | |
| CN102377515B (en) | The method of reseptance of collaboration communication, device and system | |
| CN102185682B (en) | Turbo code/network coding-united relay transmission and corresponding decoding method | |
| CN102332963B (en) | Symbol-based physical-layer network coding method for two-way relay communication system | |
| CN104219026A (en) | United network code relay transmission method based on 3D (three dimensional) Turbo code | |
| CN101394255A (en) | Two-user collaboration communication method in multi-user wireless network | |
| CN101442394B (en) | Network encode collaboration communication method capable of iteratively decoding | |
| CN101741448A (en) | Minimum mean square error beam forming-based information transmission method in two-way channel | |
| CN103078716B (en) | Based on the relay transmission method of distributed 3-D Turbo code | |
| CN103338091B (en) | A kind of cooperation transmission method based on distributed nonbinary LDPC code | |
| CN103441824B (en) | Distributed space-time grid code relay transmission method based on Soft Inform ation | |
| CN101499805A (en) | Method for encoding, decoding and apparatus for encoding, decoding | |
| CN101394211B (en) | Relay collaboration communication method capable of obtaining multi-ordered diversity | |
| CN109302266A (en) | High energy efficiency cooperative relay network transmission method based on double-layer network coding | |
| CN102497250B (en) | Multiple access channel adaptive coding relay system and method | |
| CN105554813B (en) | It is a kind of in data transmission method of the wireless relay system based on Random Maps code | |
| CN102136883B (en) | Network coding-based cooperative relay transmission method | |
| CN102725986B (en) | For carrying out the method and apparatus of decoding in junction network | |
| CN102334379B (en) | Method and apparatus for associated processing in relay station and corresponding processing in base station | |
| CN103401657A (en) | Non-differential distributed space-time coding method for cooperative communication partially-coherent network | |
| CN101674091B (en) | Network coding method based on Turbo decoding | |
| CN103152141A (en) | Cooperation space-time network coding method in multisource distributed cooperative network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20141217 |