New encoding algorithm for distributed speech recognition based on DTFS transform

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper presents a new algorithm for efficient compression of front-end feature extracted parameters used in distributed speech recognition systems (DSR). In the proposed method the source encoder is mainly based on discrete time Fourier series (DTFS) by interpolation using Fourier coefficients with conventional vector quantization. The system provides a compression bit rate as low as 4 kbps; the experiments were carried out on the TIDigits Aurora2 database [1]. The simulation results show good recognition performance without dramatic change comparing with ETSI STQ-AURORA standard front-end feature compression algorithm with quantized features at 4.4 kbps [2]. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Touazi, A., & Debyeche, M. (2012). New encoding algorithm for distributed speech recognition based on DTFS transform. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7340 LNCS, pp. 547–554). https://doi.org/10.1007/978-3-642-31254-0_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free