FFT recursive algorithm

// FFT recursive algorithm class fft {public static void calcfft (double [] rein, double [] iMin, double [] reord, double [] imout, int n) {double [] rehe = new double [n];

Double [] reho = new double [n];

Double [] rehe = new double [n];

Double [] reho = new double [n];

Double [] imhe = new double [n];

Double [] imho = new double [n];

Double [] imhe = new double [n];

Double [] imho = new double [n];

Double [] wsin = new double [n];

Double [] wcos = new double [n];

IF (n == 1)

{Reord [0] = rein [0]; imout [0] = iMin [0];

} Else {for (INT i = 0; i

Reho [i] = rein [2 * i 1];

IMHE [I] = iMin [2 * i]; IMHO [i] = iMin [2 * i 1];

Calcfft (Rehe, Imhe, Rehe, IMHE, N / 2); Calcfft (Reho, IMHO, REHO, IMHO, N / 2); for (int K = 0; k

}

}