高速通信系统中两种Turbo迭代译码算法的比较

Comparison of Two Turbo Iterative Decode in High Speed Communication Systems

1993年提出的T urbo码因其优异的性能而引起编码界的关注。之后不久提出的乘积码,是T urbo码的一个分支,他是一种分组纠错码,具有良好的性能。但是多年来大多数学者将研究集中于卷积T urbo码,而很少有人关注考虑分组T urbo码(即乘积码),事实上乘积码相比卷积T urbo码在牺牲较小性能的情况下很大程度地降低了译码复杂度。本文将基于软输入/输出的T urbo译码算法,提出并分析了传统的卷积T urbo码和分组T urbo码(乘积码)的迭代译码算法,并对比分析了两者的译码性能,最后结果表明,两类码非常适合于未来的高速移动通信系统应用,尤其对乘积码,不仅具有较高的码率,同时可以获得更好的误比特率性能,在实际应用中更具有吸引力。

Turbo code was put forward in 1993 has caught the code field＇s eye. Turbo Product Codes（TPC） was just as a branch of Turbo code,was a kind of block correct error codes with good performance. But most of the authors have focused on Convolutional Turbo Codes （CTCs） and very few have considered the Block Turbo Code （BTC）. In fact,this Turbo product code offered a good compromise between performance and complexity . Based on Soft Input Soft Output （SISO）Turbo decoding algorithms. This paper presents the iterative decoding principle of block Turbo code and convolutional Turbo code,and compareatively analyzes their decode performance. Finally the result of simulation show that both codes are very efficient for future high speed communication systems ,and especially Turbo product code can achieve better Bit Error Rate （BER） with a higher code rate,the TPC solution is more attractive for a wide range of applications.