Fast searching method of algebraic codebook in ACELP speech coding - 文章详情页

作者：

Bao, Chang-Chun (Bao, Chang-Chun.) (学者：鲍长春) | Dou, Geng-Xin (Dou, Geng-Xin.) | Fan, Rui (Fan, Rui.) | Liu, Ze-Xin (Liu, Ze-Xin.)

收录：

EI Scopus PKU CSCD

摘要：

To　reduce　the　complexity　of　algebraic　codebook　searching,　a　fast　multi-path　searching　algorithm　based　on　algebra　sub-codebook　is　presented.　Experimental　results　show　that　the　complexity　of　the　proposed　method　is　1　of　128　of　full　searching　method　while　the　quality　of　speech　coder　is　not　affected.

关键词：

Computational complexity Speech coding

作者机构：

[ 1 ] [Bao, Chang-Chun]School of Electronic Information and Control Engineering, Beijing University of Technology, Beijing 100022, China
[ 2 ] [Dou, Geng-Xin]School of Electronic Information and Control Engineering, Beijing University of Technology, Beijing 100022, China
[ 3 ] [Fan, Rui]School of Electronic Information and Control Engineering, Beijing University of Technology, Beijing 100022, China
[ 4 ] [Liu, Ze-Xin]School of Electronic Information and Control Engineering, Beijing University of Technology, Beijing 100022, China

通讯作者信息：

电子邮件地址：

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至