DocumentCode
1854359
Title
Fast computation of Chebyshev optimal nonuniform interpolation
Author
Wang, Zhongde ; Jullien, G.A. ; Miller, W.C.
Author_Institution
VLSI Res. Group, Windsor Univ., Ont., Canada
Volume
1
fYear
1995
fDate
13-16 Aug 1995
Firstpage
111
Abstract
There are two schemes of Chebyshev interpolation. Neagoe (1990) recently developed an approach, using the existing DCT algorithms, for computing the Chebyshev coefficients for one of the two schemes, but no algorithms have been developed for computing the interpolated samples. In this paper we first demonstrate that both schemes of Chebyshev interpolation relate to the type I and II discrete cosine transforms (DCT-I and DCT-II), respectively. Then we show that both schemes of Chebyshev interpolation can be computed using the existing fast algorithms for the DCT
Keywords
Chebyshev approximation; approximation theory; discrete cosine transforms; interpolation; polynomials; signal sampling; Chebyshev optimal nonuniform interpolation; DCT algorithms; discrete cosine transform; fast algorithms; fast computation; interpolated samples; Chebyshev approximation; Discrete cosine transforms; Interpolation; Performance analysis; Polynomials; Sampling methods; Speech analysis; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1995., Proceedings., Proceedings of the 38th Midwest Symposium on
Conference_Location
Rio de Janeiro
Print_ISBN
0-7803-2972-4
Type
conf
DOI
10.1109/MWSCAS.1995.504391
Filename
504391
Link To Document