Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem

Details Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem

2007-12-03

arxiv.org/abs/0712.0271v2

Computer Science

Information Theory

submitted to IEEE Transactions on Signal processing, Nov. 2007. Revised version accepted with minor revisions

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50874