Package edu.emory.mathcs.jtransforms.fft

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

25
26
27
28
29
30
31
32
33
34
35
    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
320
321
322
323
324
325
326
327
328
329
330
        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
78
79
80
81
82
83
84
85
86
87
88
    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
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.