Spectrum Analysis of Speech Recognition via Discrete Tchebichef Transform

Ernawan, F. and Abu, N. A. and Herman, N. S. (2011) Spectrum Analysis of Speech Recognition via Discrete Tchebichef Transform. In: International Conference on Graphic and Image Processing 2011.

[img]
Preview
PDF
SPECTRUM_ANALYSIS_OF_SPEECH_RECOGNITION_VIA.pdf - Published Version

Download (366kB)

Abstract

Speech recognition is still a growing field. It carries strong potential in the near future as computing power grows. Spectrum analysis is an elementary operation in speech recognition. Fast Fourier Transform (FFT) is the traditional technique to analyze frequency spectrum of the signal in speech recognition. Speech recognition operation requires heavy computation due to large samples per window. In addition, FFT consists of complex field computing. This paper proposes an approach based on discrete orthonormal Tchebichef polynomials to analyze a vowel and a consonant in spectral frequency for speech recognition. The Discrete Tchebichef Transform (DTT) is used instead of popular FFT. The preliminary experimental results show that DTT has the potential to be a simpler and faster transformation for speech recognition.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QP Physiology
Divisions: Faculty of Information and Communication Technology > Department of System and Computer Communication
Depositing User: Dr. Nur Azman Abu
Date Deposited: 03 Jan 2012 01:07
Last Modified: 28 May 2015 02:17
URI: http://eprints.utem.edu.my/id/eprint/338
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item