SPECTRUM ANALYSIS OF SPEECH RECOGNITION VIA DISCRETE TCHEBICHEF TRANSFORM
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.
Speechrecognition FastFourierTransforms Discrete Cosine Transform and Discrete Tchebichef Transform
Ferda Ernawan Nur Azman Abu Nanna Suryana
Faculty of Information and Communication Technology Universitas Dian Nuswantoro (UDINUS) Semarang, I Faculty of Information and Communication Technology Universiti Teknikal Malaysia Melaka (UTeM) Melak
国际会议
2010 International Conference on Signal and Information Processing(2010年IEEE信号与信息处理国际会议 ICSIP2010)
长沙
英文
395-399
2010-12-14(万方平台首次上网日期,不代表论文的发表时间)