A Fast Algebraic Codebook Search Method for DSVD Applications
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.7 pp.915-917
- Publication Date
- 2001/07/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Speech and Hearing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Joon-Young JUNG, Hae-Wook CHOI, "A Fast Algebraic Codebook Search Method for DSVD Applications" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 7, pp. 915-917, July 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_7_915/_p
Copy
@ARTICLE{e84-d_7_915,
author={Joon-Young JUNG, Hae-Wook CHOI, },
journal={IEICE TRANSACTIONS on Information},
title={A Fast Algebraic Codebook Search Method for DSVD Applications},
year={2001},
volume={E84-D},
number={7},
pages={915-917},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Fast Algebraic Codebook Search Method for DSVD Applications
T2 - IEICE TRANSACTIONS on Information
SP - 915
EP - 917
AU - Joon-Young JUNG
AU - Hae-Wook CHOI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2001
AB - 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.
ER -
English
