English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The Crame&#x0301;r-Rao Bound (CRB) is a powerful tool to assess the performance limits of a parameter estimation problem for a given statistical model. In particular, the Gaussian CRB (i.e., the CRB obtained assuming the data are Gaussian) corresponds to the worst case; giving the largest CRB among a large class of data distributions. This makes it very useful in practice since optimizing under the Gaussian data assumption can be interpreted as a min-max optimization (i.e., minimizing the largest CRB). The Gaussian CRB is also the corresponding bound of Second-Order Statistics (SOS)-based estimation methods, which are frequently used in practice. Despite its practicality, computing this bound might be cumbersome in some cases, particularly in the case where the input is assumed deterministic and has a large number of samples. In this paper, we address this computational issue by proposing a fast computation for the deterministic Gaussian CRB of Single-Input Multiple Output (SIMO) blind system identification. More precisely, we exploit circulant matrix properties to reduce the cost from cubic to quadratic with respect to the sample size. Moreover, we derive a closed-form formula for the asymptotic (large sample size) Gaussian CRB and show how it can be computed using the residue theorem.

On the Gaussian Cramér-Rao Bound for Blind Single-Input Multiple-Output System Identification: Fast and Asymptotic Computations