State Machine Interpretation of Arithmetic Codes for Joint Source and Channel Coding

Authors:
Dongsheng Bi;Michael W. Hoffman;Khalid Sayood
Affiliations:
University of Nebraska;University of Nebraska;University of Nebraska
Venue:
DCC '06 Proceedings of the Data Compression Conference
Year:
2006

Citing 0
Cited 4

Computation of posterior marginals on aggregated state models for soft source decoding

IEEE Transactions on Communications
Improved sequential MAP estimation of CABAC encoded data with objective adjustment of the complexity/efficiency tradeoff

IEEE Transactions on Communications
A feasible VLSI engine for soft-input-soft-output for joint source channel codes

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Chase-Like Decoding of Arithmetic Codes with Applications

International Journal of Computer Vision and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. However, arithmetic coding can also be modeled as a finite state machine and can be treated as a variable-length trellis code. The number of states used for decoding can be reduced and techniques used for convolutional codes such as the list Viterbi decoding algorithm can be applied on the trellis. The proposed approach provides a rich environment for the design of joint source/channel codes. The particular implementation presented here shows significant performance improvement over previous approaches.