Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters

S. Arya; N. Phamdo; N. Farvardin; D. Mount

doi:10.1109/SCFT.1993.762341

Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters

S. Arya, N. Phamdo, N. Farvardin, D. Mount

Department of Electrical and Computer Engineering

University of Maryland, College Park

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

Linear predictive coding (LPC) is an indispensable component of most speech coding algorithms. Thus, efficient representation of the LPC parameters is a central issue in speech coding. There is evidence that the most efficient representation of the LPC parameters is the line spectrum pair (LSP) representation [l]. The LSP parameters have two properties which make them amenable to quantization [l]: (1) their ordering property and (2) their interpolation property. It is generally believed that, due to these properties, for the same quantization scheme, quantizers which operate on LSP parameters are more efficient than quantizers which operate on other LPC representations. Results of several studies [l, 21 support this belief.

Original language	English
Pages	65-66
Number of pages	2
DOIs	https://doi.org/10.1109/SCFT.1993.762341
State	Published - 1993
Event	1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993 - Sainte-Adele, Canada Duration: 13 Oct 1993 → 15 Oct 1993

Conference

Conference	1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993
Country/Territory	Canada
City	Sainte-Adele
Period	13/10/93 → 15/10/93

Access to Document

10.1109/SCFT.1993.762341

Cite this

Arya, S., Phamdo, N., Farvardin, N., & Mount, D. (1993). Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters. 65-66. Paper presented at 1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993, Sainte-Adele, Canada. https://doi.org/10.1109/SCFT.1993.762341

@conference{d12a4645bfc141629974f230484e03c6,

title = "Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters",

abstract = "Linear predictive coding (LPC) is an indispensable component of most speech coding algorithms. Thus, efficient representation of the LPC parameters is a central issue in speech coding. There is evidence that the most efficient representation of the LPC parameters is the line spectrum pair (LSP) representation [l]. The LSP parameters have two properties which make them amenable to quantization [l]: (1) their ordering property and (2) their interpolation property. It is generally believed that, due to these properties, for the same quantization scheme, quantizers which operate on LSP parameters are more efficient than quantizers which operate on other LPC representations. Results of several studies [l, 21 support this belief.",

author = "S. Arya and N. Phamdo and N. Farvardin and D. Mount",

note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993 ; Conference date: 13-10-1993 Through 15-10-1993",

year = "1993",

doi = "10.1109/SCFT.1993.762341",

language = "English",

pages = "65--66",

}

Arya, S, Phamdo, N, Farvardin, N & Mount, D 1993, 'Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters', Paper presented at 1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993, Sainte-Adele, Canada, 13/10/93 - 15/10/93 pp. 65-66. https://doi.org/10.1109/SCFT.1993.762341

Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters. / Arya, S.; Phamdo, N.; Farvardin, N. et al.
1993. 65-66 Paper presented at 1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993, Sainte-Adele, Canada.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters

AU - Arya, S.

AU - Phamdo, N.

AU - Farvardin, N.

AU - Mount, D.

PY - 1993

Y1 - 1993

N2 - Linear predictive coding (LPC) is an indispensable component of most speech coding algorithms. Thus, efficient representation of the LPC parameters is a central issue in speech coding. There is evidence that the most efficient representation of the LPC parameters is the line spectrum pair (LSP) representation [l]. The LSP parameters have two properties which make them amenable to quantization [l]: (1) their ordering property and (2) their interpolation property. It is generally believed that, due to these properties, for the same quantization scheme, quantizers which operate on LSP parameters are more efficient than quantizers which operate on other LPC representations. Results of several studies [l, 21 support this belief.

AB - Linear predictive coding (LPC) is an indispensable component of most speech coding algorithms. Thus, efficient representation of the LPC parameters is a central issue in speech coding. There is evidence that the most efficient representation of the LPC parameters is the line spectrum pair (LSP) representation [l]. The LSP parameters have two properties which make them amenable to quantization [l]: (1) their ordering property and (2) their interpolation property. It is generally believed that, due to these properties, for the same quantization scheme, quantizers which operate on LSP parameters are more efficient than quantizers which operate on other LPC representations. Results of several studies [l, 21 support this belief.

UR - http://www.scopus.com/inward/record.url?scp=85066143510&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066143510&partnerID=8YFLogxK

U2 - 10.1109/SCFT.1993.762341

DO - 10.1109/SCFT.1993.762341

M3 - Paper

AN - SCOPUS:85066143510

SP - 65

EP - 66

T2 - 1993 IEEE Workshop on Speech Coding for Telecommunications: Speech Coding for the Network of the Future, SCFT 1993

Y2 - 13 October 1993 through 15 October 1993

ER -

Fast search algorithms with applications to split and multi-stage vector quantization of speech LSP parameters

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this