基于因子图的迭代信道估计与译码算法  

Factor-Graph-Based Iterative Channel Estimation and Decoding Algorithm

作　　者：赵宏杰[1] 武楠[1] 王华[1] 匡镜明[1] 

机构地区：[1]北京理工大学信息与电子学院,北京100081

出　　处：《北京理工大学学报》2014年第4期427-432,共6页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目(61072049;61201181);北京理工大学优秀青年教师资助计划(2012CX04039)

摘　　要：针对频率平坦-时间选择性瑞利衰落信道下的数据检测问题,提出一种基于因子图与消息传递的联合迭代信道估计、符号检测与译码算法.对信息符号与信道系数的联合后验概率分布建立因子图模型,应用和积算法进行迭代消息传递,计算信息符号与信道系数的边缘概率分布.其中利用高斯参数化近似信道系数的连续概率密度函数,并结合前向-后向递归算法对信道系数进行迭代估计.仿真结果表明,在归一化多普勒频移分别为0.005和0.020的衰落信道下,该算法的误码性能与信道估计精度均优于传统的信道估计与译码算法.Presented an iterative receiver for joint channel estimation, data detection and decoding over a time-varying frequency-flat Rayleigh fading channel. First, a factor graph （FG） that represents a joint posteriori probability mass function of the information bits and channel coefficients given the channel output was established. Then the sum product algorithm （SPA） was implemented on the FG in the proposed algorithm. Gaussian parameterization was employed to approximate the exact probability density function in message passing to yield a forward- backward recursion for the purpose of channel estimation. Compared with the traditional channel estimation and decoding methods, the effectiveness of the proposed iterative message passing algorithm is demonstrated through computer simulations.

关 键 词：平坦瑞利衰落信道 因子图 消息传递 迭代接收机 高斯参数化 

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