JTransforms：ifft奇数数据

Question

我正试图计算逆FFT，因为我只想要选择频率。下面是我如何进行FFT：

final double[] points = reader.readPoints();
final DoubleFFT_1D analyzer = new DoubleFFT_1D(points.length);
final double[] fft = new double[points.length * 2];

for (int i = 0; i < points.length; i++) {
    fft[2 * i] = points[i];
    fft[2 * i + 1] = 0;
}

analyzer.complexForward(fft);

正如上面所看到的，我正在从每个点做一个复数。

然后，我计算一个频率的功率电平：

final double[] magnitude = new double[fft.length];
for (int i = 0; i < fft.length / 2; i++) {
    magnitude[2 * i] = Math.sqrt(Math.pow(fft[2 * i], 2) + Math.pow(fft[2 * i + 1], 2));
    magnitude[2 * i + 1] = 0;
}

public void performIfft() {
    int ifftIdx = 0;
    for (int idx = 0; idx < magnitude.length; idx += 2) {
        final Double currentBinFreq = getFrequency(magnitude.length, idx);
        final boolean freqMatch = currentBinFreq.compareTo(frequencyOfInterest) == 0;
        ifft[ifftIdx] = Double.valueOf(freqMatch ? fft[ifftIdx] : 0);
        ifft[ifftIdx + 1] = Double.valueOf(freqMatch ? fft[ifftIdx + 1] : 0);
        ifftIdx += 2;
    }
    analyzer.complexInverse(ifft, true);
}

private static Double getFrequency(final int pointsLength, final int idx) {
    final Double sampleCount = Double.valueOf(idx * 30);
    final Double n = Double.valueOf(pointsLength);
    return Double.valueOf(sampleCount / n);
}

0.0,0.0
0.0,0.0
-6126.10186299952,-6126.10186299952
-3385.1822332667743,-3385.1822332667743
0.0,0.0
[ 0.0,0.0 continues until the end ]

Answer 1

为了得到严格实的结果（所有虚分量等于零），IFFT的输入必须是共轭对称的。例如，阵列的上半部分必须是下半部分的复共轭，围绕阵列的中心镜像，除了第0个元素（直流或0赫兹bin）。