CN109245858B - Improved joint network-Turbo coding method based on decoding forwarding - Google Patents

Improved joint network-Turbo coding method based on decoding forwarding Download PDF

Info

Publication number
CN109245858B
CN109245858B CN201811116495.9A CN201811116495A CN109245858B CN 109245858 B CN109245858 B CN 109245858B CN 201811116495 A CN201811116495 A CN 201811116495A CN 109245858 B CN109245858 B CN 109245858B
Authority
CN
China
Prior art keywords
information
decoding
correct
siso decoder
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.)
Active
Application number
CN201811116495.9A
Other languages
Chinese (zh)
Other versions
CN109245858A (en
Inventor
余翔
樊霞
段思睿
周遂之
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201811116495.9A priority Critical patent/CN109245858B/en
Publication of CN109245858A publication Critical patent/CN109245858A/en
Application granted granted Critical
Publication of CN109245858B publication Critical patent/CN109245858B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0066—Parallel concatenated codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0059—Convolutional codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

The invention relates to an improved joint network-Turbo coding method based on decoding forwarding, belonging to the technical field of mobile communication. The method is based on a joint Turbo-network coding scheme, and an improved Turbo code decoder is constructed at a target node to decode data; in particular according to the mobile terminal S1And S2And the CRC check result of the relay node is divided into mobile terminals S1And S2The CRC check is correct, the CRC check result of only one mobile terminal is correct, the CRC check results of the two mobile terminals and the relay node are both wrong, only four conditions that the CRC check of the signal received by the relay node is correct are provided, and corresponding solving modes are respectively deduced so as to obtain correct results. The invention reduces the frame error rate of the destination node, and the performance of the algorithm is more obvious along with the increase of the signal to noise ratio of the system.

Description

Improved joint network-Turbo coding method based on decoding forwarding
Technical Field
The invention belongs to the technical field of mobile communication, relates to a network coding technology of a cooperative communication system, and particularly relates to a joint network-Turbo coding and decoding method in the cooperative communication system.
Background
The wireless signal is greatly interfered by inherent fading of a wireless channel in the transmission process, and meanwhile, the multipath transmission of electromagnetic waves also influences the transmission rate and quality, so that a receiving end cannot stably and accurately receive the signal. The wireless signals exhibit independent characteristics in time, space, frequency, etc., so the space diversity technique is a micro-diversity technique which is currently used most and has a good development prospect. Considering that a mobile terminal cannot have multiple antennas due to small size, limited battery capacity and the like, researchers have proposed a distributed mimo system with separated antennas: the mobile terminals distributed far away from the geographical position form a virtual multi-antenna array to satisfy multiple antennas of the multi-input multi-output technology, namely the cooperative diversity technology.
Network coding and channel coding can improve the transmission effectiveness and reliability of the mobile communication system. In a communication system, a source node generally adopts channel coding, a relay node adopts combined network coding and channel coding, and a destination terminal carries out channel decoding and network decoding. Documents Stef M P, Polgar Z a, Bota v.network-coded coordination protocol for multiple source-multiple relay protocols in cellular networks propose to introduce network coding into cooperative coding, this method has many advantages but reduces diversity, and in order to solve this problem the author proposes a variant cooperative coding based on network coding: there are two schemes when carrying on channel decoding and network decoding, one of them is to process channel decoding and network decoding separately; and the second method adopts a decoding scheme combining channel decoding and network decoding.
The patent document with publication number CN201210387332.0 discloses a method of joint network-channel coding, which mainly contributes to improving the signal forwarding efficiency and simultaneously reducing the energy consumption in the signal forwarding process. In the method, a relay node receives signal sequences of a plurality of users and obtains a plurality of estimation sequences, and then obtains forwarding signal sequences and sends the forwarding signal sequences to a target node after processing such as interleaving, so that the target node can carry out joint network channel iterative decoding through the sequences. The patent document with publication number CN201110171667.4 discloses a relay transmission and corresponding decoding method combining Turbo codes and network coding, which mainly solves the problems of low relay node forwarding efficiency and high decoding complexity of a destination node in the prior art. The patent document with publication number CN200810238982.2 discloses a joint decoding method for network and channel coding of a relay system, which combines the decoding processes of the network and channel coding in a relay transmission system, and realizes the exchange of soft information therein by introducing check nodes, thereby improving the decoding reliability and the system transmission performance.
The channel coding and the network coding are simultaneously applied to the cooperative communication system, so that the reliability and the effectiveness of the system are enhanced, the overall complexity of the system is greatly improved, and the throughput of the network is reduced. The disclosed methods mainly solve the problems of low relay node forwarding efficiency and high decoding complexity of the target node in the prior art, and do not optimize the decoding mode of the target node. The traditional joint network-Turbo coding algorithm overcomes the defects in a Turbo-network coding scheme of decoding separation, but the utilization of redundant information in the scheme is determined due to the independent characteristics of the Turbo-network coding algorithm, and the reliability and effectiveness are still improved. The invention constructs an improved Turbo code decoder at a target node to carry out combined decoding on data, and aims to reduce the frame error rate of the target node in a cooperative diversity communication system, thereby improving the effectiveness and the reliability of the cooperative diversity communication system.
Disclosure of Invention
In view of the above, the present invention provides an improved joint network-Turbo coding method based on decoding forwarding, in which the algorithm mainly constructs an improved Turbo code decoder at a destination node to decode data, so as to reduce a frame error rate of the destination node, and the performance of the algorithm is more obvious as a signal-to-noise ratio of a system increases.
In order to achieve the purpose, the invention provides the following technical scheme:
an improved joint network-Turbo coding method based on decoding forwarding is disclosed, which is based on joint Turbo-network coding scheme, and an improved Turbo code decoder is constructed at a target node to decode data; the method specifically comprises the following steps: according to the mobile terminal S1And S2The CRC result of the relay node is divided into four conditions, and corresponding solving modes are respectively deduced so as to obtain a correct result, so that the frame error rate of the system is reduced;
the four cases are:
(1)P1: mobile terminal S1And S2The CRC check of the data is correct;
(2)P21: the CRC check result of only one mobile terminal is correct;
(3)P22: CRC (cyclic redundancy check) results of the two mobile terminals and the relay node are both wrong;
(4)P23: only the signal CRC received by the relay node checks correct.
Further, the situation P1The method specifically comprises the following steps: when the CRC check of the two mobile terminals is correct, the information received by the relay node is correct, and the information can be obtained according to S1And S2Obtains correct result u from the decoded information1And u2。
Further, the situation P21The method specifically comprises the following steps: suppose that only the mobile terminal S is present1If the CRC check result of u is correct, u1Correct decoding of the information of (u)2The decoding at (a) is in error,
(1) will correct the data u1Interleaving and RSC coding to obtain
Figure GDA0002909562520000021
The corresponding LLR (log likelihood ratio) values are calculated using the following formula,
Figure GDA0002909562520000031
calculated by derivation
Figure GDA0002909562520000032
Figure GDA0002909562520000033
Wherein sgn is a sign parameter,
Figure GDA0002909562520000034
is S in SISO decoder 21The verification information of (2) is stored in the storage unit,
Figure GDA0002909562520000035
then it is S in SISO decoder 22A posteriori information of Lc(p3,t) A priori information representing a relay node;
(2) using slave mobile terminals S2The obtained information is calculated to obtain corresponding Lc(c2) Wherein L isc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
(3) by passing
Figure GDA0002909562520000036
And Lc(c2) Obtaining u by iteration of conventional Turbo decoding2。
Further, the situation P22The method specifically comprises the following steps: when coming from three different information sources, i.e. mobile terminal S1And S2And the data of the relay node is found to be faulty after being subjected to the CRC check,
(1) by using
Figure GDA0002909562520000037
And
Figure GDA0002909562520000038
calculate Lc(c1) And Lc(c2) Wherein
Figure GDA0002909562520000039
and
Figure GDA00029095625200000310
respectively indicating the destination node' S reception from S1And S2Signal of (2), Lc(c1) Representing S in SISO decoder 11A posteriori LLR value of Lc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
(2) sending the information and prior information into a SISO decoder, wherein the initial value of the prior information is 0; calculating u using the output of a SISO decoder1And u2The external information of (1);
(3) calculated by an interleaver using the following formula
Figure GDA00029095625200000311
External information of
Figure GDA00029095625200000312
Wherein, L (u)1) And L (u)2) Respectively represents u1And u2LLR value after decoder, if
Figure GDA00029095625200000313
Then
Figure GDA00029095625200000314
(4) Will be provided with
Figure GDA00029095625200000315
The extrinsic information is sent as prior information to SISO decoder, from Lc(c1)、Lc(c2) To obtain Lc(u1)、Lc(u2) Is calculated to obtain
Figure GDA00029095625200000316
Namely Lc(u3) And mixing Lc(u3) As input for SISO and calculating extrinsic information, while calculating L from new information bitsc(u1)、Lc(u2) The external information is fed back to the SISO decoder of the corresponding mobile terminal; and finally, sending the decoding iteration of the maximum times to a judgment module to recover the original information.
Further, the situation P23The method specifically comprises the following steps: the signal received by the relay node is decoded correctly, and the decoding error of the mobile terminal causes that u cannot be obtained directly1And u2Therefore, it is necessary to construct two Turbo decoders and then from the relay node
Figure GDA00029095625200000317
In the process to obtain u1And u2Then RSC coding is carried out, thus iterative decoding is carried outTo the correct result;
the separation method comprises the following steps of (to obtain u)1For example) of:
(1) removing u2To the information bit
Figure GDA0002909562520000041
De-interleaving to obtain
Figure GDA0002909562520000042
Wherein,
Figure GDA0002909562520000043
a function of a de-interleaving operation is shown,
Figure GDA0002909562520000044
indicating the output result and u after de-interleaving2Exclusive-OR operation to remove u2The object of (a);
(2) RSC coding is carried out, and the obtained result and L are comparedc(c2) Carrying out redundancy deletion processing according to the following formula;
Figure GDA0002909562520000045
wherein,
Figure GDA0002909562520000046
representing a puncturing algorithm function, wherein lambda and tau are self-defined constants;
(3) analysis of the results, using LLR values and Lc(c1) Forming a product code to perform iterative decoding;
(4) repeating the steps (1) to (3) to calculate u2。
The invention has the beneficial effects that: the invention constructs the improved Turbo code decoder at the target node to carry out the joint decoding on the data, thereby reducing the frame error rate of the target node in the cooperative diversity communication system and improving the effectiveness and the reliability of the cooperative diversity communication system.
Drawings
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
FIG. 1 is a system model of a system with two users accessing more relay signals;
FIG. 2 is a system diagram of an improved joint Turbo-network coding scheme;
FIG. 3 is a flow chart of a destination node algorithm;
FIG. 4 is an iterative decoding of a destination node;
FIG. 5 is a graph of BER performance for various aspects of AWGN channels;
figure 6 shows FER performance for various aspects of the AWGN channel.
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The invention provides an improved joint network-Turbo coding algorithm based on decoding forwarding in a cooperative communication system on the basis of a traditional joint Turbo-network coding scheme, so that a multiple access relay channel system model of two users is adopted in the scheme, and the scheme is specifically shown in figure 1. The system comprises two mobile terminals S1And S2One relay node R and one destination node D. The whole system adopts a time division multiplexing mode, and each cycle process is divided into 3 time slots. In the first time slot, the mobile terminal S1And carrying out Turbo coding on the information of the node, and then transmitting the modulated signal to the node R and the node D through modulation. The second time slot and the first time slot adopt the same processing mode to process S2The information is sent out. In the third time slot, the relay node R decodes the received information, if the decoding result is verified to be correct through CRC, network coding is carried out on the two groups of data, and then the data obtained through Turbo coding and modulation are sent to a target end; if the decoding is wrong, the relay node R does not send any data any more.
Fig. 2 shows a system block diagram of an improved Turbo-network coding scheme according to fig. 1 and the above description.
In the first time slot, the mobile terminal S1Channel coding the data with length B to form coded information
Figure GDA0002909562520000051
Wherein u is1In order to be able to obtain the data information,
Figure GDA0002909562520000052
for checking information, the subscript correspondence indicates the source node S1. Then coding the information c1Obtaining a transmission signal x after BPSK modulation1Wherein x is1And c1Satisfies the following conditions: x is the number of1,t＝(-2c1,t)+1. Signals received by the relay node and the destination node are as follows:
Figure GDA0002909562520000053
Figure GDA0002909562520000054
wherein,
Figure GDA0002909562520000055
and
Figure GDA0002909562520000056
is S1The fading coefficients to R and D, obeying to the rayleigh fading distribution,
Figure GDA0002909562520000057
and z1,tAdditive white Gaussian noise of two links, obeys mean value of 0 and variance of N0Is normally distributed.
Second time slot, mobile terminal S2The data is processed in the same way to obtain the sending information x2。
A third time slot, the relay node receives the signals of the first time slot and the second time slot
Figure GDA0002909562520000058
And
Figure GDA0002909562520000059
performing CRC check on the information obtained after demodulation and channel decoding, and estimating the value after the data is correct
Figure GDA00029095625200000510
And
Figure GDA00029095625200000511
network coding and channel coding are carried out, and finally the modulated information x isRAnd sending the data to a destination node.
As shown in fig. 3, at the destination node, information obtained from three slots is considered in the following four cases.
(1)P1: from S1And S2The decoding results are all correct.
In this case, it indicates that the information received by the relay node is also correct, and according to the scheme of joint network-Turbo coding, it can be known that the destination node can perform iterative decoding according to the block diagram in fig. 4, so that the destination node is S1And S2The decoding information of (a) gets the correct result.
(2)P21: only the information of one mobile terminal is correctly decoded.
The method comprises the following steps: suppose u1Correct decoding of the information of (u)2The decoding at (1) is erroneous. To obtain u2The information of (2) needs to be removed from the information sent from the relay node
Figure GDA00029095625200000512
Remaining ones about u2The information of (1). Therefore, it is first necessary to put u1Respectively carrying out interleaving and RSC coding to obtain
Figure GDA00029095625200000513
Step two: the corresponding LLR values are calculated using the formula:
Figure GDA00029095625200000514
after pushing to get
Figure GDA00029095625200000515
Figure GDA00029095625200000516
Where sgn is a symbol parameter and,
Figure GDA00029095625200000517
is S in SISO decoder 21The verification information of (2) is stored in the storage unit,
Figure GDA00029095625200000518
then it is S in SISO decoder 22Verification information of Lc(p3,t) A priori information representing the relay node.
Step three: using slave mobile terminals S2The obtained information is calculated to obtain corresponding Lc(c2) Wherein L isc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
step four: by using
Figure GDA0002909562520000061
And Lc(c2) Obtaining u by iteration of conventional Turbo decoding2。
(1)P22: the data information of both the mobile terminal and the relay node is wrong.
The method comprises the following steps: by using
Figure GDA0002909562520000062
And
Figure GDA0002909562520000063
calculate Lc(c1) And Lc(c2). Wherein,
Figure GDA0002909562520000064
and
Figure GDA0002909562520000065
respectively representing S received by destination node1And S2Signal of (2), Lc(c1) Representing S in SISO decoder 11A posteriori LLR value of Lc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
step two: combining L calculated in the first stepc(c1) And Lc(c2) Sending the information and the prior information into a SISO decoder, wherein the initial value of the prior information is set to be 0;
step three: as shown in FIG. 4, u will be calculated using the output of the SISO decoder1And u2Then through the interleaver, the extrinsic information is calculated by the following formula
Figure GDA0002909562520000066
The external information of (2):
Figure GDA0002909562520000067
wherein,
Figure GDA0002909562520000068
Figure GDA0002909562520000069
wherein, L (u)1) And L (u)2) Respectively represents u1And u2LLR value after decoder; if it is
Figure GDA00029095625200000610
Then
Figure GDA00029095625200000611
Step four: will be provided with
Figure GDA00029095625200000612
The extrinsic information of (a) is fed as prior information into the SISO decoder. Due to the fact that in y3Corresponding Lc(c3) Has no corresponding information bit, so L cannot be directly obtainedc(u3). Therefore we first start with Lc(c1)、Lc(c2) To obtain Lc(u1)、Lc(u2) And calculate out
Figure GDA00029095625200000613
Namely Lc(u3)。
Step five: l isc(u3) The output extrinsic information can be computed as the input of the SISO, while the L computed from the new information bitsc(u1)、Lc(u2) The extrinsic information is fed back to the SISO decoder of the corresponding mobile terminal. And finally, sending the decoded iteration of the maximum times to a judgment module to recover the original information.
(2)P23: only the signal of the relay node is correct.
Decoding error of mobile terminal can not directly obtain u1And u2From a relay node
Figure GDA00029095625200000615
In the process to obtain u1And u2Therefore, two Turbo decoders need to be constructed.
The method comprises the following steps: to obtain u1For example, u is first removed2. Thus, the information bits are processed
Figure GDA00029095625200000614
De-interleaving to obtain
Figure GDA0002909562520000071
Wherein,
Figure GDA0002909562520000072
representing de-interleaving operation functions，
Figure GDA0002909562520000073
Indicating the output result and u after de-interleaving2Exclusive-OR operation to remove u2The object of (a);
step two: RSC coding is carried out, and the obtained result and L are comparedc(c2) The treatment is carried out according to the following formula:
Figure GDA0002909562520000074
wherein, among others,
Figure GDA0002909562520000075
representing a puncturing algorithm function, wherein lambda and tau are self-defined constants;
step three: the resulting data was analyzed at this time, and the results at this time were found to be equivalent to
Figure GDA0002909562520000076
And (4) obtaining a result through RSC coding. Thus, it is possible to provide
Figure GDA0002909562520000077
Equivalent to a deinterleaver, the LLR values can be compared with Lc(c1) Forming a product code to perform iterative decoding;
step four: u is calculated using the same procedure2。
In the method, the improved joint Turbo-network coding scheme is simulated under an AWGN channel, and the parameters are set as follows: dSR＝dRDWherein d isSRRepresents the distance from node S to node R, dRDRepresenting the distance from node R to node D. The path loss factor is 4 and the data length N is 1024.
FIG. 5 is a graph comparing the performance of bit error rate of the improved joint Turbo-network coding scheme with that of the conventional joint Turbo-network coding scheme, and it can be seen from FIG. 5 that the improved joint Turbo-network coding scheme has more and more advantages with increasing signal-to-noise ratioIt is apparent that at BER of 10-4There is approximately a 3dB improvement over the modified joint scheme.
FIG. 6 is a graph comparing the frame error rate of the conventional joint Turbo-network coding scheme with the improved joint Turbo-network coding scheme, and it can be seen from FIG. 6 that the frame error rate of the conventional scheme and the point-to-point scheme is very high when the SNR is low, only the improved joint Turbo-network coding scheme can obtain better performance, and the advantage is more and more obvious with the increase of the SNR, and the FER is 3 × 10-4There is approximately a 3.5dB performance increase.
Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.

