Performance Analysis and Improvement of Online Fountain Codes

Huang, Jingxuan; Fei, Zesong; Cao, Congzhe; Xiao, Ming; Jia, Dongli

doi:10.1109/tcomm.2018.2867436

Cited by 19 publications

(26 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Online fountain codes are proposed in [16], where an optimal encoding strategy is found efficiently based on the instantaneous decoding state. A modified online fountain encoding scheme is introduced in [17] to provide unequal error protection, and a theoretical framework is proposed in [18] to analyze online fountain codes more accurately. e rateless codes have been applied to FH systems in existing works.…”

Section: Introductionmentioning

confidence: 99%

Analysis and Design of Systematic Rateless Codes in FH/BFSK System with Interference

Dai

Zhao

Chen

et al. 2020

Mobile Information Systems

View full text Add to dashboard Cite

e asymptotic analysis of systematic rateless codes in frequency hopping (FH) systems with interference is first provided using discretized density evolution (DDE) and compared with the traditional fixed-rate scheme. A simplified analysis with Gaussian assumption of initial message is proposed in the worst case of interference, which has much lower complexity and provides a very close result to DDE. Based on this simplified analysis, the linear programming is employed to design rateless codes and the simulation results on partial-band interference channels show that the optimized codes have more powerful antijamming performance than the codes originally designed for conventional systems.

show abstract

Section: Introductionmentioning

confidence: 99%

Analysis and Design of Systematic Rateless Codes in FH/BFSK System with Interference

Dai

Zhao

Chen

et al. 2020

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…In [19], coded symbols that contain three unrecovered source symbols were utilized for online fountain codes to reduce overhead. A new theoretical analysis framework was proposed in [20] to more accurately describe the relationship between the number of coded symbols transmitted and the number of source symbols recovered. In [21], online fountain codes were used in wireless sensor networks for data gathering.…”

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%

“…In the proposed scheme, i.e., Online Fountain Codes without Build-up phase (OFCNB), the degree-1 coded symbols are transmitted first and the build-up phase in the original online fountain codes is removed. By exploiting the theoretical framework in [20], the intermediate performance and the full recovery overhead of the proposed OFCNB are analyzed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design and Analysis of Online Fountain Codes for Intermediate Performance

Huang¹,

Fei²,

Cao³

et al. 2020

Preprint

Self Cite

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

“…The benefits of fountain codes in terms of efficiency, reliability, and robustness over fixed-rate codes were also demonstrated in [15]- [18] for additive white Gaussian noise (AWGN) and block fading channels. Recently, the online property of fountain codes has been considered to reduce the encoding overhead [19], [20]. The benefits of fountain codes over rate-compatible codes are: 1) Rate-compatible codes exhibit high encoding complexity as the encoder generates all parity bits irrespective of the required number of parity bits for the successful decoding;…”

Section: Introductionmentioning

confidence: 99%

Distributed LT Codes With Improved Error Floor Performance

Hussain

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Distributed Luby transform (DLT) codes achieve a significant performance improvement in multi-source relay networks compared with the individual Luby transform (LT) code designed for each source. Since the DLT codes preserve the properties of the LT codes, the error floor is dominated by the low variable-node degrees in the bipartite graph, developed for iterative message passing decoding. Therefore, we analyze the error floor of the DLT codes for a multi-source, single relay, and a single destination network over additive white Gaussian noise (AWGN) channels. We modify the encoding process at the sources and propose a new relay combining scheme at the relay. The encoding process at the sources and the combining scheme at the relay are coordinated with the aim of improving the error floor performance of the proposed DLT codes. We derive a lower bound of the bit error probability of the DLT codes over AWGN channels. Furthermore, we optimize the relay degree distribution in terms of the overhead by using the framework of extrinsic information transfer chart analysis. The numerical results confirm that the proposed DLT coding scheme significantly outperforms the conventional scheme, especially in the error floor region.

show abstract

Performance Analysis and Improvement of Online Fountain Codes

Cited by 19 publications

References 18 publications

Analysis and Design of Systematic Rateless Codes in FH/BFSK System with Interference

Analysis and Design of Systematic Rateless Codes in FH/BFSK System with Interference

Design and Analysis of Online Fountain Codes for Intermediate Performance

Distributed LT Codes With Improved Error Floor Performance

Contact Info

Product

Resources

About