欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2011, Vol. 28 ›› Issue (2): 246-252.DOI: 10.7523/j.issn.2095-6134.2011.2.017

• 论文 • 上一篇    下一篇

基于变长Turbo码的低复杂度联合信源信道译码

陈绍宏1, 张灿1,2, 凃国防1, 霍岳恒1   

  1. 1. 中国科学院研究生院信息科学与工程学院, 北京 100049;
    2. 中国科学院研究生院信息安全国家重点实验室, 北京 100049
  • 收稿日期:2010-04-26 修回日期:2010-05-10 发布日期:2011-03-15
  • 基金资助:

    国家自然科学基金(61032006,60773137,60972067)和国家专用项目(2069901)资助

Low-complexity joint source-channel decoding based on variable length encoded Turbo codes

CHEN Shao-Hong1, ZHANG Can1,2, TU Guo-Fang1, HUO Yue-Heng1   

  1. 1. School of Information Science and Engineering, Graduate University, Chinese Academy of Sciences, Beijing 100049, China;
    2. State Key Laboratory of Information Security, Beijing 100049, China
  • Received:2010-04-26 Revised:2010-05-10 Published:2011-03-15

摘要:

基于变长Turbo码的联合信源信道译码通过构造联合译码平面网格图,具有比比特级译码更好的性能.但平面网格图复杂,使变长Turbo码译码复杂度高.基于此,构造了一个空间网格图,提出基于变长Turbo码的低复杂度联合信源信道译码方法.仿真结果表明,该算法比平面网格图计算复杂度减少约3.8%,在SER(symbol error ratio)为10-4时,获得Eb/N0增益约为0.2dB.

关键词: 联合信源信道编译码, 变长Turbo码, 空间网格图, VLS-APP

Abstract:

Variable length encoded Turbo codes (VL Turbo codes) with constructed joint decoding plane trellis has better decoding performance than the bit-level decoding algorithm. However the plane trellis is complicated, resulting in a high decoding complexity of VL Turbo codes. We construct a space trellis and propose a low-complexity JSCD approach based on VL Turbo codes. Simulation results show that the proposed approach reduces the decoding complexity by 3.8%, compared to the plane trellis, and the gain of Eb/N0 is about 0.2dB at SER=10-4.

Key words: JSCC/D, VL Turbo codes, space trellis, VLS-APP

中图分类号: