|
Published Articles >> Table of Contents >> Abstract
Data Compression Conference (DCC'06)
pp. 143-152
State Machine Interpretation of Arithmetic Codes for Joint Source and Channel Coding
Dongsheng Bi, University of Nebraska
Michael W. Hoffman, University of Nebraska
Khalid Sayood, University of Nebraska
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.73
Send link to a friend
| 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.
|
 Additional Information
|
Citation:
Dongsheng Bi, Michael W. Hoffman, Khalid Sayood,
"State Machine Interpretation of Arithmetic Codes for Joint Source and Channel Coding,"
dcc,
pp. 143-152,
Data Compression Conference (DCC'06),
2006
|
|
