On a faster parallel implementation of the split-step Fourier method

Authors:
J. Sánchez-Curto;P. Chamorro-Posada
Affiliations:
Departamento de Teorıa de la Señal y Comunicaciones e Ingenierıa Telemática, Universidad de Valladolid, ETSI Telecomunicación, Campus Miguel Delibes s/n, Valladolid 47011, ...;Departamento de Teorıa de la Señal y Comunicaciones e Ingenierıa Telemática, Universidad de Valladolid, ETSI Telecomunicación, Campus Miguel Delibes s/n, Valladolid 47011, ...
Venue:
Parallel Computing
Year:
2008

Citing 5
Cited 0

Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Discrete-time signal processing (2nd ed.)

Discrete-time signal processing (2nd ed.)
MPI: The Complete Reference

MPI: The Complete Reference
Sourcebook of parallel computing

Sourcebook of parallel computing
FFT algorithms for vector computers

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new parallel implementation of the split-step Fourier method is presented. The computational core of our scheme focuses on the parallelization of the whole linear step using a combination of fast cyclic convolutions and fast Fourier transforms. For all problems and cluster sizes tested, our method exhibits better performance than conventional parallel implementations of the split-step Fourier method using state-of-the art parallel fast Fourier transforms.