Sciweavers

Share
GLOBECOM
2008
IEEE

Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes

8 years 8 months ago
Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes
—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.
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where GLOBECOM
Authors Dino Sejdinovic, Robert J. Piechocki, Angela Doufexi, Mohamed Ismail
Comments (0)
books