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

被引:0
作者
Bi, Dongsheng [1 ]
Hoffman, Michael W. [1 ]
Sayood, Khalid [1 ]
机构
[1] Univ Nebraska, Dept Elect Engn, Lincoln, NE 68588 USA
来源
DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS | 2006年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:143 / +
页数:3
相关论文
共 29 条
[1]  
ANAND R, 2001, IEEE T COMM, V49
[2]  
[Anonymous], 1948, BELL SYST TECH J
[3]  
BAUER R, 2000, IEEE DCC
[4]  
BAUER R, 2001, IEEE DCC
[5]   Integrating error detection into arithmetic coding [J].
Boyd, C ;
Cleary, JG ;
Irvine, SA ;
RinsmaMelchert, I ;
Witten, IH .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (01) :1-3
[6]  
CHOU J, 2000, IEEE SELECTED AREAS, V18
[7]  
DEMIR N, 1998, IEEE DCC
[8]  
DEMIROGLU C, 2001, IEEE DCC
[9]  
GRANGETTO M, 2002, P ADV CONC INT VIS S
[10]  
GRANGETTO M, 2004, IEEE INT C COMM ICC