Superparallel FFTs

Fast Fourier transform (FFT) algorithms for single instruction multiple data (SIMD) machines are developed which simultaneously solve any combination of FFTs of different sizes and even different spatial dimensionalities. The only restrictions are that all the periods must be powers of two and that...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on scientific computing Vol. 14; no. 2; pp. 349 - 367
Main Author:	Munthe-Kaas, Hans
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.03.1993
Subjects:	Algorithms Codes Exact sciences and technology Fourier analysis Fourier transforms Mathematical problems Mathematics Numerical analysis Numerical analysis. Scientific computation Sciences and techniques of general use SIMD computer Parallel computation Fast Fourier transformation Unscrambling Factorization Implementation
ISSN:	1064-8275, 1095-7197
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!