Indexed by：
Abstract：
To reduce the complexity of algebraic codebook searching, a fast multi-path searching algorithm based on algebra sub-codebook is presented. Experimental results show that the complexity of the proposed method is 1 of 128 of full searching method while the quality of speech coder is not affected.
Keyword：
Reprint Author's Address：
Email：
Source ：
Journal of Beijing University of Technology
ISSN： 0254-0037
Year： 2007
Issue： 8
Volume： 33
Page： 823-827
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 9
Affiliated Colleges：
