Fast algorithms are proposed for precise estimation of the Fundamental frequency on a short time interval. The approach is a generalization of the unbiased frequency estimator. Its computational complexity is proportional to that of FFT on the same time interval. A trade-off between approximation error and numerical speed is established. The result is generalized to the linear trend model. The lower bound is obtained for the time interval length with a nonsingular information matrix in the estimation problem. The frequency estimation algorithm is not sensitive to big random noises.
CITATION STYLE
Barabanov, A., Melnikov, A., Magerkin, V., & Vikulov, E. (2015). Fast algorithm for precise estimation of fundamental frequency on short time intervals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9319, pp. 217–225). Springer Verlag. https://doi.org/10.1007/978-3-319-23132-7_27
Mendeley helps you to discover research relevant for your work.