Complexity reduction in Karhunen-Loeve transform based speech coder for voice transmission

For gain-shape split vector quantization, an incremental M (IM) search algorithm is proposed. In the conventional M search, every possible combination of subvectors is evaluated. However, in the proposed IM search, an intermediate subvector is constructed by merging adjacent subvectors in an increme...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on consumer electronics Vol. 60; no. 1; pp. 130 - 136
Main Authors Ju, Hyunho, Lee, Seongjoo, Kim, Moo-Young
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
CELP
codebook search
Coders
Complexity
Complexity theory
Eigenvalues and eigenfunctions
KLT-CVQ
M search
Searching
Shape
Speech
Speech coding
Telephones
Transforms
Vectors
Voice
VoIP (protocol)
Online AccessGet full text

Cover

More Information
Summary:For gain-shape split vector quantization, an incremental M (IM) search algorithm is proposed. In the conventional M search, every possible combination of subvectors is evaluated. However, in the proposed IM search, an intermediate subvector is constructed by merging adjacent subvectors in an incremental and recursive way. Based on the IM search, the high-dimensional Karhunen-Loeve Transform (KLT) based speech coder is designed in practice. IM search requires 1800 times lower complexity than M search in designing a high-dimensional KLT-CVQ. Based on the proposed KLT based speech coder, a novel voice over IP (VoIP) system is designed, which produces superior voice quality and rate-distortion performance to conventional VoIP systems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0098-3063
1558-4127
DOI:10.1109/TCE.2014.6780935