乘积码的一种新的迭代译码算法

New Iterative Decoding Algorithm of the Product Codes

乘积码是利用线性分组码实现长码的典范,能纠正大量的随机错误和突发错误,当以Turbo码的思想实现乘积码的迭代译码时,可获得很高的编码增益。针对乘积码提出一种新的迭代译码算法,该算法的反馈方式有别于Turbo码的传统迭代译码,是通过输出软信息与接收软信息进行线性叠加来实现的,此时子译码器的候选码字个数将大为降低,同时译码输出也无须做复杂的LLR计算,直接映射为由-1, +1组成的软输出矩阵,从而在牺牲较小性能的情况下很大程度地降低了译码复杂度。

The product codes using linear block codes set up a mirror in the realization of long codes and hold the outstanding performance for random error and burst correction. It can gain very excellent error-correcting capability when a product code performs decoding with the method of turbo codes based on iterative decodes. The paper describes a new iterative decoding algorithm for the product codes, its feedback method is completed by a linear combination of soft output of encoder and the receipt information is different with the traditional turbo iterative decode. When decoder obtains the soft output matrix built -1 and +1, the complexity can be reduced greatly and the performance can be lost little by reducing the number of candidate code words and omitting the complicated operation of LLR.