Chris@19: Chris@19: Chris@19: Installation and Customization - FFTW 3.3.4 Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19: Chris@19:
Chris@19: Chris@19:

Chris@19: Next: , Chris@19: Previous: Upgrading from FFTW version 2, Chris@19: Up: Top Chris@19:


Chris@19:
Chris@19: Chris@19:

10 Installation and Customization

Chris@19: Chris@19:

Chris@19: This chapter describes the installation and customization of FFTW, the Chris@19: latest version of which may be downloaded from Chris@19: the FFTW home page. Chris@19: Chris@19:

In principle, FFTW should work on any system with an ANSI C compiler Chris@19: (gcc is fine). However, planner time is drastically reduced if Chris@19: FFTW can exploit a hardware cycle counter; FFTW comes with cycle-counter Chris@19: support for all modern general-purpose CPUs, but you may need to add a Chris@19: couple of lines of code if your compiler is not yet supported Chris@19: (see Cycle Counters). (On Unix, there will be a warning at the end Chris@19: of the configure output if no cycle counter is found.) Chris@19: Chris@19: Chris@19:

Installation of FFTW is simplest if you have a Unix or a GNU system, Chris@19: such as GNU/Linux, and we describe this case in the first section below, Chris@19: including the use of special configuration options to e.g. install Chris@19: different precisions or exploit optimizations for particular Chris@19: architectures (e.g. SIMD). Compilation on non-Unix systems is a more Chris@19: manual process, but we outline the procedure in the second section. It Chris@19: is also likely that pre-compiled binaries will be available for popular Chris@19: systems. Chris@19: Chris@19:

Finally, we describe how you can customize FFTW for particular needs by Chris@19: generating codelets for fast transforms of sizes not supported Chris@19: efficiently by the standard FFTW distribution. Chris@19: Chris@19: Chris@19:

Chris@19: Chris@19: Chris@19: Chris@19: