UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Rate adaptive binary erasure quantization with dual fountain codes

Sejdinovic, D; Piechocki, RJ; Doufexi, A; Ismail, M; (2008) Rate adaptive binary erasure quantization with dual fountain codes. In: GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE. (pp. ? - ?). IEEE

Full text not available from this repository.

Abstract

In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly optimal rate with application of duals of LT and raptor codes by a belief propagation-like algorithm which amounts to a graph pruning procedure. Furthermore, this quantizing scheme is rate adaptive, i.e., its rate can be modified on-the-fly in order to adapt to the source distribution, very much like LT and raptor codes are able to adapt their rate to the erasure probability of a channel.

Type:Proceedings paper
Title:Rate adaptive binary erasure quantization with dual fountain codes
Event:IEEE Global Telecommunications Conference (GLOBECOM 08)
Location:New Orleans, LA
Dates:2008-11-30 - 2008-12-04
ISBN-13:978-1-4244-2324-8
DOI:10.1109/GLOCOM.2008.ECP.238
Keywords:SIDE INFORMATION, SATISFIABILITY
UCL classification:UCL > School of Life and Medical Sciences > Faculty of Life Sciences > Gatsby Computational Neuroscience Unit

Archive Staff Only: edit this record