RaptorQ code, as an advanced Raptor code with great flexibility and fine reception performance, has been widely adopted in international standards. Extensive research has been focused on the design and implementation of efficient decoding algorithms for Raptor codes. In this paper, a new low-complexity decoding algorithm for RaptorQ code is proposed, where the on-the-fly decoding and the incremental decoding techniques are exploited to achieve early decoding and to reduce overall computational complexity. Computer simulations show that for the proposed algorithm the decoding process may start when thirty percents of the minimum required encoded symbols are received and the overall computational complexity can be reduced by fifty percents with regards to the ML decoding algorithm in [6].
[1]
Jun Heo,et al.
On-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel
,
2011,
IEICE Trans. Commun..
[2]
Thomas Stockhammer,et al.
Raptor Forward Error Correction Scheme for Object Delivery
,
2007,
RFC.
[3]
Richard M. Karp,et al.
The rank of sparse random matrices over finite fields
,
1997,
Random Struct. Algorithms.
[4]
Todor Mladenov,et al.
Implementation and Evaluation of Raptor Codes on Embedded Systems
,
2011,
IEEE Transactions on Computers.
[5]
Thomas Stockhammer,et al.
RaptorQ Forward Error Correction Scheme for Object Delivery
,
2011,
RFC.