Claims (4)

1. An improved joint network-Turbo coding method based on decoding forwarding is characterized in that an improved Turbo code decoder is constructed at a target node to decode data based on a joint Turbo-network coding scheme; the method specifically comprises the following steps: according to the mobile terminal S1And S2And the Cyclic Redundancy Check (CRC) Check result of the relay node is divided into four conditions, and corresponding solving modes are respectively deduced so as to obtain a correct result, so that the frame error rate of the system is reduced;
the four cases are:
(1)P1: mobile terminal S1And S2The CRC check of the data is correct;
(2)P21: the CRC check result of only one mobile terminal is correct; the method specifically comprises the following steps: suppose that only the mobile terminal S is present1If the CRC check result of u is correct, u1Correct decoding of the information of (u)2The decoding of (a) has an error, where u1And u2Respectively representing mobile terminals S1And S2Decoding the obtained information;
1) will correct the data u1Interleaving and RSC coding to obtain
Figure FDA0002909562510000011
Calculating the corresponding log-likelihood ratio LLR (likelihood Rate) value by the following formula
Figure FDA0002909562510000012
Figure FDA0002909562510000013
Calculated by derivation
Figure FDA0002909562510000014
Figure FDA0002909562510000015
Wherein sgn is a symbol parameter,
Figure FDA0002909562510000016
is S in SISO decoder 21The verification information of (2) is stored in the storage unit,
Figure FDA0002909562510000017
is S in SISO decoder 22The verification information of (2) is stored in the storage unit,
Figure FDA0002909562510000018
is S in SISO decoder 22A posteriori information of Lc(p3,t) A priori information representing a relay node;
2) using slave mobile terminals S2The obtained information is calculated to obtain corresponding Lc(c2) Wherein L isc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
3) by passing
Figure FDA0002909562510000019
And Lc(c2) Obtaining u by iteration of conventional Turbo decoding2；
(3)P22: CRC (cyclic redundancy check) results of the two mobile terminals and the relay node are both wrong;
(4)P23: only the signal CRC received by the relay node checks correct.
2. The improved joint network-Turbo coding method based on decoding forwarding of claim 1, wherein the condition P is1The method specifically comprises the following steps: when CRC check of two mobile terminals is correct, according to S1And S2Obtains correct result u from the decoded information1And u2。
3. The improved joint network-Turbo coding method based on decoding forwarding of claim 1, wherein the condition P is22The method specifically comprises the following steps: when coming from three different information sources, i.e. mobile terminal S1And S2And the data of the relay node is found to be faulty after being subjected to the CRC check,
(1) by using
Figure FDA0002909562510000021
And
Figure FDA0002909562510000022
calculate Lc(c1) And Lc(c2) Wherein
Figure FDA0002909562510000023
and
Figure FDA0002909562510000024
respectively indicating the destination node' S reception from S1And S2Signal of (2), Lc(c1) Representing SISO decodingCode device 1S1A posteriori LLR value of Lc(c2) Representing S in SISO decoder 22The posterior LLR value of (2);
(2) mixing L withc(c1) And Lc(c2) And S1And S2The prior information is respectively sent to a SISO decoder 1 and a SISO decoder 2 together, and the initial value of the prior information is 0; calculating u using the outputs of SISO decoder 1 and SISO decoder 21And u2Wherein u is1And u2Respectively representing mobile terminals S1And S2Decoding the obtained information;
(3) calculated by an interleaver using the following formula
Figure FDA0002909562510000025
External information of
Figure FDA0002909562510000026
Wherein, L (u)1) And L (u)2) Respectively represents u1And u2LLR value after SISO decoder 1 and SISO decoder 2, if
Figure FDA0002909562510000027
Then
Figure FDA0002909562510000028
(4) Will be provided with
Figure FDA0002909562510000029
The extrinsic information is fed as prior information to SISO decoder 3, from Lc(c1)、Lc(c2) To obtain Lc(u1)、Lc(u2) Is calculated to obtain
Figure FDA00029095625100000210
Namely Lc(u3) And mixing Lc(u3) As input to the SISO decoder 3, extrinsic information is calculated, while L, which is calculated from new information bits, is appliedc(u1)、Lc(u2) The external information is fed back to the SISO decoder of the corresponding mobile terminal; and finally, sending the decoding iteration of the maximum times into a hard decision module to recover the original information.
4. The improved joint network-Turbo coding method based on decoding forwarding of claim 1, wherein the condition P is23The method specifically comprises the following steps: the signal received by the relay node is decoded correctly, and the decoding error of the mobile terminal causes that u cannot be obtained directly1And u2Therefore, it is necessary to construct two Turbo decoders and then from the relay node
Figure FDA00029095625100000211
In the process to obtain u1And u2RSC encoding is carried out, so that iterative decoding is carried out to obtain a correct result;
the separation method comprises the following steps:
(1) removing u2To the information bit
Figure FDA00029095625100000212
De-interleaving to obtain
Figure FDA00029095625100000213
Wherein,
Figure FDA00029095625100000214
a function of a de-interleaving operation is shown,
Figure FDA00029095625100000215
indicating the output result and u after de-interleaving2Exclusive-OR operation to remove u2The object of (a) is to provide a method for producing,
Figure FDA00029095625100000216
represents u1And u2Performing exclusive or operation after the interleaving;
(2) RSC encoding is performed and the result is compared to S in SISO decoder 22A posteriori LLR value of Lc(c2) Carrying out redundancy deletion processing according to the following formula;
Figure FDA00029095625100000217
wherein,
Figure FDA00029095625100000218
representing a puncturing algorithm function, wherein lambda and tau are self-defined constants;
(3) analysis results of
Figure FDA0002909562510000031
And S in SISO decoder 11A posteriori LLR value of Lc(c1) Forming a product code to perform iterative decoding;
(4) repeating the steps (1) to (3) to calculate u2。
CN201811116495.9A 2018-09-25 2018-09-25 Improved joint network-Turbo coding method based on decoding forwarding Active CN109245858B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811116495.9A CN109245858B (en) 2018-09-25 2018-09-25 Improved joint network-Turbo coding method based on decoding forwarding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811116495.9A CN109245858B (en) 2018-09-25 2018-09-25 Improved joint network-Turbo coding method based on decoding forwarding

