Open AccessAccumulate rateless codes and their performances over additive white Gaussian noise channel
Author(s) -
Chen Shaolei,
Zhang Zhaoyang,
Zhu Liangliang,
Wu Kedi,
Chen Xiaoming
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0315
Subject(s) - raptor code , fountain code , online codes , computer science , luby transform code , algorithm , tornado code , additive white gaussian noise , theoretical computer science , forward error correction , turbo code , block code , linear code , decoding methods , channel (broadcasting) , telecommunications
In this study, the authors propose a new class of rateless codes applicable to noisy channels, that is, the so‐called accumulate rateless (AR) codes, which concatenate the low density generator matrix (LDGM) rateless code with a simple post‐code, that is, a post‐position accumulator. The new coding structure is not only effective in reducing the ‘error floor’ as observed in traditional LDGM rateless codes such as Luby transform (LT) codes, but also quite simple for realisation as compared with the rateless codes using a pre‐coding structure such as Raptor codes. The extrinsic information transfer charts and the corresponding projection of intersectant curves for both the systematic and non‐systematic AR codes are analysed. Based on these, their convergence performance and optimal degree distributions are investigated. Simulation results show that, the performance of AR codes over additive white Gaussian noise channel is comparable to that of Raptor codes.