Premium
An efficient search algorithm for ISF vector quantization in AMR‐WB speech codec
Author(s) -
Yeh ChengYu
Publication year - 2016
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22310
Subject(s) - codec , computer science , encoder , speech coding , adaptive multi rate audio codec , algorithm , precomputation , quantization (signal processing) , benchmark (surveying) , vector quantization , speech recognition , search algorithm , voice activity detection , speech processing , telecommunications , computation , geodesy , geography , operating system
The adaptive multi‐rate wideband (AMR‐WB) speech codec with a sampling rate of 16 kHz is one of the speech codecs applied to 4G mobile communication systems as a way to remarkably improve the speech quality of a smartphone. However, a major drawback is that the vector quantization of the immittance spectral frequency (ISF) coefficients takes up the second largest of the total computational load of the AMR‐WB encoder. In other words, the speech quality is improved at the cost of high battery power consumption. Accordingly, this letter presents a triangular inequality elimination algorithm equipped with a dynamic and an intersection mechanism, named DI‐TIE, as a means to considerably improve the performance of ISF coefficient quantization in AMR‐WB speech codec. Both mechanisms are designed in a way that recursively enhances the performance of TIE algorithm. This proposal is demonstrated by experimental results as a superior search algorithm relative to a conventional TIE and a multiple TIE (MTIE) approaches. With a full search algorithm as a benchmark for search load comparison, this work provides a search load reduction of more than 77%, a figure far beyond the 36% in the TIE and 49% in the MTIE approach. © 2016 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.