On the Cramér-Rao bound for polynomial phase signals

نویسندگان

  • Robby G. McKilliam
  • André Pollok
چکیده

Polynomial-phase signals have applications including radar, sonar, geophysics, and radio communication. Of practical importance is the estimation of the parameters of a polynomial phase signal from a sequence of noisy observations. We derive closed form formulae for the Cramér-Rao lower bounds of these parameters under the assumption that the noise is additive white and Gaussian. This is achieved by making use of a family of orthogonal polynomials.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidimensional Cramér-Rao lower bound for non-uniformly sampled NMR signals

In this work, we extend recent results on the Cramér-Rao lower bound for multidimensional non-uniformly sampled Nuclear Magnetic Resonance (NMR) signals. The used signal model is more general than earlier models, allowing for the typically present variance differences between the direct and the different indirect sampling dimensions. The presented bound is verified with earlier presented 1-and ...

متن کامل

Ziv-Zakai error bounds for quantum parameter estimation.

I propose quantum versions of the Ziv-Zakai bounds as alternatives to the widely used quantum Cramér-Rao bounds for quantum parameter estimation. From a simple form of the proposed bounds, I derive both a Heisenberg error limit that scales with the average energy and a limit similar to the quantum Cramér-Rao bound that scales with the energy variance. These results are further illustrated by ap...

متن کامل

Analytic and Asymptotic Analysis of Bayesian Cramér-Rao Bound for Dynamical Phase Offset Estimation

In this paper, we present a closed-form expression of a Bayesian Cramér-Rao lower bound for the estimation of a dynamical phase offset in a non-data-aided BPSK transmitting context. This kind of bound is derived considering two different scenarios: a first expression is obtained in an off-line context and then, a second expression in an on-line context logically follows. The SNR-asymptotic expr...

متن کامل

Estimating the orientation of planar surfaces: Algorithims and bounds

This paper presents a computationally and statistically efficient parametric solution to the problem of estimating the orientation in space of a planar textured surface from a single, noisy, observed image of it. The coordinate transformation from surface to image coordinates, due to the perspective projection, transforms each homogeneous sinusoidal component of the surface texture into a sinus...

متن کامل

Maximum likelihood estimation, analysis, and applications of exponential polynomial signals

In this paper, we model complex signals by approximating the phase and the logarithm of the time-varying amplitude of the signal as a finite-order polynomial. We refer to a signal that has this form as an exponential polynomial signal (EPS). We derive an iterative maximum-likelihood (ML) estimation algorithm to estimate the unknown parameters of the EPS model. The initialization of the ML algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Signal Processing

دوره 95  شماره 

صفحات  -

تاریخ انتشار 2014