Array Permutation by Index-Digit Permutation-Reference-Cited by-同舟云学术

Array Permutation by Index-Digit Permutation

Published:1976-04 Issue:2 Volume:23 Page:298-309
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Fraser Donald¹

Affiliation:

1. Commonwealth Scientific and Industrial Research Organization, Division of Computing Research, P.O. Box 1800, Canberra City, A.C.T. 2601, Australia and University of Sydney, Sydney, Australia

Abstract

An array may be reordered according to a common permutation of the digits of each of its element indices. The digit-reversed reordering which results from common fast Fourier transform (FFT) algorithms is an example. By examination of this class of permutation in detail, very efficient algorithms for transforming very long arrays are developed.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321941.321949

Reference5 articles.

1. COOl RAN W.T. ET XL. What is the fast Fourier transform? IEEE T~ans. or~ Audio and Electro. acoustics A U-15 2 (1967) 45-55. COOl RAN W.T. ET XL. What is the fast Fourier transform? IEEE T~ans. or~ Audio and Electro. acoustics A U-15 2 (1967) 45-55.

2. An algorithm for the machine calculation of the complex Fourier series;COOLEY J.W.;Math. Comput.,1965

3. Incrementing a bit-reversed integer;IEEE Trans. on Computers C-18,1969

4. SINGLETON R.C. A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage. 1EEE Trans. on Audio and Electroacoustics A U-15 2 (1967) 91-98. SINGLETON R.C. A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage. 1EEE Trans. on Audio and Electroacoustics A U-15 2 (1967) 91-98.

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Compute-Efficient Tridiagonal Solver for Many-Core Architectures;IEEE Transactions on Parallel and Distributed Systems;2023-01-01

2. Optimum Circuits for Bit-Dimension Permutations;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2019-05

3. Multiplexer and Memory-Efficient Circuits for Parallel Bit Reversal;IEEE Transactions on Circuits and Systems II: Express Briefs;2019-04

4. Hardware architectures for the fast Fourier transform;Handbook of Signal Processing Systems;2018-10-14

5. Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers;IEEE Transactions on Computers;2018-01-01