TY - GEN
T1 - Harmonic retrieval in non-circular complex-valued multiplicative noise
T2 - 12th European Signal Processing Conference, EUSIPCO 2004
AU - Ciblat, Philippe
AU - Forster, Philippe
AU - Larzabal, Pascal
N1 - Publisher Copyright:
© 2004 EUSIPCO.
PY - 2015/4/3
Y1 - 2015/4/3
N2 - We focus on harmonic retrieval in multiplicative and additive noise. At low SNR, Maximum-Likelihood based estimate does not reach the Cramer-Rao bound. Actually, at low SNR, the Cramer-Rao bound is not a tight bound anymore and has to be replaced with the so-called Barankin bound which is tighter but more complicate. In this paper, we derive the Barankin bound when the multiplicative noise is complex-valued and non-circular. We observe that the Barankin bound is much more greater than the Cramer-Rao bound, especially when the multiplicative noise is not non-circular enough.
AB - We focus on harmonic retrieval in multiplicative and additive noise. At low SNR, Maximum-Likelihood based estimate does not reach the Cramer-Rao bound. Actually, at low SNR, the Cramer-Rao bound is not a tight bound anymore and has to be replaced with the so-called Barankin bound which is tighter but more complicate. In this paper, we derive the Barankin bound when the multiplicative noise is complex-valued and non-circular. We observe that the Barankin bound is much more greater than the Cramer-Rao bound, especially when the multiplicative noise is not non-circular enough.
M3 - Conference contribution
AN - SCOPUS:84979902277
T3 - European Signal Processing Conference
SP - 2151
EP - 2154
BT - 2004 12th European Signal Processing Conference, EUSIPCO 2004
PB - European Signal Processing Conference, EUSIPCO
Y2 - 6 September 2004 through 10 September 2004
ER -