Near optimum low complexity smoothing loops for dynamical phase estimation: application to BPSK modulated signals

Authors:
J. Yang;B. Geller
Affiliations:
Lab SATIE, ENS Cachan, Cachan, France;LEI, ENSTA ParisTech, Paris, France
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 9
Cited 2

Digital Communication Receivers: Synchronization, Channel Estimation, and Signal Processing

Digital Communication Receivers: Synchronization, Channel Estimation, and Signal Processing
Phase tracking: what do we gain from optimality? particle filtering versus phase-locked loops

Signal Processing
Bayesian and hybrid Cramer-Rao bounds for QAM dynamical phase estimation

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Approximate expressions for Cramer-Rao bounds of code aided QAM dynamical phase estimation

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Smoothing PLLs for QAM dynamical phase estimation

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A Theoretical Framework for Iterative Synchronization Based on the Sum–Product and the Expectation-Maximization Algorithms

IEEE Transactions on Signal Processing
Analytic and Asymptotic Analysis of Bayesian CramÉr–Rao Bound for Dynamical Phase Offset Estimation

IEEE Transactions on Signal Processing
Iterative carrier phase recovery suited to turbo-coded systems

IEEE Transactions on Wireless Communications
Algorithms for iterative decoding in the presence of strong phase noise

IEEE Journal on Selected Areas in Communications

Approximate expressions for Cramer-Rao bounds of code aided QAM dynamical phase estimation

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Smoothing PLLs for QAM dynamical phase estimation

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	35.68

Visualization

Abstract

This correspondence provides and analyzes a low complexity, near optimum, fixed-interval smoothing algorithm that approaches the performance of an optimal smoother for the price of two low complexity sequential estimators, i.e., two phase-locked loops (PLLs). Based on a linear approximation of the problem, a theoretical performance evaluation is given. The theoretical results are compared to some simulation results and to the Bayesian and hybrid Cramér-Rao bounds. They illustrate the good performance of the proposed smoothing PLL (S-PLL) algorithm.