.png){kind=icon}
.png){kind=icon}
Return
Using Discrete Tchebichef Transform on Speech Recognition
.png){kind=icon}
PRE
AI
DOI：10.1117/12.920206.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Speech recognition is becoming popular in current development on mobile devices. Presumably, mobile devices have limited computational power, memory size and battery life. In general, speech recognition is a heavy process that required large sample data within each window. Fast Fourier Transform (FFT) is the most popular transform in speech recognition. In addition, FFT operates in complex field with imaginary numbers. This paper proposes an approach based on discrete orthonormal Tchebichef polynomials as a possible alternative to FFT. Discrete Tchebichef Transform (DTT) shall be utilized here instead of FFT. The preliminary experimental result shows that speech recognition using DTT produces a simpler and efficient transformation for speech recognition. The frequency formants using FFT and DTT have been compared. The result showed that, they have produced relatively identical output in term of basic vowel and consonant recognition. DTT has the potential to provide simpler computing with DTT coefficient real numbers only than FFT on speech recognition.
Keywords:
Speech Recognition
Fast Fourier Transforms
Discrete Tchebichef Transform
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
4
Citations:
0