首页> 外文会议>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes >Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping
【24h】

Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping

机译:使用BIVA和网格整形的中药近乎最佳解码

获取原文

摘要

In this paper a bootstrap iterative decoding technique concatenated with the Viterbi algorithm (BIVA) and trellis shaping for trellis-coded modulation (TCM) is proposed. The concept of a bootstrap decoding is introduced first and then the new metric functions which take into account the bootstrap iterative decoding algorithm for TCM systems are derived. One and two dimensional bootstrap decoding are proposed for packet transmission. Furthermore, the trellis shaping technique is also considered to combine with such TCM schemes using the BIVA. The simulation results show that the performance of 1.25 dB away from Shannon limit can be achieved by the BIVA and trellis shaping for 256-state 6 bits/T TCM scheme, with low complexity and reasonable computation.
机译:本文提出了一种与维特比算法(BIVA)和网格整形相结合的自举迭代解码技术,用于网格编码调制(TCM)。首先介绍了自举解码的概念,然后推导了新的度量函数,该函数考虑了TCM系统的自举迭代解码算法。提出一维和二维自举解码用于分组传输。此外,还考虑了使用BIVA将网格整形技术与此类TCM方案相结合。仿真结果表明,通过对256态6 bit / T TCM方案进行BIVA和网格整形,可以实现距香农极限1.25 dB的性能,且复杂度低,计算合理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号