CN102571104B - Distributed encoding and decoding method for RA (Repeat Accumulate) code - Google Patents

Distributed encoding and decoding method for RA (Repeat Accumulate) code Download PDF

Info

Publication number
CN102571104B
CN102571104B CN201210011026.7A CN201210011026A CN102571104B CN 102571104 B CN102571104 B CN 102571104B CN 201210011026 A CN201210011026 A CN 201210011026A CN 102571104 B CN102571104 B CN 102571104B
Authority
CN
China
Prior art keywords
code
node
source node
coding
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN201210011026.7A
Other languages
Chinese (zh)
Other versions
CN102571104A (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.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN201210011026.7A priority Critical patent/CN102571104B/en
Publication of CN102571104A publication Critical patent/CN102571104A/en
Application granted granted Critical
Publication of CN102571104B publication Critical patent/CN102571104B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a distributed encoding and decoding method for an RA (Repeat Accumulate) code, in order to solve the problems of high encoding complexity and high error level in the prior art. The method comprises the following steps: (1) after performing RA code encoding on data information of a source node, respectively sending an encoding sequence to a relay node and a target node; (2) performing relay encoding on the received encoding sequence by the relay node and sending information after being encoded to the target node; (3) constructing a combined RA encoding graph according to the RA code encoding and the relay encoding, and then constructing a multilayer RA code bipartite graph on the basis of the combined RA encoding graph; and (4) performing iteration decoding according to the multilayer RA code bipartite graph, the received encoding information of the relay node and the RA encoding information sent by the source node, and recovering the source data information. According to the method, the encoding is simply realized, the network throughput and the transmitting efficiency of the relay node are increased, the performance of the target node is improved and the method can be applied to a distributed type transmission system for relay network transmission.

Description

The distributed compilation code method of RA code
Technical field
The invention belongs to field of wireless communications networks, relate to network coding and decoding, particularly relate to a kind of distributed compilation code method to RA code, can be used in the distributed transmission system in junction network transmission, to improve the forward efficiency of network throughput and via node, improve the performance of destination node.
Background technology
A kind of packeting error-correcting code with sparse check matrix that the LDPC Shi You Massachusetts Robert Gallager of Polytechnics proposed in thesis for the doctorate in 1962, its performance is approached shannon limit, and describe and realize simple, be easy to carry out theory analysis and research, therefore become the focus on coding circle, technology reaches its maturity.
And RA code is a class LDPC code, so the research of RA code can adopt the prior art of LDPC, and analytical method is many, and can be optimized by methods such as degree distribute.RA code is a kind of good code, can complete by duplication code, interleaver, single checking code and accumulated codes four processes, and its coding is realized comparatively simple, fast convergence rate, and encoding and decoding complexity is low, is applicable to being applied to various practical communication system.
Although RA code is very ripe in prior art research, for the distributed compilation code technical research of RA code seldom, be especially applied in the research of distributed coding technology of wireless relay communication system.Fig. 1 wireless both-way trunk channel, two source nodes during by a relay nodes exchange message, need four time slots conventionally, and two source nodes take respectively a time slot and relay nodes communicates, relay nodes takies two time slots, is respectively two source node forwarding datas.And in wireless relay communication system, improve the forward efficiency of via node, and improve the performance of destination node, be a current problem in the urgent need to address.
Therefore, the people such as American scholar Srinath Puducheri have proposed the concept of LT code distributed coding first in 2006, LT code distributed coding carries out two or more source information in relay nodes, to carry out simple XOR after LT coding, then send destination node to, destination node can recover information bit according to the bit receiving.Although this coding method takes full advantage of the better feature of the longer performance of LT code code length, and communication system efficiency is improved, there is following shortcoming in the distributed compilation code of LT code: encoder complexity is higher, and have higher error floor.
Summary of the invention
The object of the invention is to the defect for above-mentioned prior art, a kind of distributed coding method based on RA coding is proposed, LT coding-network code is directly extended to source node, adopt the situation of RA code, and simplify encoder complexity, improve the performance of destination node, improve the forward efficiency of network throughput and via node.
1. technical solution of the present invention one, comprises the steps:
(1) M source node compiled for g, 1≤g≤M, M represents M mobile subscriber S 1, S 2..., S m;
(2) data message each source node wish being sent is designated as respectively d 1, d 2..., d m, in the data message of this M source node, the longest message length is k, if other source node data message length is less than k, zero padding after data message, obtains the data message d of q source node q={ d q1, d q2..., d q, k;
(3) adopt the data message d of RA code to M source node 1, d 2..., d mencode respectively, draw M coded sequence x 1, x 2..., x m, and this M coded sequence is sent to via node simultaneously, the length of each coded sequence is n, wherein r code sequence x r={ x r1, x r2..., x r, n;
(4) via node carries out XOR and computing to the M a receiving coded sequence, obtains new coded sequence y 1, y 2..., y n, wherein i code sequence is bit information x in the coded sequence that if certain source node sends in the process of computing j, ihave loss, the bit of this loss does not participate in calculating, i.e. i code sequence y i = x 1 , i ⊕ x 2 , i ⊕ · · · x j - 1 , i ⊕ x j + 1 , i ⊕ · · · ⊕ x M , i , If in the i coded sequence that institute's active node sends constantly, bit information is all lost, y i=y i-1;
(5), according to the via node coding of the source node RA coding of above-mentioned steps (3) and step (4), construct the coding line chart of associating RA code:
5a) by g, g=1,2, ..., the SDI that participates in the computing of RA code in M source node for a time is designated as a group white nodes, the check information obtaining after RA coding is designated as to a dark node, and the coding line chart of RA code puts in order and is followed successively by: a group white nodes, an a dark node, a+1 organize white nodes, a+1 dark node;
5b) two source node data information of b delivery time participation RA code computing are designated as to b group white nodes, the check information obtaining after relaying coding is designated as to b dark node, and the coding line chart of combining RA code puts in order and is followed successively by: b group white nodes, a b dark node, b+1 group white nodes, a j+1 dark node;
(6) via node is by coded sequence y 1, y 2..., y nby erasure channel, send to destination node;
(7) destination node, according to the coding line chart of associating RA code and the coded sequence receiving, adopts belief propagation interpretation method to carry out the decoding of RA code, recovers the data message d from M source node 1, d 2..., d mor partial data information { d i, 1≤i≤M.
2. technical solution of the present invention two, comprise the steps:
(1) M source node compiled for g, 1≤g≤M, M represents M mobile subscriber S 1, S 2..., S m;
(2) data message each source node wish being sent is designated as respectively d 1, d 2..., d m, in the data message of this M source node, the longest message length is k, if other source node data message length is less than k, zero padding after data message, obtains the data message d of q source node q={ d q1, d q2..., d q, k;
(3) adopt the data message d of RA code to M source node 1, d 2..., d mencode respectively, draw M coded sequence x 1, x 2..., x m, and this M coded sequence is sent to via node and destination node simultaneously, the length of each coded sequence is n, wherein r code sequence x r={ x r1, x r2..., x r, n;
(4) via node carries out XOR and computing to the M a receiving coded sequence, obtains new coded sequence y 1, y 2..., y n, wherein i code sequence is
Figure BDA0000131042040000031
in the process of computing, if bit information has loss in the coded sequence that certain source node sends, the bit of this loss does not participate in calculating, i.e. i code sequence y i = x 1 , i ⊕ x 2 , i ⊕ · · · x j - 1 , i ⊕ x j + 1 , i ⊕ · · · ⊕ x M , i , If in the i coded sequence that institute's active node sends constantly, bit information is all lost, y i=y i-1;
(5) according to the via node coding of the source node RA coding of above-mentioned steps (3) and step (4), on the basis of associating RA coding line chart, the bigraph (bipartite graph) of structure multilayer RA code:
5a) by g, g=1,2, ..., the SDI that participates in the computing of RA code in M source node for a time is designated as a group white nodes, and the check information obtaining after RA coding is designated as to a dark node, according to putting in order, is followed successively by: a group white nodes, an a dark node, a+1 organize white nodes, a+1 dark node, the coding line chart of formation RA code;
5b) two source node data information of b delivery time participation RA code computing are designated as to b group white nodes, the check information obtaining after relaying coding is designated as to b dark node, according to putting in order, be followed successively by: b group white nodes, a b dark node, b+1 group white nodes, a b+1 dark node, the coding line chart of formation associating RA code
The RA coded message that 5c) source node is directly sent to destination node is attached on the coding line chart of associating RA code with the coded message that via node sends, and has formed multilayer bigraph (bipartite graph);
(6) via node is by coded sequence y 1, y 2..., y nby erasure channel, send to destination node;
(7) destination node, according to the bigraph (bipartite graph) of multilayer RA code and the coded message of via node receiving and the RA coded message of source node transmission, adopts BP algorithm to carry out iterative decoding, and concrete decoding procedure is as follows:
Decoder is combined the decoding of RA code according to the information receiving from via node, then carry out the decoding of source node RA code, the information of more all decoding being exported merges multiplexing, and reiteration iteration like this, until finally recover source information or reach predetermined iterations.
The present invention has the following advantages:
(1) transmitting terminal coding is realized simple
Transmitting terminal adopts RA coding, by duplication code, interleaver, single checking code and accumulated codes four processes, completes, and the parity matrix of system irregular RA code can be divided into two parts: H=[H dh p], H wherein dbe sparse matrix, its row, column distribution of weight is distributed and is determined by the information variable node of RA code and the degree of check-node respectively H p = 1 0 1 1 O O 0 1 1 , Therefore, the cataloged procedure of RA code has recursive structure, realizes simple;
(2) only XOR and computing of via node, calculates simple;
(3) destination node adopts BP decoding algorithm easily to realize, and the joint decoding of multilayer RA code can improve systematic function;
(4) there are the potentiality of optimization, because RA code distributes to optimize code performance by adjustment degree, and according to system requirements, use flexibly the joint decoding of multilayer RA code, therefore reach the compromise of complexity and reliability Liang Ge aspect.
Accompanying drawing explanation
Fig. 1 is that the present invention uses (N, 1,1) communication network model;
Fig. 2 is the flow chart of the embodiment of the present invention 1;
Fig. 3 is the RA code coding line chart of source node of the present invention and the combined coding line chart of the RA code after via node coding;
Fig. 4 is the flow chart of the embodiment of the present invention 2;
Fig. 5 is the flow chart that the destination node of the embodiment of the present invention 2 is carried out multilayer RA code iterative decoding;
Fig. 6 is two structure charts of multilayer RA code of the embodiment of the present invention 2.
Embodiment
The present invention is applicable to the distributed transmission system in junction network transmission, and channel used is binary eliminated channel, and sending " 1 " reception value is " 1 ", and sending " 0 " reception value is " 0 ", if the information that do not receive is information dropout, is designated as " E ".
Embodiment 1, and destination node only adopts via node transmission information to carry out decoding
With reference to Fig. 2, being specifically implemented as follows of this example:
Step 1: M source node compiled as g, 1≤g≤M, M represents source node number, this example adopts i.e. two source nodes of M=2.
Step 2: source node carries out respectively RA coding to data message, and the coded message obtaining is sent to via node.
Two source node wishs send data message d to via node respectively 1, d 2, in the data message of these two source nodes, maximum message length is k, if certain SDI length is less than k, zero padding after data message, i.e. d 1message length k 1, make k 1=k, obtains d 1={ d 11, d 12..., d 1, k, and d 2message length be k 2, make k 2< k, need be at d 2after mend k-k 2individual 0, obtain d 2={ d 21, d 22..., d 2, k, d wherein 2, q=0, k 2< q≤k; In order to guarantee reliability transmission, these two source nodes are respectively to this SDI d 1, d 2carry out RA coding, obtain coded sequence x 1, x 2, and these two coded sequences are sent to via node simultaneously, the length of each coded sequence is n, wherein the 1st code sequence x 1={ x 11, x 12..., x 1, n, the 2nd code sequence x 2={ x 21, x 22..., x 2, n.
Step 3: via node carries out relaying coding and is sent to destination node the information receiving.
Via node is to receive two coded sequence x 1, x 2carry out XOR and computing, obtain new coded sequence y 1, y 2..., y n, and this new coded sequence is sent to destination node, wherein i code sequence is if x 1ilose y i=x 2iif, x 1iand x 2iall lose, y i=y i-1.
Step 4: according to the via node coding of the source node RA coding of above-mentioned steps 2 and step 3, construct the coding line chart of associating RA code.
4a) SDI that participates in the computing of RA code in the 1st source node for a time is made as to { d successively 1,1, d 1,3, { d 1,1, d 1,2, d isosorbide-5-Nitrae, { d 1,2, d 1,3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, a=1 wherein, 2,3,4, the check information obtaining after RA coding is x 1,1, x 1,2, x 1,3, x isosorbide-5-Nitrae, put in order as { d 1,1, d 1,3, x 1,1, { d 1,1, d 1,2, d isosorbide-5-Nitrae, x 1,2, { d 1,2, d 1,3, x 1,3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, x isosorbide-5-Nitrae, obtain the RA code coding line chart of first source node, in like manner, can obtain the coding line chart of the RA code of institute's active node, as shown in the first half of Fig. 3, wherein a group white nodes represents the SDI { d of a time participation RA code computing in g source node g, h, h=1 wherein, 2 ..., k represents h data message, a dark node represents the check information x obtaining after RA coding g, a, the information in the coding line chart of RA code puts in order and organizes white nodes, a+1 dark node into: a group white nodes, an a dark node, a+1;
4b) on the basis of RA code coding line chart, the 1st two source node data information that participate in the computing of RA code are constantly made as to { d 1,1, d 1,3and { d 2,1, d 2,2and arrange in order the check information obtaining after relaying coding
Figure BDA0000131042040000061
in like manner, can obtain b check information is
Figure BDA0000131042040000062
b=1 wherein, 2,3,4, combine in the coding line chart of RA code information and put in order as { d 1,1, d 1,3, d 2,1, d 2,2, y 1, { d 1,1, d 1,2, d isosorbide-5-Nitrae, d 2,1, y 2, { d 1,2, d 1,3, d 2,3, y 3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, d 2,4, y 4, as shown in the latter half of Fig. 3, b group white nodes represents that b delivery time participates in all source node data information d of RA code computing g, h, h=1 wherein, 2 ..., k represents h data message, b dark node represents the check information y obtaining after relaying coding b, due to the data message d of source node g, hbe that white nodes first adopts RA coding to carry out and computing, then carry out via node XOR and computing, therefore, the check information of the associating RA code of gained still meets the cryptoprinciple of RA code, be that dark node is all white nodes sums that are positioned at before it, therefore be arranged as in the following order: b group white nodes, a b dark node, b+1 group white nodes, a b+1 dark node, the coding line chart of formation associating RA code.
Step 5: destination node, according to the coding line chart of associating RA code and the coded sequence receiving, adopts belief propagation interpretation method to carry out the decoding of RA code, recovers the data message d from two source nodes 1, d 2or partial data information { d q, 1≤q≤2.
Embodiment 2, and destination node utilizes the transmission information of via node and the transmission information of source node to carry out joint decoding simultaneously
With reference to Fig. 4, being specifically implemented as follows of this example:
Steps A: M source node compiled as j, 1≤j≤M, M represents source node number, this example adopts i.e. two source nodes of M=2.
Step B: source node carries out respectively RA coding to data message, and the coded message obtaining is sent to via node and destination node.
Two source node wishs send data message d to via node respectively 1, d 2, in the data message of these two source nodes, maximum message length is k, if certain SDI length is less than k, zero padding after data message, i.e. d 1message length k 1, make k 1=k, obtains d 1={ d 11, d 12..., d 1, k, and d 2message length be k 2, make k 2< k, need be at d 2after mend k-k 2individual 0, obtain d 2={ d 21, d 22..., d 2, k, d wherein 2, q=0, k 2< q≤k; In order to guarantee reliability transmission, these two source nodes are respectively to this SDI d 1, d 2carry out RA coding, obtain coded sequence x 1, x 2, and these two coded sequences are sent to via node and destination node simultaneously, the length of each coded sequence is n, wherein the 1st code sequence x 1={ x 11, x 12..., x 1, n, the 2nd code sequence x 2={ x 21, x 22..., x 2, n.
Step C: via node carries out relaying coding and is sent to destination node the information receiving.
Via node is to receive two coded sequence x 1, x 2carry out XOR and computing, obtain new coded sequence y 1, y 2..., y n, and this new coded sequence is sent to destination node, wherein i code sequence is
Figure BDA0000131042040000071
if x 1ilose y i=x 2iif, x 1iand x 2iall lose, y i=y i-1.
Step D: according to the via node coding of the source node RA coding of above-mentioned steps B and step C, the coding line chart of first tectonic syntaxis RA code, then on associating RA encodes the basis of line chart, construct the bigraph (bipartite graph) of multilayer RA code.
Da) SDI that participates in the computing of RA code in the 1st source node for a time is made as to { d successively 1,1, d 1,3, { d 1,1, d 1,2, d isosorbide-5-Nitrae, { d 1,2, d 1,3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, a=1 wherein, 2,3,4, the check information obtaining after RA coding is x 1,1, x 1,2, x 1,3, x isosorbide-5-Nitrae, put in order as { d 1,1, d 1,3, x 1,1, { d 1,1, d 1,2, d isosorbide-5-Nitrae, x 1,2, { d 1,2, d 1,3, x 1,3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, x isosorbide-5-Nitrae, obtain the RA code coding line chart of first source node, in like manner, obtain the coding line chart of the RA code of institute's active node, as shown in the first half of Fig. 3, wherein a group white nodes represents the SDI { d of a time participation RA code computing in g source node g, h, h=1 wherein, 2 ..., k represents h data message, a dark node represents the check information x obtaining after RA coding g, a, the information in the coding line chart of RA code puts in order and organizes white nodes, a+1 dark node into: a group white nodes, an a dark node, a+1;
Db), on the basis of RA code coding line chart, the 1st two source node data information that participate in the computing of RA code are constantly made as to { d 1,1, d 1,3and { d 2,1, d 2,2and arrange in order the check information obtaining after relaying coding
Figure BDA0000131042040000072
in like manner, obtaining b check information is
Figure BDA0000131042040000073
b=1 wherein, 2,3,4, combine information in the coding line chart of RA code and put in order as { d 1,1, d 1,3, d 2,1, d 2,2, y 1, { d 1,1, d 1,2, d isosorbide-5-Nitrae, d 2,1, y 2, { d 1,2, d 1,3, d 2,3, y 3, { d 1,2, d 1,3, d isosorbide-5-Nitrae, d 2,4, y 4, as shown in the latter half of Fig. 3, wherein b group white nodes represents that b delivery time participates in all source node data information { d of RA code computing g, h, h=1 wherein, 2 ..., k represents h data message, b dark node represents the check information y obtaining after relaying coding b, due to the data message d of source node g, hbe that white nodes first adopts RA coding to carry out calculus of differences, then carry out via node XOR and computing, therefore, the check information of the associating RA code of gained still meets the cryptoprinciple of RA code, be that dark node is all white nodes sums that are positioned at before it, therefore arrange in the following order: b group white nodes, a b dark node, b+1 group white nodes, a b+1 dark node, the coding line chart of formation associating RA code;
Dc) according to the theory of constitution of RA code bigraph (bipartite graph), by the coding line chart of RA code and the coding line chart of associating RA code, obtain the bigraph (bipartite graph) of each RA code and the bigraph (bipartite graph) of associating RA code, the bigraph (bipartite graph) of this RA code is combined with the bigraph (bipartite graph) of associating RA code, and common source data message is information node, formed multilayer bigraph (bipartite graph), dotted line frame as shown in Figure 6 partly represents the bigraph (bipartite graph) of RA code, solid box partly represents the bigraph (bipartite graph) of associating RA code, this two parts shared information node, has formed multilayer bigraph (bipartite graph).
Step e: destination node is carried out iterative decoding, obtains the data message that source node sends
Destination node, according to the bigraph (bipartite graph) of multilayer RA code and the coded message of via node receiving and the RA coded message of source node transmission, adopts BP algorithm to carry out iterative decoding, and as shown in Figure 5, concrete decoding procedure is as follows:
First, by decoder, according to the information receiving from via node, combine the decoding of RA code, and export decoding information;
Then, the RA code information that adopts BP decoding algorithm directly to send to destination node to source node is carried out decoding, and exports decoding information;
Finally, to the information of all decoding outputs, merge multiplexing;
Reiteration iteration like this, until finally recover SDI or reach predetermined iterations.

Claims (3)

1. a distributed compilation code method for RA code, comprises the steps:
(1) M source node compiled for g, 1≤g≤M, M represents source node number;
(2) data message each source node wish being sent is designated as respectively d 1, d 2..., d m, in the data message of this M source node, the longest message length is k, if other source node data message length is less than k, zero padding after data message, obtains the data message d of q source node q={ d q1, d q2..., d q,k;
(3) adopt the data message d of RA code to M source node 1, d 2..., d mencode respectively, draw M coded sequence x 1, x 2..., x m, and this M coded sequence is sent to via node simultaneously, the length of each coded sequence is n, wherein r code sequence x r={ x r1, x r2..., x r,n;
(4) via node carries out XOR and computing to the M a receiving coded sequence, obtains new coded sequence y 1, y 2..., y n, wherein i code sequence is
Figure FDA0000400017450000011
in the process of computing, if bit information x in the coded sequence that certain source node sends j,ilose, the bit of this loss does not participate in calculating, i.e. i code sequence
Figure FDA0000400017450000012
if in the i coded sequence that institute's active node sends constantly, bit information is all lost, y i=y i-1;
(5), according to the via node coding of the source node RA coding of above-mentioned steps (3) and step (4), construct the coding line chart of associating RA code:
(5a) by g, g=1,2, the SDI that participates in the computing of RA code in M source node for a time is designated as a group white nodes, the check information obtaining after RA coding is designated as to a dark node, and the coding line chart of RA code puts in order and is followed successively by: a group white nodes, an a dark node, a+1 organize white nodes, a+1 dark node;
(5b) M source node data information of b delivery time participation RA code computing is designated as to b group white nodes, the check information obtaining after relaying coding is designated as to b dark node, and the coding line chart of combining RA code puts in order and is followed successively by: b group white nodes, a b dark node, b+1 group white nodes, a b+1 dark node;
(6) via node is by coded sequence y 1, y 2..., y nby erasure channel, send to destination node;
(7) destination node, according to the coding line chart of associating RA code and the coded sequence receiving, adopts belief propagation interpretation method to carry out the decoding of RA code, recovers the data message d from M source node 1, d 2..., d mor partial data information { d q, 1≤q≤M.
2. a distributed compilation code method for RA code, comprises the steps:
1) M source node compiled for g, 1≤g≤M, M represents M mobile subscriber S 1, S 2..., S m;
2) data message each source node wish being sent is designated as respectively d 1, d 2..., d m, in the data message of this M source node, the longest message length is k, if other source node data message length is less than k, zero padding after data message, obtains the data message d of q source node q={ d q1, d q2 ..., d q,k;
3) adopt the data message d of RA code to M source node 1, d 2..., d mencode respectively, draw M coded sequence x 1, x 2..., x m, and this M coded sequence is sent to via node and destination node simultaneously, the length of each coded sequence is n, wherein r code sequence x r={ x r1, x r2..., x r, n;
4) via node carries out XOR to the M a receiving coded sequence, obtains new coded sequence y 1, y 2..., y n, wherein i code sequence is
Figure FDA0000400017450000021
in the process of computing, if bit information has loss in the coded sequence that certain source node sends, the bit of this loss does not participate in calculating, i.e. i code sequence
Figure FDA0000400017450000022
if in the i coded sequence that institute's active node sends constantly, bit information is all lost, y i=y i-1;
5) according to the via node coding of the source node RA coding of above-mentioned steps (3) and step (4), the coding line chart of first tectonic syntaxis RA code, then on associating RA encodes the basis of line chart, construct the bigraph (bipartite graph) of multilayer RA code:
5a) by g, g=1,2, the SDI that participates in the computing of RA code in M source node for a time is designated as a group white nodes, and the check information obtaining after RA coding is designated as to a dark node, according to putting in order, is followed successively by: a group white nodes, an a dark node, a+1 organize white nodes, a+1 dark node, the coding line chart of formation RA code;
5b) two source node data information of b delivery time participation RA code computing are designated as to b group white nodes, the check information obtaining after relaying coding is designated as to b dark node, according to putting in order, be followed successively by: b group white nodes, a b dark node, b+1 group white nodes, a b+1 dark node, the coding line chart of formation associating RA code;
5c) bigraph (bipartite graph) of source node RA code is combined with the bigraph (bipartite graph) of associating RA code, and common source data message is information node, formed multilayer bigraph (bipartite graph);
6) via node is by coded sequence y 1, y 2..., y nby erasure channel, send to destination node;
7) destination node, according to the bigraph (bipartite graph) of multilayer RA code and the coded message of via node receiving and the RA coded message of source node transmission, adopts BP algorithm to carry out iterative decoding.
3. the distributed compilation code method of RA code according to claim 2, wherein the employing BP algorithm described in step 7) carries out iterative decoding, carries out as follows:
First, by decoder, according to the information receiving from via node, combine the decoding of RA code, and export decoding information;
Then, the RA code information that adopts BP decoding algorithm directly to send to destination node to source node is carried out decoding, and exports decoding information;
Finally, to the information of all decoding outputs, merge multiplexing;
Reiteration iteration like this, until finally recover SDI or reach predetermined iterations.
CN201210011026.7A 2012-01-15 2012-01-15 Distributed encoding and decoding method for RA (Repeat Accumulate) code Expired - Fee Related CN102571104B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210011026.7A CN102571104B (en) 2012-01-15 2012-01-15 Distributed encoding and decoding method for RA (Repeat Accumulate) code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210011026.7A CN102571104B (en) 2012-01-15 2012-01-15 Distributed encoding and decoding method for RA (Repeat Accumulate) code

Publications (2)

Publication Number Publication Date
CN102571104A CN102571104A (en) 2012-07-11
CN102571104B true CN102571104B (en) 2014-01-15

Family

ID=46415681

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210011026.7A Expired - Fee Related CN102571104B (en) 2012-01-15 2012-01-15 Distributed encoding and decoding method for RA (Repeat Accumulate) code

Country Status (1)

Country Link
CN (1) CN102571104B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109274462B (en) * 2018-09-30 2021-01-01 东北大学 Image transmission method based on improved online fountain codes
CN113391948B (en) * 2021-06-29 2022-10-21 西安电子科技大学 Folding type extensible distributed storage coding and repairing and expanding method
CN114448564B (en) * 2021-12-30 2024-02-02 杭州电子科技大学 Secondary coding design method for physical layer network coding perception route

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6141788A (en) * 1998-03-13 2000-10-31 Lucent Technologies Inc. Method and apparatus for forward error correction in packet networks
EP2348640B1 (en) * 2002-10-05 2020-07-15 QUALCOMM Incorporated Systematic encoding of chain reaction codes

Also Published As

Publication number Publication date
CN102571104A (en) 2012-07-11

Similar Documents

Publication Publication Date Title
CN101453297B (en) Encoding method and apparatus for low density generation matrix code, and decoding method and apparatus
CN106100794B (en) Coding cooperation method based on punched polarization code
CN102164026B (en) Fountain code compiling method based on deep space communication environment
JP5506879B2 (en) Channel decoding apparatus and method for communication system using low density parity check code
CN102075198B (en) Quasi-cyclic low-density parity check convolution code coding-decoding system and coding-decoding method thereof
CN101459430B (en) Encoding method and apparatus for low density generation matrix code
Mahdaviani et al. Gamma codes: A low-overhead linear-complexity network coding solution
CN102571105B (en) Coding method of code-rate-variable low-density parity-check codes (LDPCs) of which performance approximates to channel capacity
CN106100795B (en) Polar code coding cooperation method based on Plotkin construction and information bit re-dormancy
CN102611463B (en) Cascade coding and decoding system and method of multi-system low-density parity check code
CN103152060A (en) Grouping Markov overlapping coding method
CN107925422A (en) Passive optical network（PON）In adaptive forward error correction（FEC）
CN101277118A (en) Method for encoding cascaded code based on LDPC code
CN102571104B (en) Distributed encoding and decoding method for RA (Repeat Accumulate) code
CN103338091A (en) Cooperative transmission method based on distributed non-binary LDPC code
CN106209305A (en) A kind of fountain codes interpretation method under access channel
Zhou et al. Optimization of protograph-based LDPC coded BICM-ID for the Poisson PPM channel
CN107070586B (en) A kind of relay cooperative coding method and system based on low-density trellis code
CN103746772A (en) Optimization method of demodulator output soft information for LDPC (Low Density Parity Code) code modulation system
CN102355330A (en) Distributed cascade-based channel coding system and method thereof
CN103095311A (en) Collaboration decoding method of multi-system low density parity check (LDPC) code
Wang et al. Partial product-LDPC codes without rate loss
CN107257244A (en) A kind of fountain code encoding method based under broadcast environment
Winkelbauer et al. Joint network-channel coding for the asymmetric multiple-access relay channel
Jesy et al. Joint source channel network coding using QC LDPC codes

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140115

Termination date: 20200115

CF01 Termination of patent right due to non-payment of annual fee