{"title":"Fast computation of Chebyshev optimal nonuniform interpolation","authors":"Zhongde Wang, G. Jullien, W. Miller","doi":"10.1109/MWSCAS.1995.504391","DOIUrl":null,"url":null,"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.","PeriodicalId":165081,"journal":{"name":"38th Midwest Symposium on Circuits and Systems. Proceedings","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Midwest Symposium on Circuits and Systems. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1995.504391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
