Efficient Dealiased Convolutions without Padding

Details Efficient Dealiased Convolutions without Padding Efficient Dealiased Convolutions without Padding

2010-08-07

arxiv.org/abs/1008.1366v2

Computer Science

Computational Engineering, Finance, and Science

18 pages, 9 figures

Scientific paper

Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. This decoupling of data and work arrays dramatically reduces the memory and computation time required to evaluate higher-dimensional in-place convolutions. The technique also allows one to dealias the higher-order convolutions that arise from Fourier transforming cubic and higher powers. Implicitly dealiased convolutions can be built on top of state-of-the-art fast Fourier transform libraries: vectorized multidimensional implementations for the complex and centered Hermitian (pseudospectral) cases have been implemented in the open-source software FFTW++.

Affiliated with

Also associated with

No associations

Rating

Efficient Dealiased Convolutions without Padding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Dealiased Convolutions without Padding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Dealiased Convolutions without Padding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313068