Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

https://github.com/clMathLibraries/clFFT

a software library containing FFT functions written in OpenCL
https://github.com/clMathLibraries/clFFT

Last synced: 28 days ago
JSON representation

a software library containing FFT functions written in OpenCL

Lists

README 

        
## Build Status

| Build branch | master | develop |

|-----|-----|-----|

| GCC/Clang x64 | [![Build Status](https://travis-ci.org/clMathLibraries/clFFT.svg?branch=master)](https://travis-ci.org/clMathLibraries/clFFT/branches) | [![Build Status](https://travis-ci.org/clMathLibraries/clFFT.svg?branch=develop)](https://travis-ci.org/clMathLibraries/clFFT/branches) |

| Visual Studio x64 |  |[![Build status](https://ci.appveyor.com/api/projects/status/facii32v72y98opv/branch/develop?svg=true)](https://ci.appveyor.com/project/kknox/clfft-whc3m/branch/develop) |



clFFT

=====

clFFT is a software library containing FFT functions written

in OpenCL. In addition to GPU devices, the library also supports

running on CPU devices to facilitate debugging and heterogeneous

programming.



Pre-built binaries are available [here][binary_release].



## What's New



-   Support for powers of 11&13 size transforms

-   Support for 1D large size transforms with no extra memory allocation

    requirement with environment flag CLFFT_REQUEST_LIB_NOMEMALLOC=1

    for complex FFTs of powers of 2,3,5,10 sizes



## Note



-   clFFT requires platform/runtime that supports OpenCL 1.2



## Introduction to clFFT



The FFT is an implementation of the Discrete Fourier Transform (DFT)

that makes use of symmetries in the FFT definition to reduce the

mathematical intensity required from O(N^2) to O(N log2(N)) when the

sequence length N is the product of small prime factors. Currently,

there is no standard API for FFT routines. Hardware vendors usually

provide a set of high-performance FFTs optimized for their systems: no

two vendors employ the same interfaces for their FFT routines. clFFT

provides a set of FFT routines that are optimized for AMD graphics

processors, but also are functional across CPU and other compute

devices.



The clFFT library is an open source OpenCL library implementation of

discrete Fast Fourier Transforms. The library:



-   provides a fast and accurate platform for calculating discrete FFTs.



-   works on CPU or GPU backends.



-   supports in-place or out-of-place transforms.



-   supports 1D, 2D, and 3D transforms with a batch size that can be

    greater than 1.



-   supports planar (real and complex components in separate arrays) and

    interleaved (real and complex components as a pair contiguous in

    memory) formats.



-   supports dimension lengths that can be any combination of powers of

    2, 3, 5, 7, 11 and 13.



-   Supports single and double precision floating point formats.



## clFFT library user documentation



[Library and API documentation][] for developers is available online as

a GitHub Pages website



### Google Groups



Two mailing lists exist for the clMath projects:



-   [[email protected]][] - group whose focus is to answer

    questions on using the library or reporting issues



-   [[email protected]][] - group whose focus is for

    developers interested in contributing to the library code



### API semantic versioning

Good software is typically the result of the loop of feedback and iteration; software 

interfaces no less so. clFFT follows the [semantic versioning] guidelines. The version

number used is of the form MAJOR.MINOR.PATCH.



## clFFT Wiki



The [project wiki][[email protected]] contains helpful

documentation, including a [build

primer][[email protected]]



## Contributing code



Please refer to and read the [Contributing][] document for guidelines on

how to contribute code to this open source project. The code in the

/master branch is considered to be stable, and all pull-requests must

be made against the /develop branch.



## License



The source for clFFT is licensed under the [Apache License, Version

2.0][]



## Example



The following simple example shows how to use clFFT to compute a simple 1D

forward transform

```c

#include 



/* No need to explicitely include the OpenCL headers */

#include 



int main( void )

{

    cl_int err;

    cl_platform_id platform = 0;

    cl_device_id device = 0;

    cl_context_properties props[3] = { CL_CONTEXT_PLATFORM, 0, 0 };

    cl_context ctx = 0;

    cl_command_queue queue = 0;

    cl_mem bufX;

	float *X;

    cl_event event = NULL;

    int ret = 0;

	size_t N = 16;



	/* FFT library realted declarations */

	clfftPlanHandle planHandle;

	clfftDim dim = CLFFT_1D;

	size_t clLengths[1] = {N};



    /* Setup OpenCL environment. */

    err = clGetPlatformIDs( 1, &platform, NULL );

    err = clGetDeviceIDs( platform, CL_DEVICE_TYPE_GPU, 1, &device, NULL );



    props[1] = (cl_context_properties)platform;

    ctx = clCreateContext( props, 1, &device, NULL, NULL, &err );

    queue = clCreateCommandQueue( ctx, device, 0, &err );



    /* Setup clFFT. */

	clfftSetupData fftSetup;

	err = clfftInitSetupData(&fftSetup);

	err = clfftSetup(&fftSetup);



	/* Allocate host & initialize data. */

	/* Only allocation shown for simplicity. */

	X = (float *)malloc(N * 2 * sizeof(*X));



    /* Prepare OpenCL memory objects and place data inside them. */

    bufX = clCreateBuffer( ctx, CL_MEM_READ_WRITE, N * 2 * sizeof(*X), NULL, &err );



    err = clEnqueueWriteBuffer( queue, bufX, CL_TRUE, 0,

	N * 2 * sizeof( *X ), X, 0, NULL, NULL );



	/* Create a default plan for a complex FFT. */

	err = clfftCreateDefaultPlan(&planHandle, ctx, dim, clLengths);



	/* Set plan parameters. */

	err = clfftSetPlanPrecision(planHandle, CLFFT_SINGLE);

	err = clfftSetLayout(planHandle, CLFFT_COMPLEX_INTERLEAVED, CLFFT_COMPLEX_INTERLEAVED);

	err = clfftSetResultLocation(planHandle, CLFFT_INPLACE);



    /* Bake the plan. */

	err = clfftBakePlan(planHandle, 1, &queue, NULL, NULL);



	/* Execute the plan. */

	err = clfftEnqueueTransform(planHandle, CLFFT_FORWARD, 1, &queue, 0, NULL, NULL, &bufX, NULL, NULL);



	/* Wait for calculations to be finished. */

	err = clFinish(queue);



	/* Fetch results of calculations. */

	err = clEnqueueReadBuffer( queue, bufX, CL_TRUE, 0, N * 2 * sizeof( *X ), X, 0, NULL, NULL );



    /* Release OpenCL memory objects. */

    clReleaseMemObject( bufX );



	free(X);



	/* Release the plan. */

	err = clfftDestroyPlan( &planHandle );



    /* Release clFFT library. */

    clfftTeardown( );



    /* Release OpenCL working objects. */

    clReleaseCommandQueue( queue );

    clReleaseContext( ctx );



    return ret;

}

```



## Build dependencies



### Library for Windows   

To develop the clFFT library code on a Windows operating system, ensure to install the following packages on your system:



-   Windows® 7/8.1



-   Visual Studio 2012 or later



-   Latest CMake



-   An OpenCL SDK, such as APP SDK 3.0



### Library for Linux

To develop the clFFT library code on a Linux operating system, ensure to install the following packages on your system:

-   GCC 4.6 and onwards



-   Latest CMake



-   An OpenCL SDK, such as APP SDK 3.0



### Library for Mac OSX

To develop the clFFT library code on a Mac OS X, it is recommended to generate Unix makefiles with cmake.



### Test infrastructure

To test the developed clFFT library code, ensure to install the following packages on your system:



-   Googletest v1.6



-   Latest FFTW



-   Latest Boost



### Performance infrastructure

To measure the performance of the clFFT library code, ensure that the Python package is installed on your system.



  [Library and API documentation]: http://clmathlibraries.github.io/clFFT/

  [[email protected]]: https://github.com/clMathLibraries/clFFT/wiki

  [[email protected]]: https://github.com/clMathLibraries/clFFT/wiki/Build

  [Contributing]: CONTRIBUTING.md

  [Apache License, Version 2.0]: http://www.apache.org/licenses/LICENSE-2.0

  [binary_release]: https://github.com/clMathLibraries/clFFT/releases

  [semantic versioning]: http://semver.org/