Research Article
Reduced-complexity Sequential Particle Belief Propagation over Correlated Fading Channels
@INPROCEEDINGS{10.1109/ChinaCom.2012.6417510, author={Linlin Duan and Zhongyong Wang and Xiangchuan Gao and Yan Xiao}, title={Reduced-complexity Sequential Particle Belief Propagation over Correlated Fading Channels}, proceedings={7th International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2012}, month={10}, keywords={factor graph particle filtering belief propagation channel estimation}, doi={10.1109/ChinaCom.2012.6417510} }- Linlin Duan
Zhongyong Wang
Xiangchuan Gao
Yan Xiao
Year: 2012
Reduced-complexity Sequential Particle Belief Propagation over Correlated Fading Channels
CHINACOM
IEEE
DOI: 10.1109/ChinaCom.2012.6417510
Abstract
In this paper, we design a factor graph based receiver for Bit-Interleaved Coded Modulation (BICM) over correlated fading channels. With the aim of enhancing the channel estimation accuracy, we propose belief propagation algorithm combined with particle filter as an alternative to typically used Kalman smoothing algorithm. To further reduce complexity, two schedules are proposed. One is employing mode and list of particle sequentially in iterations to update channel message. Another is an adaptive message update schedule in the demodulator and decoder. Simulation results illustrate performance improvement of the proposed algorithm and significant computational complexity reduction.
Copyright © 2012–2024 IEEE
