Share Email Print

Proceedings Paper

Spectrum analysis of speech recognition via discrete Tchebichef transform
Author(s): Ferda Ernawan; Nur Azman Abu; Nanna Suryana
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 1 October 2011
PDF: 8 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82856L (1 October 2011); doi: 10.1117/12.913491
Show Author Affiliations
Ferda Ernawan, Univ. Dian Nuswantoro (Indonesia)
Nur Azman Abu, Univ. Teknikal Malaysia (Malaysia)
Nanna Suryana, Univ. Teknikal Malaysia (Malaysia)

Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?