ACELP语音编码算法改进与仿真 |
| |
引用本文: | 刘华,欧阳宏志,左望霞.ACELP语音编码算法改进与仿真[J].衡阳工学院学报,2010(2):47-51. |
| |
作者姓名: | 刘华 欧阳宏志 左望霞 |
| |
作者单位: | 南华大学电气工程学院,湖南衡阳421001 |
| |
基金项目: | 湖南省教育厅基金资助项目(09C855) |
| |
摘 要: | 代数码激励线性预测算法(ACELP)是目前诸多低速率语音编码标准的算法核心,包括3G语音标准VSELP、AMR、AMR—NB、AMR—WB.该算法基于码激励线性预测模型,通过对码本的有效搜索,确定基音延迟,算法时间复杂度为O(n^3).本文在ACELP算法基础上,对ACELP中自适应码本搜索过程进行改进,提出E—ACELP算法.通过AMR标准中8种速率情况的仿真,E—ACELP算法码本搜索时间减少、时间复杂度下降.基于E—ACELP算法,语音编码标准性能和效率得到提高.
|
关 键 词: | 代数码激励线性预测 自适应码本搜索 时间复杂度 |
Improvement and Simulation for the ACELP Speech Encoding Algorithm |
| |
Authors: | LIU Hua OUYANG Hong-zhi ZUO Wang-xia |
| |
Affiliation: | ( School of Electrical Engineering, University of South China, Hengyang, Hunan 421001, China) |
| |
Abstract: | The algebra code - excited linear prediction (ACELP) is the core algorithm of a lot of low bit rate speech coding standards, including the 3G speech standard VSELP, AMR, AMR - NB, AMR - WB. The algorithm is based on code excited linear prediction model. The pitch delay is determined by the effective codebook search. The algorithm' s time complexity is O (n^3). Based on the ACELP,this paper proposes an improved algorithm called E - ACELP. E - ACELP reduces the time of codebook search and time complexity through the simulation of eight ratios for AMR. The performance and efficiency of the standards based on ACELP are improved. |
| |
Keywords: | algebra code - excited linear prediction search for adaptive eodebook time complexity |
本文献已被 维普 等数据库收录! |
|