我有一个输入信号,我想将其存储在 ArrayList 中,然后将其转换为 Complex,如下所示
-0.03480425839330703
0.07910192950176387
0.7233322451735928
0.1659819820667019
这像这样输出它的FFT
0.9336118983487516
-0.7581365035668999 + 0.08688005256493803i
0.44344407521182005
-0.7581365035668999 - 0.08688005256493803i
这是一个复杂的结构,我想将其转换为 ArrayList 类型。同时降低+ 0.08688005256493803i
价值。
所以我需要的只是这些价值观
0.9336118983487516
-0.7581365035668999
0.44344407521182005
-0.7581365035668999
解决这个问题的最佳方法是什么?
这是我正在使用的代码
public static Complex[] fft(Complex[] x) {
int N = x.length;
// base case
if (N == 1) return new Complex[] { x[0] };
// radix 2 Cooley-Tukey FFT
if (N % 2 != 0) { throw new RuntimeException("N is not a power of 2"); }
// fft of even terms
Complex[] even = new Complex[N/2];
for (int k = 0; k < N/2; k++) {
even[k] = x[2*k];
}
Complex[] q = fft(even);
// fft of odd terms
Complex[] odd = even; // reuse the array
for (int k = 0; k < N/2; k++) {
odd[k] = x[2*k + 1];
}
Complex[] r = fft(odd);
// combine
Complex[] y = new Complex[N];
for (int k = 0; k < N/2; k++) {
double kth = -2 * k * Math.PI / N;
Complex wk = new Complex(Math.cos(kth), Math.sin(kth));
y[k] = q[k].plus(wk.times(r[k]));
y[k + N/2] = q[k].minus(wk.times(r[k]));
}
return y;
}