Package DSP.fft

Examples of DSP.fft.RDFT.evaluateInverse()


    Arrays.fill( tmp, 0.0f );
    System.arraycopy( coefficients, 0, tmp, 0, coefficients.length );
    fft.evaluate( tmp, kernel );
   
    RDFT.dftProduct( kernel, transform, 1.0f );
    fft.evaluateInverse( transform, tmp );
   
    // trim off trailing zeros
   
    kernel = new double[ n ];
    System.arraycopy( tmp, 0, kernel, 0, n );
View Full Code Here


    for ( int i = 0;  i <= nfft/2;  i++ ) {
      X[i] = (double) LP.evaluate( Math.cos( 2.0*Math.PI*i/nfft ) );
    }
   
    RDFT dft = new RDFT( log2nfft );
    dft.evaluateInverse( X, x );
   
    return x;
  }
 
 
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.