Iterative decoding in factor graph representation using particle filtering

In this paper we study iterative decoding over channels with phase noise in digital communications. A factor graph representation is used for the system under study and a message passing algorithm is derived. In order to reduce the complexity of such algorithm, several methods have been proposed in the literature. One of them consists of a discretization of the phase space using a fixed number of equally spaced values. In this paper, we propose a particle filtering approach that reduces the complexity and achieves better performance than the equally spaced discretization.