On Fragmentation for Fountain Codes
Conference: SCC 2013 - 9th International ITG Conference on Systems, Communication and Coding
01/21/2013 - 01/24/2013 at München, Deutschland
Proceedings: SCC 2013
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Garrammone, Giuliano; Blasco, Francisco Lázaro (Institute of Communications and Navigation, German Aerospace Center (DLR), 82234 Wessling, Germany)
Abstract:
We study the performance of selected communication schemes based on fountain codes, under maximum-likelihood (ML) decoding, as a function of the Protocol Data Unit (PDU) erasure probability. In particular, we also consider a scheme that reduces the performance loss due to fragmentation of fountain coding symbols into several PDUs. For the presented schemes, tight upper bounds on the failure probabilities are derived and finite length decoding complexity analysis are provided. Furthermore, we propose an enhanced decoding technique for one of the selected schemes.