State machine interpretation of arithmetic codes for joint source and channel coding

Dongsheng Bi, Michael W. Hoffman, Khalid Sayood

Research output: Contribution to journalConference articlepeer-review

29 Scopus citations


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.

Original languageEnglish (US)
Article number1607249
Pages (from-to)143-152
Number of pages10
JournalData Compression Conference Proceedings
StatePublished - 2006
EventData Compression Conference, DCC 2006 - Snowbird, UT, United States
Duration: Mar 28 2006Mar 30 2006

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'State machine interpretation of arithmetic codes for joint source and channel coding'. Together they form a unique fingerprint.

Cite this