• Aucun résultat trouvé

Low-delay 16 kb/s Wideband Speech Coder withFast Search Methods

N/A
N/A
Protected

Academic year: 2021

Partager "Low-delay 16 kb/s Wideband Speech Coder withFast Search Methods"

Copied!
1
0
0

Texte intégral

(1)

Transactions on Systems, Signals & Devices

Volume 1, Issue 3, 2006, Pages 235-244

Low-delay 16 kb/s Wideband Speech Coder with Fast Search Methods

M. Bengherabi, M. Halimi

Abstract: In this paper, a low delay 16kb/s wideband speech coder with a buffering delay of 1.25ms is introduced. This coder is basically inspired from the G728 LD-CELP standard for narrowband speech signals. Our main goal is to reduce the implementation complexity of our wideband G728 –like- coder, which is mainly due to the search of the optimal excitation (gain-shape) in codebook. For this reason an algebraic codebook is proposed and an exhaustive optimal search and suboptimal full position and Joint Position and Amplitude search techniques are implemented. Objective performance evaluation on a large corpus of a testing speech database show that the JAPS (Joint Position and Amplitude Search) multistage search technique proposed recently can yield to a very important reduction of coder computational load, with only a slight degradation in the quality of synthesized speech signals compared to other -high complexity- search techniques.

Keywords : - Low delay CELP, G728, Backward LPC analysis, algebraic codebook

Centre de Recherche en Technologies Industrielles - CRTI - www.crti.dz

Powered by TCPDF (www.tcpdf.org)

Références

Documents relatifs

To this aim, Figure 3 plots the recommendation loss curves on the Cell Phones & Accessories training data for two rec- ommendation models, one trained individually and the other

The task of QUESST (“QUery by Example Search on Speech Task”) is to search FOR audio content WITHIN audio content USING an audio query.. As in previous years, the search database

It is possible that participants are trig- gered to check more books by the distinct functionality of the different panels of the multistage interface, especially since the open

In Proceedings of the First International Workshop on Gamification for Infor- mation Retrieval, GamifIR ’14, pages 2–6, 2014.. [FLHRARC14]

And third, three types of query matchings are considered: the first one is the “exact match” case used in previous years, whereas the second one, which allows for

For each keyword, the corresponding most likely sequence of EHMM states can be calculated using the Viterbi algorithm, which can then be used as a left-right HMM of the query..

In this case, the standard evaluation measures from the IR field re- quire the availability of manual content ratings with respect to query relevance and specific user preference

The results of Table 3 clearly show the performance improvements of our proposed methodology over existing text-based techniques for both data sets and most evaluation metrics..