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
본 논문에서는 주변 소음 환경에서 낮은 비트율 음성 코더의 음성 강화에 대한 새로운 접근 방식을 제안합니다. 주변 소음의 여기 벡터는 가까운 쪽에서 효율적으로 얻은 다음 G.729 CS-ACELP Annex 내에서 적절한 강화 이득을 위해 원단의 여기 신호와 결합됩니다. B 프레임워크. 이러한 이유로, 본 접근법은 이산 푸리에 변환(DFT)과 같은 추가적인 산술 단계를 필요로 하지 않는다는 점에서 이전 접근법과 분명히 다를 수 있습니다. 실험 결과는 제안된 방법이 더 낮은 계산 부담을 갖는 기존 접근 방식보다 더 나은 성능을 보이거나 적어도 비교할 수 있음을 나타냅니다.
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.
부
Jae-Hun CHOI, Joon-Hyuk CHANG, Seong-Ro LEE, "Efficient Speech Reinforcement Based on Low-Bit-Rate Speech Coding Parameters" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 9, pp. 1684-1687, September 2010, doi: 10.1587/transfun.E93.A.1684.
Abstract: In this paper, a novel approach to speech reinforcement in a low-bit-rate speech coder under ambient noise environments is proposed. The excitation vector of ambient noise is efficiently obtained at the near-end and then combined with the excitation signal of the far-end for a suitable reinforcement gain within the G.729 CS-ACELP Annex. B framework. For this reason, this can be clearly different from previous approaches in that the present approach does not require an additional arithmetic step such as the discrete Fourier transform (DFT). Experimental results indicate that the proposed method shows better performance than or at least comparable to conventional approaches with a lower computational burden.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1684/_p
부
@ARTICLE{e93-a_9_1684,
author={Jae-Hun CHOI, Joon-Hyuk CHANG, Seong-Ro LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Speech Reinforcement Based on Low-Bit-Rate Speech Coding Parameters},
year={2010},
volume={E93-A},
number={9},
pages={1684-1687},
abstract={In this paper, a novel approach to speech reinforcement in a low-bit-rate speech coder under ambient noise environments is proposed. The excitation vector of ambient noise is efficiently obtained at the near-end and then combined with the excitation signal of the far-end for a suitable reinforcement gain within the G.729 CS-ACELP Annex. B framework. For this reason, this can be clearly different from previous approaches in that the present approach does not require an additional arithmetic step such as the discrete Fourier transform (DFT). Experimental results indicate that the proposed method shows better performance than or at least comparable to conventional approaches with a lower computational burden.},
keywords={},
doi={10.1587/transfun.E93.A.1684},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - Efficient Speech Reinforcement Based on Low-Bit-Rate Speech Coding Parameters
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1684
EP - 1687
AU - Jae-Hun CHOI
AU - Joon-Hyuk CHANG
AU - Seong-Ro LEE
PY - 2010
DO - 10.1587/transfun.E93.A.1684
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2010
AB - In this paper, a novel approach to speech reinforcement in a low-bit-rate speech coder under ambient noise environments is proposed. The excitation vector of ambient noise is efficiently obtained at the near-end and then combined with the excitation signal of the far-end for a suitable reinforcement gain within the G.729 CS-ACELP Annex. B framework. For this reason, this can be clearly different from previous approaches in that the present approach does not require an additional arithmetic step such as the discrete Fourier transform (DFT). Experimental results indicate that the proposed method shows better performance than or at least comparable to conventional approaches with a lower computational burden.
ER -