Class SignalFFT
java.lang.Object
org.episteme.core.mathematics.analysis.transform.SignalFFT
Signal Processing FFT (Fast Fourier Transform).
Optimized for signal processing, operating on primitive arrays or Real arrays. Uses AlgorithmManager for hardware acceleration.
- Since:
- 1.0
- Author:
- Silvere Martin-Michiellot, Gemini AI (Google DeepMind)
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionstatic Real[]Compute convolution using FFT.static Real[]Compute correlation using FFT.static voidfft(double[] real, double[] imag) Primitive versionsstatic voidCompute forward FFT of complex data.static voidfft2D(double[][] real, double[][] imag) 2D Transformsstatic Real[][]FFT of real-valued data.static voidifft(double[] real, double[] imag) static voidCompute inverse FFT.static Real[]Compute magnitude spectrum.static Real[]Compute phase spectrum.static Real[]powerSpectrum(Real[] data) Power spectral density.
-
Constructor Details
-
SignalFFT
public SignalFFT()
-
-
Method Details
-
fft
-
ifft
-
fft
public static void fft(double[] real, double[] imag) Primitive versions -
ifft
public static void ifft(double[] real, double[] imag) -
fft2D
public static void fft2D(double[][] real, double[][] imag) 2D Transforms -
fftReal
-
magnitude
-
phase
-
powerSpectrum
-
convolve
-
correlate
-