Publications (2)

Publication Number Publication Date
CN109245858A CN109245858A (en) 2019-01-18
CN109245858B true CN109245858B (en) 2021-03-23

Family

ID=65057463

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811116495.9A Active CN109245858B (en) 2018-09-25 2018-09-25 Improved joint network-Turbo coding method based on decoding forwarding

Country Status (1)

Country Link
CN (1) CN109245858B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1170870A4 (en) * 2000-02-15 2006-08-02 Jfe Steel Corp Turbo decoder
CN102075288A (en) * 2010-12-20 2011-05-25 复旦大学 Network-code-based free-space optical cooperative relay communication method
CN102244561A (en) * 2011-06-23 2011-11-16 西安电子科技大学 Relay transmission method applied to multiple access relay network
CN102497250A (en) * 2011-12-05 2012-06-13 中国科学院计算技术研究所 Multiple access channel adaptive coding relay system and method
CN102725986A (en) * 2010-03-31 2012-10-10 上海贝尔股份有限公司 Decoding method and device in relay network
CN102811116A (en) * 2012-08-09 2012-12-05 西安电子科技大学 Distributed Turbo coding method in relay transmission system
CN104219026A (en) * 2014-09-19 2014-12-17 西安电子科技大学 United network code relay transmission method based on 3D (three dimensional) Turbo code
CN106301680A (en) * 2015-06-10 2017-01-04 中兴通讯股份有限公司 A kind of data transmission method and device
CN106899388A (en) * 2017-03-14 2017-06-27 重庆邮电大学 Joint-detection and coding/decoding method of the LDPC code under mimo channel

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1170870A4 (en) * 2000-02-15 2006-08-02 Jfe Steel Corp Turbo decoder
CN102725986A (en) * 2010-03-31 2012-10-10 上海贝尔股份有限公司 Decoding method and device in relay network
CN102075288A (en) * 2010-12-20 2011-05-25 复旦大学 Network-code-based free-space optical cooperative relay communication method
CN102244561A (en) * 2011-06-23 2011-11-16 西安电子科技大学 Relay transmission method applied to multiple access relay network
CN102497250A (en) * 2011-12-05 2012-06-13 中国科学院计算技术研究所 Multiple access channel adaptive coding relay system and method
CN102811116A (en) * 2012-08-09 2012-12-05 西安电子科技大学 Distributed Turbo coding method in relay transmission system
CN104219026A (en) * 2014-09-19 2014-12-17 西安电子科技大学 United network code relay transmission method based on 3D (three dimensional) Turbo code
CN106301680A (en) * 2015-06-10 2017-01-04 中兴通讯股份有限公司 A kind of data transmission method and device
CN106899388A (en) * 2017-03-14 2017-06-27 重庆邮电大学 Joint-detection and coding/decoding method of the LDPC code under mimo channel

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
《Distributed Turbo Code for Relay Channel with Dual-Systematic Bits》;Lingyun LI;Shujuan HOU;Peiyao Yang.;《2014IEEE International Conference on Computer and Information Technology》;20141215;第568-570页 *
《协同通信中网络编码与信道编码的联合设计》;程萍;《中国优秀硕士学位论文全文数据库-信息科技辑》;20131115;I136-181 *

