FFT computation in Java incredibly easy.

QuiFFT abstracts away the technical details of digital audio representation and wave mathematics, providing a delightfully simple interface for computing Fourier transforms in Java.

Your first FFT can be as simple as one line: FFTResult fft = new QuiFFT("audio.mp3").fullFFT();

When you give QuiFFT an audio file it will split its signal into discrete sampling windows according to configurable parameters, then compute a Fourier transform for each of these windows, returning the result.

Ready to get started? Add QuiFFT to your Maven project:
<dependency>

<groupId>org.quifft</groupId>

<artifactId>quifft</artifactId>

<version>0.1.1</version>

</dependency>

QuiFFT’s source code and documentation is available on Github. To get a better sense for how QuiFFT works, you can also check out the JavaDoc.