咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >FAST INTERPOLATION ALGORITHM U... 收藏

FAST INTERPOLATION ALGORITHM USING FFT

快插值算法使用快速傅里叶变换

作     者:PRASAD, KP SATYANARAYANA, P 

作者机构:Department of Electrical & Electronics Engineering SVU College of Engineering Tirupati India 

出 版 物:《ELECTRONICS LETTERS》 (电子学快报)

年 卷 期:1986年第22卷第4期

页      面:185-187页

核心收录:

学科分类:0808[工学-电气工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 

主  题:interpolation fast Fourier transforms finite-duration real sequences Other numerical methods FFT filtering Signal processing and detection discrete Fourier transform Interpolation and function approximation (numerical analysis) signal processing Information theory interpolation algorithm field effect transistors filtering and prediction theory 

摘      要:An interpolation algorithm for finite-duration real sequences using the discrete Fourier transform is presented. The proposed method is shown to result in a significant saving of computational labour over the discrete version of the time-domain classical interpolation formula. Estimation of inbetween samples for large sequences is possible within a mean square error of 0.00114 with this method. Some considerations with regard to the computation of FFTs are also discussed.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分