Skip to main navigation Skip to search Skip to main content

Ziv-zakai bound for harmonic retrieval in multiplicative and additive Gaussian noise

  • University of Leeds

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Citations (Scopus)

Abstract

The paper addresses the problem of the lower performance bound evaluation for harmonic retrieval in multiplicative and additive noise, especially when the SNR is low and/or when the number of available samples is small. As a novelty, we express an accurate approximation of the Ziv-Zakai bound in closed-form. This enables us to analyse the influence of some signal parameters on performance and to characterise the so-called threshold region.

Original languageEnglish
Title of host publication2005 IEEE/SP 13th Workshop on Statistical Signal Processing - Book of Abstracts
PublisherIEEE Computer Society
Pages561-566
Number of pages6
ISBN (Print)0780394046, 9780780394049
DOIs
Publication statusPublished - 1 Jan 2005
Event2005 IEEE/SP 13th Workshop on Statistical Signal Processing - Bordeaux, France
Duration: 17 Jul 2005 → 20 Jul 2005

Publication series

NameIEEE Workshop on Statistical Signal Processing Proceedings
Volume2005

Conference

Conference2005 IEEE/SP 13th Workshop on Statistical Signal Processing
Country/TerritoryFrance
CityBordeaux
Period17/07/05 → 20/07/05

Fingerprint

Dive into the research topics of 'Ziv-zakai bound for harmonic retrieval in multiplicative and additive Gaussian noise'. Together they form a unique fingerprint.

Cite this