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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/* fft/gsl_fft_complex.h
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef __GSL_FFT_COMPLEX_H__
#define __GSL_FFT_COMPLEX_H__
#include <stddef.h>
#include <gsl/gsl_math.h>
#include <gsl/gsl_complex.h>
#include <gsl/gsl_fft.h>
#undef __BEGIN_DECLS
#undef __END_DECLS
#ifdef __cplusplus
# define __BEGIN_DECLS extern "C" {
# define __END_DECLS }
#else
# define __BEGIN_DECLS /* empty */
# define __END_DECLS /* empty */
#endif
__BEGIN_DECLS
/* Power of 2 routines */
int gsl_fft_complex_radix2_forward (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_backward (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_inverse (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_transform (gsl_complex_packed_array data,
const size_t stride,
const size_t n,
const gsl_fft_direction sign);
int gsl_fft_complex_radix2_dif_forward (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_dif_backward (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_dif_inverse (gsl_complex_packed_array data,
const size_t stride,
const size_t n);
int gsl_fft_complex_radix2_dif_transform (gsl_complex_packed_array data,
const size_t stride,
const size_t n,
const gsl_fft_direction sign);
/* Mixed Radix general-N routines */
typedef struct
{
size_t n;
size_t nf;
size_t factor[64];
gsl_complex *twiddle[64];
gsl_complex *trig;
}
gsl_fft_complex_wavetable;
typedef struct
{
size_t n;
double *scratch;
}
gsl_fft_complex_workspace;
gsl_fft_complex_wavetable *gsl_fft_complex_wavetable_alloc (size_t n);
void gsl_fft_complex_wavetable_free (gsl_fft_complex_wavetable * wavetable);
gsl_fft_complex_workspace *gsl_fft_complex_workspace_alloc (size_t n);
void gsl_fft_complex_workspace_free (gsl_fft_complex_workspace * workspace);
int gsl_fft_complex_memcpy (gsl_fft_complex_wavetable * dest,
gsl_fft_complex_wavetable * src);
int gsl_fft_complex_forward (gsl_complex_packed_array data,
const size_t stride,
const size_t n,
const gsl_fft_complex_wavetable * wavetable,
gsl_fft_complex_workspace * work);
int gsl_fft_complex_backward (gsl_complex_packed_array data,
const size_t stride,
const size_t n,
const gsl_fft_complex_wavetable * wavetable,
gsl_fft_complex_workspace * work);
int gsl_fft_complex_inverse (gsl_complex_packed_array data,
const size_t stride,
const size_t n,
const gsl_fft_complex_wavetable * wavetable,
gsl_fft_complex_workspace * work);
int gsl_fft_complex_transform (gsl_complex_packed_array data,
const size_t stride, const size_t n,
const gsl_fft_complex_wavetable * wavetable,
gsl_fft_complex_workspace * work,
const gsl_fft_direction sign);
__END_DECLS
#endif /* __GSL_FFT_COMPLEX_H__ */
|
