北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (4): 21-25.doi: 10.13190/jbupt.201004.21.wuych

• 论文 • 上一篇    下一篇

联合信道编码的Golden码检测

吴玉成1,郭伟2,李国权2   

  1. 1. 重庆大学
    2. 重庆大学通信工程学院
  • 收稿日期:2009-10-10 修回日期:2010-01-15 出版日期:2010-08-28 发布日期:2010-05-21
  • 通讯作者: 吴玉成 E-mail:wuyucheng@cqu.edu.cn
  • 基金资助:

    国家级.国家自然科学基金项目

Detection on Golden Code Concatenating with Channel Coding

  • Received:2009-10-10 Revised:2010-01-15 Online:2010-08-28 Published:2010-05-21

摘要:

为分析级联信道编码Golden码系统的迭代检测性能并降低迭代检测算法的复杂度,利用软符号干扰消除的思想,提出采用高斯近似和最小均方误差(MMSE)算法来计算迭代检测过程中所需的比特软信息. 根据Golden码的传输特性,推导出适合该系统的软比特信息计算方法. 理论分析证明,与传统的list sphere decodemaximum a posteriori(LSDMAP)算法相比,高斯近似和MMSE算法具有复杂度低的优点. 仿真结果表明,新算法的迭代检测性能接近于LSDMAP算法,可以实现Golden码的快速迭代检测.

关键词: Golden码, 高斯近似, 最小均方误差, 球形译码

Abstract:

With thinking of soft symbol interference cancellation, a Gaussian approximation method and minimum mean square error (MMSE) method are proposed to obtain the soft information of each bit. According to the transmission property of Golden code, the methods are deduced to compute the soft information in the system. Analysis indicates that, compared with the traditional list sphere decodemaxinum a posteriori(LSDMAP) method, the Gaussian approximation method and the MMSE method have lower complexity. Simulations show that the iterative detection performance of proposed methods is close to the LSDMAP method, which achieve a fast iterative detection of Golden code.

Key words: Golden code, Gaussian approximation, minimum mean square error, sphere decoding

中图分类号: