On the windowed encoding complexity of SC-LDGM codes for lossy source compression

Document Type

Conference Proceeding

Publication Date

2-2-2017

Abstract

It has been shown that spatially coupled low-density generator-matrix (SC-LDGM) code ensembles display distortion saturation for the lossy binary symmetric source coding problem with belief propagation guided decimation algorithms, in the sense that the distortion of the SC-LDGM code ensemble approaches the optimal distortion of the underlying (uncoupled) LDGM block code ensemble. This has also been demonstrated for the class of protograph-based SC-LDGM code ensembles with windowed encoding (WE), where distortion close to the rate distortion limit was obtained with low-latency encoding. In this paper, we propose and compare two decimation techniques for lowering the WE complexity of SC-LDGM codes that maintain distortion performance close to the rate-distortion bound.

Identifier

85015224532 (Scopus)

ISBN

[9784885523090]

Publication Title

Proceedings of 2016 International Symposium on Information Theory and Its Applications Isita 2016

First Page

596

Last Page

600

This document is currently not available here.

Share

COinS