中国科学院研究生院学报2011，Vol.28Issue(2)：246-252,7.
基于变长Turbo码的低复杂度联合信源信道译码
Low-complexity joint source-channel decoding based on variable length encoded Turbo codes
摘要
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关键词
联合信源信道编译码/变长Turbo码/空间网格图/VLS-APPKey words
JSCC/D/ VL Turbo codes/ space trellis/ VLS-APP分类
信息技术与安全科学引用本文复制引用
陈绍宏,张灿,涂国防,霍岳恒..基于变长Turbo码的低复杂度联合信源信道译码[J].中国科学院研究生院学报,2011,28(2):246-252,7.基金项目
国家自然科学基金(61032006,60773137,60972067)和国家专用项目(2069901)资助 （61032006,60773137,60972067）
