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 (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 (int r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a, r * rowspan, 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 (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 * rowspan, 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.complexInverse(a[s][r], scale); } } } });
public void run() { for (long r = firstRow; r < lastRow; r++) { fftColumns.complexInverse(a, r * rowspan, scale); } } });
public void run() { for (long 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], scale); } } });
public void run() { for (int r = firstRow; r < lastRow; r++) { fftRows.complexInverse(elements[r], scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { int idx2 = 2 * c; for (int r = 0; r < rows; r++) { int idx1 = 2 * r; temp[c][idx1] = a[r][idx2]; temp[c][idx1 + 1] = a[r][idx2 + 1]; } fftRows.complexInverse(temp[c], scale); } } });
/** * Compute the IFFT of the values */ public void ifft(){ this.fft.complexInverse(values, true); }
public void run() { for (int c = firstColumn; c < lastColumn; c++) { int idx2 = 2 * c; for (int r = 0; r < rows; r++) { int idx1 = 2 * r; temp[c][idx1] = a[r][idx2]; temp[c][idx1 + 1] = a[r][idx2 + 1]; } fftRows.complexInverse(temp[c], scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { int idx0 = 2 * c; for (int r = 0; r < rows; r++) { int idx1 = 2 * r; int idx2 = r * columns + idx0; temp[c][idx1] = a[idx2]; temp[c][idx1 + 1] = a[idx2 + 1]; } fftRows.complexInverse(temp[c], scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { int idx0 = 2 * c; for (int r = 0; r < rows; r++) { int idx1 = 2 * r; int idx2 = r * columns + idx0; temp[c][idx1] = a[idx2]; temp[c][idx1 + 1] = a[idx2 + 1]; } fftRows.complexInverse(temp[c], scale); } } });
public void run() { for (long c = firstColumn; c < lastColumn; c++) { long idx0 = 2 * c; for (long r = 0; r < rowsl; r++) { long idx1 = 2 * r; long idx2 = r * columnsl + idx0; temp.setDouble(c * temp_stride + idx1, a.getDouble(idx2)); temp.setDouble(c * temp_stride + idx1 + 1, a.getDouble(idx2 + 1)); } fftRows.complexInverse(temp, c * temp_stride, scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { double[] column = (double[]) viewColumn(c).copy().elements(); fftColumns.complexInverse(column, scale); viewColumn(c).assign(column); } } });