.png){kind=icon}
.png){kind=icon}
Return
Generalized Wald Test for Binary Composite Hypothesis Test
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2472991.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter provides a generalization of the well-known Wald test. The proposed generalized Wald test (GWT) is a Separating Function Estimation Test (SFET) which is a type of detector recently introduced for a wide class of composite problems. The test statistics of an SFET is an estimate of a real-valued Separating Function (SF). It is already proved that a Minimum Variance Unbiased Estimator of any SF leads to the optimal Uniformly Most Powerful unbiased detector. In many practical cases, such an optimal detector does not exist; hence, suboptimal ones are used, instead. Selecting an SF with a guaranteed performance is still an open problem which is investigated in this letter. First, we derive a lower bound for the detection probability of the SFET in terms of corresponding SF and the Fisher Information Matrix. Then we optimize the proposed bound with respect to the SF. The solution of the optimization problem leads to a generalization of the Wald test which is asymptotically optimal and reduces to the Wald detector in some special cases. Simulation results show the superiority of the proposed GWT over its counterparts, namely, the Wald test and GLR detector in some examples.
Keywords:
CFAR
GLR
Rao
separating function (SF)
separating function estimation test (SFET)
Wald
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W