中南大学学报（自然科学版）2017，Vol.48Issue(1)：141-147,7.DOI:10.11817/j.issn.1672-7207.2017.01.020
低复杂度的TPC自适应译码算法
A low-complexity adaptive decoding algorithm for Turbo product code
摘要
Abstract
A new efficient adaptive decoding algorithm was proposed to reduce the complexity of Turbo product code (TPC) decoding algorithm.The new algorithm was suitable for the TPCs formed by extended Hamming codes.The adaptive decoding algorithm without estimating SNR was the basic framework of the proposed algorithm and a simple formula for calculating the extrinsic information was introduced after analyzing codeword reliability.In the proposed algorithm,the least reliable bits could be reduced adaptively;meanwhile,computation of the extrinsic information should be simplified.The results show that when the extended Hamming code (64,57,4) is the subcode of TPC and the bit error rate is 10-5,the performance loss of the proposed algorithm is only 0.05 dB compared with the adaptive decoding algorithm without estimating SNR.But the complexity is decreased by about 1/3.So the proposed algorithm is an excellent balance and compromise between complexity and performance.关键词
TPC/Chase-Pyndiah译码/自适应译码/低复杂度Key words
Turbo product code/Chase-Pyndiah decoding/adaptive decoding/low complexity分类
信息技术与安全科学引用本文复制引用
韩明,张佳岩,赵洪林..低复杂度的TPC自适应译码算法[J].中南大学学报（自然科学版）,2017,48(1):141-147,7.基金项目
国家科技重大专项(2012ZX03003011-004) (Project(2012ZX03003011-044) supported by the Major Program of the National Science and Technology) （2012ZX03003011-004）
