联合信道编码的Golden码检测  

Detection on Golden Code Concatenating with Channel Coding

作　　者：吴玉成[1] 郭伟[1] 李国权[1] 

机构地区：[1]重庆大学通信工程学院,重庆400044

出　　处：《北京邮电大学学报》2010年第4期21-25,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(60872038);中国博士后科学基金项目(20090450787);重庆市教委科技研究项目(KJ08A09);重庆大学"211工程"创新人才计划项目(S-09102)

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

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

分 类 号：TN911.23[电子电信—通信与信息系统]