Module fft 

Fast Fourier Transform (FFT) Implementation

The FFT is one of the most important numerical algorithms, used in signal processing, image compression, audio processing, and many other applications.

This implementation uses the Cooley-Tukey algorithm and supports parallel processing for improved performance on large datasets.

Examples

use advanced_algorithms::numerical::fft;

// Transform a simple signal
let signal = vec![1.0, 2.0, 3.0, 4.0, 3.0, 2.0, 1.0, 0.0];
let spectrum = fft::fft(&signal);

// Transform back to time domain
let reconstructed = fft::ifft(&spectrum);

Functions

fft

Performs a Fast Fourier Transform on the input signal

fft_complex

Performs FFT on complex-valued input

fft_parallel

Performs FFT with parallel processing for large inputs

ifft

Inverse Fast Fourier Transform

magnitude_spectrum

Compute the magnitude spectrum from FFT output

power_spectrum

Compute the power spectrum (magnitude squared) from FFT output