Blahut-Arimoto algorithm and code design for action-dependent source coding problems

Kasper Fløe Trillingsgaard, Osvaldo Simeone, Petar Popovski, Torben Larsen

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

375 Downloads (Pure)

Abstract

The source coding problem with action-dependent side information at the decoder has recently been introduced to model data acquisition in resource-constrained systems. In this paper, an efficient Blahut-Arimoto-type algorithm for the numerical computation of the rate-distortion-cost function for this problem is proposed. Moreover, a simplified two-stage code structure based on multiplexing is put forth, whereby the first stage encodes the actions and the second stage is composed of an array of classical Wyner-Ziv codes, one for each action. Leveraging this structure, specific coding/decoding strategies are designed based on LDGM codes and message passing. Through numerical examples, the proposed code design is shown to achieve performance close to the rate-distortion-cost function.
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory Proceedings
Number of pages5
PublisherIEEE
Publication dateJul 2013
Pages1192-1196
ISBN (Print)978-1-4799-0446-4
DOIs
Publication statusPublished - Jul 2013
EventISIT 2013 - IEEE International Symposium on Information Theory - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Conference

ConferenceISIT 2013 - IEEE International Symposium on Information Theory
CountryTurkey
CityIstanbul
Period07/07/201312/07/2013
SeriesProceedings of the IEEE International Symposium on Information Theory
ISSN2157-8095

Fingerprint Dive into the research topics of 'Blahut-Arimoto algorithm and code design for action-dependent source coding problems'. Together they form a unique fingerprint.

  • Cite this

    Trillingsgaard, K. F., Simeone, O., Popovski, P., & Larsen, T. (2013). Blahut-Arimoto algorithm and code design for action-dependent source coding problems. In IEEE International Symposium on Information Theory Proceedings (pp. 1192-1196). IEEE. Proceedings of the IEEE International Symposium on Information Theory https://doi.org/10.1109/ISIT.2013.6620415