Fountain Code Design for Data Multicast with Side Information

doi:10.1109/TWC.2009.081076

Fountain Code Design for Data Multicast with Side Information

2009-10-01

21

OA

AI

DOI：10.1109/TWC.2009.081076

Original

Original request for help

Save

Abstract

En 中文

Fountain codes are a robust solution for data multi-casting to a large number of receivers which experience variable channel conditions and different packet loss rates. However, the standard fountain code design becomes inefficient if all receivers have access to some side information correlated with the source information. We focus our attention on the cases where the correlation of the source and side information can be modelled by a binary erasure channel (BEC) or by a binary input additive white Gaussian noise channel (BIAWGNC). We analyse the performance of fountain codes in data multicasting with side information for these cases, derive bounds on their performance and provide a fast and robust linear programming optimization framework for code parameters. We demonstrate that systematic Raptor code design can be employed as a possible solution to the problem at the cost of higher encoding/decoding complexity, as it reduces the side information scenario to a channel coding problem. However, our results also indicate that a simpler solution, non-systematic LT and Raptor codes, can be designed to perform close to the information theoretic bounds.

Keywords:

Fountain codes

distributed compression

joint source-channel coding

side information

Fountain Code Design for Data Multicast with Side Information

Abstract

Journal

Organization