Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem release_4kavdjrwjbf2thpz7tds7taziu

by M. Grangetto, E. Magli, G. Olmo

Released as a article .

2007  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  284.6 kB
file_rvzsxclfqrds3b5dqwpxnswdum
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2007-12-03
Version   v1
Language   en ?
arXiv  0712.0271v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 367d1f16-edb8-4b0e-a758-5e058677179b
API URL: JSON