Expanding window fountain codes for unequal error protection

Sejdinović, Dino; Vukobratović, Dejan; Doufexi, Angela; Šenk, V.; Piechocki, Robert J.

doi:10.1109/tcomm.2009.09.070616

Cited by 151 publications

(86 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach virtually increases the source block length which increases the FEC correction capability. In the same year, Sejdinovic et al proposed the expanding window fountain (EWF) code [22], [23]. EWF codes generate multiple windows over the source symbols, where windows expand according to the importance of the data.…”

Section: Related Workmentioning

confidence: 99%

Layer-Aware Forward Error Correction for Mobile Broadcast of Layered Media

Hellge

Gómez-Barquero

Schierl

et al. 2011

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Layer-Aware Forward Error Correction for Mobile Broadcast of Layered Media

Hellge

Gómez-Barquero

Schierl

et al. 2011

IEEE Trans. Multimedia

View full text Add to dashboard Cite

“…If not all output degree distributions are the same, this is generally not true, as output degree distributions of different average degree may induce different average input degrees in different sources and such scenario may yield an Unequal Error Protection (UEP) property across sources. Fountain codes for UEP are an active area of research [10], [11], and this may be another interesting application of distributed LT coding scenario. Next, we formulate a version of AND-OR lemma for density evolution of DLT codes.…”

Section: Distributed Lt Codesmentioning

confidence: 99%

AND-OR tree analysis of distributed LT codes

Sejdinović

Piechocki

Doufexi

2009

2009 IEEE Information Theory Workshop on Networking and Information Theory

View full text Add to dashboard Cite

Abstract-In this contribution, we consider design of distributed LT codes, i.e., independent rateless encodings of multiple sources which communicate to a common relay, where relay is able to combine incoming packets from the sources and forwards them to receivers. We provide density evolution formulae for distributed LT codes, which allow us to formulate distributed LT code design problem and prove the equivalence of performance of distributed LT codes and LT codes with related parameters in the asymptotic regime. Furthermore, we demonstrate that allowing LT coding apparatus at both the sources and the relay may prove advantageous to coding only at the sources and coding only at the relay.

show abstract

“…The fourth competing scheme denoted as SV-EWF is a method based on [23] and [24] which employs expanding window fountain codes (EWF) [25] for scalable video multicasting. EWF codes consist of several LT codes [26] that are applied separately to expanding windows of data.…”

Section: A Simulation Setupmentioning

confidence: 99%

“…It employs EWF codes [25] that consist of several LT codes [26] applied separately to expanding windows of data. This corresponds to some form of embedding coding as packet combinations are generated only with packets from the same window, which actually coincide with the importance classes of the source data.…”

Section: Related Workmentioning

confidence: 99%

Prioritized Distributed Video Delivery With Randomized Network Coding

Thomos

Chakareski

Frossard

2011

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Abstract-We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel randomized network coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the video content. We design a distributed receiver-driven streaming solution, where a client requests packets from the different priority classes from its neighbors in the overlay. Based on the received requests, a node in turn forwards combinations of the selected packets to the requesting peers. Choosing a network coding strategy at every node can be cast as an optimization problem that determines the rate allocation between the different packet classes such that the average distortion at the requesting peer is minimized. As the optimization problem has log-concavity properties, it can be solved with low complexity by an iterative algorithm. Our simulation results demonstrate that the proposed scheme respects the relative priorities of the different packet classes and achieves a graceful quality adaptation to network resource constraints. Therefore, our scheme substantially outperforms reference schemes such as baseline network coding techniques as well as solutions that employ rateless codes with built-in UEP properties. The performance evaluation provides additional evidence of the substantial robustness of the proposed scheme in a variety of transmission scenarios.Index Terms-Network coding, overlay networks, peer-to-peer (P2P) systems, rate allocation, scalable video delivery, unequal error protection, video streaming.

show abstract

Expanding window fountain codes for unequal error protection

Cited by 151 publications

References 10 publications

Layer-Aware Forward Error Correction for Mobile Broadcast of Layered Media

Layer-Aware Forward Error Correction for Mobile Broadcast of Layered Media

AND-OR tree analysis of distributed LT codes

Prioritized Distributed Video Delivery With Randomized Network Coding

Contact Info

Product

Resources

About