Abstract
Aiming at the next generation forward error correction code (FEC) in the application layer, a RaptorQ code decoding algorithm is proposed in this paper. The proposed index-based decoder significantly reduces the decoding complexity by tabulates the indices of the non-zero entries in the sparse code generator matrix. As the number of tabulated indices is much less than the dimension of the code generator matrix, the computational complexity is up to ten times lower than direct implementation of the Raptor code decoder, the previous version of RaptorQ code. Finally, saving of up to two orders of magnitude in the required memory is also achieved by the proposed solution.
