基于空间网格图的低复杂度联合信源信道编译码方法

doi:10.7523/j.issn.2095-6134.2012.4.009

中国科学院大学学报 ›› 2012, Vol. 29 ›› Issue (4): 493-500.DOI: 10.7523/j.issn.2095-6134.2012.4.009

基于空间网格图的低复杂度联合信源信道编译码方法

霍岳恒¹, 张灿^1,2, 高绍帅¹

1. 中国科学院研究生院信息科学与工程学院, 北京 100049;
2. 中国科学院研究生院信息安全国家重点实验室, 北京 100049

收稿日期:2011-04-22 修回日期:2011-06-01 发布日期:2012-07-15
通讯作者: 张灿
基金资助:
国家自然科学基金(61032006,60972067)和国家科技重大专项(2010ZX03002-008)资助

Low-complexity joint source-channel coding and decoding approach based on space trellis

HUO Yue-Heng¹, ZHANG Can^1,2, GAO Shao-Shuai¹

1. School of Information Science and Engineering, Graduate University, Chinese Academy of Sciences, Beijing 100049, China;
2. State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China

Received:2011-04-22 Revised:2011-06-01 Published:2012-07-15

摘要/Abstract

摘要： 在分析和研究空间网格图和优化方法的基础上,采用约束条件方程组和权重值递推方法,优化空间网格图的权重参数,提出基于空间网格图的低复杂度联合信源信道编译码方法. 仿真实验结果表明,与现存方法相比,该方法有效降低了计算复杂度,并改善了译码性能,可应用于资源受限的空间通信中的流媒体的联合编译码.

关键词: 联合信源信道编译码, 变长Turbo码, 空间网格图, 权重值优化设计

Abstract: We have optimized weight value of space trellis and proposed a low-complexity joint source-channel coding and decoding approach based on space trellis. Simulation results show that, compared to the existing methods, the proposed approach reduces computation complexity and improves decoding performance. The approach can be applied to joint en/decoding of streaming media in resource-constrained space communications.

Key words: JSCC/D, VL Turbo codes, space trellis, optimization of weight value

中图分类号:

TN911.2

霍岳恒, 张灿, 高绍帅. 基于空间网格图的低复杂度联合信源信道编译码方法[J]. 中国科学院大学学报, 2012, 29(4): 493-500.

HUO Yue-Heng, ZHANG Can, GAO Shao-Shuai. Low-complexity joint source-channel coding and decoding approach based on space trellis[J]. , 2012, 29(4): 493-500.

参考文献

[1] Tu G, Liu J, Zhang C, et al. Studies and advances on joint source-channel encoding/decoding techniques in flow media communications[J]. Sci China Inf Sci, 2010, 53: 1-17.
[2] Bauer R, Hagenauer J. Iterative source/channel decoding using reversible variable length codes //Proc IEEE Data Compression Conference (DCC'00). Snowbird, Utah, USA, March 2000:93-102.
[3] Bauer R, Hagenauer J. Symbol-by-symbol MAP decoding of variable length codes //Proc 3rd ITG Conference on Source and Channel Coding (CSCC'00). Munich, Germany, January 2000:111-116.
[4] Bauer R, Hagenauer J. On variable length codes for iterative source/channel decoding //Proc IEEE Data Compression Conference (DCC'01). Snowbird, Utah, USA, March 2001:273-282.
[5] Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding: turbo codes (1) //Proc IEEE Int Conf Communications. Geneva, Switzerland, 1993: 1064-1070.
[6] Peng Z, Huang Y, Costello D J. Turbo codes for image transmission——a joint channel and source decoding approach[J]. IEEE J Select Areas Commun, 2000, 18(6): 868-879.
[7] Lakovic K, Villasenor J. Combing variable length codes and turbo codes //Proc IEEE VTC. Birmingham, Ala, USA, 2002: 1719-1723.
[8] Liu J, Tu G, Zhang C, et al. Joint source and channel decoding for variable length encoded turbo codes[J]. EURASIP J Advances in Signal Processing, 2008(1).
[9] Chen S H, Zhang C, Tu G F, et al. Low-complexity joint source-channel decoding based on variable length encoded Turbo codes[J]. Journal of the Graduate School of the Chinese Academy of Sciences, 2011(2): 246-252 (in Chinese). 陈绍宏,张灿,凃国防,等. 基于变长Turbo码的低复杂度联合信源信道编译码[J]. 中国科学院研究生院学报, 2011, 28(2): 246-252.
[10] CCSDS. Image data compression, recommended standard[S]. CCSDS 120.1-G-1, Green Book, 2007.
[11] Hellebrand S, Würtenberger A. Alternating run-length coding: A technique for improved test data compression //Handouts 3rd IEEE International Workshop on Test Resource Partitioning. 2002.
[12] Chen S H. Research on joint source-channel coding/decoding for space image transmission . Beijing: Graduate School of the Chinese Academy of Sciences, 2010(in Chinese). 陈绍宏. 面向空间图像传输的联合信源信道编译码技术的研究 . 北京: 中国科学院研究生院, 2010.
[13] Lakovic K, Villasenor J. Combining variable-length codes and turbo codes //Proc IEEE 55^th Vehicular Technology Conference (VTC'02). 2002, 4: 1719-1723.
[14] Okuda T, Tanaka E, Kasai T. A method for the correction of garbled words based on the Levenshtein metric[J]. IEEE Trans Comp, 1976, 25(2): 172-178.

基于空间网格图的低复杂度联合信源信道编译码方法

Low-complexity joint source-channel coding and decoding approach based on space trellis

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价

访问统计

联系我们