Rate-compatible distributed arithmetic coding

Distributed arithmetic coding has been shown to be effective for Slepian-Wolf coding with side information. In this letter, we extend it to rate-compatible coding, which is useful in presence of a feedback channel between encoder and decoder. The performance loss with respect to the original version...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2008-08, Vol.12 (8), p.575-577
Main Authors: Grangetto, M., Magli, E., Tron, R., Olmo, G.
Format: Article
Language:English
Subjects:
Applied sciences
Arithmetic
Arithmetic coding
Bit error rate
Channels
Coders
Coding
Coding, codes
Convolutional codes
Decoders
Decoding
Encoders
Entropy
Exact sciences and technology
Feedback
Information, signal and communications theory
Parity check codes
Performance loss
Signal and communications theory
Source coding
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distributed arithmetic coding has been shown to be effective for Slepian-Wolf coding with side information. In this letter, we extend it to rate-compatible coding, which is useful in presence of a feedback channel between encoder and decoder. The performance loss with respect to the original version is negligible.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2008.080645