Share Email Print

Proceedings Paper

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

Paper Abstract

Spectrum analysis is an elementary operation in speech recognition. Fast Fourier Transform (FFT) is a famous technique to analyze frequency spectrum of the signal in speech recognition. The Discrete Tchebichef Transform (DTT) is proposed as possible alternative to the FFT. DTT has lower computational complexity and it does not require complex transform with imaginary numbers. This paper proposes an approach based on 256 discrete orthonormal Tchebichef polynomials for efficient to analyze a vowel and a consonant in spectral frequency of speech recognition. The comparison between 1024 discrete Tchebichef transform and 256 discrete Tchebichef transform has been done. The preliminary experimental results show that 256 DTT has the potential to be efficient to transform time domain into frequency domain for speech recognition. 256 DTT produces simpler output than 1024 DTT in frequency spectrum. The used of 256 Discrete Tchebichef Transform can produce concurrently four formants F1, F2, F3 and F4 for the consonant.

Paper Details

Date Published: 14 March 2013
PDF: 7 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680O (14 March 2013); doi: 10.1117/12.2010642
Show Author Affiliations
Ferda Ernawan, Univ. Dian Nuswantoro (Indonesia)
Nur Azman Abu, Univ. Teknikal Malaysia Melaka (Malaysia)
Nanna Suryana, Univ. Teknikal Malaysia Melaka (Malaysia)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, 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?