Higher Order Crossings

Abstract

In the research on higher order crossings (HOC) they have solved some of the mathematical/statistical problems associated with a certain contraction mapping method for frequency detection and estimation in the presence of noise. They can now tell how to shrink the filters bandwidth to achieve almost sure convergence of the HOC sequence. The sample first order autocorrelation in filtered data is called a higher order correlation, or HOC again. Given the close association between the two types of HOC, these two types of HOC are in fact equivalent under some conditions the nonlinear least squares precision using O(N) computational complexity, but without any matrix inversion and/or other complicated calculations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1992
Accession Number
ADA258727

Entities

People

  • Benjamin Kedem

Organizations

  • University of Maryland, Baltimore

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Autocorrelation
  • Bandwidth
  • Computational Complexity
  • Crossings
  • Data Science
  • Frequency
  • Gaussian Processes
  • Information Science
  • Information Theory
  • Mathematics
  • Sequences
  • Spectrum Analysis
  • Statistical Algorithms
  • Statistical Analysis
  • Statistical Inference
  • Statistics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Parallel and Distributed Computing.
  • Statistical inference.