A novel rateless codes design scheme based on two‐stage encoding and forward equal probability. (30th September 2013)

• Record Type: Journal Article
• Authors: Li, Yunji; Yang, Xiaolong; Dai, Zeyang; Zhao, Changming; Long, Keping
• Is Part Of: International journal of communication systems. Volume 28:Number 3(2015)
• Page Start: 426
• Page End: 436
• Publication Date: 2013-09-30
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2674
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main" id="dac2674-abs-0001"> <title>Summary</title> <p id="dac2674-para-0006">This paper proposes an ideal rateless codes model to comprehensively describe rateless codes and extends the definition of systematic linear block code to generalized systematic code. Under the proposed model, average delay, maximum disorder, and uniformity recovery entropy are introduced as performance indices to design efficient rateless codes. A novel coding scheme based on two‐stage encoding and forward equal probability is proposed to optimize the proposed indices. In the first stage, the first <italic>k</italic> symbols are encoded, aiming to improve the performance of order recovery, uniformity recovery, and transmission efficiency as much as possible. In the second stage, the remaining infinite symbols are encoded, where the symbols with high degree are used to compensate the symbols loss in the first stage. Simulation results show that the proposed scheme can achieve generalized systematic rateless codes with high probability and also has less average delay and maximum disorder, better capacity achievability, and uniformity recovery performance than Luby trasform (LT) codes and rateless coded symbol sorting algorithm. Besides, the proposed scheme has the aforementioned advantages compared with expending window fountain codes except for uniformity recovery and maximum disorder performance when the erasure rate is higher than about 0.25. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>