5th International Mobile Multimedia Communications Conference

Research Article

Rateless Distributed Source Code Design

Download641 downloads
  • @INPROCEEDINGS{10.4108/ICST.MOBIMEDIA2009.7455,
        author={Dino Sejdinovic and Robert J. Piechocki and Angela Doufexi},
        title={Rateless Distributed Source Code Design},
        proceedings={5th International Mobile Multimedia Communications Conference},
        publisher={ICST},
        proceedings_a={MOBIMEDIA},
        year={2010},
        month={5},
        keywords={},
        doi={10.4108/ICST.MOBIMEDIA2009.7455}
    }
    
  • Dino Sejdinovic
    Robert J. Piechocki
    Angela Doufexi
    Year: 2010
    Rateless Distributed Source Code Design
    MOBIMEDIA
    ICST
    DOI: 10.4108/ICST.MOBIMEDIA2009.7455
Dino Sejdinovic1,*, Robert J. Piechocki1,*, Angela Doufexi1,*
  • 1: Centre for Communications Research, Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK, BS8 1UB
*Contact email: d.sejdinovic@bristol.ac.uk, r.j.piechocki@bristol.ac.uk, a.doufexi@bristol.ac.uk

Abstract

Over the past decade, rateless codes, i.e., digital fountain codes, have emerged as an efficient and robust solution for reliable data transmission over packet erasure networks and a particularly suitable one for multicasting and broadcasting applications where users may experience variable channel conditions and packet loss rates, such as mobile environments. Luby Transform (LT) and Raptor codes are practical fountain codes with a capacity approaching performance and a low computational cost. In addition to their channel coding applications, the use of fountain codes for various kinds of distributed source compression and distributed joint-source channel coding has been extensively studied lately, and with promising results. However, a systematic treatise of the code design and optimization considerations for such non-standard applications of fountain codes is still absent. In this contribution, we overview the main results concerned with rateless codes for distributed source coding and outline several examples of data dissemination protocols where carefully designed fountain codes can provide strikingly simple, yet robust solutions yielding both distributed source coding and channel coding gains.