一种快速的固定码本搜索方法  

Fast Fixed Codebook Search Method

作　　者：高建敏[1] 施海彬[1] 唐骏[1] 

机构地区：[1]厦门大学信息科学与技术学院ATR实验室,福建厦门361005

出　　处：《计算机工程》2011年第8期265-267,共3页Computer Engineering

基　　金：福建省科技厅重大专项基金资助项目(2009HZ0003-1)

摘　　要：为降低固定码本搜索算法的复杂度,在脉冲取代法的基础上提出一种码矢分段优化的快速搜索方法。采用码矢分段优化的方法,在保证语音质量的前提下,降低计算复杂度。实验结果表明,与AMR-WB采用的深度优先树算法及传统的脉冲取代算法相比,在不影响语音质量的条件下,码矢分段优化算法复杂度降低了70%-80%。In order to reduce complexity of fixed codebook search,a fast algebraic codebook search argorithm based on pulse replacement procedure is proposed in this paper.The proposed method is employed dividing candidate codevector into two sub-codevectors to optimize.It not only lowers the computational complexity sharply,but also ensures the speech quality.Experimental results show that the proposed method reduces the total computational complexity by 70%80% with speech quality equivalent,compared with that by the depth-first tree search method adopted in AMR-WB and traditional pulse replace method.

关 键 词：语音编码 固定码本搜索 码矢分段优化 AMR—WB标准 MOS值 

分 类 号：TN912.3[电子电信—通信与信息系统]