Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
release_4kavdjrwjbf2thpz7tds7taziu
by
M. Grangetto, E. Magli, G. Olmo
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) |
0712.0271v1
access all versions, variants, and formats of this works (eg, pre-prints)