List of complexInverse() Examples

Examples of complexInverse()

edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D.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

Examples of edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D.complexInverse()

    for(int i=0;i!=x.length();++i) {
      array[i*2] = x.getElementAsComplex(i).getReal();
      array[i*2+1] = x.getElementAsComplex(i).getImaginary();
    }
    if(inverse) {
      fft.complexInverse(array, false);
    } else {
      fft.complexForward(array);
    }
    return toComplex(array);
  }

View Full Code Here

Examples of edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D.complexInverse()

        this.fid = new ComplexArray[numberOfTraces];
        DoubleFFT_1D inverseFourierTransform = new DoubleFFT_1D(numberOfSamples);
        for (int i = 0; i < numberOfTraces; i++) {
                 double[] interleavedArray = this.spec[i].toDoubleArray(
                                ComplexArray.reductionMode.INTERLEAVED);
               inverseFourierTransform.complexInverse(interleavedArray, true);
               ComplexArray tmp = new ComplexArray(numberOfSamples);
               tmp.setInterleavedDoubles(interleavedArray);
               this.fid[i] = tmp.clone();
            
        }

View Full Code Here

Examples of edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D.complexInverse()

    DoubleFFT_1D fft = CACHE_1D.get(n);
    if (fft == null) {
      fft = new DoubleFFT_1D(n);
      CACHE_1D.put(n, fft);
    }
    fft.complexInverse(a, scale);
    return unpackFull(a);
  }


  /**
   * The forward discrete Fourier transform. *Note:* In this definition

View Full Code Here

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

    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.