Paper Info
Title
Efficient fixed codebook search method for ACELP speech codecs
Abstract
There are several sub-optimal search techniques for fast algebraic codebook search of ACELP speech codecs. Focused search method, depth-first tree search method and pulse replacement methods are used to reduce computational complexity of algebraic codebook search. In previous pulse replacement methods, the computational load is increased as the pulse replacement procedure is repeated. In this paper, we propose a fast algebraic codebook search method based on iteration-free pulse replacement. The proposed method is composed of two stages. At the first stage, an initial codevector is determined by the backward filtered target vector or the pulse-position likelihood-estimate vector. At the second stage, after computing pulse contributions for every track the pulse replacement is performed to maximize the search criterion Qk over all combination replacing the pulses of the initial codevector with the most important pulses for every track. The performance of the proposed algebraic codebook search method is measured in terms of the segmental signal to noise ratio (SNRseg) and PESQ (Perceptual Evaluation of Speech Quality) using various speech data. Experimental results show that the proposed method is very efficient in computational complexity and speech quality comparing to previous pulse replacement methods.
Year
DOI
Venue
2006
10.1007/978-3-540-77368-9_18
ICHIT
Keywords
DocType
Volume
acelp speech codecs,algebraic codebook search,search criterion qk,previous pulse replacement method,focused search method,fast algebraic codebook search,computational complexity,efficient fixed codebook search,proposed algebraic codebook search,sub-optimal search technique,depth-first tree search method,signal to noise ratio
Conference
4413
ISSN
ISBN
Citations 
0302-9743
3-540-77367-3
5
PageRank 
References 
Authors
0.83
5
2
Name
Order
Citations
PageRank
Eung-Don Lee161.87
Jae-Min Ahn29411.73