QuiFFT is a Fourier transform (FFT) library for digital audio files. QuiFFT abstracts away the technical details of digital audio representation and wave mathematics, providing a delightfully simple interface for computing Fourier transforms in Java.
For those not experienced in signal processing, implementing a program that performs an FFT on audio data can be daunting. In addition to the interpretation of raw FFT output, it requires knowledge about discrete time sampling, signal windowing, smoothing, and overlap. QuiFFT provides the opportunity to analyze signal frequencies without the prerequisite of obtaining intimate knowledge of signal processing concepts.
Your first FFT can be as easy as one line of code:
FFTResult fft = new QuiFFT("audio.mp3").fullFFT();This code computes an FFT for a file called audio.mp3 using QuiFFT's default FFT parameters.
Computing a more customized FFT is easy! Just add a few configuration methods to the QuiFFT object:
FFTResult fft = new QuiFFT("audio.mp3").windowSize(2048)
.windowFunction(WindowFunction.BLACKMAN).windowOverlap(0.75).fullFFT();Exhaustive documentation for QuiFFT can be found below.
For examples of QuiFFT in action, see the quifft-examples repo.
- Getting Started
- Supported File Types
- QuiFFT Output Object Types
- Configuring FFT Parameters
- FFT Algorithm Implementation
- JavaDoc and Code Examples
- Changelog
QuiFFT can be installed from the Maven Central Repository:
<dependency>
<groupId>org.quifft</groupId>
<artifactId>quifft</artifactId>
<version>0.1.1</version>
</dependency>Alternatively, you can clone the project and build it from the command line:
$ git clone https://github.com/mhenrichs/QuiFFT.git
$ cd QuiFFT
$ mvn clean install
QuiFFT's constructor accepts 8- and 16-bit audio files with the following extensions:
- .wav
- .aiff
- .mp3
If a file not matching the above extensions or an audio file with a bit depth of 24 or 32 is provided, the constructor will throw an UnsupportedAudioFileException.
QuiFFT can perform FFTs on both single channel (mono) and dual channel (stereo) audio signals. For stereo audio, left and right samples are averaged together (which effectively converts it to mono) before computing the FFT.
QuiFFT has been designed with simplicity and ease of use in mind, so its output structures are named using basic signal processing vocabulary and include metadata fields to make it extremely clear what type of information each object represents.
QuiFFT offers two methods to compute FFTs, the most straightforward of which is fullFFT(). The Full FFT reads the entire audio file into memory, then computes and stores each FFT frame (output of FFT applied to a single sampling window), finally returning an array of all FFT frames for the entire audio file when it completes. Typically the space complexity of this all-at-once computation won't be an issue, but if you're in a space-contrained environment or want to start using the results of each computed FFT frame right away, you'll want to take a look at fftStream(), which allows the computation of FFT frames one at a time.
When computing a Fourier transform on an audio file, a prerequisite is to split the full-length waveform into multiple sampling windows (typically consisting of 2048, 4096, or 8192 samples each). The FFT algorithm is then applied to each of these sampling windows separately, producing a sequence of FFT frames that spans the duration of the entire audio file.
Therefore, the FFTResult object returned by quiFFT.fullFFT() includes an instance variable fftResult.fftFrames which points to an array of FFTFrame objects. Here's what an FFTFrame looks like:
class FFTFrame {
double frameStartMs;
double frameEndMs;
FrequencyBin[] bins;
}The frameStartMs and frameEndMs variables indicate the range of time from the original audio file represented in the sampling window used as input to this frame's FFT computation. The actual output of the Fourier transform is contained in the bins array.
The Fast Fourier Transform is based on the Discrete Fourier Transform, which separates the frequencies present in a signal into a finite set of discrete bins. For example, a frequency bin from 300 Hz to 320 Hz will indicate the cumulative power of all frequencies in the signal that fall between 300 Hz and 320 Hz.
Each FFTFrame contains an array of these FrequencyBins. Here's what a single FrequencyBin looks like:
class FrequencyBin {
double frequency;
double amplitude;
}The frequency variable indicates the start (lower) value of the bin range in Hertz. The amplitude variable is what we're really interested in -- it represents the power of the frequencies within this bin from the time-domain sampling window. If you wanted to make a frequency spectrum visualizer, for example, the amplitude values of each FrequencyBin would lie along the y-axis of the spectrum graph. By default, amplitude values are in decibels (dB), but this can be changed through simple configuration of the FFT parameters.
The Full FFT is not an output object of QuiFFT, but instead one of two methods for computing FFTs. The Full FFT reads the entire audio file into memory, then computes and stores each FFT frame (output of FFT applied to a single sampling window), finally returning an array of all FFT frames for the entire audio file when it completes. As mentioned in the introduction to this setting, if you fear this all-at-once computation will violate space constraints, it would be preferable to use the FFT Stream method instead.
The output object associated with a full FFT is FFTResult. Here's what it looks like:
class FFTResult {
// metadata inherited from FFTOutputObject
String fileName;
long fileDurationMs;
double frequencyResolution;
double windowDurationMs;
FFTParameters fftParameters;
// output structure unique to FFTResult
FFTFrame[] fftFrames;
}FFT output is accessible through the fftFrames array, which is a field unique to FFTResult.
If you'd like to save some space by only reading bytes from an audio file as needed as opposed to all at once, the FFT Stream will come in handy. It's an alternative way to compute an FFT that, unlike the Full FFT, computes individual FFT frames on an as-requested basis.
The output object associated with an FFT stream is FFTStream. Here's what it looks like:
class FFTStream {
// metadata inherited from FFTOutputObject
String fileName;
long fileDurationMs;
double frequencyResolution;
double windowDurationMs;
FFTParameters fftParameters;
// output methods unique to FFTStream
boolean hasNext();
FFTFrame next();
}The FFTStream class extends Iterator<FFTFrame>, so you can call fftStream.hasNext() to check if there's another frame that can be computed, and fftFrame.next() to perform the sample extraction and FFT computation. The amount of work done by each call to next() is proportional to the window size chosen for the FFT.
Here's some code that obtains an FFTStream and computes FFT frames one at a time:
FFTStream fftStream = new QuiFFT("audio.mp3").fftStream();
while(fftStream.hasNext()) {
FFTFrame nextFrame = fftStream.next();
// do something with the computed frame here
}FFT Streams can also be useful if you want to use FFT frames immediately after they are computed as opposed to waiting for all frames to be computed before taking any action.
A single instance of QuiFFT can produce either an FFTResult or an FFTStream, but not both. You should choose whether a Full FFT or an FFT Stream is preferable for your use case.
One thing to note: It is not allowed to compute values using an FFT Stream if the isNormalized parameter is set to true and the useDecibelScale parameter is set to false. If this is attempted, a BadParametersException will be thrown from fftStream(). This is because normalized output values only work if the maximum amplitude of any frequency bin across all frames is known, which is not the case for FFT Stream, which only knows the results of the current and previously computed frames.
The Fourier transform can be viewed as a single function with a number of parameters that can be configured to produce optimal results based on characteristics of the audio sample and the requirements of the spectral analysis being performed. QuiFFT uses method chaining to make configuration of these parameters straightforward.
Below is a reference for QuiFFT's configuration methods. None of these parameters are required to be explicitly set -- default values are denoted by boldface.
| Method | Description | Values | Constraints |
|---|---|---|---|
.windowSize() |
Size of sampling windows from signal (number of samples per window) | Integers (i.e. 512, 2048, 4096, 8192) |
Must be greater than 0, and if numPoints is not set, must be a power of 2 |
.windowFunction() |
Window smoothing function to be applied to the time domain signal prior to computing FFT | WindowFunction.RECTANGULAR, WindowFunction.TRIANGULAR, WindowFunction.BARTLETT, WindowFunction.HANNING, WindowFunction.HAMMING, WindowFunction.BLACKMAN |
Cannot be null |
.windowOverlap() |
Percentage by which consecutive windows will be overlapped (0.50 = 50% overlap) |
Decimal between 0.00 and 1.00 (0.50 by default) |
Must be greater or equal to 0 and less than 1 |
.numPoints() |
Number of points (N-point FFT); if set, each sampling window will be zero-padded up to the length designated by numPoints. This parameter can be useful if you want to use a window size that isn't a power of 2 -- simply set numPoints to the next power of 2 greater than your desired window size. |
Integers (equivalent to windowSize by default) |
Must be a power of 2 |
.dbScale() |
Boolean indicating whether FFT output should be represented in decibels (dB). On the dB scale, the highest possible amplitude a frequency bin can have is 0 dB (maximum energy) and the lowest is -100 dB (minimum energy) | true, false |
If true, value of normalized doesn't matter because the decibels are, by definition, normalized |
.normalized() |
Boolean indicating whether FFT output will be normalized such that each amplitude is in the range 0.00 - 1.00 where 1.00 represents the highest amplitude of any bin across the entire signal |
true, false |
Only applicable to full FFT (not FFT stream) |
To get the current value of any of the above parameters from the QuiFFT object, simply call the configuration method without providing an argument.
Under the hood, QuiFFT uses Robert Sedgewick and Kevin Wayne's implementation of an in-place radix 2 Cooley-Tukey FFT. It runs in O(n*logn) time.
See QuiFFT's JavaDoc on its website: https://www.quifft.org/javadoc
Below are some code examples that make use of QuiFFT's functionality. All of these examples come from the quifft-examples repository.
- FFT with rectangular windows of length 1024 samples and 75% window overlap
- FFT whose amplitude values are scaled linearly (as opposed to logarithmic dB) between 0 and 1
- FFT over sampling window that isn't a power of 2 (zero-padding)
quifft-examples/customizedparams
This spectrum visualizer renders an animated graph of the frequency content of full-length MP3 files using QuiFFT's FFTStream and JFreeChart.
quifft-examples/spectrumvisualization
- v0.1.1: remove unnecessary Guava dependency -- read all bytes of an audio file using native classes [04/06/2019]
- v0.1.0: initial release [04/05/2019]
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent