Eigenvalue-Based Detection of a Signal in Colored Noise: Finite and Asymptotic Analyses

arXiv: Information Theory(2020)

引用 10|浏览43
暂无评分
摘要
Signal detection in colored noise with an unknown covariance matrix has a myriad of applications in diverse scientific/engineering fields. The test statistic is the largest generalized eigenvalue (l.g.e.) of the whitened sample covariance matrix, which is constructed via $m$ -dimensional $p $ signal-plus-noise samples and $m$ -dimensional $n $ noise-only samples. A finite dimensional characterization of this statistic under the alternative hypothesis has hitherto been an open problem. We answer this problem by deriving cumulative distribution function (c.d.f.) of this l.g.e. via the powerful orthogonal polynomial approach, exploiting the deformed Jacobi unitary ensemble (JUE). Two special cases and an asymptotic version of the c.d.f. are also derived. With this new c.d.f., we comprehensively analyze the receiver operating characteristics (ROC) of the detector. Importantly, when the noise-only covariance matrix is nearly rank deficient (i.e., $m=n$ ), we show that (a) when $m$ and $p$ increase such that $m/p$ is fixed, at each fixed signal-to-noise ratio (SNR), there exists an optimal ROC profile. We also establish a tight approximation of it; and (b) asymptotically, reliable signal detection is always possible if SNR scales with $m$ .
更多
查看译文
关键词
Eigenvalues and eigenfunctions,Jacobian matrices,Covariance matrices,Colored noise,Signal to noise ratio,Detectors,Receivers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要