FFT

DESCRIPTION

The FFT library is used for the execution of discrete Fourier transforms in 1-D, 2-D and 3-D through the implementation of Fast Fourier Transform (FFT) algorithms.

FEATURES

• The FFT library has been written in Java for portability across different platforms, integrated into a single jar file for easy implementation.
• The FFT library provides forward and backward fast Fourier transforms in 1-D, 2-D and 3-D with an easy-to-use manner.
• The FFT requires the length equal to a number with an integer power of two. This library automatically examines the input data and detects the length to prevent improper execution.

USAGE

SYSTEM REQUIREMENTS
OS: any, Memory: Depends on the size of FFT length and dimensions, Processor: N/a

INSTALLATION
No installation is required.

PURPOSE
The FFT library can be used as a fundamental image analysis tool that requires the knowledge of Fourier transforms in both spatial and frequency domains.

ACKNOWLEDGEMENT(S)

This work was supported by:
NIH-NCRR 9P41EB015922-15 and 2-P41-RR-013642-15
NIH-NCRR U54 RR021813