A Zero-Pole Vocal Tract Model Estimation Method Accurately Reproducing Spectral Zeros

Balazs P, Marelli D. A Zero-Pole Vocal Tract Model Estimation Method Accurately Reproducing Spectral Zeros. In: AES Convention 122. Audio Engineering Society; 2007. Paper 7028. Available from: https://aes.org/publications/elibrary-page/?id=14013

@inproceedings{Balazs2007_14013,
  author = {Balazs, Peter and Marelli, Damián},
  title = {{A Zero-Pole Vocal Tract Model Estimation Method Accurately Reproducing Spectral Zeros}},
  booktitle = {AES Convention 122},
  note = {Paper 7028},
  year = {2007},
  month = may,
  publisher = {Audio Engineering Society},
  url = {https://aes.org/publications/elibrary-page/?id=14013}
}

TY  - CPAPER
TI  - A Zero-Pole Vocal Tract Model Estimation Method Accurately Reproducing Spectral Zeros
AU  - Balazs, Peter
AU  - Marelli, Damián
T2  - AES Convention 122
M1  - Paper 7028
PY  - 2007
DA  - 2007/05/06
UR  - https://aes.org/publications/elibrary-page/?id=14013
PB  - Audio Engineering Society
LA  - en
AB  - Model based speech coding consists in modeling the vocal tract as a linear time-variant system. The all-pole model produced by the computationally efficiency Linear Predictive Coding method provides a good representation for the majority of speech sounds. However, nasal and fricative sounds, as well as stop consonants, contain spectral zeros which requires the use of a zero-pole model. Roughly speaking, a zero-pole model estimation method typically does a non-parametric estimation of the vocal tract impulse response, and tunes the zero-pole model to fit this estimation in a square sense. In this paper we propose an alternative strategy. We tune the zero-pole model to directly fit the power spectrum of the speech signal in a logarithmic scale, to be consistent with the way the human ear perceives sounds. In this way, we avoid the error introduced by the vocal tract impulse response estimation and obtain a model that is more accurate at reproducing spectral zeros in a logarithmic scale. A drawback of the proposed method, however, is its computational complexity.
ER  -