Low-complexity encoding of speech lsf parameters using multistage tree-structured vector quantization: Application to the MELP coder

Author

Djamah, M. ; Shaughnessy, D.O.

Author_Institution

INRS-EMT, Montreal, QC

fYear

2009

fDate

3-6 May 2009

Firstpage

376

Lastpage

380

Abstract

A fast search procedure to reduce the search complexity required to locate the codevectors during the encoding process in multistage tree-structured vector quantization (MTVQ) is proposed. Quantization of line spectral frequency (LSF) parameters at different rates is used to provide experimental results, which are compared to the multipath sequential search or M-L search (MSS) and the multipath sequential tree-assisted search (MSTS). The Federal standard MELP coder is modified by replacing the original LSF quantizer with an MTVQ using the proposed fast search procedure, and an evaluation of the produced speech quality is given.

Keywords

communication complexity; search problems; speech coding; vector quantisation; Federal standard MELP coder; codevector; line spectral frequency quantization; low-complexity encoding; multipath sequential tree-assisted search; multistage tree-structured vector quantization; search complexity; speech quality; Algorithm design and analysis; Binary trees; Code standards; Costs; Electronic mail; Encoding; Frequency; Speech analysis; Speech coding; Vector quantization; Fast search; LSF; MELP speech coder; speech coding; tree-structured vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on

Conference_Location

St. John´s, NL

ISSN

0840-7789

Print_ISBN

978-1-4244-3509-8

Electronic_ISBN

0840-7789

Type

conf

DOI

10.1109/CCECE.2009.5090158

Filename

5090158