(int maxN)
| 224 | } |
| 225 | |
| 226 | void makeBitReverseTable(int maxN) { |
| 227 | bitrev = new int[maxN]; |
| 228 | int nLog2 = log2(maxN); |
| 229 | for (int i=0; i<maxN; i++) |
| 230 | bitrev[i] = bitRevX(i, nLog2); |
| 231 | } |
| 232 | |
| 233 | /** Performs a 2D FHT (Fast Hartley Transform). */ |
| 234 | public void rc2DFHT(float[] x, boolean inverse, int maxN) { |
no test coverage detected