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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE communications letters Ročník 12; číslo 8; s. 575 - 577
Hlavní autori:	Grangetto, M., Magli, E., Tron, R., Olmo, G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.08.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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 Performance evaluation Codec Wyner-Ziv coding Source coding Distributed source signal arithmetic coding Arithmetic code Wyner Ziv problem Slepian-Wolf coding compression Channel coding Distributed source coding
ISSN:	1089-7798, 1558-2558
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
Bibliografia:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2008.080645