Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

FFT of Externally Stored Data

Naidu, PS

Publication date

October 1978

Publisher

IEEE

Abstract

A one-dimensional array is split into a pseudo two-dimensional array and stored into an external device, like a disk. The FFT of the stored array is computed using Eklundh's fast transposition algorithm

Extracted data

Related items

A Data-Flow Methodology for Accelerating FFT

Verdoscia, L
Sahebi, A
Giorgi, R

January 2019

The native implementation of the N-point digital Fourier Transform involves calculating the scalar p...

FFT algorithms and their adaptation to parallel processing

Chu, Eleanor
George, Alan

November 1998

AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...

Efficient Coefficient Store in Decomposed DFT/FFT Architectures for On-Board Processors

Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.
Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.

January 2013

Fast Fourier Transform (FFT) and Discrete Fourier Transform (DFT) are the two very important buildin...

An algorithm for the two dimensional FFT

Hoyer, Elmer. A.
Berry, W.

May 1977

Click on the DOI link to access the article (may not be free)Conventional two dimensional fast Fouri...

FFT for the APE Parallel Computer

Lippert, Thomas
Schilling, Klaus
Trentmann, Sven
Toschi, Federico
Tripiccione, Raffaele

January 1997

We present a parallel FFT algorithm for SIMD systems following the "Transpose Algorithm" approach. T...

Fast matrix transposition computer implementation

Naidu, PS

January 1982

Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc h...

FFT for the APE parallel computer

LIPPERT T
SCHILLING K
TRENTMANN S
TOSCHI F
TRIPICCIONE R.

January 1997

We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. T...

Determining an Out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming

Thomas Cormen

January 1999

We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. O...

A Formal Derivation of Array Implementations of FFT Algorithms

Johnsson, Lennart
Cohen, Danny

November 1982

Fast Fourier Transform, FFT, algorithms are interesting for direct hardware implementation in VLSI. ...

Split Vector-Radix-2/8 2-D Fast Fourier Transform

Pei, Soo-Chang

November 2006

This letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The...

PFFT - An Extension of FFTW to Massively Parallel Architectures

Pippig, Michael

January 2012

We present a MPI based software library for computing the fast Fourier transforms on massively paral...

Optimizing the Fast Fourier Transform over memory hierarchies for embedded digital systems: a fully in-cache algorithm

Lenore R. Mullin
James
E. Raynolds

December 2014

Abstract. We present a new algorithm for the Fast Fourier Transform which is a factor of 2 to 4 time...

Real and Complex Fast Fourier Transforms on the Fujitsu VPP 500

Markus Hegland
M. Hegland

January 1994

. Fast Fourier transforms parallelize well but need large amounts of communication. An algorithm whi...

Fast Fourier Transformation Realization with Distributed Arithmetic

Renu Bala
Shamim Aktar

November 2015

Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It...

CORRESPONDENCE&mdash; A HIGH-PERFORMANCE FFT ALGORITHM FOR VECTOR SUPERCOMPUTERS

David H. Bailey

October 2016

Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers...

A Data-Flow Methodology for Accelerating FFT

Verdoscia, L
Sahebi, A
Giorgi, R

January 2019

The native implementation of the N-point digital Fourier Transform involves calculating the scalar p...

FFT algorithms and their adaptation to parallel processing

Chu, Eleanor
George, Alan

November 1998

AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...

Efficient Coefficient Store in Decomposed DFT/FFT Architectures for On-Board Processors

Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.
Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.

January 2013

Fast Fourier Transform (FFT) and Discrete Fourier Transform (DFT) are the two very important buildin...

An algorithm for the two dimensional FFT

Hoyer, Elmer. A.
Berry, W.

May 1977

Click on the DOI link to access the article (may not be free)Conventional two dimensional fast Fouri...

FFT for the APE Parallel Computer

Lippert, Thomas
Schilling, Klaus
Trentmann, Sven
Toschi, Federico
Tripiccione, Raffaele

January 1997

We present a parallel FFT algorithm for SIMD systems following the "Transpose Algorithm" approach. T...

Fast matrix transposition computer implementation

Naidu, PS

January 1982

Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc h...

FFT for the APE parallel computer

LIPPERT T
SCHILLING K
TRENTMANN S
TOSCHI F
TRIPICCIONE R.

January 1997

We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. T...

Determining an Out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming

Thomas Cormen

January 1999

We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. O...

A Formal Derivation of Array Implementations of FFT Algorithms

Johnsson, Lennart
Cohen, Danny

November 1982

Fast Fourier Transform, FFT, algorithms are interesting for direct hardware implementation in VLSI. ...

Split Vector-Radix-2/8 2-D Fast Fourier Transform

Pei, Soo-Chang

November 2006

This letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The...

PFFT - An Extension of FFTW to Massively Parallel Architectures

Pippig, Michael

January 2012

We present a MPI based software library for computing the fast Fourier transforms on massively paral...

Optimizing the Fast Fourier Transform over memory hierarchies for embedded digital systems: a fully in-cache algorithm

Lenore R. Mullin
James
E. Raynolds

December 2014

Abstract. We present a new algorithm for the Fast Fourier Transform which is a factor of 2 to 4 time...

Real and Complex Fast Fourier Transforms on the Fujitsu VPP 500

Markus Hegland
M. Hegland

January 1994

. Fast Fourier transforms parallelize well but need large amounts of communication. An algorithm whi...

Fast Fourier Transformation Realization with Distributed Arithmetic

Renu Bala
Shamim Aktar

November 2015

Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It...

CORRESPONDENCE&mdash; A HIGH-PERFORMANCE FFT ALGORITHM FOR VECTOR SUPERCOMPUTERS

David H. Bailey

October 2016

Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers...

A Data-Flow Methodology for Accelerating FFT

Verdoscia, L
Sahebi, A
Giorgi, R

January 2019

The native implementation of the N-point digital Fourier Transform involves calculating the scalar p...

FFT algorithms and their adaptation to parallel processing

Chu, Eleanor
George, Alan

November 1998

AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...

Efficient Coefficient Store in Decomposed DFT/FFT Architectures for On-Board Processors

Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.
Coskun, A.
Kale, I.
Morling, R.C.S.
Cetinsel, S.
Hughes, R.
Brown, S.
Angeletti, P.

January 2013

Fast Fourier Transform (FFT) and Discrete Fourier Transform (DFT) are the two very important buildin...