Package edu.emory.mathcs.jtransforms.fft

Examples of edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D

17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
    return realFFT(x, inverse);
  }

  @Internal
  public static ComplexVector fft(ComplexVector x, boolean inverse) {
    DoubleFFT_1D fft = new DoubleFFT_1D(x.length());
   
    double array[] = new double[x.length() * 2];
    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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
    return toComplex(array);
  }
 
  private static ComplexVector realFFT(Vector x, boolean inverse) {
   
    DoubleFFT_1D fft = new DoubleFFT_1D(x.length());
   
    double array[] = new double[x.length() * 2];
    for(int i=0;i!=x.length();++i) {
      array[i] = x.getElementAsDouble(i);
    }
   
    if(inverse) {
      fft.realInverse(array, false);
    } else {
      fft.realForwardFull(array);
    }
    return toComplex(array);
  }
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
   
    void fft() {
        numberOfTraces = this.fid.length;
        numberOfSamples = this.fid[0].getLength();
        this.spec = new ComplexArray[numberOfTraces];
        DoubleFFT_1D fourierTransform = new DoubleFFT_1D(numberOfSamples);
        //ComplexArray specElement;
        for (int i = 0; i < numberOfTraces; i++) {
                 double[] interleaved = this.fid[i].toDoubleArray(
                                ComplexArray.reductionMode.INTERLEAVED);
               fourierTransform.complexForward(interleaved);
               ComplexArray tmp = new ComplexArray(numberOfSamples);
               tmp.setInterleavedDoubles(interleaved);
               this.spec[i] = tmp.circShift().clone();
           
        }
View Full Code Here
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
   
     void ifft() {
        numberOfTraces = this.spec.length;
        numberOfSamples = this.spec[0].getLength();
        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
380
381
382
383
384
385
386
387
388
389
390
391
            //The number of coefficients for the FFT
            int transformLength = coef.length / 2;  // N real, imag pairs

            // Perform the FFT. Values are placed back in coef[].
            DoubleFFT_1D fft = new DoubleFFT_1D(transformLength);
            fft.complexForward(coef);

            // Swap the left/right halves of the output array
            // to get the negative freqs into the proper place.
            for (int i = 0; i < transformLength; ++i)
            {
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
   */
  public static ComplexNumber[] transform1DComplex(final ComplexNumber[] z) {
    ArgumentChecker.notNull(z, "array of complex number");
    final int n = z.length;
    final double[] a = packFull(z);
    DoubleFFT_1D fft = CACHE_1D.get(n);
    if (fft == null) {
      fft = new DoubleFFT_1D(n);
      CACHE_1D.put(n, fft);
    }
    fft.complexForward(a);
    return unpackFull(a);
  }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
   */
  public static ComplexNumber[] inverseTransform1DComplex(final ComplexNumber[] z, final boolean scale) {
    ArgumentChecker.notNull(z, "array of complex number");
    final int n = z.length;
    final double[] a = packFull(z);
    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);
  }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
   */
  public static ComplexNumber[] fullTransform1DReal(final double[] h) {
    ArgumentChecker.notEmpty(h, "array of doubles");
    final int n = h.length;
    final double[] a = Arrays.copyOf(h, 2 * n);
    DoubleFFT_1D fft = CACHE_1D.get(n);
    if (fft == null) {
      fft = new DoubleFFT_1D(n);
      CACHE_1D.put(n, fft);
    }
    fft.realForwardFull(a);
    return unpackFull(a);
  }
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
153
154
   */
  public static ComplexNumber[] fullInverseTransform1DReal(final double[] x, final boolean scale) {
    ArgumentChecker.notEmpty(x, "array of doubles");
    final int n = x.length;
    final double[] a = Arrays.copyOf(x, 2 * n);
    DoubleFFT_1D fft = CACHE_1D.get(n);
    if (fft == null) {
      fft = new DoubleFFT_1D(n);
      CACHE_1D.put(n, fft);
    }
    fft.realInverseFull(a, scale);
    return unpackFull(a);
  }
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
183
   */
  public static ComplexNumber[] transform1DReal(final double[] h) {
    ArgumentChecker.notEmpty(h, "array of doubles");
    final int n = h.length;
    final double[] a = Arrays.copyOf(h, n);
    DoubleFFT_1D fft = CACHE_1D.get(n);
    if (fft == null) {
      fft = new DoubleFFT_1D(n);
      CACHE_1D.put(n, fft);
    }
    fft.realForward(a);
    return unpack(a);
  }
View Full Code Here
TOP

Related Classes of edu.emory.mathcs.jtransforms.fft.DoubleFFT_1D

  • com.opengamma.analytics.math.fft.JTransformsWrapper
  • mrstk.SpectrumArray
  • opensonata.dataDisplays.WaterfallDisplay$CoefConversion
  • org.renjin.stats.internals.FFT
    • Copyright © 2018 www.massapicom. 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.