Performance Analysis of Raptor Codes under Maximum Likelihood Decoding

Publication Type:
Journal Article
Citation:
IEEE Transactions on Communications, 2016, 64 (3), pp. 906 - 917
Issue Date:
2016-03-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
07393818.pdfPublished Version676.21 kB
Adobe PDF
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes with a systematic low-density generator-matrix code as the pre-code. By investigating the rank of the product of two random coefficient matrices, we derive upper and lower bounds on the decoding failure probability. The accuracy of our analysis is validated through simulations. Results of extensive Monte Carlo simulations demonstrate that for Raptor codes with different degree distributions and pre-codes, the bounds obtained in this paper are of high accuracy. The derived bounds can be used to design near-optimum Raptor codes with short and moderate lengths.
Please use this identifier to cite or link to this item: