The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 DSVD 응용을 위한 빠른 대수적 코드북 검색을 제안합니다. 이 방법에서는 평균 기반 트랙 임계값에 경험적으로 결정된 최적 임계값 인자를 곱하여 가능한 위치 조합의 수를 줄임으로써 코드북 검색을 단순화합니다. 그리고 DSVD의 복잡도 요구사항을 보장하기 위해 최대 검색 위치 조합 수는 320개로 제한된다. 제안하는 방법은 SNR이 약간 저하되면서 G.729에 비해 계산 복잡도를 상당히 줄였다. 특히, G.729A에 비해 복잡도는 낮고 더 나은 음성 품질을 보여줍니다.
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.
부
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
부
@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},}
부
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 -