Document Type

Report

Date

12-1991

Embargo Period

5-4-2012

Keywords

F.2.1 [Numerical Algorithms and Problems]: Computation of transforms, algorithms, theory, Fast Fourier transform, Pascal algorithms

Language

English

Disciplines

Computer Sciences

Description/Abstract

This tutorial discusses the fast Fourier transform, which has numerous applications in signal and image processing. The FFT computes the frequency components of a signal that has been sampled at n points in O( n log n) time. We explain the FFT and illustrate it by examples and Pascal algorithms. We assume that you are familiar with elementary calculus.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-91-46

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.