A Framework for the Design and Implementation of FFT Permutation Algorithms

Authors:
Jaime Seguel;Dorothy Bollman;John Feo
Affiliations:
Univ. of Puerto Rico, Mayaguez;Univ. of Puerto Rico, Mayaguez;Univ. of California, San Diego
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2000

Citing 9
Cited 1

Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
Retire Fortran?: a debate rekindled

Communications of the ACM
Fast digit-reversal algorithms on a shared-memory machine

Parallel Computing
Fast digit-index permutations

Scientific Programming - Special issue: high-performance functional computing
Bit reversal on uniprocessors

SIAM Review
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Array Permutation by Index-Digit Permutation

Journal of the ACM (JACM)
Parallel Tridiagonal Equation Solvers

ACM Transactions on Mathematical Software (TOMS)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Performance of parallel bit-reversal with cilk and UPC for fast fourier transform

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algebraic framework for the design and implementation of a large class of data-sorting procedures, including all index-digit permutations used in FFTs. We discuss both old and new algorithms in terms of this framework. We show that the algebraic formulation of the new algorithms can be easily encoded using a functional programming language, and that the resulting code introduces no inefficiencies. We present performance results for implementations of three new algorithms for mixed-radix digit-reversal on a Cray C-90 and on a Sun Sparc 5.