comparison src/fftw-3.3.3/dft/zero.c @ 10:37bf6b4a2645

Add FFTW3
author Chris Cannam
date Wed, 20 Mar 2013 15:35:50 +0000
parents
children
comparison
equal deleted inserted replaced
9:c0fb53affa76 10:37bf6b4a2645
1 /*
2 * Copyright (c) 2003, 2007-11 Matteo Frigo
3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
18 *
19 */
20
21
22 #include "dft.h"
23
24 /* fill a complex array with zeros. */
25 static void recur(const iodim *dims, int rnk, R *ri, R *ii)
26 {
27 if (rnk == RNK_MINFTY)
28 return;
29 else if (rnk == 0)
30 ri[0] = ii[0] = K(0.0);
31 else if (rnk > 0) {
32 INT i, n = dims[0].n;
33 INT is = dims[0].is;
34
35 if (rnk == 1) {
36 /* this case is redundant but faster */
37 for (i = 0; i < n; ++i)
38 ri[i * is] = ii[i * is] = K(0.0);
39 } else {
40 for (i = 0; i < n; ++i)
41 recur(dims + 1, rnk - 1, ri + i * is, ii + i * is);
42 }
43 }
44 }
45
46
47 void X(dft_zerotens)(tensor *sz, R *ri, R *ii)
48 {
49 recur(sz->dims, sz->rnk, ri, ii);
50 }