Rate adaptive binary erasure quantization with dual fountain codes

D Sejdinovic, RJ Piechocki, A Doufexi, MR Ismail

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

1 Citation (Scopus)
357 Downloads (Pure)

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.
Translated title of the contributionRate adaptive binary ersure equantiation with dual fountain codes
Original languageEnglish
Title of host publicationGlobecom 2008, New Orleans
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1 - 5
Number of pages5
ISBN (Print)9781424423248
DOIs
Publication statusPublished - Nov 2008
EventGlobal Telecommunications Conference, 2008 (GLOBECOM 2008) - New Orleans, United States
Duration: 1 Nov 2008 → …

Publication series

Name
ISSN (Print)1930529X

Conference

ConferenceGlobal Telecommunications Conference, 2008 (GLOBECOM 2008)
CountryUnited States
CityNew Orleans
Period1/11/08 → …

Bibliographical note

Rose publication type: Conference contribution

Additional information: With accompanying conference poster

Terms of use: Copyright © 2008 IEEE. Reprinted from GLOBECOM 2008. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

  • fountain codes

Fingerprint Dive into the research topics of 'Rate adaptive binary erasure quantization with dual fountain codes'. Together they form a unique fingerprint.

Cite this