Iteration-free pulse replacement method for algebraic codebook search

A fast algebraic codebook search method based on iteration-free pulse replacement is proposed. The method comprises two stages. At the first stage, an initial codevector is determined by the pulse-position likelihood-estimate vector. At the second stage, after computing pulse-contributions for every track, the pulse replacement is performed to maximise the search criterion over all combinations, replacing the pulses of the initial codevector with the most important pulses for every track. Experimental results show that the proposed method is very efficient in terms of computational complexity and speech quality compared to previous pulse replacement methods