一种TPC硬判决译码改进算法研究

A modified algorithm of hard decision decoding for TPC

摘要:

针对Turbo乘积码(TPC)传统硬判决译码算法中某些错误可以检测但无法纠正的问题,提出了一种改进的TPC硬判决译码算法.该算法在对传统硬判决译码算法进行多次迭代的基础上,通过串接检错、估算错误总数、构造错码候选码字集、选取最优码字等步骤来解决传统算法可检而不可纠的错误图样问题.仿真结果表明:在误比特率为10-5时,与传统硬判决迭代译码算法相比,本文提出的算法能够提高0.9 dB的增益.

Abstract:

A modified algorithm was proposed in this paper to deal with the problem that the conventional algorithm of hard decision decoding for Turbo Product Code(TPC) can not correct some detected error symbols.Based on multiple iteration steps of the conventional algorithm of hard decision decoding,the modified algorithm can correct the wrong symbols by detecting them,estimating their total number,constructing their candidate sequences and then selecting the optimum sequence among the candidates.Simulation results show that the modified algorithm can provide a gain of 0.9 dB over the conventional algorithm at BER of 10-5.