Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed "distributed arithmetic coding", which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along with a soft joint decoder. The proposed scheme provides several advantages over existing Slepian-Wolf coders, especially its good performance at small block lengths, and the ability to incorporate arbitrary source models in the encoding process, e.g. context-based statistical models. We have compared the performance of distributed arithmetic coding with turbo codes and low-density parity-check codes, and found that the proposed approach has very competitive performance.
submitted to IEEE Transactions on Signal processing, Nov. 2007. Revised version accepted with minor revisions

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/173684

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.0271
 http://arxiv.org/abs/0712.0271

Collections

arXiv