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. To reduce the complexity of such an algorithm, several methods have been proposed in the literature. One 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 performs better than does the Equally Spaced Discretization.