A Fast Algebraic Codebook Search Method for DSVD Applications
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a fast algebraic codebook search for DSVD applications. In this method, the codebook search is simplified by reducing the number of possible position combinations using a mean-based track threshold multiplied by heuristically determined optimum threshold factor. And, to guarantee a complexity requirement of DSVD, the maximum number of searching position combinations is limited to 320. The proposed method reduced computational complexity considerably, compared with G.729 with a slight degradation of SNR. Particularly, it shows better speech quality with lower complexity than G.729A.
- 一般社団法人電子情報通信学会の論文
- 2001-07-01
著者
-
Choi Hae-wook
The Authors Are With System Vlsi Lab. Information And Communications University
-
Jung Joon-young
The Authors Are With System Vlsi Lab. Information And Communications University