Cramer–Rao lower bounds for change points in additive and multiplicative noise - Archive ouverte HAL Access content directly
Journal Articles Signal Processing Year : 2004

Cramer–Rao lower bounds for change points in additive and multiplicative noise

Abstract

The paper addresses the problem of determining the Cramer–Rao lower bounds (CRLBs) for noise and change-point parameters, for steplike signals corrupted by multiplicative and/or additive white noise. Closed-form expressions for the signal and noise CRLBs are first derived for an ideal step with a known change point. For an unknown change-point, the noise-free signal is modeled by a sigmoidal function parametrized by location and step rise parameters. The noise and step change CRLBs corresponding to this model are shown to be well approximated by the more tractable expressions derived for a known change-point. The paper also shows that the step location parameter is asymptotically decoupled from the other parameters, which allows us to derive simple CRLBs for the step location. These bounds are then compared with the corresponding mean square errors of the maximum likelihood estimators in the pure multiplicative case. The comparison illustrates convergence and efficiency of the ML estimator. An extension to colored multiplicative noise is also discussed.
Fichier principal
Vignette du fichier
Tourneret_3050.pdf (460.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03602345 , version 1 (09-03-2022)

Identifiers

Cite

Jean-Yves Tourneret, André Ferrari, Ananthram Swami. Cramer–Rao lower bounds for change points in additive and multiplicative noise. Signal Processing, 2004, 84 (7), pp.1071-1088. ⟨10.1016/j.sigpro.2004.03.009⟩. ⟨hal-03602345⟩
14 View
30 Download

Altmetric

Share

Gmail Facebook X LinkedIn More