DeliriOS_64bits/fft/fft.c
char Inverse(Complex *Data, unsigned int N, char ifScale /* = true */)
{
    //   Check input parameters
    if (!Data || N < 1 || N & (N - 1)) {
        return FALSE;
    }
    //   Rearrange
    Rearrange(Data, N);
    //   Call FFT implementation
    Perform(Data, N, TRUE);
    //   Scale if necessary
    if (ifScale) {
        Scale(Data, N);
    }
    //   Succeeded
    return TRUE;
}
//   INVERSE FOURIER TRANSFORM, INPLACE VERSION
//     Data  - both input data and output
//     N     - length of both input data and result
//     Scale - if to scale result

INVERSE FOURIER TRANSFORM, INPLACE VERSION
Data  - both input data and output
N     - length of both input data and result
Scale - if to scale result
INVERSE FOURIER TRANSFORM INPLACE VERSION Data - both input data and output N - length of both input data and result Scale - if to scale result
char Inverse(Complex *Data, unsigned int N, char ifScale )
{
    if (!Data || N < 1 || N & (N - 1)) {
        return FALSE;
    }
    Rearrange(Data, N);
    Perform(Data, N, TRUE);
    if (ifScale) {
        Scale(Data, N);
    }
    return TRUE;
}
char Inverse ( Complex * Data , unsigned int N , char ifScale ) { if ( ! Data || N < 1 || N & ( N - 1 ) ) { return FALSE ; } Rearrange ( Data , N ) ; Perform ( Data , N , TRUE ) ; if ( ifScale ) { Scale ( Data , N ) ; } return TRUE ; }
INVERSE FOURIER TRANSFORM, INPLACE VERSION
Data  - both input data and output
N     - length of both input data and result
Scale - if to scale result
INVERSE FOURIER TRANSFORM INPLACE VERSION Data - both input data and output N - length of both input data and result Scale - if to scale result
/* = true */ //   Check input parameters
 //   Rearrange
 //   Call FFT implementation
 //   Scale if necessary
 //   Succeeded
