A fast algebraic codebook search method for DSVD applications

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 151
  • Download : 0
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.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2001-07
Language
English
Article Type
Letter
Keywords

CS-ACELP; KB/S

Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E84D, no.7, pp.915 - 917

ISSN
0916-8532
URI
http://hdl.handle.net/10203/209081
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0