性能接近Turbo卷积码的Turbo三维乘积码

Performance of 3 dimension Turbo product code near Turbo convoluted code

目前一般认为采用迭代译码的Turbo卷积码适合于低码率的情况 ,而Turbo分组码 ,尤其是Turbo乘积码 ,则较适合于高码率的应用。文中使用Pyndiah提出的方法研究了Turbo三维乘积码 ,用试探法对分组迭代译码的参数进行了优化 ,实验结果表明 :在低码率应用时 ,例如码率为R =0 .5 36的Turbo三维 (32 ,2 6,4 ) 3 乘积码的性能已与C .Berrou[1] 的Turbo卷积码接近 。

It is well known that the turbo convoluted code using iterating decoding is suited to the case of low code rate and Turbo block code, and the Turbo product code has better performance for high code rate. This paper presents a three dimension Turbo product code based on the Pyndiah′s method, and optimizes block iterative decoding parameter by using the tentative method. The experimental results show that performance of (32,26,4) 3 with code rate R =0.536 near to the C.Berrou′s Turbo convoluted code and is a competitor of correcting error application in low code rate