qcnn
Class FFT

java.lang.Object
  qcnn.FFT

public class FFT
extends java.lang.Object

Compilation: javac FFT.java Execution: java FFT N Dependencies: Complex.java Compute the FFT and inverse FFT of a length N complex sequence. Bare bones implementation that runs in O(N log N) time. Limitations ----------- * assumes N is a power of 2 * not the most memory efficient algorithm

Constructor Summary

FFT()

Method Summary

static Complex[]	convolve(Complex[] x, Complex[] y)
static Complex[]	fft(Complex[] x)
static Complex[]	fft(double[] data)
static Complex[]	ifft(Complex[] x)
static void	main(java.lang.String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FFT

public FFT()

Method Detail

fft

public static Complex[] fft(Complex[] x)

fft

public static Complex[] fft(double[] data)

ifft

public static Complex[] ifft(Complex[] x)

convolve

public static Complex[] convolve(Complex[] x,
                                 Complex[] y)

main

public static void main(java.lang.String[] args)