计算机工程与应用2011，Vol.47Issue(31)：144-147,4.DOI:10.3778/j.issn.1002-8331.2011.31.041
低复杂度的Turbo乘积码迭代译码研究
Research of low complexity iterative decoding for Turbo product codes
摘要
Abstract
For the traditional iterative decoding algorithm of Turbo Product Codes (TPC), it's hard to search competitive codeword and it needs so many memory capacities of soft information.This paper presents a very low complexity iterative decoding algorithm to solve these problems, and obtains a new iterative decoder structure.lt is based on the iterative SISO Chase algorithm, and a correlation operation is used to simplify the calculation of soft output information.Thus there is no need to find competitive codeword.Meanwhile, let the soft inputs for the previous decoding unit replace the traditional received information from channel, and then obtain soft inputs for the next iterative decoding unit by a linear combination of soft outputs for the current iterative decoding unit.Thereby the calculation of soft input information and memory capacities are simplified.Simulation results show the feasibility and effectiveness of the algorithm.关键词
Turbo乘积码/迭代译码/相关运算/低复杂度Key words
Turbo product codes/ iterative decodes/ correlation operation/ low complexity分类
信息技术与安全科学引用本文复制引用
刘晓明,黄小平..低复杂度的Turbo乘积码迭代译码研究[J].计算机工程与应用,2011,47(31):144-147,4.
