Abstract
We address the problem of harmonic retrieval in the presence of multiplicative and additive noise sources. In the new context of a complex-valued non-circular Gaussian multiplicative noise, we express the Cramér–Rao bound (CRB) as well as the asymptotic (large sample) CRB in closed form. Below a certain SNR threshold and/or when the number of samples is not large enough, the CRB becomes too optimistic and therefore we also derive the Barankin bound (BB). The new theoretical expressions for the CRB and BB are then used to study the behavior of the performance bound with respect to the signal parameters. We especially describe the region (in terms of SNR and number of samples) for which the CRB and the BB differ. Finally we compare the performance of the square-power-based frequency estimate, which is equivalent to the non-linear least-squares-based estimate, to these bounds.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
