Standard

Fast algorithm for precise estimation of fundamental frequency on short time intervals. / Barabanov, A.; Melnikov, A.; Magerkin, V.; Vikulov, E.

International Conference on Speech and Computer SPECOM 2015. Springer Nature, 2015. p. 217-225.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research

Harvard

Barabanov, A, Melnikov, A, Magerkin, V & Vikulov, E 2015, Fast algorithm for precise estimation of fundamental frequency on short time intervals. in International Conference on Speech and Computer SPECOM 2015. Springer Nature, pp. 217-225. https://doi.org/10.1007/978-3-319-23132-7_27

APA

Barabanov, A., Melnikov, A., Magerkin, V., & Vikulov, E. (2015). Fast algorithm for precise estimation of fundamental frequency on short time intervals. In International Conference on Speech and Computer SPECOM 2015 (pp. 217-225). Springer Nature. https://doi.org/10.1007/978-3-319-23132-7_27

Vancouver

Barabanov A, Melnikov A, Magerkin V, Vikulov E. Fast algorithm for precise estimation of fundamental frequency on short time intervals. In International Conference on Speech and Computer SPECOM 2015. Springer Nature. 2015. p. 217-225 https://doi.org/10.1007/978-3-319-23132-7_27

Author

Barabanov, A. ; Melnikov, A. ; Magerkin, V. ; Vikulov, E. / Fast algorithm for precise estimation of fundamental frequency on short time intervals. International Conference on Speech and Computer SPECOM 2015. Springer Nature, 2015. pp. 217-225

BibTeX

@inproceedings{aabfb22ceb834cdcaf45be5335352525,
title = "Fast algorithm for precise estimation of fundamental frequency on short time intervals",
abstract = "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. Frequency estimation under big noises is studied in detail.",
keywords = "frequency estimation, fast algorithms, harmonic model",
author = "A. Barabanov and A. Melnikov and V. Magerkin and E. Vikulov",
year = "2015",
doi = "10.1007/978-3-319-23132-7_27",
language = "English",
isbn = "9783319231310",
pages = "217--225",
booktitle = "International Conference on Speech and Computer SPECOM 2015",
publisher = "Springer Nature",
address = "Germany",

}

RIS

TY - GEN

T1 - Fast algorithm for precise estimation of fundamental frequency on short time intervals

AU - Barabanov, A.

AU - Melnikov, A.

AU - Magerkin, V.

AU - Vikulov, E.

PY - 2015

Y1 - 2015

N2 - 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. Frequency estimation under big noises is studied in detail.

AB - 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. Frequency estimation under big noises is studied in detail.

KW - frequency estimation

KW - fast algorithms

KW - harmonic model

U2 - 10.1007/978-3-319-23132-7_27

DO - 10.1007/978-3-319-23132-7_27

M3 - Conference contribution

SN - 9783319231310

SP - 217

EP - 225

BT - International Conference on Speech and Computer SPECOM 2015

PB - Springer Nature

ER -

ID: 3979440