频率选择性慢信道下消息传递迭代均衡算法

Turbo Equalization for Frequency-Selective Slow Fading Channels Using Combined Message Passing Algorithm

  • 摘要: 针对双选择性信道,现有的迭代接收机性能与最优估计性能有较大差距,且复杂度高,本文从全局的角度利用消息传递算法进行联合信道估计和数据均衡,提出了BP-EP-MF消息传递算法迭代接收机。本文使用的消息传递算法包含置信传播(Belief Propagation)、期望传播(Expectation Propagation)和平均场(Mean Field)。消息传递算法需要建立信道的因子图模型,因子图可以清楚表示系统中的未知变量及关系。根据因子图上各部分的特点选择合理的、有效的消息更新规则和合适的消息更新机制,提高迭代接收机的性能,降低计算复杂度。仿真结果表明,与非线性卡尔曼(EKF)迭代均衡器相比,消息传递算法(BP-EP-MF)均衡器性能大幅提升、收敛速度加快、复杂度略微降低。

     

    Abstract:  The performance of the existing iterative receiver with high computational complexity had to be a big difference from optimal receiver for frequencyselective slow fading channels. In order to improve the performance of the equalizer, the BP-EP-MF messaging passing iterative equalization algorithm was proposed in this paper. The proposed message passing algorithm contained belief propagation (BP), expectation propagation (EP) and mean field (MF). MF was used to handle the nonlinear model of the factor, meanwhile EP made a great contribution for the low complexity implementation of the proposed message passing algorithm iterative receiver. Firstly, a channel factor graph model that based on global posterior probability density function was established. In the channel factor graph model, all unknown variables in the system and the relationship between factor nodes and variable nodes were made clear. Then, according to the characteristics of the factors, reasonable and effective message passing rules and the appropriate message update mechanism were chosen to improve the performance of iterative receiver and reduce the computational complexity. Finally, the data symbols can be estimated based on maximum a posteriori estimation. Simulation results turn out that our message-passing algorithm with little less computational complexity and faster convergence speed leads to better performance than fixedlag soft input nonlinear Kalman filtering (EKF) for frequency-selective slow fading channels.

     

/

返回文章
返回