A low-complexity adaptive decoding algorithm for Turbo product code

被引：0
|
作者：
Han M. [1 ]
Zhang J. [1 ]
Zhao H. [1 ]
机构：
[1] Communication Research Center, Harbin Institute of Technology, Harbin
来源：
Zhao, Honglin (hlzhao@hit.edu.cn) | 1600年 / Central South University of Technology卷 / 48期
关键词：
Adaptive decoding; Chase-Pyndiah decoding; Low complexity; Turbo product code;
D O I：
10.11817/j.issn.1672-7207.2017.01.020
中图分类号：
学科分类号：
摘要：
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. © 2017, Central South University Press. All right reserved.
引用
收藏
页码：141 / 147
页数：6
相关论文
共 18 条
  • [1] Mukhtar H., Al-Dweik A., Al-Mualla M., Et al., Adaptive hybrid ARQ system using Turbo product codes with hard/soft decoding, IEEE Communications Letters, 17, 11, pp. 2132-2135, (2013)
  • [2] Cao J., Ma M., Li H., Et al., A survey on security aspects for LTE and LTE-A networks, IEEE Communications Surveys & Tutorials, 16, 1, pp. 283-302, (2014)
  • [3] Zhang X., Zhang P., Jiang W., Et al., The analysis of coded overlapped time division multiplexing system, IEEE 3rd International Conference on Broadband Network and Multimedia Technology (IC-BNMT), pp. 488-494, (2010)
  • [4] Pyndiah R., Combelles P., Adde P., A very low complexity block Turbo decoder for product codes, IEEE Global Telecommunications Conference, Communications: The Key to Global Prosperity, pp. 101-105, (1996)
  • [5] Argon C., McLaughlin S.W., A parallel decoder for low latency decoding of Turbo product codes, IEEE Communications Letters, 6, 2, pp. 70-72, (2002)
  • [6] Dong Z., Gong K., Ge L., A low complexity and low latency TPC Iterative Decoding Algorithm, Journal of Sichuan University (Engineering Science Edition), 44, 2, pp. 122-129, (2012)
  • [7] Pyndiah R., Glavieux A., Picart A., Et al., Near optimum decoding of product codes, IEEE Global Telecommunications Conference, pp. 339-343, (1994)
  • [8] Chase D., Class of algorithms for decoding block codes with channel measurement information, IEEE Transactions on Information Theory, 18, 1, pp. 170-182, (1972)
  • [9] Mahran A., Benaissa M., Adaptive Chase algorithm for block Turbo codes, Electronics Letters, 39, 7, pp. 617-619, (2003)
  • [10] Liu X., Wang K., Adaptive SNR estimation based decoding algorithm for block Turbo codes, IEEE Fourth International Conference on Communications and Networking in China (CHINACOM), pp. 1-6, (2009)
12