| 注册
首页|期刊导航|计算机工程|一种快速的固定码本搜索方法

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

高建敏 施海彬 唐骏

计算机工程2011,Vol.37Issue(8):265-267,3.
计算机工程2011,Vol.37Issue(8):265-267,3.DOI:10.3969/j.issn.1000-3428.2011.08.092

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

Fast Fixed Codebook Search Method

高建敏 1施海彬 1唐骏1

作者信息

  • 1. 厦门大学信息科学与技术学院ATR实验室,福建,厦门,361005
  • 折叠

摘要

Abstract

In order to reduce complexity of fixed codebook search, a fast algebraic codcbook 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值

Key words

speech coding/ fixed codebook search/ sub-codevector optimization/ AMR-WB standard/ MOS score

分类

信息技术与安全科学

引用本文复制引用

高建敏,施海彬,唐骏..一种快速的固定码本搜索方法[J].计算机工程,2011,37(8):265-267,3.

基金项目

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

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文