Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

1991

Fast Fourier transform

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Parallel Divide And Conquer, Per Brinch Hansen Dec 1991

Parallel Divide And Conquer, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements. The performance of these algorithms is analyzed and measured on a Computing Surface configured as a tree machine with distributed memory.


The Fast Fourier Transform, Per Brinch Hansen Dec 1991

The Fast Fourier Transform, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

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.