Pith. sign in

REVIEW

Low-Complexity Detection of Small Frequency Changes by the Generalized LMPU Test

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.09458 v1 pith:SR3AADHZ submitted 2020-08-21 eess.SP

Low-Complexity Detection of Small Frequency Changes by the Generalized LMPU Test

classification eess.SP
keywords detectionfrequencytestgeneralizedglrtperformancesmallcomplexity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we consider the detection of a small change in the frequency of sinusoidal signals, which arises in various signal processing applications. The generalized likelihood ratio test (GLRT) for this problem uses the maximum likelihood (ML) estimator of the frequency, and therefore suffers from high computational complexity. In addition, the GLRT is not necessarily optimal and its performance may degrade for non-asymptotic scenarios that are characterized by close hypotheses and small sample sizes. In this paper we propose a new detection method, named the generalized locally most powerful unbiased (GLMPU) test, which is a general method for local detection in the presence of nuisance parameters. A closed-form expression of the GLMPU test is developed for the detection of frequency deviation in the case where the complex amplitudes of the measured signals are unknown. Numerical simulations show improved performance over the GLRT in terms of probability of detection performance and computational complexity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.