Design of improved Luby transform codes with decreasing ripple size and feedback
نویسندگان
چکیده
In this study, the design of improved Luby transform codes with decreasing ripple size (LTC-DRS) with feedback is presented. Under the proposed design, a new degree distribution algorithm named generalised degree distribution algorithm (GDDA) is proposed, which can achieve arbitrary ripple size revolution accurately. On the basis of GDDA, an accurate ripple size revolution based on binomial fitting is proposed, which can keep the ripple size to a suitable value throughout the decoding process. Furthermore, the authors introduce the feedback and propose a shifted ripple size revolution to diversify the degree values. The improved LTC-DRS with feedback is evaluated and compared with the existing schemes. The simulation results demonstrate that it outperforms other existing schemes in terms of average overhead, average degree of encoded symbols, memory usage and energy consumption.
منابع مشابه
On LT Codes with Decreasing Ripple Size
In the orignal work on LT codes by Luby, the ripple size during decoding was designed to be approximately constant. In fact, the Ideal Soliton and the Robust Soliton distributions were designed to yield an approximately unit ripple size and a fixed ripple size greater than one, respectively. In this work, the redundancy within an LT code is characterized, and it is found that a decreasing rippl...
متن کاملRegularized Variable-Node LT Codes with Improved Erasure Floor Performance
We consider the use of extrinsic information transfer charts for the design of Luby Transform (LT) codes over the binary erasure channel (BEC). In particular, we formulate an optimization problem to determine asymptotically good checknode degree distributions in terms of decoder overhead. We further propose a modified encoding scheme that maximizes the minimum variable-node degree, thus optimiz...
متن کاملUnequal error protection using LT codes and block duplication
Luby Transform (LT) codes are powerful packet erasure codes with low encoding and decoding complexity. We provide a simple method to improve the bit error rate performance of LT codes. Moreover, we exploit our method to design a new approach for unequal error protection with LT codes. We used simulations to compare our approach with a state of the art unequal error protection technique when the...
متن کاملRateless Codes for the Multicast Stream Authentication Problem
We study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a pro...
متن کاملErasure Codes with a Hierarchical Bundle Structure
This paper presents a proof of the existence of computationally fast probabilistic erasure codes at distance ǫ from being MDS, namely the decoding algorithm is able with high probability to reconstruct the n letter message from any set of (1+ǫ)n letters. It can either be fixed rate or a rateless LT code [10] in that any number of code letters can be produced and each is produced independently o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IET Communications
دوره 8 شماره
صفحات -
تاریخ انتشار 2014