Shortened Turbo Product Codes: Encoding Design and Decoding Algorithm
Shortened Turbo Product Codes: Encoding Design and Decoding Algorithm
复制标题
DOI：
10.1109/tvt.2007.901931
复制
发表时间：
2007-11
影响因子：
6.8
通讯作者：
Changlong Xu;Ying-Chang Liang;Wing Seng Leon
中科院分区：
文献类型：
--
作者：
Changlong Xu;Ying-Chang Liang;Wing Seng Leon
缩短的涡轮产品代码（TPC）已经在许多标准下已被采用。在本文中，我们研究了从两个方面缩短TPC，即编码设计和解码算法。为了获得不同的编码块尺寸，将缩短的扩展锤码用作IEEE 802.16标准中产品代码的组件代码。要设计缩短TPC的良好结构，我们计算其相应组件代码的未检测到的错误概率。组件代码缩短了扩展的锤式代码，并根据未检测到的误差概率选择其最佳发电机多项式。对于解码算法，我们提出了一种有效的追逐解码算法，用于缩短平坦褪色通道中的TPC。在拟议的方案中，不需要Pyndiah方案中使用的可靠性因素；因此，通过避免在每次迭代时避免整个代码单词的归一化操作，大大降低了解码的复杂性。还提供了仿真结果，以验证所提出的算法的性能。
Shortened turbo product codes (TPCs) have already been adopted in many standards. In this paper, we study shortened TPCs from two aspects, namely encoding design and decoding algorithm. To obtain different encoding block sizes, shortened-extended Hamming codes are used as the component codes of product codes in the IEEE 802.16 standard. To design a good structure for the shortened TPC, we compute the undetected error probability of its corresponding component codes. The component codes are shortened-extended Hamming codes, and their optimal generator polynomials are selected in terms of their undetected error probability. For the decoding algorithm, we present an efficient Chase decoding algorithm for shortened TPCs in flat fading channels. In the proposed scheme, the reliability factor used in Pyndiah's scheme is not needed; thus, the decoding complexity is greatly reduced by avoiding the normalization operation of the whole code word at each iteration. Simulation results are also presented to verify the performance of the proposed algorithm.