Home > Research > Publications & Outputs > Algorithm for speech model root location

Research

Links

Text available via DOI:

Keywords

View graph of relations

Algorithm for speech model root location

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Algorithm for speech model root location. / Thomas, Bryn; Arani, F.; Honary, Bahram.
In: Electronics Letters, Vol. 33, No. 5, 27.02.1997, p. 355-356.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Thomas, B, Arani, F & Honary, B 1997, 'Algorithm for speech model root location', Electronics Letters, vol. 33, no. 5, pp. 355-356. https://doi.org/10.1049/el:19970241

APA

Thomas, B., Arani, F., & Honary, B. (1997). Algorithm for speech model root location. Electronics Letters, 33(5), 355-356. https://doi.org/10.1049/el:19970241

Vancouver

Thomas B, Arani F, Honary B. Algorithm for speech model root location. Electronics Letters. 1997 Feb 27;33(5):355-356. doi: 10.1049/el:19970241

Author

Thomas, Bryn ; Arani, F. ; Honary, Bahram. / Algorithm for speech model root location. In: Electronics Letters. 1997 ; Vol. 33, No. 5. pp. 355-356.

Bibtex

@article{b3082f1c5c5d4a0483fd933a40c0c16f,
title = "Algorithm for speech model root location",
abstract = "A novel algorithm for locating the roots of the speech model filter polynomial derived from LPC analysis is proposed. The technique is guaranteed to converge and can be implemented in a fixed time interval. When several iterations are performed, very accurate root estimation can be achieved.",
keywords = "linear predictive coding, convergence of numerical methods, iterative methods, speech processing, polynomials ",
author = "Bryn Thomas and F. Arani and Bahram Honary",
year = "1997",
month = feb,
day = "27",
doi = "10.1049/el:19970241",
language = "English",
volume = "33",
pages = "355--356",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "5",

}

RIS

TY - JOUR

T1 - Algorithm for speech model root location

AU - Thomas, Bryn

AU - Arani, F.

AU - Honary, Bahram

PY - 1997/2/27

Y1 - 1997/2/27

N2 - A novel algorithm for locating the roots of the speech model filter polynomial derived from LPC analysis is proposed. The technique is guaranteed to converge and can be implemented in a fixed time interval. When several iterations are performed, very accurate root estimation can be achieved.

AB - A novel algorithm for locating the roots of the speech model filter polynomial derived from LPC analysis is proposed. The technique is guaranteed to converge and can be implemented in a fixed time interval. When several iterations are performed, very accurate root estimation can be achieved.

KW - linear predictive coding

KW - convergence of numerical methods

KW - iterative methods

KW - speech processing

KW - polynomials

U2 - 10.1049/el:19970241

DO - 10.1049/el:19970241

M3 - Journal article

VL - 33

SP - 355

EP - 356

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 5

ER -