Efficient 2D FFT implementation on mediaprocessors

DOI10.1016/S0167-8191(03)00040-1MaRDI QIDQ436199zbMATH OpenFDO

Authors Coskun Mermer, Donglok Kim, Yongmin Kim

Publication date 30 July 2012

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

performanceFFTMAPfast Fourier transformdata flowDMAmanarraymediaprocessortrimedia

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• On computing the 2-D FFT
• Effective implementations of multi-dimensional radix-2 FFT
• Two-dimensional FFT algorithms on hypercube and mesh machines
• Two and three dimensional FFTs on highly parallel computers
• FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2

Cited in

(4)

• A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods
• A low-memory-access length-adaptive architecture for \(2^n\)-point FFT
• An efficient technique for recovering responses of parameterized structural dynamic problems
• Effective implementations of multi-dimensional radix-2 FFT

This page was built for publication: Efficient 2D FFT implementation on mediaprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436199)