FAST FOURIER INTEGRATION OF PIECEWISE POLYNOMIAL FUNCTIONS

被引：4

作者：

ARONSON, EA

机构：

[1] Sandia Laboratories, Albuquerque, N. Mex.

来源：

PROCEEDINGS OF THE IEEE | 1969年 / 57卷 / 04期

关键词：

D O I：

10.1109/PROC.1969.7026

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The fast Fourier transform (FFT) is a high-speed technique for computing the discrete Fourier transform of a function. The FFT is exact only for discrete (sampled) functions. A technique is presented which utilizes the FFT and its associated computational speed, and computes the Fourier transform of “smooth” functions with better accuracy than the FFT alone. In particular, algorithms using the FFT for transformation of piecewise polynomial functions are presented. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：691 / &