Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes

We consider lower bounds on the rate-distortion performance for the binary erasure source(BES) introduced by Martinian and Yedidia, using sparse graph codes for compression. Our approach follows that of Kudekar and Urbanke, where lower bounds on the rate distortion performance of low-density generat...

Full description

Saved in:
Bibliographic Details
Published in2010 Data Compression Conference pp. 49 - 58
Main Authors Demay, Gregory, Rathi, Vishwambhar, Rasmussen, Lars K
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2010
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We consider lower bounds on the rate-distortion performance for the binary erasure source(BES) introduced by Martinian and Yedidia, using sparse graph codes for compression. Our approach follows that of Kudekar and Urbanke, where lower bounds on the rate distortion performance of low-density generator matrix (LDGM) codes for the binary symmetric source(BSS) are derived. They introduced two methods for deriving lower bounds, namely the counting method and the test channel method. Based on numerical results they observed that the two methods lead to the same bound. We generalize these two methods for the BES and prove that indeed both methods lead to identical rate-distortion bounds for the BES and hence, also forthe BSS.
ISBN:1424464250
9781424464258
ISSN:1068-0314
2375-0359
DOI:10.1109/DCC.2010.95