Difference between revisions of "FFTW"
Jump to navigation
Jump to search
Moskalenko (talk | contribs) |
|||
| Line 4: | Line 4: | ||
|{{#vardefine:url|http://http://www.fftw.org}} | |{{#vardefine:url|http://http://www.fftw.org}} | ||
<!--CONFIGURATION: OPTIONAL (1=ON)--> | <!--CONFIGURATION: OPTIONAL (1=ON)--> | ||
| − | + | |{{#vardefine:exe|}} <!--RUNNING --> | |
| − | |||
| − | |||
| − | |{{#vardefine:exe| | ||
|{{#vardefine:conf|1}} <!--CONFIGS--> | |{{#vardefine:conf|1}} <!--CONFIGS--> | ||
| − | |{{#vardefine:pbs| | + | |{{#vardefine:pbs|}} <!--PBS SCRIPTS--> |
| − | |{{#vardefine:policy| | + | |{{#vardefine:policy|}} <!--POLICY--> |
| − | |{{#vardefine:testing| | + | |{{#vardefine:testing|}} <!--TESTING/PROFILING--> |
|{{#vardefine:faq|1}} <!--FAQ--> | |{{#vardefine:faq|1}} <!--FAQ--> | ||
| − | |{{#vardefine:citation| | + | |{{#vardefine:citation|}} <!--CITATION--> |
| − | |{{#vardefine:installation| | + | |{{#vardefine:installation|}} <!--INSTALLATION--> |
|} | |} | ||
<!--BODY--> | <!--BODY--> | ||
| Line 31: | Line 28: | ||
./configure --prefix=/apps/fftw/3.3.2 --enable-shared --enable-sse2 | ./configure --prefix=/apps/fftw/3.3.2 --enable-shared --enable-sse2 | ||
|}} | |}} | ||
| − | <!-- | + | <!--Additional--> |
| + | {{#if: {{#var: exe}}|==Additional Information== | ||
| + | DOUBLE_CLICK_TO_WRITE_INSTRUCTIONS_ON_RUNNING_THE_ACTUAL_BINARY | ||
| + | |}} | ||
<!--Citation--> | <!--Citation--> | ||
| + | {{#if: {{#var: citation}}|==Citation== | ||
| + | If you publish research that uses {{#var:app}} you have to cite it as follows: | ||
| + | DOUBLE_CLICK_TO_WRITE_CITATION_HERE | ||
| + | |}} | ||
<!--Turn the Table of Contents and Edit paragraph links ON/OFF--> | <!--Turn the Table of Contents and Edit paragraph links ON/OFF--> | ||
__NOTOC____NOEDITSECTION__ | __NOTOC____NOEDITSECTION__ | ||
Revision as of 21:25, 10 August 2012
Description
FFTW website
Fastest Fourier Transform in the West, is a C library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data. Developed at MIT, it is by far the fastest implementation of FFT algorithm (upheld by regular benchmarks.)
Required Modules
- intel
- fftw
Configuration
./configure --prefix=/apps/fftw/3.3.2 --enable-shared --enable-sse2