java 용 rfft 코드

static double M_SQRT2 = 1.41421356237309504880; //C : void rfft (double *x, int n, int m) public static double[] rfft (double x[], int n, int m) { int j, i, k, is, id; int i0, i1, i2, i3, i4, i5, i6, i7, i8; int n2, n4, n8; double xt, a0, e, a, a3; double t1, t2, t3, t4, t5, t6; double cc1, ss1, cc3, ss3; int r0 = 0; /* Digit reverse counter */ j = 0; // r0 = x; for (i = 0; i < n - 1; i++) { if (i < j) { xt = x[j]; x[j] = x[r0]; x[r0] = xt; } r0++; k = n >> 1; while (k <= j) { j = j - k; k >>= 1...