FFTW 3.2 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News FFTW 3.2 (Default branch)
# 1  
Old 11-16-2008
FFTW 3.2 (Default branch)

FFTW is a fast C FFT library. It includes complex, real, symmetric, multidimensional, and parallel transforms, and can handle arbitrary array sizes efficiently.It is typically faster than other freely available FFT implementations, and is even competitive with vendor-tuned libraries (benchmarks are available at the homepage). To achieve this performance, it uses novel code generation and runtime self optimization techniques (along with many other tricks).License: GNU General Public License (GPL)Changes:
Real-to-complex transforms, non-power-of-twotransforms, and multi-threaded transforms weremade faster. Cell processor support was added.MIPS paired-single SIMD support was added.Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

2 More Discussions You Might Find Interesting

1. High Performance Computing

FFTW - ./configure --enable-mpi error.

Hello I am trying to install fftw3.3.3 on an HPC system. The system has openmpi installed ( though we can choose between a variety of mpi distributions). However, while ./configure step of fftw, there is an error. The relevant section of the output is: checking whether to build shared... (3 Replies)
Discussion started by: abhi34101
3 Replies

2. OS X (Apple)

fftw libraries

hi everyone, I need fftw3 libraries (FFTW Installation on the MacOS) but I can't succeed in installing them on my Mac OSX. I tried with "./configure make make install" procedure, fink and macports but my programs always ask me "fftw.h" files? can you help me? thank you!! ... (12 Replies)
Discussion started by: federico_tn84
12 Replies
Login or Register to Ask a Question
FFT(3)							User Contributed Perl Documentation						    FFT(3)

NAME
PDL::FFT - FFTs for PDL DESCRIPTION
FFTs for PDL. These work for arrays of any dimension, although ones with small prime factors are likely to be the quickest. Each routine works `inplace'. SYNOPSIS
use PDL::FFT qw/:Func/; fft($real,$imag); ifft($real,$imag); realfft($real); realifft($real); fftnd($real,$imag); ifftnd($real,$imag); $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); ALTERNATIVE FFT PACKAGES
Various other modules - such as PDL::FFTW and PDL::Slatec - contain FFT routines. However, unlike PDL::FFT, these modules are optional, and so may not be installed. FUNCTIONS
fft Signature: ([o,nc]real(n); [o,nc]imag(n)) Complex FFT of the "real" and "imag" arrays [inplace] ifft Signature: ([o,nc]real(n); [o,nc]imag(n)) Complex Inverse FFT of the "real" and "imag" arrays [inplace] realfft() One-dimensional FFT of real function [inplace]. The real part of the transform ends up in the first half of the array and the imaginary part of the transform ends up in the second half of the array. realfft($real); realifft() Inverse of one-dimensional realfft routine [inplace]. realifft($real); fftnd() N-dimensional FFT (inplace) fftnd($real,$imag); ifftnd() N-dimensional inverse FFT ifftnd($real,$imag); fftconvolve() N-dimensional convolution $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); fftconvolve works inplace, and returns an error array in kernel as an accuracy check -- all the values in it should be negligible. The sizes of the image and the kernel must be the same. kernctr centres a small kernel to emulate the behaviour of the direct convolution routines. The speed cross-over between using straight convolution (PDL::Image2D::conv2d()) and these fft routines is for kernel sizes roughly 7x7. kernctr() `centre' a kernel (auxiliary routine to fftconvolve) $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); kernctr centres a small kernel to emulate the behaviour of the direct convolution routines. convmath Signature: ([o,nc]a(m); [o,nc]b(m)) Internal routine doing maths for convolution cmul Signature: (ar(); ai(); br(); bi(); [o]cr(); [o]ci()) Complex multiplication cdiv Signature: (ar(); ai(); br(); bi(); [o]cr(); [o]ci()) Complex division BUGS
Where the source is marked `FIX', could re-implement using phase-shift factors on the transforms and some real-space bookkeeping, to save some temporary space and redundant transforms. AUTHOR
This file copyright (C) 1997, 1998 R.J.R. Williams (rjrw@ast.leeds.ac.uk), Karl Glazebrook (kgb@aaoepp.aao.gov.au), Tuomas J. Lukka, (lukka@husc.harvard.edu). All rights reserved. There is no warranty. You are allowed to redistribute this software / documentation under certain conditions. For details, see the file COPYING in the PDL distribution. If this file is separated from the PDL distribution, the copyright notice should be included in the file. perl v5.8.0 2003-01-29 FFT(3)