DocumentCode
903789
Title
Fast fourier integration of piecewise polynomial functions
Author
Aronson, E.A.
Volume
57
Issue
4
fYear
1969
fDate
4/1/1969 12:00:00 AM
Firstpage
691
Lastpage
692
Abstract
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.
Keywords
Cadmium compounds; Discrete Fourier transforms; Fast Fourier transforms; Photovoltaic cells; Piecewise linear techniques; Polynomials; Sun; Temperature; Testing; Transistors;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1969.7026
Filename
1448956
Link To Document