Examples of mikera.matrixx.algo.FFT.complexInverse()

mikera.matrixx.algo.FFT.complexInverse()
Computes 1D inverse DFT of complex data leaving the result in a. Complex number is stored as two double values in sequence: the real and imaginary part, i.e. the size of the input array must be greater or equal 2*n. The physical layout of the input data has to be as follows:
```
 a[2*k] = Re[k],  a[2*k+1] = Im[k], 0<=k<n 
```
@param a data to transform @param scale if true then scaling is performed

    FFT fft=new FFT(3);
    
    //System.out.println(Vector.create(d));
    fft.realForwardFull(d);
    //System.out.println(Vector.create(d));  
    fft.complexInverse(d, true);
    //System.out.println(Vector.create(d));
    assertEquals(r0,d[0],0.000001);
    assertEquals(r1,d[2],0.000001);
    assertEquals(r2,d[4],0.000001);
  }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.