期刊文献+

Turbo乘积码译码算法的优化和改进 被引量:2

Optimization and improvement for Turbo product code decoding algorithm
下载PDF
导出
摘要 Chase2算法是Turbo乘积码(TPC)软判决译码中常采用的算法之一。由于传统的Chase2算法中欧氏距离计算以及寻找竞争码字都需要大量的运算,因而在硬件上实现比较复杂。为此,在传统Chase2算法的基础上,采用相关度量等价替代欧氏距离的度量,简化寻找竞争码字的过程,以降低译码复杂度;调整竞争码字不存在时的软输出信息值,以提高编码增益。仿真结果表明:改进算法比传统的Chase算法译码速度更快,译码性能更好,非常适合硬件实现。 The Chase2 algorithm is one of the soft-decision decoding algorithms of Turbo Product Code (TPC). The conventional Chase2 algorithm needs a large amount of computation to calculate the Euclidean distance and search for competing codeword, so it is complex to implement in the hardware. Therefore, on the basis of the conventional Chase2 algorithm, the correlation was substituted as the metric for the Euclidean distance and the process of searching for competing codeword was simplified to reduce the decoding complexity; and the soft-output value was adjusted when there was no competing codeword to improve the coding gain. The simulation results show that, compared with the conventional algorithm, the modified algorithm has better performance and faster decoding speed, and it is suitable for hardware implementation.
出处 《计算机应用》 CSCD 北大核心 2013年第2期397-399,共3页 journal of Computer Applications
关键词 TURBO乘积码 Chase2算法 软判决译码 信道编码增益 复杂度 Turbo Product Code (TPC) Chase2 algorithm soft-decision decoding channel coding gain complexity
  • 相关文献

参考文献11

  • 1BERROU C, GLAVIEUX A, THITIMAJSHIMA P. Near Shannon limit error-correcting coding and decoding: Turbo codes [ C ]// ICC'93: IEEE International Conference on Communications. Piscat- away: IEEE, 1993:1064 - 1071.
  • 2PYNDIAH R, GLAVIEUX A, PICART A, et al. Near optimum de- coding of product codes [ C]/! GLOBECOM '94: Global Telecom- munications Conference. Piscataway: IEEE, 1994, 1 : 339 - 343.
  • 3PYNDIAH R M. Near optimum decoding of product codes: block turbo codes [ J]. IEEE Transactions on Communications, 1998, 46 (8) : 1003 - 1010.
  • 4郭立浩,蒋培文,郑雪峰,卢满宏.TPC编码在高码率数传中的应用[J].飞行器测控学报,2010,29(5):51-55. 被引量:2
  • 5黄小平,简福斌,谭廷庆,解志强.一种新的Turbo乘积码简化迭代译码算法[J].计算机应用研究,2011,28(2):689-691. 被引量:6
  • 6张天瑜.基于偏移量和归一化的改进型TPC译码算法研究[J].长春工业大学学报,2010,31(4):417-422. 被引量:2
  • 7CHEN Y, PARHI K K. A very low complexity block Turbo decoder composed of extended hamming codes [ C]/! GLOBECOM '01: IEEE Global Telecommunications Cmfference. Piscataway: IEEE, 2001, 1:171-175.
  • 8徐进廷,李红信.Turbo乘积码梯度译码算法研究[J].通信技术,2008,41(12):81-83. 被引量:6
  • 9VANSTRACEELE C, GELLER B, BROSSIER J-M, et al. A low complexity block turbo decoder architecture [ J]. IEEE Transactions on Communications, 2008, 56(12) : 1985 - 1987.
  • 10王玮,葛临东,巩克现.TPC基于相关运算的迭代译码算法[J].计算机应用,2010,30(7):1760-1762. 被引量:2

二级参考文献46

  • 1朱光喜,何业军,王锋,刘文明.Turbo乘积码的两种迭代译码器的比较[J].电讯技术,2004,44(6):30-34. 被引量:7
  • 2BERROU C, GLAVIEUX A, THITIMAJSHIM P. Near Shannon limit errorcorrecting coding and decoding: Turbocodes [C]. IEEE Int Conf. Communications ICC ' 93, May 1993, vol. 2/3, 1993:1064-1071.
  • 3CHASE D. A class of algorithms for decoding block codes with channel measurement information [J]. IEEE Trans. Inform. Theory, 1972, IT-11:170-182.
  • 4PYNDIAHR, GLAVIEUX A, PICART A, et al. Near optimum decoding of product codes[C]. Proc. IEEE GLOBECOM' 94 Conf., San Francisco, CA, Nov.-Oec. 1994, vol. 1/3: 339- 343.
  • 5ELIAS P. Error - free coding [J]. IRE Trans. Inform. Theory, 1954, IT-4:29-37.
  • 6HAGENAUER J, OFFER E, PAPKE L. Iterative decoding of binary and block and convolution codes [J]. IEEE Trans. Inform. Theory, 1996,42:429-445.
  • 7FOSSORIER M P C, LIN S. Soft-decision decoding of linear block codes based on ordered statistics [J]. IEEE Trans. Inform. Theory, 1995,41:1379-1396.
  • 8Pyndiah R, Combelles P and Adde P, h very low complexity block turbo decoder for product codes[J]. IEEE GLOBECOM , 1996,1:101-105.
  • 9Robert H.Morelos-Zaragoza.纠错编码的艺术[M].北京:北京交通大学出版社.2007:180-197.
  • 10PYNDIAH R,GLAVIEUX A,PICART A,et al.Near optimum decoding of product codes[C] // 1994 IEEE GLOBECOM.New York:IEEE,1994:339-343.

共引文献15

同被引文献18

  • 1徐以涛,李浩,王金龙,石胜庆.软件无线电中调频波形的正交解调[J].解放军理工大学学报(自然科学版),2006,7(4):312-315. 被引量:7
  • 2Fonseka J P, Dowling E M, Brown T K, et al.. Constrained interleaving of Turbo product codes[J]. IEEE Communications Letters, 2012, 16(9): 1365-1368.
  • 3Pyndiah R, Glavieux A, Picart A, et al.. Near optimum decoding of products codes[C]. IEEE Global Communications Conference, San Francisco, CA, 1994: 339-343.
  • 4Pyndiah R. Near-optimum decoding of product codes: block Turbo codesIJ]. IEEE Transactions on Communications, 1998, 46(8): 1003-1010.
  • 5Chase D. Class of algorithms for decoding block codes with channel measurement information[J]. IEEE Transactions on Information Theory, 1972, 18(1): 170-182.
  • 6Morero D A and Hueda M R. Efficient concatenated codingschemes for error floor reduction of LDPC and turbo product codes[C]. IEEE Global Communications Conference, Anacheim CA, 2012: 2361-2366.
  • 7Dave S, Kim J, and Kwatra S C. An efficient decoding algorithm for block turbo codes[J]. IEEE Transactions on Communications, 2001, 49(1): 41-46.
  • 8Chen Guo-tai, Cao Lei, and Zheng Hal-feng. Near-Log-MAP decoding for turbo product codes[C]. InternationM Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), Wuhan, 2011 1-4.
  • 9Pyndiah R. Iterative decoding of product codes: block turbo codes[C]. IEEE International Symposium on Turbo Codes &: Related Topics, Brest, France, 1997: 71-79.
  • 10Pyndiah R, Picart A, and Glavieux A. Performance of block turbo coded 16-QAM and 64-QAM modulations[C]. IEEE Global Communications Conference, Singapore, 1995, 2: 1039-1043.

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部