scholarly journals Improving the data recovery for short length LT codes

2020 ◽  
Vol 10 (2) ◽  
pp. 1972
Author(s):  
Nadhir Ibrahim Abdulkhaleq ◽  
Faeza Abbas Abed ◽  
Ihsan Jabbar Hasan ◽  
Falah Hasan Mahdi
Keyword(s):  
Code Generation ◽  
Degree Distribution ◽  
Short Length ◽  
Data Recovery ◽  
Data Selection ◽  
Encoding Scheme ◽  
Data Packets ◽  
Lt Code ◽  
Fountain Code ◽  
Data Length

Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.

A Degree Distribution Optimization Algorithm in Unequal-Protected LT Code

2014 ◽  
Vol 599-601 ◽  
pp. 1313-1316
Author(s):  
Wei Jiang ◽  
Jun Jie Yang
Keyword(s):  
Optimization Algorithm ◽  
Degree Distribution ◽  
Evolutionary Strategy ◽  
Practical Implementation ◽  
Coding Systems ◽  
Source Data ◽  
Lt Code ◽  
Fountain Code ◽  
The Relationship ◽  
Unequal Loss Protection

LT code is the first practical implementation of digital fountain code. The coding behavior of LT code is mainly decided by the degree distribution which determines the relationship between source data and codeword. Since coding systems with unequal loss protection are widely applied, a degree distribution optimization algorithm is designed for unequal-protected LT code. The degree distribution that minimizes the number of un-recovered source symbols is found. By introducing the weighted cost, the optimal degree distribution can be solved by evolutionary strategy. The experimental results are quite promising. Compared with LT code with robust soliton distribution, the proposed algorithm improves the number of the recovered symbols obviously with the same overhead.

scholarly journals Cloud Computing Storage Backup and Recovery Strategy Based on Secure IoT and Spark

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Dajun Chang ◽  
Li Li ◽  
Ying Chang ◽  
Zhangquan Qiao
Keyword(s):  
Cloud Computing ◽  
Internet Of Things ◽  
Spatial Data ◽  
Loss Rate ◽  
Data Recovery ◽  
Computing Device ◽  
Data Packets ◽  
Recovery Strategies ◽  
Backup And Recovery ◽  
The Cost

Spatial data occupies a large proportion of the large amount of data that is constantly emerging, but a large amount of spatial data cannot be directly understood by people. Even a highly configured stand-alone computing device can hardly meet the needs of visualization processing. In order to protect the security of data and facilitate for users the search for data and recover by mistake, this paper conducts a research on cloud computing storage backup and recovery strategies based on the secure Internet of Things and Spark platform. In the method part, this article introduces the security Internet of Things, Spark, and cloud computing backup and recovery related content and proposes cluster analysis and Ullman two algorithms. In the experimental part, this article explains the experimental environment and experimental objects and designs an experiment for data recovery. In the analysis part, this article analyzes the challenge-response-verification framework, the number of data packets, the cost of calculation and communication, the choice of Spark method, the throughput of different platforms, and the iteration and cache analysis. The experimental results show that the loss rate of database 1 in the fourth node is 0.4%, 2.4%, 1.6%, and 3.2% and the loss rate of each node is less than 5%, indicating that the system can respond to applications.

scholarly journals An ECSO-based approach for optimizing degree distribution of short-length LT codes

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Peng Luo ◽  
Hui Fan ◽  
Weiguang Shi ◽  
Xiaoli Qi ◽  
Yuhao Zhao ◽  
...  
Keyword(s):  
Degree Distribution ◽  
Short Length ◽  
Lt Codes

A Degree Distribution Optimization Algorithm for Image Transmission

2016 ◽  
Vol 37 (3) ◽  
Author(s):  
Wei Jiang ◽  
Junjie Yang
Keyword(s):  
Optimization Algorithm ◽  
Degree Distribution ◽  
Image Transmission ◽  
Unequal Error Protection ◽  
Channel Noise ◽  
Practical Implementation ◽  
Selection Scheme ◽  
Lt Code ◽  
The Relationship

AbstractLuby Transform (LT) code is the first practical implementation of digital fountain code. The coding behavior of LT code is mainly decided by the degree distribution which determines the relationship between source data and codewords. Two degree distributions are suggested by Luby. They work well in typical situations but not optimally in case of finite encoding symbols. In this work, the degree distribution optimization algorithm is proposed to explore the potential of LT code. Firstly selection scheme of sparse degrees for LT codes is introduced. Then probability distribution is optimized according to the selected degrees. In image transmission, bit stream is sensitive to the channel noise and even a single bit error may cause the loss of synchronization between the encoder and the decoder. Therefore the proposed algorithm is designed for image transmission situation. Moreover, optimal class partition is studied for image transmission with unequal error protection. The experimental results are quite promising. Compared with LT code with robust soliton distribution, the proposed algorithm improves the final quality of recovered images obviously with the same overhead.

Sign in / Sign up

Export Citation Format

Share Document