A fast search approach for LSF parameters codebook - 文章详情页

作者：

Yanning, Bai (Yanning, Bai.) | Changchun, Bao (Changchun, Bao.) (学者：鲍长春)

收录：

EI Scopus

摘要：

In　this　paper,　a　fast-search　algorithm　is　introduced　to　reduce　the　complexity　of　LSF　quantization　in　speech　coding.　A　new　inequality　between　the　weighted　mean　and　the　weighted　Euclidean　distance　is　derived.　Using　this　inequality,　many　codewords　that　are　impossible　to　be　the　nearest　codeword　are　rejected　directly.　The　proposed　algorithm　produces　the　same　output　as　conventional　full　search　algorithm　and　the　experiment　results　confirm　its　effectiveness.　©　2006　IEEE.

关键词：

Algorithms Computational complexity Speech analysis Speech coding

作者机构：

[ 1 ] [Yanning, Bai]Speech and Audio Signal Processing Lab., Beijing University of Technology, Beijing 100022
[ 2 ] [Changchun, Bao]Speech and Audio Signal Processing Lab., Beijing University of Technology, Beijing 100022

通讯作者信息：

电子邮件地址：

baiyanning@emails.bjut.edu.cn

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至