Also Published As

Publication number Publication date
CN109245858A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
CN104137464B (en) Transmit the method and trunking of the data signal for semi-orthogonal MS MARC systems
EP1798920B1 (en) Iterative detection and decoding in MIMO communication systems
KR100889302B1 (en) Partial iterative detection and decoding receiver and method in multiple antenna system
CN102630374B (en) Method for transmitting a digital signal for a marc system with a full-duplex relay, and corresponding program product and relay device
CN102742201B (en) Method for transmitting a digital signal for a semi-orthogonal frame system having half-duplex relay, and corresponding program product and relay device
US9319187B2 (en) Method and a device for relaying in a communications network
CN104137456B (en) Transmission is for the method for the digital signal of nonopiate MS-MARC systems and corresponding program product and trunking
CN110430009B (en) Multi-user joint coding modulation system
US6996762B2 (en) Methods and apparatus of signal demodulation combining with different modulations and coding for wireless communications
EP2405590A1 (en) Coder, receiver, wireless communication system, puncture pattern selection method, and program therefor
CN102281126B (en) Digital video broadcasting-satellite second generation (DVB-S2) code modulation system-oriented constellation mapping and demapping method
WO2015055256A1 (en) Transmission and receiving method in a wireless communication system
Zheng et al. LDPC-coded MIMO systems with unknown block fading channels: soft MIMO detector design, channel estimation, and code optimization
CN102064917A (en) Demodulation decoding method for LDPC (Low Density Parity Code) modulation system
CN111245571B (en) Receiver design method combined with coding modulation technology under noise aggregation system
CN102612822B (en) For having the program product for the method and correspondence that transmit digital signal and the relay of the multiple access trunk channel system of half-duplex relaying
KR20070118835A (en) Apparatus and method for improving of iterative detection and decoding in multiple antenna system
CN100486235C (en) Iterative receiving method for maintaining soft information
CN102487315B (en) Multi-source multi-relay cooperation communication method, communication equipment and cooperation communication system
CN109245858B (en) Improved joint network-Turbo coding method based on decoding forwarding
Hatefi et al. Joint channel-network coding for the semi-orthogonal multiple access relay channel
CN112787758B (en) Serial interference elimination uplink multiple access system of mass medium modulation equipment
Irawan et al. Combining-after-decoding turbo hybrid ARQ by utilizing doped-accumulator
CN113660064A (en) Multi-data-packet-based joint two-dimensional interleaving coding method suitable for power line communication system
Lenkeit et al. An improved detection scheme for distributed IDM-STCs in relay-systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant