1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
#include <stdio.h>
#include <math.h>
#include <string.h>
#define FORWARD 1
#define INVERSE 0
#ifndef PI
#define PI 3.141592653589793115997963468544185161590576171875
#endif
#ifndef TWOPI
#define TWOPI 6.28318530717958623199592693708837032318115234375
#endif
#define FFTEASE_ANNOUNCEMENT "- a member of FFTease 2.5\nby Eric Lyon and Christopher Penrose"
#define MAX_N (16384)
#define MAX_Nw (MAX_N * 4)
#define MAX_N2 (MAX_N/2)
void rfft( float *x, int N, int forward );
void cfft( float *x, int NC, int forward );
void convert(float *S, float *C, int N2, float *lastphase, float fundamental, float factor );
void unconvert( float *C, float *S, int N2, float *lastphase, float fundamental, float factor );
void leanconvert( float *S, float *C, int N2 );
void leanunconvert( float *C, float *S, int N2 );
void makewindows( float *H, float *A, float *S, int Nw, int N, int I );
void makehamming( float *H, float *A, float *S, int Nw, int N, int I,int odd );
void makehanning( float *H, float *A, float *S, int Nw, int N, int I,int odd );
void fold( float *I, float *W, int Nw, float *O, int N, int n );
void overlapadd( float *I, int N, float *W, float *O, int Nw, int n );
void bitreverse( float *x, int N );
void bloscbank( float *S, float *O, int D, float iD, float *lf, float *la, float *bindex, float *tab,
int len, float synt, int lo, int hi );
/* fast fft calls */
void makect(int nc, int *ip, float *c);
void makewt(int nw, int *ip, float *w);
void rftsub(int n, float *a, int nc, float *c);
void cftsub(int n, float *a, float *w);
void bitrv2(int n, int *ip, float *a);
void rdft(int n, int isgn, float *a, int *ip, float *w);
void init_rdft(int n, int *ip, float *w);
/* rands */
float randf( float min, float max );
int randi( int min, int max );
int power_of_two(int test);
void limit_fftsize(int *N, int *Nw, char *OBJECT_NAME);
|
