Joint source-channel decoding of variable-length codes with soft information: A survey

被引:7
作者
Guillemot, C
Siohan, P
机构
[1] IRISA, INRIA, F-35042 Rennes, France
[2] France Telecom, R&D Div, F-35512 Rennes, France
关键词
joint source-channel decoding; source-controlled decoding; turbo principle; variable-length codes;
D O I
10.1155/ASP.2005.906
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multimedia transmission over time-varying wireless channels presents a number of challenges beyond existing capabilities conceived so far for third-generation networks. Efficient quality-of-service (QoS) provisioning for multimedia on these channels may in particular require a loosening and a rethinking of the layer separation principle. In that context, joint source-channel decoding (JSCD) strategies have gained attention as viable alternatives to separate decoding of source and channel codes. A statistical framework based on hidden Markov models (HMMs) capturing dependencies between the source and channel coding components sets the foundation for optimal design of techniques of joint decoding of source and channel codes. The problem has been largely addressed in the research community, by considering both fixed-length codes (FLC) and variable-length source codes (VLC) widely used in compression standards. joint source-channel decoding of VLC raises specific difficulties due to the fact that the segmentation of the received bitstream into source symbols is random. This paper makes a survey of recent theoretical and practical advances in the area of JSCD with soft information of VLC-encoded sources. It first describes the main paths followed for designing efficient estimators for VLC-encoded sources, the key component of the JSCD iterative structure. It then presents the main issues involved in the application of the turbo principle to JSCD of VLC-encoded sources as well as the main approaches to source-controlled channel decoding. This survey terminates by performance illustrations with real image and video decoding systems.
引用
收藏
页码:906 / 927
页数:22
相关论文
共 50 条
[31]   JOINT ITERATIVE SOURCE-CHANNEL DECODING OF THREE CORRELATED SOURCES [J].
Zheng Jian ;
Bie Hongxia ;
Xu Dijia ;
Lei Chunyang ;
Zhang Xuekun .
2014 4TH IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT (IEEE IC-NIDC), 2014, :6-10
[32]   Estimation of redundancy in compressed image and video data for joint source-channel decoding [J].
Nguyen, H ;
DuHamel, P .
GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, :2198-2202
[33]   Joint Source-Channel En/Decoding Based on a New Symbol-Level Joint Trellis [J].
Tu Guofang ;
Liu Jianjun ;
Zhang Can ;
Wang Qiang .
CHINESE JOURNAL OF ELECTRONICS, 2011, 20 (01) :114-120
[34]   Joint source-channel turbo decoding of entropy-coded sources [J].
Guyader, A ;
Fabre, E ;
Guillemot, C ;
Robert, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (09) :1680-1696
[35]   Synchronization recovery of variable-length codes [J].
Zhou, GC ;
Zhang, Z .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) :219-227
[36]   Repeated joint source-channel decoding with reduced new bit errors [J].
Xu, W .
SIGNAL PROCESSING, 2006, 86 (01) :1-7
[37]   Soft-input soft-output decoding of variable length codes [J].
Wen, JT ;
Villasensor, J .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (05) :689-692
[38]   Iterative Joint Source-Channel Decoding with source statistics estimation: Application to image transmission [J].
Belhadj, Haifa ;
Zaibi, Sonia ;
Bouallegue, Ammar .
SIGNAL PROCESSING FOR IMAGE ENHANCEMENT AND MULTIMEDIA PROCESSING, 2008, :301-311
[39]   A novel decoding method for Linear Index Joint Source-Channel Coding Schemes [J].
Mahmood, Rehan ;
Qin Huang ;
Wang Zulin .
2016 13TH INTERNATIONAL BHURBAN CONFERENCE ON APPLIED SCIENCES AND TECHNOLOGY (IBCAST), 2016, :595-600
[40]   Iterative Joint Source-Channel Decoding Aided Transmission of Losslessly Compressed Video [J].
Zhu, Chuan ;
Huo, Yongkai ;
Maunder, Rob G. ;
Kawade, Santosh ;
Hanzo, Lajos .
2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2013, :4582-4587