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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The detection problem in statistical signal processing can be succinctly formulated: given m (possibly) signal bearing, n -dimensional signal-plus-noise snapshot vectors (samples) and <i>N</i> statistically independent n-dimensional noise-only snapshot vectors, can one reliably infer the presence of a signal? This problem arises in the context of applications as diverse as radar, sonar, wireless communications, bioinformatics, and machine learning and is the critical first step in the subsequent signal parameter estimation phase. The signal detection problem can be naturally posed in terms of the sample generalized eigenvalues. The sample generalized eigenvalues correspond to the eigenvalues of the matrix formed by ?whitening? the signal-plus-noise sample covariance matrix with the noise-only sample covariance matrix. In this paper, we prove a fundamental asymptotic limit of sample generalized eigenvalue-based detection of signals in arbitrarily colored noise when there are relatively few signal bearing and noise-only samples. Specifically, we show why when the (eigen) signal-to-noise ratio (SNR) is below a critical value, that is a simple function of n , m, and N, then reliable signal detection, in an asymptotic sense, is not possible. If, however, the eigen-SNR is above this critical value then a simple, new random matrix theory-based algorithm, which we present here, will reliably detect the signal even at SNRs close to the critical value. Numerical simulations highlight the accuracy of our analytical prediction, permit us to extend our heuristic definition of the effective number of identifiable signals in colored noise and display the dramatic improvement in performance relative to the classical estimator by Zhao We discuss implications of our result for the detection of weak and/or closely spaced signals in sensor array processing, abrupt change detection in sensor networks, and clustering methodologies in machine learning.

Fundamental Limit of Sample Generalized Eigenvalue Based Detection of Signals in Noise Using Relatively Few Signal-Bearing and Noise-Only Samples