OAK

A packet loss concealment algorithm robust to burst packet loss using multiple codebooks and comfort noise for CELP-type speech coders

Metadata Downloads
Abstract
In this paper, a packet loss concealment (PLC) algorithm for CELP-type speech coders is proposed to improve the quality of decoded speech under burst packet loss. A conventional PLC algorithm is usually based on speech correlation to reconstruct decoded speech of lost frames by using the information on the parameters obtained from the previous frames that are assumed to be correctly received. However, this approach is apt to fail to reconstruct voice onset signals since the parameters such as pitch, LPC coefficient, and adaptive/fixed codebooks of the previous frames are almost related to silence frames. Thus, in order to reconstruct speech signals in the voice onset intervals, we propose a multiple codebook based approach which includes a traditional adaptive codebook and a new random codebook composed of comfort noise. The proposed PLC algorithm is designed as a PLC algorithm for G.729 and its performance is then compared with that of the PLC algorithm employed in G.729 by means of perceptual evaluation of speech quality (PESQ), a waveform comparison, and an A-B preference test under different random and burst packet loss conditions. It is shown from the experiments that the proposed PLC algorithm provides significantly better speech quality than the PLC of G.729, especially under burst packet loss and voice onset conditions. © 2010 Springer-Verlag Berlin Heidelberg.
Author(s)
Park, N.I.Kim, Hong KookJung, M.A.Lee, S.R.Choi, S.H.
Issued Date
2010-12
Type
Article
DOI
10.1007/978-3-642-17604-3_15
URI
https://scholar.gist.ac.kr/handle/local/16515
Publisher
Springer-Verlag Berlin Heidelberg
Citation
Communications in Computer and Information Science, v.120, no.2, pp.138 - 147
ISSN
1865-0929
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.