Unlock instant, AI-driven research and patent intelligence for your innovation.
Distributed encoding and decoding method for RA (Repeat Accumulate) code
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A coding and distributed technology, which is applied in the field of network coding and distributed coding of RA codes, can solve the problems of high coding complexity and high error level, and achieve the effect of simple coding
Inactive Publication Date: 2014-01-15
XIDIAN UNIV
View PDF2 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
Although this encoding method makes full use of the characteristic that the longer the code length, the better the performance of the LT code, the efficiency of the communication system is improved, but the distributed encoding and decoding of the LT code has the following disadvantages: the encoding complexity is high, and it has a high error level
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0042] Embodiment 1, the destination node only uses the information transmitted by the relay node for decoding
[0043] refer to figure 2 , the specific implementation of this example is as follows:
[0044] Step 1: Code the M source nodes as g, where 1≤g≤M, and M represents the number of source nodes. In this example, M=2, that is, two source nodes.
[0045] Step 2: The source node performs RA encoding on the data information respectively, and sends the obtained encoded information to the relay node.
[0046] The two source nodes want to send data information to the relay node respectively d 1 , d 2 , in the data information of these two source nodes, the maximum information length is k, if the length of a certain source data information is less than k, it will be filled with zeros after the data information, that is, d 1 The message length k 1 , then let k 1 = k, get d 1 ={d 11 , d 12 ,...,d 1，k}, while d 2 The message length is k 2 , then let k 2 2 Back fill k...
Embodiment 2
[0053] Embodiment 2, the destination node uses the transmission information of the relay node and the transmission information of the source node to perform joint decoding
[0054] refer to Figure 4 , the specific implementation of this example is as follows:
[0055] Step A: Code M source nodes as j, where 1≤j≤M, and M represents the number of source nodes. In this example, M=2, that is, two source nodes.
[0056] Step B: The source node performs RA encoding on the data information, and sends the obtained encoded information to the relay node and the destination node.
[0057] The two source nodes want to send data information to the relay node respectively d 1 , d 2 , in the data information of these two source nodes, the maximum information length is k, if the length of a certain source data information is less than k, it will be filled with zeros after the data information, that is, d 1 The message length k 1 , then let k 1 = k, get d 1 ={d 11 , d 12 ,...,d 1，k}...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
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
technical field [0001] The invention belongs to the field of wireless communication networks, relates to network encoding and decoding, in particular to a distributed encoding and decoding method for RA codes, which can be used in distributed transmission systems in relay network transmission to improve network throughput and relay The forwarding efficiency of the node improves the performance of the destination node. Background technique [0002] LDPC is a block error-correcting code with a sparse parity check matrix proposed by Robert Gallager of the Massachusetts Institute of Technology in his doctoral dissertation in 1962. Its performance is close to the Shannon limit, and its description and implementation are simple, and it is easy to carry out theoretical analysis and research. Therefore, it has become a hot spot in the coding field, and the technology is becoming more and more mature. [0003] RA codes are a type of LDPC codes, so the research on RA codes can use th...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More