Lines Matching refs:fct
32 * FCT is its own inverse, up to a multiplier depending on conventions.
35 * Different from FFT and FST, FCT requires the length of data set to be
64 return fct(f);
87 return fct(data);
104 return FastFourierTransformer.scaleArray(fct(f), scaling_coefficient);
130 return FastFourierTransformer.scaleArray(fct(data), scaling_coefficient);
147 return FastFourierTransformer.scaleArray(fct(f), scaling_coefficient);
171 return FastFourierTransformer.scaleArray(fct(data), scaling_coefficient);
212 * Perform the FCT algorithm (including inverse).
218 protected double[] fct(double f[])
251 // reconstruct the FCT result for the original array
