Joint Source Channel Coding Using Arithmetic Codes and Trellis Coded Modulation

Authors:
Cenk Demiroglu;Michael W. Hoffman;Khalid Sayood
Affiliations:
-;-;-
Venue:
DCC '01 Proceedings of the Data Compression Conference
Year:
2001

Citing 4
Cited 3

Joint Source/Channel Coding Using Arithmetic Codes

DCC '00 Proceedings of the Conference on Data Compression
Image Transmission Using Arithmetic Coding Based Continuous Error Detection

DCC '98 Proceedings of the Conference on Data Compression
Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

Joint source-channel decoding of variable-length codes with soft information: a survey

EURASIP Journal on Applied Signal Processing
Soft and joint source-channel decoding of quasi-arithmetic codes

EURASIP Journal on Applied Signal Processing
Improved sequential MAP estimation of CABAC encoded data with objective adjustment of the complexity/efficiency tradeoff

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Previous work has indicated that using an arithmetic encoder with reserved probability space can pro vide powerful error detection and error correction when used with a sequential decoding algorithm. How ever, performance improvements were limited at high error rates, principally because of the lack of an explicit decoding tree. In this work a Trellis Coded Modulation scheme is used to provide a convenient tree for a list decoding algorithm. Results are obtained for both a small alphabet application (SPIHT encoded image) and a large alphabet application (predictive lossless image compression). Simulations on A WGN channels with bit err or rates in the range of 10^{-3} to 10^{-1.5} show significant pack et recovery rates even for the poorest channels.