A factor graph approach to design close-to-optimal receivers in the presence of a timing uncertainty

This paper considers the design of close-to-optimal receivers in the presence of a timing uncertainty. The problem is placed into the factor-graph and the sum-product (SP) algorithm framework. A simplified version of the SP algorithm is considered and the expectation-maximization (EM) algorithm is used to implement it. The proposed approach, combining the SP and EM algorithms, is shown to outperform classical approaches while exhibiting a low complexity.