org.mobicents.media.server.impl.resource.fft
Class FFT

java.lang.Object
  org.mobicents.media.server.impl.resource.fft.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. Our goal is to optimize the clarity of the code, rather than performance. Limitations ----------- - assumes N is a power of 2 - not the most memory efficient algorithm (because it uses an object type for representing complex numbers and because it re-allocates memory for the subarray, instead of doing in-place or reusing a single temporary array)

Constructor Summary

FFT()

Method Summary

Complex[]	fft(Complex[] x)
static void	show(Complex[] x, java.lang.String title)

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 Complex[] fft(Complex[] x)

show

public static void show(Complex[] x,
                        java.lang.String title)