Memory and complexity analysis of on-the-fly coding schemes for multimedia multicast communications - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Memory and complexity analysis of on-the-fly coding schemes for multimedia multicast communications

Résumé

A new class of erasure codes for delay-constraint applications, called on-the-fly coding, have recently been introduced for their improvements in terms of recovery delay and achievable capacity. Despite their promising characteristics, little is known about the complexity of the systematic and non-systematic variants of this code, notably for live multicast transmission of multimedia content which is their ideal use case. Our paper aims to fill this gap and targets specifically the metrics relevant to mobile receivers with limited resources: buffer size requirements and computation complexity of the receiver. As our contribution, we evaluate both code variants on uniform and bursty erasure channels. Results obtained are unequivocal and demonstrate that the systematic codes outperform the nonsystematic ones, in terms of both the buffer occupancy and computation overhead.
Fichier principal
Vignette du fichier
Lacan_5902.pdf (169.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02553121 , version 1 (24-04-2020)

Identifiants

Citer

Guillaume Smith, Emmanuel Lochin, Jérôme Lacan, Roksana Boreli. Memory and complexity analysis of on-the-fly coding schemes for multimedia multicast communications. IEEE International Conference on Communications (ICC 2012), Jun 2012, Ottawa, Canada. pp.2070-2074, ⟨10.1109/ICC.2012.6364122⟩. ⟨hal-02553121⟩
13 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More