.png){kind=icon}
.png){kind=icon}
Return
Fast Sparse Period Estimation
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2014.2345737.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of estimating the period of a point process from observations that are both sparse and noisy is considered. By sparse it is meant that only a potentially small unknown subset of the process is observed. By noisy it is meant that the subset that is observed, is observed with error, or noise. Existing accurate algorithms for estimating the period require O(N-2) operations where N is the number of observations. By quantizing the observations we produce an estimator that requires only O(N log N) operations by use of the chirp z-transform or the fast Fourier transform. The quantization has the adverse effect of decreasing the accuracy of the estimator. This is investigated by Monte-Carlo simulation. The simulations indicate that significant computational savings are possible with negligible loss in statistical accuracy.
Keywords:
Fast Fourier Transform
period estimation
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
Organization
View more organizations