Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Source Coding for Erasure Channels
KTH, School of Electrical Engineering (EES), Communication Theory.
2011 (English)Student paper other, 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The main goal of this thesis is to bound the rate-distortion performance of the aforementioned sparse-graph codes for lossy compression of a BES. As our main contributions, we first derive lower bounds on the rate-distortion performance of LDGM codes for the BES, which are valid for any LDGM code of a given rate and generator node degree distribution and any encoding function. Our approach follows that of Kudekar and Urbanke, where lower bounds were derived for the BSS case. 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 for the BSS. Secondly, based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion performance of the check regular Poisson LDGM (CRP LDGM) ensemble and the compound LDGM-LDPC ensemble for the BES.We also show that there exist compound LDGM-LDPC codes, with degrees independent of the blocklength, which can achieve any given point on the Shannon rate-distortion curve of the BES.

Place, publisher, year, edition, pages
2011. , 76 p.
Series
EES Examensarbete / Master Thesis, XR-EE-KT 2011:004
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-55297OAI: oai:DiVA.org:kth-55297DiVA: diva2:471235
Uppsok
Technology
Examiners
Available from: 2012-01-19 Created: 2012-01-02 Last updated: 2012-03-15Bibliographically approved

Open Access in DiVA

fulltext(783 kB)340 downloads
File information
File name FULLTEXT01.pdfFile size 783 kBChecksum SHA-512
432d75f89d3601beafc41a8c44bfedd1d1fb62f3688a791647a93a5f2c5b32138ada7bf5487e0a6038867270d0c9008e22a50ab9e2dcab8ab747b91f915dc19b
Type fulltextMimetype application/pdf

By organisation
Communication Theory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 340 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 110 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf