A method of encoding and decoding of digital fountain code based on arm
An implementation method, digital fountain technology, applied in the field of encoding and decoding of digital fountain codes, can solve the problems of high decoding cost, complex calculation, and many iterations, so as to reduce the number of iterations, simplify the calculation process, and reduce the number of iterations Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0035] Specific implementation mode one: a kind of coding and decoding implementation method of the digital fountain code based on ARM of the present embodiment specific process is:
[0036] Step 1. Uniformly and randomly generate two positive integers X and Y in the encoding module, where X and Y are independent of each other and satisfy: 1≤X≤K-1, 1≤Y≤K-1;
[0037] K is the number of original data packets, and the value of K is a positive integer;
[0038] The robust solitary wave distribution is:
[0039] In the formula, ρ(i) is the ideal solitary wave distribution function; τ(i) is the variable in the robust solitary wave distribution formula;
[0040]
[0041] Where 1≤j≤K; sum is the summation function;
[0042] Randomly select a parameter r between 0-1, there must be a j in 1≤j≤k so that sum(j)
[0043] Step 2. If the positive integer X and the degree value d do not satisfy the condition 1
specific Embodiment approach 2
[0080] Specific embodiment two: the difference between this embodiment and specific embodiment three is: the ideal solitary wave distribution function ρ(i) is:
[0081]
[0082] Other steps and parameters are the same as those in the first embodiment.
specific Embodiment approach 3
[0083] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is: the variable τ(i) in the robust solitary wave distribution formula is:
[0084]
[0085] where s is the mathematical expectation of encoded N packets of degree 1, c is a free variable, and δ is the probability limit that the decoding module cannot decode after receiving the encoded N data packets;
[0086] N is the number of encoded data packets, K≤N.
[0087] Other steps and parameters are the same as those in Embodiment 1 or 2.
[0088] Specific Embodiment 3: This embodiment differs from one of Specific Embodiments 1 to 3 in that: the value of c is 1.
[0089] Other steps and parameters are the same as those in the first to third specific embodiments.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com