Rate adaptive binary erasure quantization with dual fountain codes

D Sejdinovic; RJ Piechocki; A Doufexi; MR Ismail

doi:10.1109/GLOCOM.2008.ECP.238

Rate adaptive binary erasure quantization with dual fountain codes

D Sejdinovic, RJ Piechocki, A Doufexi, MR Ismail

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

1 Citation (Scopus)

511 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 contribution	Rate adaptive binary ersure equantiation with dual fountain codes
Original language	English
Title of host publication	Globecom 2008, New Orleans
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1 - 5
Number of pages	5
ISBN (Print)	9781424423248
DOIs	https://doi.org/10.1109/GLOCOM.2008.ECP.238
Publication status	Published - Nov 2008
Event	Global Telecommunications Conference, 2008 (GLOBECOM 2008) - New Orleans, United States Duration: 1 Nov 2008 → …

Publication series

Name
ISSN (Print)	1930529X

Conference

Conference	Global Telecommunications Conference, 2008 (GLOBECOM 2008)
Country/Territory	United States
City	New Orleans
Period	1/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 [email protected].

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

Keywords

fountain codes

Access to Document

10.1109/GLOCOM.2008.ECP.238

Conference paperAccepted author manuscript, 133 KB
Accompanying conference posterAccepted author manuscript, 347 KB

http://hdl.handle.net/1983/1251

Handle.net

Persistent link

Cite this

@inproceedings{1aec4792c3424f929c59fa8fbdfd51b2,

title = "Rate adaptive binary erasure quantization with dual fountain codes",

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.",

keywords = "fountain codes",

author = "D Sejdinovic and RJ Piechocki and A Doufexi and MR Ismail",

note = "Rose publication type: Conference contribution Additional information: With accompanying conference poster Terms of use: Copyright {\textcopyright} 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ; Global Telecommunications Conference, 2008 (GLOBECOM 2008) ; Conference date: 01-11-2008",

year = "2008",

month = nov,

doi = "10.1109/GLOCOM.2008.ECP.238",

language = "English",

isbn = "9781424423248",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

pages = "1 -- 5",

booktitle = "Globecom 2008, New Orleans",

address = "United States",

}

TY - GEN

T1 - Rate adaptive binary erasure quantization with dual fountain codes

AU - Sejdinovic, D

AU - Piechocki, RJ

AU - Doufexi, A

AU - Ismail, MR

N1 - 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2008/11

Y1 - 2008/11

N2 - 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.

AB - 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.

KW - fountain codes

U2 - 10.1109/GLOCOM.2008.ECP.238

DO - 10.1109/GLOCOM.2008.ECP.238

M3 - Conference Contribution (Conference Proceeding)

SN - 9781424423248

SP - 1

EP - 5

BT - Globecom 2008, New Orleans

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - Global Telecommunications Conference, 2008 (GLOBECOM 2008)

Y2 - 1 November 2008

ER -

Rate adaptive binary erasure quantization with dual fountain codes

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this