Indexed by:
Abstract:
An new orthogonal decomposition method and implementation algorithm for speech signals is proposed in this paper. From the reproducing kernel function of Hilbert space W21[a, b], a set of normalized orthogonal functions {φ*j(x)}1n are generated. Based on {phi;*j(x)}1n, speech signals can be orthogonally decomposed, and the orthogonal decomposition coefficients can be computed by a fast algorithm based on the properties of reproducing kernel function. This method transforms the discrete problem to continuous function space and convert the inner product computation problem in Hilbert space into function evaluation problem in some discrete points. The experiment results indicate that it can be applied to the reconstruction and feature extraction of speech signals.
Keyword:
Reprint Author's Address:
Email:
Source :
Journal of Beijing University of Technology
ISSN: 0254-0037
Year: 2010
Issue: 3
Volume: 36
Page: 394-400
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 7
Affiliated Colleges: