1 October 2011 Spectrum analysis of speech recognition via discrete Tchebichef transform
Author Affiliations +
Proceedings Volume 8285, International Conference on Graphic and Image Processing (ICGIP 2011); 82856L (2011) https://doi.org/10.1117/12.913491
Event: 2011 International Conference on Graphic and Image Processing, 2011, Cairo, Egypt
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ferda Ernawan, Ferda Ernawan, Nur Azman Abu, Nur Azman Abu, Nanna Suryana, Nanna Suryana, } "Spectrum analysis of speech recognition via discrete Tchebichef transform", Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82856L (1 October 2011); doi: 10.1117/12.913491; https://doi.org/10.1117/12.913491
PROCEEDINGS
8 PAGES


SHARE
Back to Top