Spectrum analysis of speech recognition via discrete Tchebichef transform
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 re...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/338/1/SPECTRUM_ANALYSIS_OF_SPEECH_RECOGNITION_VIA.pdf http://eprints.utem.edu.my/id/eprint/338/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|