Skip to main content

Fast Algorithm for Precise Estimation of Fundamental Frequency on Short Time Intervals

  • Conference paper
  • First Online:
Speech and Computer (SPECOM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9319))

Included in the following conference series:

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. The frequency estimation algorithm is not sensitive to big random noises.

The work was supported by Saint Petersburg State University, project 6.37.349.2015.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Stylianou, Y.: Harmonic plus Noise Models for speech, combined with statistical methods, for speech and speaker modification. Ph.D. thesis. Ecole Nationale Superieure des Telecommunications, Paris (1996)

    Google Scholar 

  2. de Cheveigne, A., Kawahara, H.: YIN, a fundamental frequency estimator for speech and music. JASA 111(4), 1917–1930 (2002)

    Article  Google Scholar 

  3. Griffin, D.W., Lim, J.S.: Multiband excitation vocoder. IEEE Trans. Acoustic Speech Sig. Process. 36(8), 1223–1235 (1988)

    Article  MATH  Google Scholar 

  4. Pirker, G., Wohlmayr, M., Petrik, S., Pernkopf, F.: A pitch tracking corpus with evaluation on multipitch tracking scenario. In: INTERSPEECH, pp. 1509–1512 (2011)

    Google Scholar 

  5. Kasi, K., Zahorian, S.A.: Yet another algorithm for pitch tracking. IEEE Trans. Acoustic Speech Sig. Process. 1, 361–364 (2002)

    Google Scholar 

  6. Camacho, A.: SWIPE: a sawtooth waveform inspired pitch estimator for speech and music. Doctoral dissertation, University of Florida (2007)

    Google Scholar 

  7. Talkin, D.: A robust algorithm for pitch tracking (RAPT). In: Kleijn, W.B., Paliwal, K.K. (eds.) Speech Coding and Synthesis, pp. 495–518. Elsevier, Amsterdam (1995)

    Google Scholar 

  8. Gonzalez, S., Brookes, M.: A pitch estimation filter robust to high levels of noise (PEFAC). In: IEEE 19th European Signal Processing Conference, pp. 451–455 (2011)

    Google Scholar 

Download references

Acknowledgments

The work was supported by Saint Petersburg State University, project 6.37.349.2015.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexandr Melnikov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Barabanov, A., Melnikov, A., Magerkin, V., Vikulov, E. (2015). Fast Algorithm for Precise Estimation of Fundamental Frequency on Short Time Intervals. In: Ronzhin, A., Potapova, R., Fakotakis, N. (eds) Speech and Computer. SPECOM 2015. Lecture Notes in Computer Science(), vol 9319. Springer, Cham. https://doi.org/10.1007/978-3-319-23132-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23132-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23131-0

  • Online ISBN: 978-3-319-23132-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics