Standard

Trade-off between speed and accuracy for noise variance minimization (NVM) Pitch estimation algorithm. / Barabanov, Andrey; Melnikov, Alexandr.

In: Lecture Notes in Computer Science, Vol. LNAI 9811, 2016, p. 714-721.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Barabanov, Andrey ; Melnikov, Alexandr. / Trade-off between speed and accuracy for noise variance minimization (NVM) Pitch estimation algorithm. In: Lecture Notes in Computer Science. 2016 ; Vol. LNAI 9811. pp. 714-721.

BibTeX

@article{46cdea70df5547218ae6cf5929f65dd2,
title = "Trade-off between speed and accuracy for noise variance minimization (NVM) Pitch estimation algorithm",
abstract = "New version of NVM algorithm in case of stationary voice model are proposed for precise estimation of the Fundamental frequency on a short time interval. Its computational complexity is proportional to that of FFT on the same time interval. A precise trade-off between approximation error and numerical speed is established.",
keywords = "frequency estimation, fast algorithms, harmonic model",
author = "Andrey Barabanov and Alexandr Melnikov",
year = "2016",
doi = "10.1007/978-3-319-43958-7",
language = "English",
volume = "LNAI 9811",
pages = "714--721",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Nature",

}

RIS

TY - JOUR

T1 - Trade-off between speed and accuracy for noise variance minimization (NVM) Pitch estimation algorithm

AU - Barabanov, Andrey

AU - Melnikov, Alexandr

PY - 2016

Y1 - 2016

N2 - New version of NVM algorithm in case of stationary voice model are proposed for precise estimation of the Fundamental frequency on a short time interval. Its computational complexity is proportional to that of FFT on the same time interval. A precise trade-off between approximation error and numerical speed is established.

AB - New version of NVM algorithm in case of stationary voice model are proposed for precise estimation of the Fundamental frequency on a short time interval. Its computational complexity is proportional to that of FFT on the same time interval. A precise trade-off between approximation error and numerical speed is established.

KW - frequency estimation

KW - fast algorithms

KW - harmonic model

U2 - 10.1007/978-3-319-43958-7

DO - 10.1007/978-3-319-43958-7

M3 - Article

VL - LNAI 9811

SP - 714

EP - 721

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

ID: 7581881