public void run() { for (int r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a[r], scale); } } });
public void run() { for (int s = firstSlice; s < lastSlice; s++) { int idx1 = s * sliceStride; for (int r = 0; r < rows; r++) { fftColumns.complexInverse(a, idx1 + r * rowStride, scale); } } } });
public void run() { for (int s = firstSlice; s < lastSlice; s++) { for (int r = 0; r < rows; r++) { fftColumns.realForwardFull(a[s][r]); } } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realForward(a, i * columns); } } });
public void init() { // this.coeffs = MathBasics.getLPCoefficientsButterworth2Pole(bciSettings.getSamplesPerSecond(), 36d); this.fft = new DoubleFFT_1D(bciSettings.getSamplesPerSecond()); this.fftData.init(bciSettings.getSamplesPerSecond(), bciSettings.getBins(), bciSettings.getNumChannels()); System.out.println("window size: " + this.fftData.windowSize + " / samples per second: " + bciSettings.getSamplesPerSecond()); this.filterWindow = WindowFunction.generate(this.fftData.windowSize, WindowFunction.FunctionType.BLACKMAN); }
public void run() { for (long i = firstRow; i < lastRow; i++) { fftColumns.realForward(a, i * columnsl); } } });
public void run() { for (long s = firstSlice; s < lastSlice; s++) { long idx1 = s * sliceStridel; for (long r = 0; r < rowsl; r++) { fftColumns.complexForward(a, idx1 + r * rowStridel); } } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a[i], 0, scale); } } });
fft.realForward(convData);
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realForward(a[i]); } } });
public void run() { for (long r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a, r * rowspan, scale); } } });
public void run() { for (long s = firstSlice; s < lastSlice; s++) { long idx1 = s * sliceStridel; for (long r = 0; r < rowsl; r++) { fftColumns.complexInverse(a, idx1 + r * rowStridel, scale); } } } });
public void run() { for (long s = firstSlice; s < lastSlice; s++) { long idx1 = s * sliceStridel; for (long r = 0; r < rowsl; r++) { fftColumns.complexForward(a, idx1 + r * rowStridel); } } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columns, scale); } } });
public void run() { for (long s = firstSlice; s < lastSlice; s++) { long idx1 = s * sliceStridel; for (long r = 0; r < rowsl; r++) { fftColumns.complexInverse(a, idx1 + r * rowStridel, scale); } } } });
public void run() { for (int r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a[r], scale); } } });
public void run() { for (long i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columnsl, scale); } } });
public void run() { for (int s = firstSlice; s < lastSlice; s++) { for (int r = 0; r < rows; r++) { fftColumns.complexInverse(a[s][r], scale); } } } });
public void run() { for (int r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a, r * rowspan, scale); } } });
public void run() { for (int r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a, r * rowspan, scale); } } });