Improved online fountain codes based on shaping for left degree distribution

Huang, Taiqi; Yi, Benshun

doi:10.1016/j.aeue.2017.05.035

Cited by 14 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed SOFC has improvement on both the intermediate performance and the full recovery overhead compare to OFC. We can find that when ǫ 0 = 0.1, SOFC has better intermediate performance than all other schemes, and for full recovery it requires the same overhead as the best scheme, i.e., the scheme in [18]. Moreover, SOFC almost achieves the upper bound when ǫ = 0.1.…”

Section: B Performance Comparisonsmentioning

confidence: 84%

“…For the proposed schemes, the performance of OFCNB with γ 0 = 0.01 and SOFC is presented. For other online fountain coding schemes, we present OFC [15], IOFC [20], the scheme in [22] with quantized distance s = 50, and the scheme in [18]. We also present the upper bound in Fig.…”

Section: B Performance Comparisonsmentioning

confidence: 99%

“…7 corresponding to the situation where every coded symbol can recover one source symbol once it is received. Among these online fountain coding schemes, IOFC and the scheme in [18] improve the full recovery overhead with degraded intermediate performance compared with OFC. The scheme in [22] with quantized distance s = 50 improves the intermediate performance but requires larger 0.9 1.1 1.3 1.5 1.7 1.9 2.1 2.3 2.5 2.7 2.9 3.1 3.3 3.5 10 overhead than OFC for full recovery.…”

Section: B Performance Comparisonsmentioning

confidence: 99%

“…Based on [15], the schemes in [16] and [17] provided unequal error protection for online fountain codes. In [18], the minimum degree of source symbols was maximized for online fountain codes to achieve lower full recovery overhead and less feedback. In [19], coded symbols that contain three unrecovered source symbols were utilized for online fountain codes to reduce overhead.…”

Section: Introductionmentioning

confidence: 99%

“…One interesting problem of online fountain codes is how to reduce the full-recovery overhead and improve the intermediate performance at the same time. On the one hand, the schemes in [18] and [20] have lower overhead but worse intermediate performance than the original online fountain codes. However, the scheme in [22] has better intermediate performance but requires more full recovery overhead.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Design and Analysis of Online Fountain Codes for Intermediate Performance

Huang¹,

Fei²,

Cao³

et al. 2020

Preprint

View full text Add to dashboard Cite

For the benefit of improved intermediate performance, recently online fountain codes attract much research attention. However, there is a trade-off between the intermediate performance and the full recovery overhead for online fountain codes, which prevents them to be improved simultaneously. We analyze this trade-off, and propose to improve both of these two performance. We first propose a method called Online Fountain Codes without Build-up phase (OFCNB) where the degree-1 coded symbols are transmitted at first and the build-up phase is removed to improve the intermediate performance. Then we analyze the performance of OFCNB theoretically. Motivated by the analysis results, we propose Systematic Online Fountain Codes (SOFC) to further reduce the full recovery overhead. Theoretical analysis shows that SOFC has better intermediate performance, and it also requires lower full recovery overhead when the channel erasure rate is lower than a constant. Simulation results verify the analyses and demonstrate the superior performance of OFCNB and SOFC in comparison to other online fountain codes.

show abstract

Section: B Performance Comparisonsmentioning

confidence: 84%