Fast digit-index permutations

Authors:
Dorothy Bollman;Jaime Seguel;John Feo
Affiliations:
-;-;-
Venue:
Scientific Programming - Special issue: high-performance functional computing
Year:
1996

Citing 0
Cited 4

A Framework for the Design and Implementation of FFT Permutation Algorithms

IEEE Transactions on Parallel and Distributed Systems
A functional approach to radix-r FFTS

Progress in computer research
A functional approach to radix-r FFTS

Progress in computer research
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 introduce a tensor sum which is useful for the design andanalysis of digit-index permutations (DIPs) algorithms. Using thisoperation we obtain a new high-performance algorithm for the familyof DIPs. We discuss an implementation in the applicative languageSisal and show how different choices of parameters yield differentDIPs. The efficiency of the special case of digit reversal isillustrated with performance results on a Cray C-90.