A Fast Algebraic Codebook Search Method for DSVD Applications

Joon-Young JUNG  Hae-Wook CHOI  

IEICE TRANSACTIONS on Information and Systems   Vol.E84-D   No.7   pp.915-917
Publication Date: 2001/07/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Speech and Hearing
algebraic codebook,  DSVD applications,  

Full Text: PDF>>
Buy this Article

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.