z-logo
open-access-imgOpen Access
Estimation of glottal closure instants by considering speech signal as a spectrum
Author(s) -
Sripriya N.,
Nagarajan T.
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.4444
Subject(s) - mathematics , group delay and phase delay , signal (programming language) , algorithm , closure (psychology) , speech recognition , function (biology) , transfer function , computer science , telecommunications , bandwidth (computing) , economics , market economy , programming language , engineering , evolutionary biology , electrical engineering , biology
Close to glottal closure instants (GCIs), the speech signal is expected to change its amplitude rapidly and, at GCIs, it is expected to have strong negative peaks. A novel algorithm that exploits these two properties for the estimation of GCIs is presented. Here, a symmetrised speech segment is assumed to be a Fourier transform (FT) of an even function. In such a case, at the locations of the GCIs, the strong negative peaks in the symmetrised speech segment correspond to zeros that lie considerably outside the unit circle in the z ‐plane. The group delay spectrum of the time‐domain signal derived by taking inverse FT of this assumed FT is expected to take a value close to −2 π at the angular locations of these zeros. Mapping frequency scale to time scale, the frequency bins for which group delay reaches −2 π correspond to the locations of GCIs. Theoretical justification for the proposed approach is also presented by defining a novel function called the conditional group delay function. Systematic evaluation is carried out on the CMU Arctic database and the performance of the proposed technique is better than that of the algorithms namely DYPSA, ZFF, YAGA and is close to that of SEDREAMS.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here