Lower bounds to the performance of bit synchronization for bandwidth efficient pulse-shaping

  • Authors:

  • Amin Emad;Norman C. Beaulieu

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.02

Visualization

Abstract

Bandwidth efficient signaling requires using pulse-shaping that inherently has intersymbol interference (ISI) except when the timing is perfect. Several lower bounds to the mean-square-error (MSE) of non-data-aided bit-synchronizers are derived for this case. The optimal lower bound is derived using the maximum likelihood (ML) criterion for a sequence of binary pulse amplitude modulated pulses in the presence of ISI and Gaussian noise. This lower bound is used as a benchmark to evaluate the performance of other synchronizers in a practical scenario. It is shown that a previous lower bound based on the ISI-free ML synchronizer cannot be used to lower bound the MSE of bit-synchronizers. A detection theory bound (DTB) (also called Ziv-Zakai bound) is applied to the symbol timing recovery problem in the presence of ISI and it is shown that this bound is a tight lower bound on the MSE of the ML synchronizer. A simple lower bound on this DTB is derived and it is shown that the simple bound is almost as tight as the well known modified Cramer-Rao bound (MCRB) at moderate values of SNR, while it does not suffer from the shortcomings of the MCRB at small values of SNR.