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

Dongsheng Bi, Michael W. Hoffman, Khalid Sayood

Research output: Contribution to journalConference article

28 Citations (Scopus)

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.

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

Fingerprint

Channel coding
Decoding
Trellis codes
Convolutional codes
Finite automata

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

State machine interpretation of arithmetic codes for joint source and channel coding. / Bi, Dongsheng; Hoffman, Michael W.; Sayood, Khalid.

In: Data Compression Conference Proceedings, 01.12.2006, p. 143-152.

Research output: Contribution to journalConference article

@article{d867376ffd1346c485fe666b7c722b7e,
title = "State machine interpretation of arithmetic codes for joint source and channel coding",
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.",
author = "Dongsheng Bi and Hoffman, {Michael W.} and Khalid Sayood",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/DCC.2006.73",
language = "English (US)",
pages = "143--152",
journal = "Proceedings of the Data Compression Conference",
issn = "1068-0314",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Bi, Dongsheng

AU - Hoffman, Michael W.

AU - Sayood, Khalid

PY - 2006/12/1

Y1 - 2006/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=65649104449&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=65649104449&partnerID=8YFLogxK

U2 - 10.1109/DCC.2006.73

DO - 10.1109/DCC.2006.73

M3 - Conference article

AN - SCOPUS:65649104449

SP - 143

EP - 152

JO - Proceedings of the Data Compression Conference

JF - Proceedings of the Data Compression Conference

SN - 1068-0314

M1 - 1607249

ER -