一种确定Turbo乘积码迭代因子的方法

An Algorithm to Determine the Optimal Iteration Factors for Turbo Product Code

提出一种确定Turbo乘积码迭代因子的算法。建立信道模型,生成测试软信息R;生成一组备选迭代因子向量,在备选迭代因子空间里用MATLAB仿真Chase-Pyndiah迭代译码算法流程,选择最优的迭代因子;迭代因子优劣的判据为迭代译码器的误码率以及迭代次数。实验结果表明,最优迭代因子有效地加速了迭代译码器的收敛速度,降低了译码的功耗。

An algorithm to determine turbo product code iteration factors is presented. It firstly sets up the channel model and generates the soft input array （R） for simulation, and then simulates the decoding process in Chase -Pyndiah algorithm to choose the optimal iteration factors , which is evaluated by BER and iterations of the decoder. The optimal iteration factors determined in this algorithm accelerate the convergence rate and reduce the power consumption of the decoder.